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/sanfoundry_27_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:24,923 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:24,925 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:24,942 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:24,942 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:24,944 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:24,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:24,950 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:24,953 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:24,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:24,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:24,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:24,956 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:24,957 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:24,958 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:24,959 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:24,960 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:24,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:24,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:24,965 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:24,966 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:24,968 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:24,970 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:24,971 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:24,971 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:24,972 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:24,973 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:24,974 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:24,974 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:24,976 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:24,976 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:24,976 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:24,977 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:24,977 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:24,978 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:24,979 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:24,979 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:58:24,999 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:25,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:25,001 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:25,005 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:25,005 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:25,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:25,006 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:25,006 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:25,006 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:25,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:25,008 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:25,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:25,008 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:25,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:25,008 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:25,008 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:25,009 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:25,009 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:25,009 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:25,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:25,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:25,010 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:25,010 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:25,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:25,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:25,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:25,011 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:25,011 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:25,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:25,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:25,011 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:25,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:25,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:25,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:25,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:25,087 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:25,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_27_true-unreach-call_ground.i [2018-11-23 11:58:25,152 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235c3e64e/6a08f1cc83df4c9e8b016ca29671d869/FLAG34ec178cf [2018-11-23 11:58:25,551 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:25,552 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_27_true-unreach-call_ground.i [2018-11-23 11:58:25,557 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235c3e64e/6a08f1cc83df4c9e8b016ca29671d869/FLAG34ec178cf [2018-11-23 11:58:25,940 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235c3e64e/6a08f1cc83df4c9e8b016ca29671d869 [2018-11-23 11:58:25,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:25,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:25,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:25,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:25,956 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:25,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:25" (1/1) ... [2018-11-23 11:58:25,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f16c6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:25, skipping insertion in model container [2018-11-23 11:58:25,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:25" (1/1) ... [2018-11-23 11:58:25,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:25,999 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:26,270 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:26,274 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:26,297 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:26,326 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:26,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26 WrapperNode [2018-11-23 11:58:26,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:26,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:26,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:26,327 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:26,335 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:58:26" (1/1) ... [2018-11-23 11:58:26,343 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:58:26" (1/1) ... [2018-11-23 11:58:26,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:26,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:26,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:26,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:26,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:26,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:26,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:26,380 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:26,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (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:58:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:26,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:26,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:26,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:26,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:26,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:26,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:26,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:26,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:58:27,022 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:58:27,022 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:58:27,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:27 BoogieIcfgContainer [2018-11-23 11:58:27,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:58:27,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:58:27,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:58:27,028 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:58:27,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:25" (1/3) ... [2018-11-23 11:58:27,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8699ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:27, skipping insertion in model container [2018-11-23 11:58:27,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (2/3) ... [2018-11-23 11:58:27,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8699ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:27, skipping insertion in model container [2018-11-23 11:58:27,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:27" (3/3) ... [2018-11-23 11:58:27,032 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_27_true-unreach-call_ground.i [2018-11-23 11:58:27,043 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:58:27,051 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:58:27,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:58:27,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:58:27,103 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:58:27,104 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:58:27,104 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:58:27,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:58:27,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:58:27,105 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:58:27,106 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:58:27,106 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:58:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 11:58:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:58:27,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:27,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:27,137 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:27,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:27,142 INFO L82 PathProgramCache]: Analyzing trace with hash -132821438, now seen corresponding path program 1 times [2018-11-23 11:58:27,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:27,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:27,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:27,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 11:58:27,284 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:58:27,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 11:58:27,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #54#return; {28#true} is VALID [2018-11-23 11:58:27,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2018-11-23 11:58:27,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28#true} is VALID [2018-11-23 11:58:27,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 11:58:27,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} havoc ~x~0;~x~0 := 0; {29#false} is VALID [2018-11-23 11:58:27,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {29#false} is VALID [2018-11-23 11:58:27,289 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {29#false} is VALID [2018-11-23 11:58:27,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 11:58:27,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 11:58:27,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 11:58:27,293 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:58:27,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:27,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:58:27,300 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:58:27,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:27,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:58:27,389 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:58:27,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:58:27,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:58:27,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:27,404 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 11:58:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:27,582 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 11:58:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:58:27,582 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:58:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 11:58:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 11:58:27,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 11:58:27,908 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:58:27,921 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:58:27,921 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:58:27,925 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:58:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:58:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:58:28,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:28,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:58:28,066 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:58:28,066 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:58:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,076 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:58:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:58:28,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:28,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:28,077 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:58:28,078 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:58:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,083 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:58:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:58:28,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:28,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:28,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:28,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 11:58:28,094 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 11:58:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:28,094 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 11:58:28,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:58:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:58:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:58:28,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:28,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:28,097 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:28,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1305427337, now seen corresponding path program 1 times [2018-11-23 11:58:28,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:28,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:28,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:28,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:28,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:28,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2018-11-23 11:58:28,409 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:58:28,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2018-11-23 11:58:28,410 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #54#return; {152#true} is VALID [2018-11-23 11:58:28,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret6 := main(); {152#true} is VALID [2018-11-23 11:58:28,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {154#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:28,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {154#(<= main_~i~0 1)} assume !(~i~0 < 100000); {153#false} is VALID [2018-11-23 11:58:28,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {153#false} havoc ~x~0;~x~0 := 0; {153#false} is VALID [2018-11-23 11:58:28,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {153#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {153#false} is VALID [2018-11-23 11:58:28,437 INFO L256 TraceCheckUtils]: 9: Hoare triple {153#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {153#false} is VALID [2018-11-23 11:58:28,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2018-11-23 11:58:28,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2018-11-23 11:58:28,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {153#false} assume !false; {153#false} is VALID [2018-11-23 11:58:28,439 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:58:28,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:28,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:28,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:58:28,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:28,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:28,574 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:58:28,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:28,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:28,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:28,576 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 11:58:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,765 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 11:58:28,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:28,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:58:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:58:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:58:28,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 11:58:28,851 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:58:28,853 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:58:28,853 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:58:28,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:58:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 11:58:28,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:28,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2018-11-23 11:58:28,869 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2018-11-23 11:58:28,869 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2018-11-23 11:58:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,872 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:58:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:58:28,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:28,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:28,873 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2018-11-23 11:58:28,873 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2018-11-23 11:58:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,876 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:58:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:58:28,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:28,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:28,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:28,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:58:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 11:58:28,879 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 11:58:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:28,879 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 11:58:28,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 11:58:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:58:28,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:28,881 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:58:28,881 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:28,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:28,882 INFO L82 PathProgramCache]: Analyzing trace with hash -11566460, now seen corresponding path program 1 times [2018-11-23 11:58:28,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:28,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:28,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:29,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 11:58:29,108 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:58:29,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 11:58:29,109 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #54#return; {279#true} is VALID [2018-11-23 11:58:29,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret6 := main(); {279#true} is VALID [2018-11-23 11:58:29,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {281#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:29,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {281#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:29,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {281#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:29,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {281#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {282#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:29,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 2)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 11:58:29,177 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-23 11:58:29,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {280#false} is VALID [2018-11-23 11:58:29,178 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {280#false} is VALID [2018-11-23 11:58:29,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 11:58:29,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 11:58:29,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 11:58:29,181 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:58:29,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:29,182 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:58:29,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:29,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:29,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 11:58:29,453 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:58:29,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 11:58:29,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #54#return; {279#true} is VALID [2018-11-23 11:58:29,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret6 := main(); {279#true} is VALID [2018-11-23 11:58:29,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {281#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:29,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {281#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:29,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {281#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:29,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {281#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {282#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:29,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 2)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 11:58:29,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-23 11:58:29,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {280#false} is VALID [2018-11-23 11:58:29,479 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {280#false} is VALID [2018-11-23 11:58:29,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 11:58:29,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 11:58:29,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 11:58:29,481 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:58:29,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:29,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 11:58:29,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 11:58:29,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:29,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:58:29,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:29,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:58:29,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:58:29,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:58:29,531 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 4 states. [2018-11-23 11:58:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:29,855 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 11:58:29,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:58:29,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 11:58:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:58:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 11:58:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:58:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 11:58:29,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-23 11:58:29,954 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:58:29,957 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:58:29,957 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:58:29,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:58:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:58:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 11:58:29,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:29,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 11:58:29,969 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 11:58:29,970 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 11:58:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:29,972 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 11:58:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 11:58:29,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:29,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:29,973 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 11:58:29,973 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 11:58:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:29,976 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 11:58:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 11:58:29,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:29,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:29,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:29,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:58:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 11:58:29,979 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 16 [2018-11-23 11:58:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:29,980 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 11:58:29,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:58:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 11:58:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:58:29,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:29,981 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:58:29,981 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:29,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1933661353, now seen corresponding path program 2 times [2018-11-23 11:58:29,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:29,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:29,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:29,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:29,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:30,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-23 11:58:30,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {466#true} is VALID [2018-11-23 11:58:30,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-23 11:58:30,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #54#return; {466#true} is VALID [2018-11-23 11:58:30,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2018-11-23 11:58:30,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {468#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:30,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {468#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {468#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:30,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {468#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:30,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {469#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:30,135 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {469#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:30,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {469#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {469#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:30,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {469#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {470#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:30,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {470#(<= main_~i~0 3)} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-23 11:58:30,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#false} havoc ~x~0;~x~0 := 0; {467#false} is VALID [2018-11-23 11:58:30,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {467#false} is VALID [2018-11-23 11:58:30,138 INFO L256 TraceCheckUtils]: 15: Hoare triple {467#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {467#false} is VALID [2018-11-23 11:58:30,139 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2018-11-23 11:58:30,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {467#false} assume 0 == ~cond; {467#false} is VALID [2018-11-23 11:58:30,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-23 11:58:30,141 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:58:30,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:30,141 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:58:30,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:30,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:30,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:30,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:30,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-23 11:58:30,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {466#true} is VALID [2018-11-23 11:58:30,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-23 11:58:30,312 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #54#return; {466#true} is VALID [2018-11-23 11:58:30,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2018-11-23 11:58:30,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {468#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:30,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {468#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {468#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:30,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {468#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:30,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {469#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:30,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {469#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:30,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {469#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {469#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:30,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {469#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {470#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:30,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {470#(<= main_~i~0 3)} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-23 11:58:30,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#false} havoc ~x~0;~x~0 := 0; {467#false} is VALID [2018-11-23 11:58:30,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {467#false} is VALID [2018-11-23 11:58:30,325 INFO L256 TraceCheckUtils]: 15: Hoare triple {467#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {467#false} is VALID [2018-11-23 11:58:30,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2018-11-23 11:58:30,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {467#false} assume 0 == ~cond; {467#false} is VALID [2018-11-23 11:58:30,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-23 11:58:30,327 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:58:30,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:30,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 11:58:30,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:58:30,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:30,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:58:30,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:30,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:58:30,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:58:30,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:30,458 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 5 states. [2018-11-23 11:58:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:30,673 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 11:58:30,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:58:30,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:58:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:58:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:58:30,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-23 11:58:30,755 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:58:30,757 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:58:30,757 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:58:30,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:58:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 11:58:30,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:30,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 11:58:30,772 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 11:58:30,772 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 11:58:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:30,776 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:58:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 11:58:30,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:30,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:30,777 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 11:58:30,777 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 11:58:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:30,779 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:58:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 11:58:30,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:30,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:30,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:30,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:58:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 11:58:30,785 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2018-11-23 11:58:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:30,785 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 11:58:30,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:58:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 11:58:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:58:30,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:30,787 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:58:30,787 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:30,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1736338852, now seen corresponding path program 3 times [2018-11-23 11:58:30,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:30,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:30,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:30,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:30,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {677#true} is VALID [2018-11-23 11:58:30,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {677#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {677#true} is VALID [2018-11-23 11:58:30,956 INFO L273 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2018-11-23 11:58:30,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #54#return; {677#true} is VALID [2018-11-23 11:58:30,957 INFO L256 TraceCheckUtils]: 4: Hoare triple {677#true} call #t~ret6 := main(); {677#true} is VALID [2018-11-23 11:58:30,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {677#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {679#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:30,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {679#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {679#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:30,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {679#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {679#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:30,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {680#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:30,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {680#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {680#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:30,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {680#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {680#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:30,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {680#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {681#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:30,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {681#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {681#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:30,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {681#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {681#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:30,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {681#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {682#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:30,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {682#(<= main_~i~0 4)} assume !(~i~0 < 100000); {678#false} is VALID [2018-11-23 11:58:30,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {678#false} havoc ~x~0;~x~0 := 0; {678#false} is VALID [2018-11-23 11:58:30,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {678#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {678#false} is VALID [2018-11-23 11:58:30,977 INFO L256 TraceCheckUtils]: 18: Hoare triple {678#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {678#false} is VALID [2018-11-23 11:58:30,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {678#false} ~cond := #in~cond; {678#false} is VALID [2018-11-23 11:58:30,978 INFO L273 TraceCheckUtils]: 20: Hoare triple {678#false} assume 0 == ~cond; {678#false} is VALID [2018-11-23 11:58:30,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {678#false} assume !false; {678#false} is VALID [2018-11-23 11:58:30,979 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:58:30,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:30,980 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:58:30,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:31,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:58:31,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:31,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:31,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {677#true} is VALID [2018-11-23 11:58:31,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {677#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {677#true} is VALID [2018-11-23 11:58:31,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2018-11-23 11:58:31,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #54#return; {677#true} is VALID [2018-11-23 11:58:31,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {677#true} call #t~ret6 := main(); {677#true} is VALID [2018-11-23 11:58:31,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {677#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {679#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:31,128 INFO L273 TraceCheckUtils]: 6: Hoare triple {679#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {679#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:31,128 INFO L273 TraceCheckUtils]: 7: Hoare triple {679#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {679#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:31,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {680#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:31,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {680#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {680#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:31,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {680#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {680#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:31,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {680#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {681#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:31,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {681#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {681#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:31,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {681#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {681#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:31,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {681#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {682#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:31,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {682#(<= main_~i~0 4)} assume !(~i~0 < 100000); {678#false} is VALID [2018-11-23 11:58:31,138 INFO L273 TraceCheckUtils]: 16: Hoare triple {678#false} havoc ~x~0;~x~0 := 0; {678#false} is VALID [2018-11-23 11:58:31,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {678#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {678#false} is VALID [2018-11-23 11:58:31,139 INFO L256 TraceCheckUtils]: 18: Hoare triple {678#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {678#false} is VALID [2018-11-23 11:58:31,139 INFO L273 TraceCheckUtils]: 19: Hoare triple {678#false} ~cond := #in~cond; {678#false} is VALID [2018-11-23 11:58:31,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {678#false} assume 0 == ~cond; {678#false} is VALID [2018-11-23 11:58:31,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {678#false} assume !false; {678#false} is VALID [2018-11-23 11:58:31,142 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:58:31,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:31,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 11:58:31,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:58:31,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:31,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:58:31,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:31,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:58:31,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:58:31,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:31,190 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-11-23 11:58:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:31,356 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-23 11:58:31,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:58:31,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:58:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 11:58:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 11:58:31,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2018-11-23 11:58:31,439 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:58:31,441 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:58:31,441 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:58:31,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:58:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 11:58:31,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:31,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-23 11:58:31,460 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-23 11:58:31,461 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-23 11:58:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:31,463 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 11:58:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 11:58:31,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:31,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:31,464 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-23 11:58:31,465 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-23 11:58:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:31,467 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 11:58:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 11:58:31,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:31,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:31,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:31,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:58:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 11:58:31,470 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2018-11-23 11:58:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:31,470 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 11:58:31,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:58:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 11:58:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:58:31,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:31,472 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:58:31,472 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:31,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2024959031, now seen corresponding path program 4 times [2018-11-23 11:58:31,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:31,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:31,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2018-11-23 11:58:31,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {912#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {912#true} is VALID [2018-11-23 11:58:31,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2018-11-23 11:58:31,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #54#return; {912#true} is VALID [2018-11-23 11:58:31,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2018-11-23 11:58:31,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {914#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:31,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {914#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {914#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:31,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {914#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {914#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:31,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {914#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {915#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:31,595 INFO L273 TraceCheckUtils]: 9: Hoare triple {915#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {915#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:31,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {915#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {915#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:31,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {916#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:31,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {916#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {916#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:31,597 INFO L273 TraceCheckUtils]: 13: Hoare triple {916#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {916#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:31,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {916#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {917#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:31,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {917#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {917#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:31,599 INFO L273 TraceCheckUtils]: 16: Hoare triple {917#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {917#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:31,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {917#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {918#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:31,600 INFO L273 TraceCheckUtils]: 18: Hoare triple {918#(<= main_~i~0 5)} assume !(~i~0 < 100000); {913#false} is VALID [2018-11-23 11:58:31,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {913#false} havoc ~x~0;~x~0 := 0; {913#false} is VALID [2018-11-23 11:58:31,601 INFO L273 TraceCheckUtils]: 20: Hoare triple {913#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {913#false} is VALID [2018-11-23 11:58:31,601 INFO L256 TraceCheckUtils]: 21: Hoare triple {913#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {913#false} is VALID [2018-11-23 11:58:31,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2018-11-23 11:58:31,602 INFO L273 TraceCheckUtils]: 23: Hoare triple {913#false} assume 0 == ~cond; {913#false} is VALID [2018-11-23 11:58:31,602 INFO L273 TraceCheckUtils]: 24: Hoare triple {913#false} assume !false; {913#false} is VALID [2018-11-23 11:58:31,603 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:58:31,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:31,604 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:58:31,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:31,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:31,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:31,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:31,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2018-11-23 11:58:31,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {912#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {912#true} is VALID [2018-11-23 11:58:31,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2018-11-23 11:58:31,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #54#return; {912#true} is VALID [2018-11-23 11:58:31,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2018-11-23 11:58:31,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {914#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:31,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {914#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {914#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:31,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {914#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {914#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:31,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {914#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {915#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:31,812 INFO L273 TraceCheckUtils]: 9: Hoare triple {915#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {915#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:31,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {915#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {915#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:31,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {916#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:31,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {916#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {916#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:31,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {916#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {916#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:31,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {916#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {917#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:31,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {917#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {917#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:31,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {917#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {917#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:31,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {917#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {918#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:31,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {918#(<= main_~i~0 5)} assume !(~i~0 < 100000); {913#false} is VALID [2018-11-23 11:58:31,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {913#false} havoc ~x~0;~x~0 := 0; {913#false} is VALID [2018-11-23 11:58:31,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {913#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {913#false} is VALID [2018-11-23 11:58:31,820 INFO L256 TraceCheckUtils]: 21: Hoare triple {913#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {913#false} is VALID [2018-11-23 11:58:31,821 INFO L273 TraceCheckUtils]: 22: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2018-11-23 11:58:31,821 INFO L273 TraceCheckUtils]: 23: Hoare triple {913#false} assume 0 == ~cond; {913#false} is VALID [2018-11-23 11:58:31,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {913#false} assume !false; {913#false} is VALID [2018-11-23 11:58:31,823 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:58:31,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:31,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 11:58:31,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:58:31,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:31,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:58:31,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:31,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:58:31,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:58:31,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:58:31,922 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2018-11-23 11:58:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:32,256 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 11:58:32,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:58:32,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:58:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:58:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2018-11-23 11:58:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:58:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2018-11-23 11:58:32,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2018-11-23 11:58:32,391 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:58:32,392 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:58:32,392 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:58:32,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:58:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:58:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 11:58:32,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:32,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2018-11-23 11:58:32,413 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2018-11-23 11:58:32,413 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2018-11-23 11:58:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:32,416 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 11:58:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 11:58:32,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:32,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:32,417 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2018-11-23 11:58:32,417 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2018-11-23 11:58:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:32,421 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 11:58:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 11:58:32,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:32,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:32,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:32,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:58:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 11:58:32,424 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 25 [2018-11-23 11:58:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:32,425 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 11:58:32,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:58:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 11:58:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:58:32,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:32,426 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:58:32,427 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:32,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:32,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1784185028, now seen corresponding path program 5 times [2018-11-23 11:58:32,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:32,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:32,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:32,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:32,564 INFO L256 TraceCheckUtils]: 0: Hoare triple {1171#true} call ULTIMATE.init(); {1171#true} is VALID [2018-11-23 11:58:32,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {1171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1171#true} is VALID [2018-11-23 11:58:32,565 INFO L273 TraceCheckUtils]: 2: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 11:58:32,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1171#true} {1171#true} #54#return; {1171#true} is VALID [2018-11-23 11:58:32,566 INFO L256 TraceCheckUtils]: 4: Hoare triple {1171#true} call #t~ret6 := main(); {1171#true} is VALID [2018-11-23 11:58:32,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {1171#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1173#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:32,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {1173#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1173#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:32,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {1173#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1173#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:32,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {1173#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1174#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:32,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {1174#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1174#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:32,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {1174#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1174#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:32,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {1174#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1175#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:32,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {1175#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1175#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:32,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {1175#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1175#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:32,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {1175#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1176#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:32,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {1176#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1176#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:32,589 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1176#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:32,589 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1177#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:32,590 INFO L273 TraceCheckUtils]: 18: Hoare triple {1177#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1177#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:32,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {1177#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1177#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:32,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {1177#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1178#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:32,596 INFO L273 TraceCheckUtils]: 21: Hoare triple {1178#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1172#false} is VALID [2018-11-23 11:58:32,597 INFO L273 TraceCheckUtils]: 22: Hoare triple {1172#false} havoc ~x~0;~x~0 := 0; {1172#false} is VALID [2018-11-23 11:58:32,597 INFO L273 TraceCheckUtils]: 23: Hoare triple {1172#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1172#false} is VALID [2018-11-23 11:58:32,597 INFO L256 TraceCheckUtils]: 24: Hoare triple {1172#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {1172#false} is VALID [2018-11-23 11:58:32,597 INFO L273 TraceCheckUtils]: 25: Hoare triple {1172#false} ~cond := #in~cond; {1172#false} is VALID [2018-11-23 11:58:32,597 INFO L273 TraceCheckUtils]: 26: Hoare triple {1172#false} assume 0 == ~cond; {1172#false} is VALID [2018-11-23 11:58:32,598 INFO L273 TraceCheckUtils]: 27: Hoare triple {1172#false} assume !false; {1172#false} is VALID [2018-11-23 11:58:32,600 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:58:32,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:32,600 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:58:32,615 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:58:32,641 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:58:32,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:32,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:32,806 INFO L256 TraceCheckUtils]: 0: Hoare triple {1171#true} call ULTIMATE.init(); {1171#true} is VALID [2018-11-23 11:58:32,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {1171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1171#true} is VALID [2018-11-23 11:58:32,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 11:58:32,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1171#true} {1171#true} #54#return; {1171#true} is VALID [2018-11-23 11:58:32,808 INFO L256 TraceCheckUtils]: 4: Hoare triple {1171#true} call #t~ret6 := main(); {1171#true} is VALID [2018-11-23 11:58:32,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {1171#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1173#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:32,819 INFO L273 TraceCheckUtils]: 6: Hoare triple {1173#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1173#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:32,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {1173#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1173#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:32,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {1173#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1174#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:32,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {1174#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1174#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:32,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {1174#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1174#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:32,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {1174#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1175#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:32,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {1175#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1175#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:32,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {1175#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1175#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:32,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {1175#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1176#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:32,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {1176#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1176#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:32,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1176#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:32,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1177#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:32,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {1177#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1177#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:32,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {1177#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1177#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:32,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {1177#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1178#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:32,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {1178#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1172#false} is VALID [2018-11-23 11:58:32,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {1172#false} havoc ~x~0;~x~0 := 0; {1172#false} is VALID [2018-11-23 11:58:32,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {1172#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1172#false} is VALID [2018-11-23 11:58:32,835 INFO L256 TraceCheckUtils]: 24: Hoare triple {1172#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {1172#false} is VALID [2018-11-23 11:58:32,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {1172#false} ~cond := #in~cond; {1172#false} is VALID [2018-11-23 11:58:32,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {1172#false} assume 0 == ~cond; {1172#false} is VALID [2018-11-23 11:58:32,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {1172#false} assume !false; {1172#false} is VALID [2018-11-23 11:58:32,838 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:58:32,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:32,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 11:58:32,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 11:58:32,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:32,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:32,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:32,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:32,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:32,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:32,892 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 8 states. [2018-11-23 11:58:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:33,134 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 11:58:33,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:58:33,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 11:58:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 11:58:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 11:58:33,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2018-11-23 11:58:33,213 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:58:33,215 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:58:33,215 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 11:58:33,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 11:58:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 11:58:33,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:33,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2018-11-23 11:58:33,253 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2018-11-23 11:58:33,253 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2018-11-23 11:58:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:33,255 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 11:58:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 11:58:33,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:33,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:33,256 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2018-11-23 11:58:33,256 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2018-11-23 11:58:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:33,258 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 11:58:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 11:58:33,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:33,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:33,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:33,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:58:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 11:58:33,261 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 28 [2018-11-23 11:58:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:33,262 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 11:58:33,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 11:58:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:58:33,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:33,263 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:58:33,263 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:33,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1481245975, now seen corresponding path program 6 times [2018-11-23 11:58:33,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:33,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:33,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:33,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1454#true} is VALID [2018-11-23 11:58:33,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {1454#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1454#true} is VALID [2018-11-23 11:58:33,417 INFO L273 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID [2018-11-23 11:58:33,417 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #54#return; {1454#true} is VALID [2018-11-23 11:58:33,417 INFO L256 TraceCheckUtils]: 4: Hoare triple {1454#true} call #t~ret6 := main(); {1454#true} is VALID [2018-11-23 11:58:33,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {1454#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1456#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:33,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {1456#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1456#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:33,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {1456#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1456#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:33,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {1456#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1457#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:33,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {1457#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1457#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:33,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {1457#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1457#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:33,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {1457#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1458#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:33,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {1458#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1458#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:33,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {1458#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1458#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:33,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {1458#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1459#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:33,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {1459#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1459#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:33,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {1459#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1459#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:33,440 INFO L273 TraceCheckUtils]: 17: Hoare triple {1459#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1460#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:33,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {1460#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1460#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:33,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {1460#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1460#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:33,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {1460#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1461#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:33,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {1461#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1461#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:33,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {1461#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1461#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:33,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {1461#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1462#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:33,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {1462#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1455#false} is VALID [2018-11-23 11:58:33,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {1455#false} havoc ~x~0;~x~0 := 0; {1455#false} is VALID [2018-11-23 11:58:33,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {1455#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1455#false} is VALID [2018-11-23 11:58:33,446 INFO L256 TraceCheckUtils]: 27: Hoare triple {1455#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {1455#false} is VALID [2018-11-23 11:58:33,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {1455#false} ~cond := #in~cond; {1455#false} is VALID [2018-11-23 11:58:33,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {1455#false} assume 0 == ~cond; {1455#false} is VALID [2018-11-23 11:58:33,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {1455#false} assume !false; {1455#false} is VALID [2018-11-23 11:58:33,449 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:58:33,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:33,450 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:58:33,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:58:33,530 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:58:33,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:33,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:33,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1454#true} is VALID [2018-11-23 11:58:33,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {1454#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1454#true} is VALID [2018-11-23 11:58:33,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID [2018-11-23 11:58:33,832 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #54#return; {1454#true} is VALID [2018-11-23 11:58:33,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {1454#true} call #t~ret6 := main(); {1454#true} is VALID [2018-11-23 11:58:33,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {1454#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1456#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:33,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {1456#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1456#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:33,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {1456#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1456#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:33,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {1456#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1457#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:33,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {1457#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1457#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:33,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {1457#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1457#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:33,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {1457#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1458#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:33,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {1458#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1458#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:33,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {1458#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1458#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:33,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {1458#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1459#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:33,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {1459#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1459#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:33,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {1459#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1459#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:33,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {1459#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1460#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:33,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {1460#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1460#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:33,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {1460#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1460#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:33,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {1460#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1461#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:33,844 INFO L273 TraceCheckUtils]: 21: Hoare triple {1461#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1461#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:33,845 INFO L273 TraceCheckUtils]: 22: Hoare triple {1461#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1461#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:33,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {1461#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1462#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:33,864 INFO L273 TraceCheckUtils]: 24: Hoare triple {1462#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1455#false} is VALID [2018-11-23 11:58:33,864 INFO L273 TraceCheckUtils]: 25: Hoare triple {1455#false} havoc ~x~0;~x~0 := 0; {1455#false} is VALID [2018-11-23 11:58:33,865 INFO L273 TraceCheckUtils]: 26: Hoare triple {1455#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1455#false} is VALID [2018-11-23 11:58:33,865 INFO L256 TraceCheckUtils]: 27: Hoare triple {1455#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {1455#false} is VALID [2018-11-23 11:58:33,865 INFO L273 TraceCheckUtils]: 28: Hoare triple {1455#false} ~cond := #in~cond; {1455#false} is VALID [2018-11-23 11:58:33,865 INFO L273 TraceCheckUtils]: 29: Hoare triple {1455#false} assume 0 == ~cond; {1455#false} is VALID [2018-11-23 11:58:33,865 INFO L273 TraceCheckUtils]: 30: Hoare triple {1455#false} assume !false; {1455#false} is VALID [2018-11-23 11:58:33,867 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:58:33,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:33,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 11:58:33,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:58:33,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:33,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:58:33,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:33,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:58:33,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:58:33,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:33,926 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 9 states. [2018-11-23 11:58:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:34,291 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-23 11:58:34,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:58:34,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:58:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-23 11:58:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-23 11:58:34,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2018-11-23 11:58:34,421 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:58:34,424 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:58:34,424 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:58:34,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:34,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:58:34,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 11:58:34,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:34,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2018-11-23 11:58:34,499 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2018-11-23 11:58:34,499 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2018-11-23 11:58:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:34,502 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 11:58:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 11:58:34,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:34,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:34,503 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2018-11-23 11:58:34,503 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2018-11-23 11:58:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:34,505 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 11:58:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 11:58:34,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:34,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:34,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:34,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:58:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 11:58:34,508 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 31 [2018-11-23 11:58:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:34,509 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 11:58:34,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:58:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 11:58:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:58:34,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:34,510 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:58:34,510 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:34,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:34,511 INFO L82 PathProgramCache]: Analyzing trace with hash 350206948, now seen corresponding path program 7 times [2018-11-23 11:58:34,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:34,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:34,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:34,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:34,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:35,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {1761#true} call ULTIMATE.init(); {1761#true} is VALID [2018-11-23 11:58:35,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {1761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1761#true} is VALID [2018-11-23 11:58:35,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {1761#true} assume true; {1761#true} is VALID [2018-11-23 11:58:35,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1761#true} {1761#true} #54#return; {1761#true} is VALID [2018-11-23 11:58:35,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {1761#true} call #t~ret6 := main(); {1761#true} is VALID [2018-11-23 11:58:35,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {1761#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1763#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:35,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {1763#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1763#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:35,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {1763#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1763#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:35,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {1763#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1764#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:35,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {1764#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1764#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:35,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {1764#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1764#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:35,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {1764#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1765#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:35,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {1765#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1765#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:35,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {1765#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1765#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:35,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {1765#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1766#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:35,131 INFO L273 TraceCheckUtils]: 15: Hoare triple {1766#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1766#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:35,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {1766#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1766#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:35,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {1766#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1767#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:35,133 INFO L273 TraceCheckUtils]: 18: Hoare triple {1767#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1767#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:35,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {1767#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1767#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:35,153 INFO L273 TraceCheckUtils]: 20: Hoare triple {1767#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1768#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:35,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {1768#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1768#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:35,160 INFO L273 TraceCheckUtils]: 22: Hoare triple {1768#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1768#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:35,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {1768#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1769#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:35,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {1769#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1769#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:35,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {1769#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1769#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:35,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {1769#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1770#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:35,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {1770#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1762#false} is VALID [2018-11-23 11:58:35,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {1762#false} havoc ~x~0;~x~0 := 0; {1762#false} is VALID [2018-11-23 11:58:35,163 INFO L273 TraceCheckUtils]: 29: Hoare triple {1762#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1762#false} is VALID [2018-11-23 11:58:35,163 INFO L256 TraceCheckUtils]: 30: Hoare triple {1762#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {1762#false} is VALID [2018-11-23 11:58:35,164 INFO L273 TraceCheckUtils]: 31: Hoare triple {1762#false} ~cond := #in~cond; {1762#false} is VALID [2018-11-23 11:58:35,164 INFO L273 TraceCheckUtils]: 32: Hoare triple {1762#false} assume 0 == ~cond; {1762#false} is VALID [2018-11-23 11:58:35,164 INFO L273 TraceCheckUtils]: 33: Hoare triple {1762#false} assume !false; {1762#false} is VALID [2018-11-23 11:58:35,166 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:58:35,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:35,167 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:58:35,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:35,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:35,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {1761#true} call ULTIMATE.init(); {1761#true} is VALID [2018-11-23 11:58:35,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {1761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1761#true} is VALID [2018-11-23 11:58:35,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {1761#true} assume true; {1761#true} is VALID [2018-11-23 11:58:35,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1761#true} {1761#true} #54#return; {1761#true} is VALID [2018-11-23 11:58:35,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {1761#true} call #t~ret6 := main(); {1761#true} is VALID [2018-11-23 11:58:35,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {1761#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1763#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:35,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {1763#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1763#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:35,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {1763#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1763#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:35,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {1763#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1764#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:35,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {1764#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1764#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:35,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {1764#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1764#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:35,468 INFO L273 TraceCheckUtils]: 11: Hoare triple {1764#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1765#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:35,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {1765#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1765#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:35,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {1765#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1765#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:35,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {1765#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1766#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:35,470 INFO L273 TraceCheckUtils]: 15: Hoare triple {1766#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1766#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:35,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {1766#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1766#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:35,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {1766#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1767#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:35,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {1767#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1767#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:35,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {1767#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1767#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:35,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {1767#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1768#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:35,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {1768#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1768#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:35,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {1768#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1768#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:35,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {1768#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1769#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:35,475 INFO L273 TraceCheckUtils]: 24: Hoare triple {1769#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1769#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:35,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {1769#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {1769#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:35,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {1769#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1770#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:35,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {1770#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1762#false} is VALID [2018-11-23 11:58:35,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {1762#false} havoc ~x~0;~x~0 := 0; {1762#false} is VALID [2018-11-23 11:58:35,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {1762#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1762#false} is VALID [2018-11-23 11:58:35,478 INFO L256 TraceCheckUtils]: 30: Hoare triple {1762#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {1762#false} is VALID [2018-11-23 11:58:35,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {1762#false} ~cond := #in~cond; {1762#false} is VALID [2018-11-23 11:58:35,478 INFO L273 TraceCheckUtils]: 32: Hoare triple {1762#false} assume 0 == ~cond; {1762#false} is VALID [2018-11-23 11:58:35,479 INFO L273 TraceCheckUtils]: 33: Hoare triple {1762#false} assume !false; {1762#false} is VALID [2018-11-23 11:58:35,480 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:58:35,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:35,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 11:58:35,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 11:58:35,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:35,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:58:35,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:35,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:58:35,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:58:35,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:35,571 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 10 states. [2018-11-23 11:58:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:35,786 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 11:58:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:58:35,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 11:58:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:58:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 11:58:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:58:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 11:58:35,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2018-11-23 11:58:35,950 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:58:35,952 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:58:35,953 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:58:35,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:58:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 11:58:35,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:35,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 11:58:35,976 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 11:58:35,976 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 11:58:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:35,977 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 11:58:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 11:58:35,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:35,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:35,978 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 11:58:35,978 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 11:58:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:35,979 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 11:58:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 11:58:35,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:35,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:35,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:35,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:58:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-11-23 11:58:35,982 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 34 [2018-11-23 11:58:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:35,982 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-23 11:58:35,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:58:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-11-23 11:58:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:58:35,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:35,983 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:58:35,983 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:35,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -415009289, now seen corresponding path program 8 times [2018-11-23 11:58:35,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:35,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:35,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:35,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:35,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:36,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {2092#true} call ULTIMATE.init(); {2092#true} is VALID [2018-11-23 11:58:36,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {2092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2092#true} is VALID [2018-11-23 11:58:36,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {2092#true} assume true; {2092#true} is VALID [2018-11-23 11:58:36,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2092#true} {2092#true} #54#return; {2092#true} is VALID [2018-11-23 11:58:36,190 INFO L256 TraceCheckUtils]: 4: Hoare triple {2092#true} call #t~ret6 := main(); {2092#true} is VALID [2018-11-23 11:58:36,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {2092#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2094#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:36,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {2094#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2094#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:36,194 INFO L273 TraceCheckUtils]: 7: Hoare triple {2094#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2094#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:36,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {2094#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2095#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {2095#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2095#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {2095#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2095#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {2095#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2096#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {2096#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2096#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,199 INFO L273 TraceCheckUtils]: 13: Hoare triple {2096#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2096#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,199 INFO L273 TraceCheckUtils]: 14: Hoare triple {2096#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2097#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {2097#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2097#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,200 INFO L273 TraceCheckUtils]: 16: Hoare triple {2097#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2097#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,200 INFO L273 TraceCheckUtils]: 17: Hoare triple {2097#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2098#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,201 INFO L273 TraceCheckUtils]: 18: Hoare triple {2098#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2098#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,201 INFO L273 TraceCheckUtils]: 19: Hoare triple {2098#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2098#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,202 INFO L273 TraceCheckUtils]: 20: Hoare triple {2098#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2099#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {2099#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2099#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {2099#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2099#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {2099#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2100#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {2100#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2100#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {2100#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2100#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {2100#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2101#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {2101#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2101#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {2101#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2101#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,264 INFO L273 TraceCheckUtils]: 29: Hoare triple {2101#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2102#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:36,264 INFO L273 TraceCheckUtils]: 30: Hoare triple {2102#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2093#false} is VALID [2018-11-23 11:58:36,264 INFO L273 TraceCheckUtils]: 31: Hoare triple {2093#false} havoc ~x~0;~x~0 := 0; {2093#false} is VALID [2018-11-23 11:58:36,265 INFO L273 TraceCheckUtils]: 32: Hoare triple {2093#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {2093#false} is VALID [2018-11-23 11:58:36,265 INFO L256 TraceCheckUtils]: 33: Hoare triple {2093#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {2093#false} is VALID [2018-11-23 11:58:36,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {2093#false} ~cond := #in~cond; {2093#false} is VALID [2018-11-23 11:58:36,265 INFO L273 TraceCheckUtils]: 35: Hoare triple {2093#false} assume 0 == ~cond; {2093#false} is VALID [2018-11-23 11:58:36,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {2093#false} assume !false; {2093#false} is VALID [2018-11-23 11:58:36,266 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:58:36,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:36,266 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:58:36,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:36,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:36,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:36,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:36,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {2092#true} call ULTIMATE.init(); {2092#true} is VALID [2018-11-23 11:58:36,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {2092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2092#true} is VALID [2018-11-23 11:58:36,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {2092#true} assume true; {2092#true} is VALID [2018-11-23 11:58:36,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2092#true} {2092#true} #54#return; {2092#true} is VALID [2018-11-23 11:58:36,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {2092#true} call #t~ret6 := main(); {2092#true} is VALID [2018-11-23 11:58:36,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {2092#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2094#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:36,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {2094#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2094#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:36,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {2094#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2094#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:36,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {2094#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2095#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {2095#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2095#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {2095#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2095#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {2095#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2096#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {2096#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2096#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {2096#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2096#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {2096#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2097#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {2097#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2097#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {2097#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2097#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {2097#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2098#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {2098#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2098#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {2098#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2098#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {2098#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2099#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {2099#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2099#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,543 INFO L273 TraceCheckUtils]: 22: Hoare triple {2099#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2099#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {2099#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2100#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {2100#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2100#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {2100#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2100#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {2100#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2101#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {2101#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2101#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {2101#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2101#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,546 INFO L273 TraceCheckUtils]: 29: Hoare triple {2101#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2102#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:36,547 INFO L273 TraceCheckUtils]: 30: Hoare triple {2102#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2093#false} is VALID [2018-11-23 11:58:36,547 INFO L273 TraceCheckUtils]: 31: Hoare triple {2093#false} havoc ~x~0;~x~0 := 0; {2093#false} is VALID [2018-11-23 11:58:36,547 INFO L273 TraceCheckUtils]: 32: Hoare triple {2093#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {2093#false} is VALID [2018-11-23 11:58:36,548 INFO L256 TraceCheckUtils]: 33: Hoare triple {2093#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {2093#false} is VALID [2018-11-23 11:58:36,548 INFO L273 TraceCheckUtils]: 34: Hoare triple {2093#false} ~cond := #in~cond; {2093#false} is VALID [2018-11-23 11:58:36,548 INFO L273 TraceCheckUtils]: 35: Hoare triple {2093#false} assume 0 == ~cond; {2093#false} is VALID [2018-11-23 11:58:36,548 INFO L273 TraceCheckUtils]: 36: Hoare triple {2093#false} assume !false; {2093#false} is VALID [2018-11-23 11:58:36,550 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:58:36,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:36,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 11:58:36,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 11:58:36,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:36,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:58:36,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:36,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:58:36,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:58:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:58:36,628 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 11 states. [2018-11-23 11:58:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:37,028 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-11-23 11:58:37,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:58:37,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 11:58:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:58:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 11:58:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:58:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 11:58:37,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 11:58:37,109 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:58:37,110 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:58:37,111 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:58:37,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:58:37,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:58:37,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 11:58:37,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:37,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-23 11:58:37,128 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-23 11:58:37,128 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-23 11:58:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:37,130 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-23 11:58:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 11:58:37,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:37,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:37,130 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-23 11:58:37,131 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-23 11:58:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:37,132 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-23 11:58:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 11:58:37,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:37,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:37,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:37,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:58:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-23 11:58:37,134 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 37 [2018-11-23 11:58:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:37,134 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 11:58:37,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:58:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-11-23 11:58:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:58:37,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:37,135 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:58:37,136 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:37,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:37,136 INFO L82 PathProgramCache]: Analyzing trace with hash 714481412, now seen corresponding path program 9 times [2018-11-23 11:58:37,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:37,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:37,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:37,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:37,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:37,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {2447#true} call ULTIMATE.init(); {2447#true} is VALID [2018-11-23 11:58:37,441 INFO L273 TraceCheckUtils]: 1: Hoare triple {2447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2447#true} is VALID [2018-11-23 11:58:37,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {2447#true} assume true; {2447#true} is VALID [2018-11-23 11:58:37,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2447#true} {2447#true} #54#return; {2447#true} is VALID [2018-11-23 11:58:37,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {2447#true} call #t~ret6 := main(); {2447#true} is VALID [2018-11-23 11:58:37,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {2447#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2449#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:37,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {2449#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2449#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:37,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {2449#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2449#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:37,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {2449#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2450#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:37,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {2450#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2450#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:37,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {2450#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2450#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:37,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {2450#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2451#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:37,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {2451#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2451#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:37,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {2451#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2451#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:37,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {2451#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2452#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:37,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {2452#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2452#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:37,453 INFO L273 TraceCheckUtils]: 16: Hoare triple {2452#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2452#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:37,455 INFO L273 TraceCheckUtils]: 17: Hoare triple {2452#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2453#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:37,455 INFO L273 TraceCheckUtils]: 18: Hoare triple {2453#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2453#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:37,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {2453#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2453#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:37,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {2453#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2454#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:37,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {2454#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2454#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:37,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {2454#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2454#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:37,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {2454#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2455#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:37,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {2455#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2455#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:37,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {2455#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2455#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:37,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {2455#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2456#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:37,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {2456#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2456#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:37,468 INFO L273 TraceCheckUtils]: 28: Hoare triple {2456#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2456#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:37,470 INFO L273 TraceCheckUtils]: 29: Hoare triple {2456#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2457#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:37,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {2457#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2457#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:37,472 INFO L273 TraceCheckUtils]: 31: Hoare triple {2457#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2457#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:37,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {2457#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2458#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:37,474 INFO L273 TraceCheckUtils]: 33: Hoare triple {2458#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2448#false} is VALID [2018-11-23 11:58:37,474 INFO L273 TraceCheckUtils]: 34: Hoare triple {2448#false} havoc ~x~0;~x~0 := 0; {2448#false} is VALID [2018-11-23 11:58:37,474 INFO L273 TraceCheckUtils]: 35: Hoare triple {2448#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {2448#false} is VALID [2018-11-23 11:58:37,474 INFO L256 TraceCheckUtils]: 36: Hoare triple {2448#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {2448#false} is VALID [2018-11-23 11:58:37,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {2448#false} ~cond := #in~cond; {2448#false} is VALID [2018-11-23 11:58:37,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {2448#false} assume 0 == ~cond; {2448#false} is VALID [2018-11-23 11:58:37,474 INFO L273 TraceCheckUtils]: 39: Hoare triple {2448#false} assume !false; {2448#false} is VALID [2018-11-23 11:58:37,476 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:58:37,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:37,476 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:58:37,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:37,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 11:58:37,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:37,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:37,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {2447#true} call ULTIMATE.init(); {2447#true} is VALID [2018-11-23 11:58:37,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {2447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2447#true} is VALID [2018-11-23 11:58:37,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {2447#true} assume true; {2447#true} is VALID [2018-11-23 11:58:37,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2447#true} {2447#true} #54#return; {2447#true} is VALID [2018-11-23 11:58:37,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {2447#true} call #t~ret6 := main(); {2447#true} is VALID [2018-11-23 11:58:37,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {2447#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2449#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:37,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {2449#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2449#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:37,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {2449#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2449#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:37,671 INFO L273 TraceCheckUtils]: 8: Hoare triple {2449#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2450#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:37,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {2450#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2450#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:37,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {2450#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2450#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:37,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {2450#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2451#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:37,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {2451#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2451#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:37,676 INFO L273 TraceCheckUtils]: 13: Hoare triple {2451#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2451#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:37,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {2451#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2452#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:37,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {2452#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2452#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:37,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {2452#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2452#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:37,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {2452#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2453#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:37,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {2453#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2453#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:37,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {2453#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2453#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:37,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {2453#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2454#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:37,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {2454#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2454#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:37,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {2454#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2454#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:37,694 INFO L273 TraceCheckUtils]: 23: Hoare triple {2454#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2455#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:37,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {2455#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2455#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:37,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {2455#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2455#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:37,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {2455#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2456#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:37,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {2456#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2456#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:37,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {2456#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2456#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:37,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {2456#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2457#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:37,697 INFO L273 TraceCheckUtils]: 30: Hoare triple {2457#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2457#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:37,697 INFO L273 TraceCheckUtils]: 31: Hoare triple {2457#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2457#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:37,698 INFO L273 TraceCheckUtils]: 32: Hoare triple {2457#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2458#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:37,699 INFO L273 TraceCheckUtils]: 33: Hoare triple {2458#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2448#false} is VALID [2018-11-23 11:58:37,699 INFO L273 TraceCheckUtils]: 34: Hoare triple {2448#false} havoc ~x~0;~x~0 := 0; {2448#false} is VALID [2018-11-23 11:58:37,699 INFO L273 TraceCheckUtils]: 35: Hoare triple {2448#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {2448#false} is VALID [2018-11-23 11:58:37,699 INFO L256 TraceCheckUtils]: 36: Hoare triple {2448#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {2448#false} is VALID [2018-11-23 11:58:37,700 INFO L273 TraceCheckUtils]: 37: Hoare triple {2448#false} ~cond := #in~cond; {2448#false} is VALID [2018-11-23 11:58:37,700 INFO L273 TraceCheckUtils]: 38: Hoare triple {2448#false} assume 0 == ~cond; {2448#false} is VALID [2018-11-23 11:58:37,700 INFO L273 TraceCheckUtils]: 39: Hoare triple {2448#false} assume !false; {2448#false} is VALID [2018-11-23 11:58:37,702 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:58:37,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:37,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-23 11:58:37,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-23 11:58:37,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:37,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:58:37,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:37,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:58:37,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:58:37,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:37,761 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 12 states. [2018-11-23 11:58:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:38,019 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-23 11:58:38,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:58:38,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-23 11:58:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2018-11-23 11:58:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2018-11-23 11:58:38,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 74 transitions. [2018-11-23 11:58:38,099 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:58:38,101 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:58:38,101 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 11:58:38,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 11:58:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-23 11:58:38,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:38,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2018-11-23 11:58:38,120 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2018-11-23 11:58:38,121 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2018-11-23 11:58:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:38,122 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 11:58:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-23 11:58:38,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:38,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:38,123 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2018-11-23 11:58:38,123 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2018-11-23 11:58:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:38,124 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 11:58:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-23 11:58:38,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:38,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:38,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:38,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:58:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-23 11:58:38,126 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 40 [2018-11-23 11:58:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:38,127 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 11:58:38,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:58:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 11:58:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:58:38,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:38,128 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:58:38,128 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:38,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1696809257, now seen corresponding path program 10 times [2018-11-23 11:58:38,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:38,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:38,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:38,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {2826#true} call ULTIMATE.init(); {2826#true} is VALID [2018-11-23 11:58:38,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {2826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2826#true} is VALID [2018-11-23 11:58:38,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {2826#true} assume true; {2826#true} is VALID [2018-11-23 11:58:38,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2826#true} {2826#true} #54#return; {2826#true} is VALID [2018-11-23 11:58:38,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {2826#true} call #t~ret6 := main(); {2826#true} is VALID [2018-11-23 11:58:38,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {2826#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2828#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:38,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {2828#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2828#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:38,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {2828#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2828#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:38,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {2828#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2829#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {2829#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2829#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {2829#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2829#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {2829#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2830#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {2830#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2830#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {2830#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2830#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {2830#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2831#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {2831#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2831#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {2831#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2831#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {2831#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2832#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {2832#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2832#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {2832#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2832#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {2832#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2833#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {2833#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2833#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {2833#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2833#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {2833#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2834#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {2834#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2834#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {2834#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2834#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {2834#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2835#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {2835#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2835#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {2835#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2835#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,362 INFO L273 TraceCheckUtils]: 29: Hoare triple {2835#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2836#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,362 INFO L273 TraceCheckUtils]: 30: Hoare triple {2836#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2836#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,363 INFO L273 TraceCheckUtils]: 31: Hoare triple {2836#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2836#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,364 INFO L273 TraceCheckUtils]: 32: Hoare triple {2836#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2837#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,364 INFO L273 TraceCheckUtils]: 33: Hoare triple {2837#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2837#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,365 INFO L273 TraceCheckUtils]: 34: Hoare triple {2837#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2837#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {2837#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2838#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:38,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {2838#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2827#false} is VALID [2018-11-23 11:58:38,366 INFO L273 TraceCheckUtils]: 37: Hoare triple {2827#false} havoc ~x~0;~x~0 := 0; {2827#false} is VALID [2018-11-23 11:58:38,366 INFO L273 TraceCheckUtils]: 38: Hoare triple {2827#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {2827#false} is VALID [2018-11-23 11:58:38,367 INFO L256 TraceCheckUtils]: 39: Hoare triple {2827#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {2827#false} is VALID [2018-11-23 11:58:38,367 INFO L273 TraceCheckUtils]: 40: Hoare triple {2827#false} ~cond := #in~cond; {2827#false} is VALID [2018-11-23 11:58:38,367 INFO L273 TraceCheckUtils]: 41: Hoare triple {2827#false} assume 0 == ~cond; {2827#false} is VALID [2018-11-23 11:58:38,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {2827#false} assume !false; {2827#false} is VALID [2018-11-23 11:58:38,369 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:58:38,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:38,369 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:58:38,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:38,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:38,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:38,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:38,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {2826#true} call ULTIMATE.init(); {2826#true} is VALID [2018-11-23 11:58:38,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {2826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2826#true} is VALID [2018-11-23 11:58:38,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {2826#true} assume true; {2826#true} is VALID [2018-11-23 11:58:38,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2826#true} {2826#true} #54#return; {2826#true} is VALID [2018-11-23 11:58:38,662 INFO L256 TraceCheckUtils]: 4: Hoare triple {2826#true} call #t~ret6 := main(); {2826#true} is VALID [2018-11-23 11:58:38,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {2826#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2828#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:38,667 INFO L273 TraceCheckUtils]: 6: Hoare triple {2828#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2828#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:38,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {2828#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2828#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:38,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {2828#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2829#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {2829#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2829#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {2829#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2829#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {2829#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2830#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {2830#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2830#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {2830#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2830#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {2830#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2831#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {2831#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2831#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {2831#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2831#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {2831#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2832#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {2832#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2832#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {2832#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2832#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {2832#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2833#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,677 INFO L273 TraceCheckUtils]: 21: Hoare triple {2833#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2833#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {2833#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2833#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,678 INFO L273 TraceCheckUtils]: 23: Hoare triple {2833#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2834#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {2834#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2834#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {2834#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2834#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {2834#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2835#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,681 INFO L273 TraceCheckUtils]: 27: Hoare triple {2835#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2835#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {2835#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2835#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {2835#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2836#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {2836#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2836#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,683 INFO L273 TraceCheckUtils]: 31: Hoare triple {2836#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2836#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {2836#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2837#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {2837#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2837#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {2837#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {2837#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,686 INFO L273 TraceCheckUtils]: 35: Hoare triple {2837#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2838#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:38,687 INFO L273 TraceCheckUtils]: 36: Hoare triple {2838#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2827#false} is VALID [2018-11-23 11:58:38,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {2827#false} havoc ~x~0;~x~0 := 0; {2827#false} is VALID [2018-11-23 11:58:38,687 INFO L273 TraceCheckUtils]: 38: Hoare triple {2827#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {2827#false} is VALID [2018-11-23 11:58:38,687 INFO L256 TraceCheckUtils]: 39: Hoare triple {2827#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {2827#false} is VALID [2018-11-23 11:58:38,688 INFO L273 TraceCheckUtils]: 40: Hoare triple {2827#false} ~cond := #in~cond; {2827#false} is VALID [2018-11-23 11:58:38,688 INFO L273 TraceCheckUtils]: 41: Hoare triple {2827#false} assume 0 == ~cond; {2827#false} is VALID [2018-11-23 11:58:38,688 INFO L273 TraceCheckUtils]: 42: Hoare triple {2827#false} assume !false; {2827#false} is VALID [2018-11-23 11:58:38,690 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:58:38,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:38,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 11:58:38,713 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 11:58:38,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:38,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:58:38,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:38,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:58:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:58:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:58:38,802 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 13 states. [2018-11-23 11:58:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:39,032 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-11-23 11:58:39,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:58:39,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 11:58:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:58:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 11:58:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:58:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 11:58:39,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2018-11-23 11:58:39,153 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:58:39,155 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:58:39,155 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:58:39,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:58:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:58:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-23 11:58:39,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:39,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 51 states. [2018-11-23 11:58:39,193 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 51 states. [2018-11-23 11:58:39,193 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 51 states. [2018-11-23 11:58:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:39,195 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 11:58:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:58:39,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:39,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:39,195 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 53 states. [2018-11-23 11:58:39,196 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 53 states. [2018-11-23 11:58:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:39,197 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 11:58:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:58:39,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:39,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:39,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:39,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:58:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-23 11:58:39,199 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 43 [2018-11-23 11:58:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:39,199 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-23 11:58:39,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:58:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 11:58:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:58:39,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:39,199 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:58:39,200 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:39,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1165863460, now seen corresponding path program 11 times [2018-11-23 11:58:39,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:39,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:39,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:39,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:39,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:39,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {3229#true} call ULTIMATE.init(); {3229#true} is VALID [2018-11-23 11:58:39,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {3229#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3229#true} is VALID [2018-11-23 11:58:39,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {3229#true} assume true; {3229#true} is VALID [2018-11-23 11:58:39,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3229#true} {3229#true} #54#return; {3229#true} is VALID [2018-11-23 11:58:39,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {3229#true} call #t~ret6 := main(); {3229#true} is VALID [2018-11-23 11:58:39,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {3229#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3231#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:39,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {3231#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3231#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:39,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {3231#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3231#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:39,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {3231#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3232#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:39,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {3232#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3232#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:39,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {3232#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3232#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:39,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {3232#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3233#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:39,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {3233#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3233#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:39,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {3233#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3233#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:39,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {3233#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3234#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:39,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {3234#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3234#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:39,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {3234#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3234#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:39,479 INFO L273 TraceCheckUtils]: 17: Hoare triple {3234#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3235#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:39,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {3235#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3235#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:39,480 INFO L273 TraceCheckUtils]: 19: Hoare triple {3235#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3235#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:39,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {3235#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3236#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:39,482 INFO L273 TraceCheckUtils]: 21: Hoare triple {3236#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3236#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:39,482 INFO L273 TraceCheckUtils]: 22: Hoare triple {3236#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3236#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:39,483 INFO L273 TraceCheckUtils]: 23: Hoare triple {3236#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3237#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:39,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {3237#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3237#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:39,484 INFO L273 TraceCheckUtils]: 25: Hoare triple {3237#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3237#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:39,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {3237#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3238#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:39,485 INFO L273 TraceCheckUtils]: 27: Hoare triple {3238#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3238#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:39,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {3238#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3238#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:39,487 INFO L273 TraceCheckUtils]: 29: Hoare triple {3238#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3239#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:39,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {3239#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3239#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:39,488 INFO L273 TraceCheckUtils]: 31: Hoare triple {3239#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3239#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:39,489 INFO L273 TraceCheckUtils]: 32: Hoare triple {3239#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3240#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:39,489 INFO L273 TraceCheckUtils]: 33: Hoare triple {3240#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3240#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:39,490 INFO L273 TraceCheckUtils]: 34: Hoare triple {3240#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3240#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:39,490 INFO L273 TraceCheckUtils]: 35: Hoare triple {3240#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3241#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:39,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {3241#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3241#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:39,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {3241#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3241#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:39,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {3241#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3242#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:39,493 INFO L273 TraceCheckUtils]: 39: Hoare triple {3242#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3230#false} is VALID [2018-11-23 11:58:39,493 INFO L273 TraceCheckUtils]: 40: Hoare triple {3230#false} havoc ~x~0;~x~0 := 0; {3230#false} is VALID [2018-11-23 11:58:39,493 INFO L273 TraceCheckUtils]: 41: Hoare triple {3230#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {3230#false} is VALID [2018-11-23 11:58:39,494 INFO L256 TraceCheckUtils]: 42: Hoare triple {3230#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {3230#false} is VALID [2018-11-23 11:58:39,494 INFO L273 TraceCheckUtils]: 43: Hoare triple {3230#false} ~cond := #in~cond; {3230#false} is VALID [2018-11-23 11:58:39,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {3230#false} assume 0 == ~cond; {3230#false} is VALID [2018-11-23 11:58:39,494 INFO L273 TraceCheckUtils]: 45: Hoare triple {3230#false} assume !false; {3230#false} is VALID [2018-11-23 11:58:39,498 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:58:39,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:39,498 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:58:39,510 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:58:39,549 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:58:39,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:39,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:39,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {3229#true} call ULTIMATE.init(); {3229#true} is VALID [2018-11-23 11:58:39,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {3229#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3229#true} is VALID [2018-11-23 11:58:39,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {3229#true} assume true; {3229#true} is VALID [2018-11-23 11:58:39,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3229#true} {3229#true} #54#return; {3229#true} is VALID [2018-11-23 11:58:39,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {3229#true} call #t~ret6 := main(); {3229#true} is VALID [2018-11-23 11:58:39,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {3229#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3231#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:39,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {3231#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3231#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:39,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {3231#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3231#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:39,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {3231#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3232#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:39,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {3232#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3232#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:39,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {3232#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3232#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:39,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {3232#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3233#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:39,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {3233#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3233#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:39,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {3233#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3233#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:39,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {3233#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3234#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:39,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {3234#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3234#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:39,770 INFO L273 TraceCheckUtils]: 16: Hoare triple {3234#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3234#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:39,771 INFO L273 TraceCheckUtils]: 17: Hoare triple {3234#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3235#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:39,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {3235#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3235#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:39,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {3235#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3235#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:39,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {3235#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3236#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:39,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {3236#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3236#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:39,774 INFO L273 TraceCheckUtils]: 22: Hoare triple {3236#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3236#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:39,774 INFO L273 TraceCheckUtils]: 23: Hoare triple {3236#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3237#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:39,775 INFO L273 TraceCheckUtils]: 24: Hoare triple {3237#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3237#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:39,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {3237#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3237#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:39,776 INFO L273 TraceCheckUtils]: 26: Hoare triple {3237#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3238#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:39,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {3238#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3238#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:39,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {3238#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3238#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:39,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {3238#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3239#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:39,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {3239#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3239#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:39,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {3239#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3239#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:39,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {3239#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3240#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:39,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {3240#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3240#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:39,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {3240#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3240#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:39,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {3240#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3241#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:39,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {3241#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3241#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:39,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {3241#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3241#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:39,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {3241#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3242#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:39,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {3242#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3230#false} is VALID [2018-11-23 11:58:39,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {3230#false} havoc ~x~0;~x~0 := 0; {3230#false} is VALID [2018-11-23 11:58:39,785 INFO L273 TraceCheckUtils]: 41: Hoare triple {3230#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {3230#false} is VALID [2018-11-23 11:58:39,785 INFO L256 TraceCheckUtils]: 42: Hoare triple {3230#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {3230#false} is VALID [2018-11-23 11:58:39,785 INFO L273 TraceCheckUtils]: 43: Hoare triple {3230#false} ~cond := #in~cond; {3230#false} is VALID [2018-11-23 11:58:39,785 INFO L273 TraceCheckUtils]: 44: Hoare triple {3230#false} assume 0 == ~cond; {3230#false} is VALID [2018-11-23 11:58:39,786 INFO L273 TraceCheckUtils]: 45: Hoare triple {3230#false} assume !false; {3230#false} is VALID [2018-11-23 11:58:39,788 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:58:39,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:39,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-23 11:58:39,808 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2018-11-23 11:58:39,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:39,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:58:39,851 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:58:39,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:58:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:58:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:58:39,852 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 14 states. [2018-11-23 11:58:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:40,177 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 11:58:40,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:58:40,177 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2018-11-23 11:58:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:58:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2018-11-23 11:58:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:58:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2018-11-23 11:58:40,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 82 transitions. [2018-11-23 11:58:40,302 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:58:40,303 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:58:40,304 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:58:40,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:58:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:58:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-23 11:58:40,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:40,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 54 states. [2018-11-23 11:58:40,325 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 54 states. [2018-11-23 11:58:40,325 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 54 states. [2018-11-23 11:58:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:40,327 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-23 11:58:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 11:58:40,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:40,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:40,328 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 56 states. [2018-11-23 11:58:40,328 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 56 states. [2018-11-23 11:58:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:40,329 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-23 11:58:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 11:58:40,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:40,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:40,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:40,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:58:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2018-11-23 11:58:40,331 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 46 [2018-11-23 11:58:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:40,331 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-23 11:58:40,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:58:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2018-11-23 11:58:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:58:40,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:40,332 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:58:40,332 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:40,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2116821065, now seen corresponding path program 12 times [2018-11-23 11:58:40,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:40,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:40,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:40,611 INFO L256 TraceCheckUtils]: 0: Hoare triple {3656#true} call ULTIMATE.init(); {3656#true} is VALID [2018-11-23 11:58:40,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {3656#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3656#true} is VALID [2018-11-23 11:58:40,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {3656#true} assume true; {3656#true} is VALID [2018-11-23 11:58:40,612 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3656#true} {3656#true} #54#return; {3656#true} is VALID [2018-11-23 11:58:40,612 INFO L256 TraceCheckUtils]: 4: Hoare triple {3656#true} call #t~ret6 := main(); {3656#true} is VALID [2018-11-23 11:58:40,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {3656#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3658#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {3658#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3658#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {3658#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3658#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {3658#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3659#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {3659#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3659#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {3659#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3659#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {3659#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3660#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:40,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {3660#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3660#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:40,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {3660#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3660#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:40,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {3660#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3661#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:40,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {3661#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3661#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:40,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {3661#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3661#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:40,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {3661#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3662#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:40,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {3662#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3662#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:40,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {3662#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3662#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:40,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {3662#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3663#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:40,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {3663#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3663#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:40,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {3663#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3663#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:40,626 INFO L273 TraceCheckUtils]: 23: Hoare triple {3663#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3664#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:40,626 INFO L273 TraceCheckUtils]: 24: Hoare triple {3664#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3664#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:40,627 INFO L273 TraceCheckUtils]: 25: Hoare triple {3664#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3664#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:40,628 INFO L273 TraceCheckUtils]: 26: Hoare triple {3664#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3665#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:40,629 INFO L273 TraceCheckUtils]: 27: Hoare triple {3665#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3665#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:40,629 INFO L273 TraceCheckUtils]: 28: Hoare triple {3665#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3665#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:40,630 INFO L273 TraceCheckUtils]: 29: Hoare triple {3665#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3666#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:40,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {3666#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3666#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:40,631 INFO L273 TraceCheckUtils]: 31: Hoare triple {3666#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3666#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:40,632 INFO L273 TraceCheckUtils]: 32: Hoare triple {3666#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3667#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:40,633 INFO L273 TraceCheckUtils]: 33: Hoare triple {3667#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3667#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:40,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {3667#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3667#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:40,634 INFO L273 TraceCheckUtils]: 35: Hoare triple {3667#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3668#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:40,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {3668#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3668#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:40,635 INFO L273 TraceCheckUtils]: 37: Hoare triple {3668#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3668#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:40,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {3668#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3669#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:40,637 INFO L273 TraceCheckUtils]: 39: Hoare triple {3669#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3669#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:40,637 INFO L273 TraceCheckUtils]: 40: Hoare triple {3669#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3669#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:40,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {3669#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3670#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:40,639 INFO L273 TraceCheckUtils]: 42: Hoare triple {3670#(<= main_~i~0 13)} assume !(~i~0 < 100000); {3657#false} is VALID [2018-11-23 11:58:40,639 INFO L273 TraceCheckUtils]: 43: Hoare triple {3657#false} havoc ~x~0;~x~0 := 0; {3657#false} is VALID [2018-11-23 11:58:40,639 INFO L273 TraceCheckUtils]: 44: Hoare triple {3657#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {3657#false} is VALID [2018-11-23 11:58:40,640 INFO L256 TraceCheckUtils]: 45: Hoare triple {3657#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {3657#false} is VALID [2018-11-23 11:58:40,640 INFO L273 TraceCheckUtils]: 46: Hoare triple {3657#false} ~cond := #in~cond; {3657#false} is VALID [2018-11-23 11:58:40,640 INFO L273 TraceCheckUtils]: 47: Hoare triple {3657#false} assume 0 == ~cond; {3657#false} is VALID [2018-11-23 11:58:40,640 INFO L273 TraceCheckUtils]: 48: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2018-11-23 11:58:40,645 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:58:40,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:40,645 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:58:40,655 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:58:40,686 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:58:40,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:40,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:40,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {3656#true} call ULTIMATE.init(); {3656#true} is VALID [2018-11-23 11:58:40,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {3656#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3656#true} is VALID [2018-11-23 11:58:40,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {3656#true} assume true; {3656#true} is VALID [2018-11-23 11:58:40,954 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3656#true} {3656#true} #54#return; {3656#true} is VALID [2018-11-23 11:58:40,954 INFO L256 TraceCheckUtils]: 4: Hoare triple {3656#true} call #t~ret6 := main(); {3656#true} is VALID [2018-11-23 11:58:40,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {3656#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3658#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {3658#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3658#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {3658#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3658#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {3658#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3659#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {3659#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3659#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {3659#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3659#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {3659#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3660#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:40,958 INFO L273 TraceCheckUtils]: 12: Hoare triple {3660#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3660#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:40,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {3660#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3660#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:40,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {3660#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3661#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:40,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {3661#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3661#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:40,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {3661#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3661#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:40,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {3661#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3662#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:40,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {3662#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3662#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:40,963 INFO L273 TraceCheckUtils]: 19: Hoare triple {3662#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3662#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:40,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {3662#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3663#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:40,985 INFO L273 TraceCheckUtils]: 21: Hoare triple {3663#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3663#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:41,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {3663#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3663#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:41,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {3663#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3664#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:41,026 INFO L273 TraceCheckUtils]: 24: Hoare triple {3664#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3664#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:41,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {3664#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3664#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:41,054 INFO L273 TraceCheckUtils]: 26: Hoare triple {3664#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3665#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:41,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {3665#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3665#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:41,072 INFO L273 TraceCheckUtils]: 28: Hoare triple {3665#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3665#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:41,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {3665#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3666#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:41,073 INFO L273 TraceCheckUtils]: 30: Hoare triple {3666#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3666#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:41,075 INFO L273 TraceCheckUtils]: 31: Hoare triple {3666#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3666#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:41,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {3666#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3667#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:41,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {3667#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3667#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:41,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {3667#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3667#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:41,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {3667#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3668#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:41,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {3668#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3668#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:41,079 INFO L273 TraceCheckUtils]: 37: Hoare triple {3668#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3668#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:41,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {3668#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3669#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:41,081 INFO L273 TraceCheckUtils]: 39: Hoare triple {3669#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3669#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:41,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {3669#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {3669#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:41,082 INFO L273 TraceCheckUtils]: 41: Hoare triple {3669#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3670#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:41,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {3670#(<= main_~i~0 13)} assume !(~i~0 < 100000); {3657#false} is VALID [2018-11-23 11:58:41,083 INFO L273 TraceCheckUtils]: 43: Hoare triple {3657#false} havoc ~x~0;~x~0 := 0; {3657#false} is VALID [2018-11-23 11:58:41,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {3657#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {3657#false} is VALID [2018-11-23 11:58:41,084 INFO L256 TraceCheckUtils]: 45: Hoare triple {3657#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {3657#false} is VALID [2018-11-23 11:58:41,084 INFO L273 TraceCheckUtils]: 46: Hoare triple {3657#false} ~cond := #in~cond; {3657#false} is VALID [2018-11-23 11:58:41,084 INFO L273 TraceCheckUtils]: 47: Hoare triple {3657#false} assume 0 == ~cond; {3657#false} is VALID [2018-11-23 11:58:41,084 INFO L273 TraceCheckUtils]: 48: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2018-11-23 11:58:41,088 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:58:41,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:41,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-23 11:58:41,110 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-11-23 11:58:41,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:41,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:58:41,166 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:58:41,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:58:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:58:41,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:58:41,167 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand 15 states. [2018-11-23 11:58:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:41,530 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-11-23 11:58:41,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:58:41,530 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-11-23 11:58:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:58:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2018-11-23 11:58:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:58:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2018-11-23 11:58:41,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 86 transitions. [2018-11-23 11:58:42,070 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:58:42,071 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:58:42,071 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:58:42,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:58:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:58:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 11:58:42,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:42,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 57 states. [2018-11-23 11:58:42,090 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 57 states. [2018-11-23 11:58:42,090 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 57 states. [2018-11-23 11:58:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,092 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-23 11:58:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-23 11:58:42,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:42,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:42,093 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 59 states. [2018-11-23 11:58:42,093 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 59 states. [2018-11-23 11:58:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,094 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-23 11:58:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-23 11:58:42,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:42,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:42,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:42,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:58:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-11-23 11:58:42,096 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 49 [2018-11-23 11:58:42,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:42,096 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-23 11:58:42,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:58:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2018-11-23 11:58:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 11:58:42,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:42,097 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:58:42,098 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:42,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:42,098 INFO L82 PathProgramCache]: Analyzing trace with hash -166175420, now seen corresponding path program 13 times [2018-11-23 11:58:42,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:42,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:42,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:42,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:42,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:43,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {4107#true} call ULTIMATE.init(); {4107#true} is VALID [2018-11-23 11:58:43,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {4107#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4107#true} is VALID [2018-11-23 11:58:43,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {4107#true} assume true; {4107#true} is VALID [2018-11-23 11:58:43,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4107#true} {4107#true} #54#return; {4107#true} is VALID [2018-11-23 11:58:43,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {4107#true} call #t~ret6 := main(); {4107#true} is VALID [2018-11-23 11:58:43,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {4107#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4109#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:43,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {4109#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4109#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:43,449 INFO L273 TraceCheckUtils]: 7: Hoare triple {4109#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4109#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:43,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {4109#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4110#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {4110#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4110#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {4110#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4110#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {4110#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4111#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {4111#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4111#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {4111#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4111#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {4111#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4112#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,452 INFO L273 TraceCheckUtils]: 15: Hoare triple {4112#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4112#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,453 INFO L273 TraceCheckUtils]: 16: Hoare triple {4112#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4112#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,454 INFO L273 TraceCheckUtils]: 17: Hoare triple {4112#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4113#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,454 INFO L273 TraceCheckUtils]: 18: Hoare triple {4113#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4113#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,455 INFO L273 TraceCheckUtils]: 19: Hoare triple {4113#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4113#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,455 INFO L273 TraceCheckUtils]: 20: Hoare triple {4113#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4114#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,456 INFO L273 TraceCheckUtils]: 21: Hoare triple {4114#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4114#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {4114#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4114#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,457 INFO L273 TraceCheckUtils]: 23: Hoare triple {4114#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4115#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {4115#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4115#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {4115#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4115#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {4115#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4116#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,460 INFO L273 TraceCheckUtils]: 27: Hoare triple {4116#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4116#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {4116#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4116#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,461 INFO L273 TraceCheckUtils]: 29: Hoare triple {4116#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4117#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,461 INFO L273 TraceCheckUtils]: 30: Hoare triple {4117#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4117#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,462 INFO L273 TraceCheckUtils]: 31: Hoare triple {4117#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4117#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,463 INFO L273 TraceCheckUtils]: 32: Hoare triple {4117#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4118#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,463 INFO L273 TraceCheckUtils]: 33: Hoare triple {4118#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4118#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,464 INFO L273 TraceCheckUtils]: 34: Hoare triple {4118#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4118#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,465 INFO L273 TraceCheckUtils]: 35: Hoare triple {4118#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4119#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,465 INFO L273 TraceCheckUtils]: 36: Hoare triple {4119#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4119#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,466 INFO L273 TraceCheckUtils]: 37: Hoare triple {4119#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4119#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,466 INFO L273 TraceCheckUtils]: 38: Hoare triple {4119#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4120#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,467 INFO L273 TraceCheckUtils]: 39: Hoare triple {4120#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4120#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,467 INFO L273 TraceCheckUtils]: 40: Hoare triple {4120#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4120#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,468 INFO L273 TraceCheckUtils]: 41: Hoare triple {4120#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4121#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,469 INFO L273 TraceCheckUtils]: 42: Hoare triple {4121#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4121#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,469 INFO L273 TraceCheckUtils]: 43: Hoare triple {4121#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4121#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,470 INFO L273 TraceCheckUtils]: 44: Hoare triple {4121#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4122#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:43,471 INFO L273 TraceCheckUtils]: 45: Hoare triple {4122#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4108#false} is VALID [2018-11-23 11:58:43,471 INFO L273 TraceCheckUtils]: 46: Hoare triple {4108#false} havoc ~x~0;~x~0 := 0; {4108#false} is VALID [2018-11-23 11:58:43,471 INFO L273 TraceCheckUtils]: 47: Hoare triple {4108#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {4108#false} is VALID [2018-11-23 11:58:43,471 INFO L256 TraceCheckUtils]: 48: Hoare triple {4108#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {4108#false} is VALID [2018-11-23 11:58:43,472 INFO L273 TraceCheckUtils]: 49: Hoare triple {4108#false} ~cond := #in~cond; {4108#false} is VALID [2018-11-23 11:58:43,472 INFO L273 TraceCheckUtils]: 50: Hoare triple {4108#false} assume 0 == ~cond; {4108#false} is VALID [2018-11-23 11:58:43,472 INFO L273 TraceCheckUtils]: 51: Hoare triple {4108#false} assume !false; {4108#false} is VALID [2018-11-23 11:58:43,474 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:58:43,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:43,475 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:58:43,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:43,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:43,643 INFO L256 TraceCheckUtils]: 0: Hoare triple {4107#true} call ULTIMATE.init(); {4107#true} is VALID [2018-11-23 11:58:43,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {4107#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4107#true} is VALID [2018-11-23 11:58:43,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {4107#true} assume true; {4107#true} is VALID [2018-11-23 11:58:43,644 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4107#true} {4107#true} #54#return; {4107#true} is VALID [2018-11-23 11:58:43,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {4107#true} call #t~ret6 := main(); {4107#true} is VALID [2018-11-23 11:58:43,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {4107#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4109#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:43,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {4109#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4109#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:43,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {4109#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4109#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:43,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {4109#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4110#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,647 INFO L273 TraceCheckUtils]: 9: Hoare triple {4110#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4110#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {4110#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4110#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {4110#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4111#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {4111#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4111#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {4111#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4111#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {4111#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4112#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {4112#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4112#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {4112#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4112#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {4112#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4113#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {4113#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4113#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {4113#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4113#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {4113#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4114#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {4114#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4114#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,653 INFO L273 TraceCheckUtils]: 22: Hoare triple {4114#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4114#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,654 INFO L273 TraceCheckUtils]: 23: Hoare triple {4114#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4115#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {4115#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4115#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {4115#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4115#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {4115#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4116#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {4116#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4116#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {4116#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4116#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,657 INFO L273 TraceCheckUtils]: 29: Hoare triple {4116#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4117#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {4117#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4117#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,658 INFO L273 TraceCheckUtils]: 31: Hoare triple {4117#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4117#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,659 INFO L273 TraceCheckUtils]: 32: Hoare triple {4117#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4118#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,660 INFO L273 TraceCheckUtils]: 33: Hoare triple {4118#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4118#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,660 INFO L273 TraceCheckUtils]: 34: Hoare triple {4118#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4118#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,661 INFO L273 TraceCheckUtils]: 35: Hoare triple {4118#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4119#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,662 INFO L273 TraceCheckUtils]: 36: Hoare triple {4119#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4119#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,662 INFO L273 TraceCheckUtils]: 37: Hoare triple {4119#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4119#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,663 INFO L273 TraceCheckUtils]: 38: Hoare triple {4119#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4120#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,663 INFO L273 TraceCheckUtils]: 39: Hoare triple {4120#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4120#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,664 INFO L273 TraceCheckUtils]: 40: Hoare triple {4120#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4120#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,665 INFO L273 TraceCheckUtils]: 41: Hoare triple {4120#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4121#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,665 INFO L273 TraceCheckUtils]: 42: Hoare triple {4121#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4121#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,666 INFO L273 TraceCheckUtils]: 43: Hoare triple {4121#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4121#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,666 INFO L273 TraceCheckUtils]: 44: Hoare triple {4121#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4122#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:43,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {4122#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4108#false} is VALID [2018-11-23 11:58:43,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {4108#false} havoc ~x~0;~x~0 := 0; {4108#false} is VALID [2018-11-23 11:58:43,668 INFO L273 TraceCheckUtils]: 47: Hoare triple {4108#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {4108#false} is VALID [2018-11-23 11:58:43,668 INFO L256 TraceCheckUtils]: 48: Hoare triple {4108#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {4108#false} is VALID [2018-11-23 11:58:43,668 INFO L273 TraceCheckUtils]: 49: Hoare triple {4108#false} ~cond := #in~cond; {4108#false} is VALID [2018-11-23 11:58:43,668 INFO L273 TraceCheckUtils]: 50: Hoare triple {4108#false} assume 0 == ~cond; {4108#false} is VALID [2018-11-23 11:58:43,668 INFO L273 TraceCheckUtils]: 51: Hoare triple {4108#false} assume !false; {4108#false} is VALID [2018-11-23 11:58:43,671 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:58:43,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:43,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-23 11:58:43,691 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-23 11:58:43,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:43,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:58:43,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:43,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:58:43,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:58:43,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:58:43,739 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand 16 states. [2018-11-23 11:58:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:44,126 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2018-11-23 11:58:44,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:58:44,126 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-23 11:58:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:58:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 90 transitions. [2018-11-23 11:58:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:58:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 90 transitions. [2018-11-23 11:58:44,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 90 transitions. [2018-11-23 11:58:44,216 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:58:44,217 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:58:44,217 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:58:44,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:58:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:58:44,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-23 11:58:44,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:44,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-23 11:58:44,238 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-23 11:58:44,238 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-23 11:58:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:44,240 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 11:58:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 11:58:44,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:44,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:44,240 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-23 11:58:44,240 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-23 11:58:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:44,242 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 11:58:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 11:58:44,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:44,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:44,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:44,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:58:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2018-11-23 11:58:44,244 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 52 [2018-11-23 11:58:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:44,245 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2018-11-23 11:58:44,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:58:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 11:58:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:58:44,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:44,246 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:58:44,246 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:44,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:44,246 INFO L82 PathProgramCache]: Analyzing trace with hash 610719895, now seen corresponding path program 14 times [2018-11-23 11:58:44,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:44,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:44,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:44,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:44,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:45,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {4582#true} call ULTIMATE.init(); {4582#true} is VALID [2018-11-23 11:58:45,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {4582#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4582#true} is VALID [2018-11-23 11:58:45,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {4582#true} assume true; {4582#true} is VALID [2018-11-23 11:58:45,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4582#true} {4582#true} #54#return; {4582#true} is VALID [2018-11-23 11:58:45,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {4582#true} call #t~ret6 := main(); {4582#true} is VALID [2018-11-23 11:58:45,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {4582#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4584#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {4584#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4584#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,448 INFO L273 TraceCheckUtils]: 7: Hoare triple {4584#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4584#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {4584#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4585#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {4585#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4585#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,450 INFO L273 TraceCheckUtils]: 10: Hoare triple {4585#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4585#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {4585#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4586#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {4586#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4586#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {4586#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4586#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {4586#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4587#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {4587#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4587#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,452 INFO L273 TraceCheckUtils]: 16: Hoare triple {4587#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4587#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {4587#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4588#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {4588#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4588#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {4588#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4588#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,454 INFO L273 TraceCheckUtils]: 20: Hoare triple {4588#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4589#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {4589#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4589#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {4589#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4589#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {4589#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4590#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {4590#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4590#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,457 INFO L273 TraceCheckUtils]: 25: Hoare triple {4590#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4590#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {4590#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4591#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {4591#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4591#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {4591#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4591#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,459 INFO L273 TraceCheckUtils]: 29: Hoare triple {4591#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4592#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,460 INFO L273 TraceCheckUtils]: 30: Hoare triple {4592#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4592#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,460 INFO L273 TraceCheckUtils]: 31: Hoare triple {4592#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4592#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,461 INFO L273 TraceCheckUtils]: 32: Hoare triple {4592#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4593#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,462 INFO L273 TraceCheckUtils]: 33: Hoare triple {4593#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4593#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,463 INFO L273 TraceCheckUtils]: 34: Hoare triple {4593#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4593#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,463 INFO L273 TraceCheckUtils]: 35: Hoare triple {4593#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4594#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,464 INFO L273 TraceCheckUtils]: 36: Hoare triple {4594#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4594#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,464 INFO L273 TraceCheckUtils]: 37: Hoare triple {4594#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4594#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {4594#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4595#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,466 INFO L273 TraceCheckUtils]: 39: Hoare triple {4595#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4595#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,466 INFO L273 TraceCheckUtils]: 40: Hoare triple {4595#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4595#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,467 INFO L273 TraceCheckUtils]: 41: Hoare triple {4595#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4596#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {4596#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4596#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,468 INFO L273 TraceCheckUtils]: 43: Hoare triple {4596#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4596#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,468 INFO L273 TraceCheckUtils]: 44: Hoare triple {4596#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4597#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,469 INFO L273 TraceCheckUtils]: 45: Hoare triple {4597#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4597#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {4597#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4597#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,470 INFO L273 TraceCheckUtils]: 47: Hoare triple {4597#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4598#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:45,471 INFO L273 TraceCheckUtils]: 48: Hoare triple {4598#(<= main_~i~0 15)} assume !(~i~0 < 100000); {4583#false} is VALID [2018-11-23 11:58:45,471 INFO L273 TraceCheckUtils]: 49: Hoare triple {4583#false} havoc ~x~0;~x~0 := 0; {4583#false} is VALID [2018-11-23 11:58:45,471 INFO L273 TraceCheckUtils]: 50: Hoare triple {4583#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {4583#false} is VALID [2018-11-23 11:58:45,472 INFO L256 TraceCheckUtils]: 51: Hoare triple {4583#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {4583#false} is VALID [2018-11-23 11:58:45,472 INFO L273 TraceCheckUtils]: 52: Hoare triple {4583#false} ~cond := #in~cond; {4583#false} is VALID [2018-11-23 11:58:45,472 INFO L273 TraceCheckUtils]: 53: Hoare triple {4583#false} assume 0 == ~cond; {4583#false} is VALID [2018-11-23 11:58:45,472 INFO L273 TraceCheckUtils]: 54: Hoare triple {4583#false} assume !false; {4583#false} is VALID [2018-11-23 11:58:45,475 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:58:45,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:45,475 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:58:45,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:45,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:45,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:45,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:45,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {4582#true} call ULTIMATE.init(); {4582#true} is VALID [2018-11-23 11:58:45,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {4582#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4582#true} is VALID [2018-11-23 11:58:45,707 INFO L273 TraceCheckUtils]: 2: Hoare triple {4582#true} assume true; {4582#true} is VALID [2018-11-23 11:58:45,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4582#true} {4582#true} #54#return; {4582#true} is VALID [2018-11-23 11:58:45,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {4582#true} call #t~ret6 := main(); {4582#true} is VALID [2018-11-23 11:58:45,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {4582#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4584#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {4584#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4584#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {4584#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4584#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {4584#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4585#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {4585#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4585#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {4585#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4585#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {4585#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4586#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,711 INFO L273 TraceCheckUtils]: 12: Hoare triple {4586#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4586#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {4586#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4586#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {4586#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4587#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {4587#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4587#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {4587#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4587#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {4587#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4588#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {4588#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4588#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {4588#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4588#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,715 INFO L273 TraceCheckUtils]: 20: Hoare triple {4588#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4589#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,716 INFO L273 TraceCheckUtils]: 21: Hoare triple {4589#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4589#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {4589#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4589#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,717 INFO L273 TraceCheckUtils]: 23: Hoare triple {4589#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4590#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,718 INFO L273 TraceCheckUtils]: 24: Hoare triple {4590#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4590#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,718 INFO L273 TraceCheckUtils]: 25: Hoare triple {4590#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4590#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {4590#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4591#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {4591#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4591#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {4591#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4591#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,721 INFO L273 TraceCheckUtils]: 29: Hoare triple {4591#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4592#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,721 INFO L273 TraceCheckUtils]: 30: Hoare triple {4592#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4592#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,722 INFO L273 TraceCheckUtils]: 31: Hoare triple {4592#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4592#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,722 INFO L273 TraceCheckUtils]: 32: Hoare triple {4592#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4593#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,723 INFO L273 TraceCheckUtils]: 33: Hoare triple {4593#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4593#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,723 INFO L273 TraceCheckUtils]: 34: Hoare triple {4593#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4593#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,724 INFO L273 TraceCheckUtils]: 35: Hoare triple {4593#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4594#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,725 INFO L273 TraceCheckUtils]: 36: Hoare triple {4594#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4594#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,725 INFO L273 TraceCheckUtils]: 37: Hoare triple {4594#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4594#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,726 INFO L273 TraceCheckUtils]: 38: Hoare triple {4594#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4595#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,726 INFO L273 TraceCheckUtils]: 39: Hoare triple {4595#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4595#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,727 INFO L273 TraceCheckUtils]: 40: Hoare triple {4595#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4595#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,728 INFO L273 TraceCheckUtils]: 41: Hoare triple {4595#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4596#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,728 INFO L273 TraceCheckUtils]: 42: Hoare triple {4596#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4596#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,729 INFO L273 TraceCheckUtils]: 43: Hoare triple {4596#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4596#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,729 INFO L273 TraceCheckUtils]: 44: Hoare triple {4596#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4597#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,730 INFO L273 TraceCheckUtils]: 45: Hoare triple {4597#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4597#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,730 INFO L273 TraceCheckUtils]: 46: Hoare triple {4597#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {4597#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,731 INFO L273 TraceCheckUtils]: 47: Hoare triple {4597#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4598#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:45,732 INFO L273 TraceCheckUtils]: 48: Hoare triple {4598#(<= main_~i~0 15)} assume !(~i~0 < 100000); {4583#false} is VALID [2018-11-23 11:58:45,732 INFO L273 TraceCheckUtils]: 49: Hoare triple {4583#false} havoc ~x~0;~x~0 := 0; {4583#false} is VALID [2018-11-23 11:58:45,732 INFO L273 TraceCheckUtils]: 50: Hoare triple {4583#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {4583#false} is VALID [2018-11-23 11:58:45,733 INFO L256 TraceCheckUtils]: 51: Hoare triple {4583#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {4583#false} is VALID [2018-11-23 11:58:45,733 INFO L273 TraceCheckUtils]: 52: Hoare triple {4583#false} ~cond := #in~cond; {4583#false} is VALID [2018-11-23 11:58:45,733 INFO L273 TraceCheckUtils]: 53: Hoare triple {4583#false} assume 0 == ~cond; {4583#false} is VALID [2018-11-23 11:58:45,733 INFO L273 TraceCheckUtils]: 54: Hoare triple {4583#false} assume !false; {4583#false} is VALID [2018-11-23 11:58:45,736 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:58:45,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:45,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-23 11:58:45,755 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-23 11:58:45,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:45,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:58:45,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:45,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:58:45,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:58:45,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:58:45,807 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand 17 states. [2018-11-23 11:58:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:46,331 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-23 11:58:46,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:58:46,332 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-23 11:58:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:58:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 11:58:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:58:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 11:58:46,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2018-11-23 11:58:46,885 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:58:46,887 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:58:46,887 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:58:46,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:58:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:58:46,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 11:58:46,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:46,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 11:58:46,912 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 11:58:46,912 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 11:58:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:46,914 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-11-23 11:58:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-11-23 11:58:46,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:46,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:46,914 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 11:58:46,915 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 11:58:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:46,916 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-11-23 11:58:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-11-23 11:58:46,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:46,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:46,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:46,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:58:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2018-11-23 11:58:46,919 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 55 [2018-11-23 11:58:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:46,919 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2018-11-23 11:58:46,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:58:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2018-11-23 11:58:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 11:58:46,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:46,920 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:58:46,920 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:46,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:46,921 INFO L82 PathProgramCache]: Analyzing trace with hash -479709084, now seen corresponding path program 15 times [2018-11-23 11:58:46,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:46,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:46,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:46,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:46,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:47,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {5081#true} call ULTIMATE.init(); {5081#true} is VALID [2018-11-23 11:58:47,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {5081#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5081#true} is VALID [2018-11-23 11:58:47,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {5081#true} assume true; {5081#true} is VALID [2018-11-23 11:58:47,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5081#true} {5081#true} #54#return; {5081#true} is VALID [2018-11-23 11:58:47,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {5081#true} call #t~ret6 := main(); {5081#true} is VALID [2018-11-23 11:58:47,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {5081#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5083#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {5083#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5083#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {5083#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5083#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {5083#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5084#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,251 INFO L273 TraceCheckUtils]: 9: Hoare triple {5084#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5084#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {5084#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5084#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {5084#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5085#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {5085#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5085#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,253 INFO L273 TraceCheckUtils]: 13: Hoare triple {5085#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5085#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {5085#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5086#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:47,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {5086#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5086#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:47,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {5086#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5086#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:47,255 INFO L273 TraceCheckUtils]: 17: Hoare triple {5086#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5087#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:47,256 INFO L273 TraceCheckUtils]: 18: Hoare triple {5087#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5087#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:47,256 INFO L273 TraceCheckUtils]: 19: Hoare triple {5087#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5087#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:47,257 INFO L273 TraceCheckUtils]: 20: Hoare triple {5087#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5088#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:47,258 INFO L273 TraceCheckUtils]: 21: Hoare triple {5088#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5088#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:47,258 INFO L273 TraceCheckUtils]: 22: Hoare triple {5088#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5088#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:47,259 INFO L273 TraceCheckUtils]: 23: Hoare triple {5088#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5089#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:47,259 INFO L273 TraceCheckUtils]: 24: Hoare triple {5089#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5089#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:47,260 INFO L273 TraceCheckUtils]: 25: Hoare triple {5089#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5089#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:47,261 INFO L273 TraceCheckUtils]: 26: Hoare triple {5089#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5090#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:47,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {5090#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5090#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:47,262 INFO L273 TraceCheckUtils]: 28: Hoare triple {5090#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5090#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:47,262 INFO L273 TraceCheckUtils]: 29: Hoare triple {5090#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5091#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:47,263 INFO L273 TraceCheckUtils]: 30: Hoare triple {5091#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5091#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:47,263 INFO L273 TraceCheckUtils]: 31: Hoare triple {5091#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5091#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:47,264 INFO L273 TraceCheckUtils]: 32: Hoare triple {5091#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5092#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:47,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {5092#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5092#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:47,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {5092#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5092#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:47,266 INFO L273 TraceCheckUtils]: 35: Hoare triple {5092#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5093#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:47,266 INFO L273 TraceCheckUtils]: 36: Hoare triple {5093#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5093#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:47,267 INFO L273 TraceCheckUtils]: 37: Hoare triple {5093#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5093#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:47,268 INFO L273 TraceCheckUtils]: 38: Hoare triple {5093#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5094#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:47,268 INFO L273 TraceCheckUtils]: 39: Hoare triple {5094#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5094#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:47,269 INFO L273 TraceCheckUtils]: 40: Hoare triple {5094#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5094#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:47,269 INFO L273 TraceCheckUtils]: 41: Hoare triple {5094#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5095#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:47,270 INFO L273 TraceCheckUtils]: 42: Hoare triple {5095#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5095#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:47,270 INFO L273 TraceCheckUtils]: 43: Hoare triple {5095#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5095#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:47,271 INFO L273 TraceCheckUtils]: 44: Hoare triple {5095#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5096#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:47,272 INFO L273 TraceCheckUtils]: 45: Hoare triple {5096#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5096#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:47,272 INFO L273 TraceCheckUtils]: 46: Hoare triple {5096#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5096#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:47,273 INFO L273 TraceCheckUtils]: 47: Hoare triple {5096#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5097#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:47,273 INFO L273 TraceCheckUtils]: 48: Hoare triple {5097#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5097#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:47,274 INFO L273 TraceCheckUtils]: 49: Hoare triple {5097#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5097#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:47,275 INFO L273 TraceCheckUtils]: 50: Hoare triple {5097#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5098#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:47,275 INFO L273 TraceCheckUtils]: 51: Hoare triple {5098#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5082#false} is VALID [2018-11-23 11:58:47,275 INFO L273 TraceCheckUtils]: 52: Hoare triple {5082#false} havoc ~x~0;~x~0 := 0; {5082#false} is VALID [2018-11-23 11:58:47,276 INFO L273 TraceCheckUtils]: 53: Hoare triple {5082#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {5082#false} is VALID [2018-11-23 11:58:47,276 INFO L256 TraceCheckUtils]: 54: Hoare triple {5082#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {5082#false} is VALID [2018-11-23 11:58:47,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {5082#false} ~cond := #in~cond; {5082#false} is VALID [2018-11-23 11:58:47,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {5082#false} assume 0 == ~cond; {5082#false} is VALID [2018-11-23 11:58:47,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {5082#false} assume !false; {5082#false} is VALID [2018-11-23 11:58:47,280 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:58:47,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:47,280 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:58:47,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:47,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 11:58:47,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:47,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:47,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {5081#true} call ULTIMATE.init(); {5081#true} is VALID [2018-11-23 11:58:47,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {5081#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5081#true} is VALID [2018-11-23 11:58:47,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {5081#true} assume true; {5081#true} is VALID [2018-11-23 11:58:47,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5081#true} {5081#true} #54#return; {5081#true} is VALID [2018-11-23 11:58:47,567 INFO L256 TraceCheckUtils]: 4: Hoare triple {5081#true} call #t~ret6 := main(); {5081#true} is VALID [2018-11-23 11:58:47,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {5081#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5083#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {5083#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5083#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {5083#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5083#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {5083#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5084#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {5084#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5084#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {5084#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5084#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {5084#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5085#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {5085#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5085#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {5085#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5085#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {5085#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5086#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:47,579 INFO L273 TraceCheckUtils]: 15: Hoare triple {5086#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5086#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:47,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {5086#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5086#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:47,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {5086#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5087#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:47,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {5087#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5087#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:47,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {5087#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5087#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:47,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {5087#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5088#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:47,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {5088#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5088#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:47,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {5088#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5088#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:47,588 INFO L273 TraceCheckUtils]: 23: Hoare triple {5088#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5089#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:47,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {5089#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5089#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:47,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {5089#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5089#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:47,590 INFO L273 TraceCheckUtils]: 26: Hoare triple {5089#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5090#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:47,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {5090#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5090#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:47,592 INFO L273 TraceCheckUtils]: 28: Hoare triple {5090#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5090#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:47,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {5090#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5091#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:47,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {5091#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5091#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:47,596 INFO L273 TraceCheckUtils]: 31: Hoare triple {5091#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5091#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:47,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {5091#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5092#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:47,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {5092#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5092#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:47,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {5092#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5092#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:47,600 INFO L273 TraceCheckUtils]: 35: Hoare triple {5092#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5093#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:47,600 INFO L273 TraceCheckUtils]: 36: Hoare triple {5093#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5093#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:47,602 INFO L273 TraceCheckUtils]: 37: Hoare triple {5093#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5093#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:47,602 INFO L273 TraceCheckUtils]: 38: Hoare triple {5093#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5094#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:47,604 INFO L273 TraceCheckUtils]: 39: Hoare triple {5094#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5094#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:47,604 INFO L273 TraceCheckUtils]: 40: Hoare triple {5094#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5094#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:47,606 INFO L273 TraceCheckUtils]: 41: Hoare triple {5094#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5095#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:47,606 INFO L273 TraceCheckUtils]: 42: Hoare triple {5095#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5095#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:47,609 INFO L273 TraceCheckUtils]: 43: Hoare triple {5095#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5095#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:47,609 INFO L273 TraceCheckUtils]: 44: Hoare triple {5095#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5096#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:47,611 INFO L273 TraceCheckUtils]: 45: Hoare triple {5096#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5096#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:47,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {5096#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5096#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:47,613 INFO L273 TraceCheckUtils]: 47: Hoare triple {5096#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5097#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:47,613 INFO L273 TraceCheckUtils]: 48: Hoare triple {5097#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5097#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:47,615 INFO L273 TraceCheckUtils]: 49: Hoare triple {5097#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5097#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:47,615 INFO L273 TraceCheckUtils]: 50: Hoare triple {5097#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5098#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:47,617 INFO L273 TraceCheckUtils]: 51: Hoare triple {5098#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5082#false} is VALID [2018-11-23 11:58:47,617 INFO L273 TraceCheckUtils]: 52: Hoare triple {5082#false} havoc ~x~0;~x~0 := 0; {5082#false} is VALID [2018-11-23 11:58:47,617 INFO L273 TraceCheckUtils]: 53: Hoare triple {5082#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {5082#false} is VALID [2018-11-23 11:58:47,617 INFO L256 TraceCheckUtils]: 54: Hoare triple {5082#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {5082#false} is VALID [2018-11-23 11:58:47,617 INFO L273 TraceCheckUtils]: 55: Hoare triple {5082#false} ~cond := #in~cond; {5082#false} is VALID [2018-11-23 11:58:47,617 INFO L273 TraceCheckUtils]: 56: Hoare triple {5082#false} assume 0 == ~cond; {5082#false} is VALID [2018-11-23 11:58:47,617 INFO L273 TraceCheckUtils]: 57: Hoare triple {5082#false} assume !false; {5082#false} is VALID [2018-11-23 11:58:47,620 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:58:47,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:47,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-23 11:58:47,639 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-11-23 11:58:47,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:47,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:58:47,705 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:58:47,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:58:47,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:58:47,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:58:47,706 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand 18 states. [2018-11-23 11:58:48,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:48,775 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2018-11-23 11:58:48,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:58:48,775 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-11-23 11:58:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:58:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2018-11-23 11:58:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:58:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2018-11-23 11:58:48,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 98 transitions. [2018-11-23 11:58:49,658 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:58:49,660 INFO L225 Difference]: With dead ends: 79 [2018-11-23 11:58:49,661 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 11:58:49,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:58:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 11:58:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-23 11:58:49,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:49,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2018-11-23 11:58:49,695 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2018-11-23 11:58:49,695 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2018-11-23 11:58:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:49,696 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-11-23 11:58:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 11:58:49,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:49,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:49,697 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2018-11-23 11:58:49,697 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2018-11-23 11:58:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:49,699 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-11-23 11:58:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 11:58:49,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:49,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:49,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:49,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:58:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-11-23 11:58:49,702 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 58 [2018-11-23 11:58:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:49,702 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2018-11-23 11:58:49,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:58:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2018-11-23 11:58:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:58:49,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:49,703 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:58:49,703 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:49,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:49,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1683204471, now seen corresponding path program 16 times [2018-11-23 11:58:49,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:49,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:49,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:49,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:49,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:50,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {5604#true} call ULTIMATE.init(); {5604#true} is VALID [2018-11-23 11:58:50,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {5604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5604#true} is VALID [2018-11-23 11:58:50,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {5604#true} assume true; {5604#true} is VALID [2018-11-23 11:58:50,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5604#true} {5604#true} #54#return; {5604#true} is VALID [2018-11-23 11:58:50,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {5604#true} call #t~ret6 := main(); {5604#true} is VALID [2018-11-23 11:58:50,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {5604#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5606#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {5606#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5606#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {5606#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5606#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {5606#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5607#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {5607#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5607#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {5607#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5607#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {5607#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5608#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {5608#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5608#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {5608#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5608#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {5608#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5609#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {5609#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5609#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {5609#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5609#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {5609#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5610#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {5610#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5610#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {5610#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5610#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {5610#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5611#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {5611#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5611#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {5611#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5611#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {5611#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5612#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {5612#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5612#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {5612#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5612#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {5612#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5613#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {5613#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5613#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {5613#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5613#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,287 INFO L273 TraceCheckUtils]: 29: Hoare triple {5613#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5614#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,288 INFO L273 TraceCheckUtils]: 30: Hoare triple {5614#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5614#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,288 INFO L273 TraceCheckUtils]: 31: Hoare triple {5614#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5614#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,289 INFO L273 TraceCheckUtils]: 32: Hoare triple {5614#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5615#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {5615#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5615#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,290 INFO L273 TraceCheckUtils]: 34: Hoare triple {5615#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5615#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,291 INFO L273 TraceCheckUtils]: 35: Hoare triple {5615#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5616#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,291 INFO L273 TraceCheckUtils]: 36: Hoare triple {5616#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5616#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,292 INFO L273 TraceCheckUtils]: 37: Hoare triple {5616#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5616#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,293 INFO L273 TraceCheckUtils]: 38: Hoare triple {5616#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5617#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,293 INFO L273 TraceCheckUtils]: 39: Hoare triple {5617#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5617#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,294 INFO L273 TraceCheckUtils]: 40: Hoare triple {5617#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5617#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,294 INFO L273 TraceCheckUtils]: 41: Hoare triple {5617#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5618#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,295 INFO L273 TraceCheckUtils]: 42: Hoare triple {5618#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5618#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,295 INFO L273 TraceCheckUtils]: 43: Hoare triple {5618#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5618#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,296 INFO L273 TraceCheckUtils]: 44: Hoare triple {5618#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5619#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,297 INFO L273 TraceCheckUtils]: 45: Hoare triple {5619#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5619#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,297 INFO L273 TraceCheckUtils]: 46: Hoare triple {5619#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5619#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,298 INFO L273 TraceCheckUtils]: 47: Hoare triple {5619#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5620#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,298 INFO L273 TraceCheckUtils]: 48: Hoare triple {5620#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5620#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,299 INFO L273 TraceCheckUtils]: 49: Hoare triple {5620#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5620#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,300 INFO L273 TraceCheckUtils]: 50: Hoare triple {5620#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5621#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {5621#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5621#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,301 INFO L273 TraceCheckUtils]: 52: Hoare triple {5621#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5621#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,301 INFO L273 TraceCheckUtils]: 53: Hoare triple {5621#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5622#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:50,302 INFO L273 TraceCheckUtils]: 54: Hoare triple {5622#(<= main_~i~0 17)} assume !(~i~0 < 100000); {5605#false} is VALID [2018-11-23 11:58:50,302 INFO L273 TraceCheckUtils]: 55: Hoare triple {5605#false} havoc ~x~0;~x~0 := 0; {5605#false} is VALID [2018-11-23 11:58:50,303 INFO L273 TraceCheckUtils]: 56: Hoare triple {5605#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {5605#false} is VALID [2018-11-23 11:58:50,303 INFO L256 TraceCheckUtils]: 57: Hoare triple {5605#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {5605#false} is VALID [2018-11-23 11:58:50,303 INFO L273 TraceCheckUtils]: 58: Hoare triple {5605#false} ~cond := #in~cond; {5605#false} is VALID [2018-11-23 11:58:50,303 INFO L273 TraceCheckUtils]: 59: Hoare triple {5605#false} assume 0 == ~cond; {5605#false} is VALID [2018-11-23 11:58:50,303 INFO L273 TraceCheckUtils]: 60: Hoare triple {5605#false} assume !false; {5605#false} is VALID [2018-11-23 11:58:50,308 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:58:50,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:50,308 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:58:50,318 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:50,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:50,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:50,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:50,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {5604#true} call ULTIMATE.init(); {5604#true} is VALID [2018-11-23 11:58:50,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {5604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5604#true} is VALID [2018-11-23 11:58:50,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {5604#true} assume true; {5604#true} is VALID [2018-11-23 11:58:50,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5604#true} {5604#true} #54#return; {5604#true} is VALID [2018-11-23 11:58:50,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {5604#true} call #t~ret6 := main(); {5604#true} is VALID [2018-11-23 11:58:50,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {5604#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5606#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {5606#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5606#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {5606#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5606#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {5606#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5607#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {5607#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5607#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {5607#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5607#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {5607#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5608#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {5608#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5608#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {5608#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5608#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {5608#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5609#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {5609#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5609#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {5609#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5609#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {5609#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5610#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {5610#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5610#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {5610#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5610#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {5610#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5611#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,517 INFO L273 TraceCheckUtils]: 21: Hoare triple {5611#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5611#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {5611#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5611#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {5611#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5612#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {5612#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5612#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,519 INFO L273 TraceCheckUtils]: 25: Hoare triple {5612#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5612#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,520 INFO L273 TraceCheckUtils]: 26: Hoare triple {5612#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5613#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {5613#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5613#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {5613#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5613#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {5613#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5614#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {5614#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5614#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,522 INFO L273 TraceCheckUtils]: 31: Hoare triple {5614#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5614#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,523 INFO L273 TraceCheckUtils]: 32: Hoare triple {5614#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5615#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,524 INFO L273 TraceCheckUtils]: 33: Hoare triple {5615#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5615#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {5615#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5615#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,525 INFO L273 TraceCheckUtils]: 35: Hoare triple {5615#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5616#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,525 INFO L273 TraceCheckUtils]: 36: Hoare triple {5616#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5616#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,526 INFO L273 TraceCheckUtils]: 37: Hoare triple {5616#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5616#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {5616#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5617#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,527 INFO L273 TraceCheckUtils]: 39: Hoare triple {5617#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5617#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,527 INFO L273 TraceCheckUtils]: 40: Hoare triple {5617#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5617#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,528 INFO L273 TraceCheckUtils]: 41: Hoare triple {5617#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5618#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,529 INFO L273 TraceCheckUtils]: 42: Hoare triple {5618#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5618#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,529 INFO L273 TraceCheckUtils]: 43: Hoare triple {5618#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5618#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {5618#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5619#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,530 INFO L273 TraceCheckUtils]: 45: Hoare triple {5619#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5619#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,531 INFO L273 TraceCheckUtils]: 46: Hoare triple {5619#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5619#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,531 INFO L273 TraceCheckUtils]: 47: Hoare triple {5619#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5620#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {5620#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5620#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,532 INFO L273 TraceCheckUtils]: 49: Hoare triple {5620#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5620#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,533 INFO L273 TraceCheckUtils]: 50: Hoare triple {5620#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5621#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {5621#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5621#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,534 INFO L273 TraceCheckUtils]: 52: Hoare triple {5621#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {5621#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,535 INFO L273 TraceCheckUtils]: 53: Hoare triple {5621#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5622#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:50,535 INFO L273 TraceCheckUtils]: 54: Hoare triple {5622#(<= main_~i~0 17)} assume !(~i~0 < 100000); {5605#false} is VALID [2018-11-23 11:58:50,536 INFO L273 TraceCheckUtils]: 55: Hoare triple {5605#false} havoc ~x~0;~x~0 := 0; {5605#false} is VALID [2018-11-23 11:58:50,536 INFO L273 TraceCheckUtils]: 56: Hoare triple {5605#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {5605#false} is VALID [2018-11-23 11:58:50,536 INFO L256 TraceCheckUtils]: 57: Hoare triple {5605#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {5605#false} is VALID [2018-11-23 11:58:50,536 INFO L273 TraceCheckUtils]: 58: Hoare triple {5605#false} ~cond := #in~cond; {5605#false} is VALID [2018-11-23 11:58:50,536 INFO L273 TraceCheckUtils]: 59: Hoare triple {5605#false} assume 0 == ~cond; {5605#false} is VALID [2018-11-23 11:58:50,537 INFO L273 TraceCheckUtils]: 60: Hoare triple {5605#false} assume !false; {5605#false} is VALID [2018-11-23 11:58:50,540 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:58:50,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:50,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-23 11:58:50,559 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-11-23 11:58:50,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:50,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:58:50,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:50,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:58:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:58:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:58:50,622 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 19 states. [2018-11-23 11:58:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:51,066 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-23 11:58:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:58:51,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-11-23 11:58:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:58:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2018-11-23 11:58:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:58:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2018-11-23 11:58:51,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 102 transitions. [2018-11-23 11:58:51,630 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:58:51,631 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:58:51,631 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 11:58:51,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:58:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 11:58:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-11-23 11:58:51,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:51,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 69 states. [2018-11-23 11:58:51,651 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 69 states. [2018-11-23 11:58:51,651 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 69 states. [2018-11-23 11:58:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:51,654 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-23 11:58:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 11:58:51,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:51,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:51,655 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 71 states. [2018-11-23 11:58:51,655 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 71 states. [2018-11-23 11:58:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:51,658 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-23 11:58:51,658 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 11:58:51,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:51,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:51,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:51,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 11:58:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2018-11-23 11:58:51,662 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 61 [2018-11-23 11:58:51,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:51,662 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2018-11-23 11:58:51,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:58:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2018-11-23 11:58:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 11:58:51,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:51,663 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:58:51,664 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:51,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:51,664 INFO L82 PathProgramCache]: Analyzing trace with hash -353420412, now seen corresponding path program 17 times [2018-11-23 11:58:51,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:51,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:51,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:51,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:51,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:52,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {6151#true} call ULTIMATE.init(); {6151#true} is VALID [2018-11-23 11:58:52,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {6151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6151#true} is VALID [2018-11-23 11:58:52,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {6151#true} assume true; {6151#true} is VALID [2018-11-23 11:58:52,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6151#true} {6151#true} #54#return; {6151#true} is VALID [2018-11-23 11:58:52,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {6151#true} call #t~ret6 := main(); {6151#true} is VALID [2018-11-23 11:58:52,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {6151#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6153#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {6153#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6153#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {6153#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6153#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {6153#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6154#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {6154#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6154#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {6154#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6154#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,493 INFO L273 TraceCheckUtils]: 11: Hoare triple {6154#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6155#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,493 INFO L273 TraceCheckUtils]: 12: Hoare triple {6155#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6155#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {6155#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6155#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {6155#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6156#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {6156#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6156#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {6156#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6156#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {6156#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6157#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {6157#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6157#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {6157#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6157#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {6157#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6158#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {6158#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6158#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,499 INFO L273 TraceCheckUtils]: 22: Hoare triple {6158#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6158#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {6158#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6159#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,500 INFO L273 TraceCheckUtils]: 24: Hoare triple {6159#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6159#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,501 INFO L273 TraceCheckUtils]: 25: Hoare triple {6159#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6159#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {6159#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6160#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,502 INFO L273 TraceCheckUtils]: 27: Hoare triple {6160#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6160#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,502 INFO L273 TraceCheckUtils]: 28: Hoare triple {6160#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6160#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {6160#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6161#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {6161#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6161#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,504 INFO L273 TraceCheckUtils]: 31: Hoare triple {6161#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6161#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,505 INFO L273 TraceCheckUtils]: 32: Hoare triple {6161#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6162#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,505 INFO L273 TraceCheckUtils]: 33: Hoare triple {6162#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6162#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,506 INFO L273 TraceCheckUtils]: 34: Hoare triple {6162#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6162#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,507 INFO L273 TraceCheckUtils]: 35: Hoare triple {6162#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6163#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:52,507 INFO L273 TraceCheckUtils]: 36: Hoare triple {6163#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6163#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:52,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {6163#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6163#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:52,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {6163#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6164#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:52,509 INFO L273 TraceCheckUtils]: 39: Hoare triple {6164#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6164#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:52,509 INFO L273 TraceCheckUtils]: 40: Hoare triple {6164#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6164#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:52,510 INFO L273 TraceCheckUtils]: 41: Hoare triple {6164#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6165#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:52,510 INFO L273 TraceCheckUtils]: 42: Hoare triple {6165#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6165#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:52,511 INFO L273 TraceCheckUtils]: 43: Hoare triple {6165#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6165#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:52,512 INFO L273 TraceCheckUtils]: 44: Hoare triple {6165#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6166#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:52,512 INFO L273 TraceCheckUtils]: 45: Hoare triple {6166#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6166#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:52,513 INFO L273 TraceCheckUtils]: 46: Hoare triple {6166#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6166#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:52,513 INFO L273 TraceCheckUtils]: 47: Hoare triple {6166#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6167#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:52,514 INFO L273 TraceCheckUtils]: 48: Hoare triple {6167#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6167#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:52,514 INFO L273 TraceCheckUtils]: 49: Hoare triple {6167#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6167#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:52,516 INFO L273 TraceCheckUtils]: 50: Hoare triple {6167#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6168#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:52,520 INFO L273 TraceCheckUtils]: 51: Hoare triple {6168#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6168#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:52,520 INFO L273 TraceCheckUtils]: 52: Hoare triple {6168#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6168#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:52,521 INFO L273 TraceCheckUtils]: 53: Hoare triple {6168#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6169#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:52,521 INFO L273 TraceCheckUtils]: 54: Hoare triple {6169#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6169#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:52,523 INFO L273 TraceCheckUtils]: 55: Hoare triple {6169#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6169#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:52,525 INFO L273 TraceCheckUtils]: 56: Hoare triple {6169#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6170#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:52,525 INFO L273 TraceCheckUtils]: 57: Hoare triple {6170#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6152#false} is VALID [2018-11-23 11:58:52,525 INFO L273 TraceCheckUtils]: 58: Hoare triple {6152#false} havoc ~x~0;~x~0 := 0; {6152#false} is VALID [2018-11-23 11:58:52,526 INFO L273 TraceCheckUtils]: 59: Hoare triple {6152#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {6152#false} is VALID [2018-11-23 11:58:52,526 INFO L256 TraceCheckUtils]: 60: Hoare triple {6152#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {6152#false} is VALID [2018-11-23 11:58:52,526 INFO L273 TraceCheckUtils]: 61: Hoare triple {6152#false} ~cond := #in~cond; {6152#false} is VALID [2018-11-23 11:58:52,526 INFO L273 TraceCheckUtils]: 62: Hoare triple {6152#false} assume 0 == ~cond; {6152#false} is VALID [2018-11-23 11:58:52,526 INFO L273 TraceCheckUtils]: 63: Hoare triple {6152#false} assume !false; {6152#false} is VALID [2018-11-23 11:58:52,529 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:58:52,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:52,529 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:58:52,538 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:58:52,575 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 11:58:52,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:52,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:52,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {6151#true} call ULTIMATE.init(); {6151#true} is VALID [2018-11-23 11:58:52,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {6151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6151#true} is VALID [2018-11-23 11:58:52,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {6151#true} assume true; {6151#true} is VALID [2018-11-23 11:58:52,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6151#true} {6151#true} #54#return; {6151#true} is VALID [2018-11-23 11:58:52,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {6151#true} call #t~ret6 := main(); {6151#true} is VALID [2018-11-23 11:58:52,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {6151#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6153#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {6153#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6153#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,985 INFO L273 TraceCheckUtils]: 7: Hoare triple {6153#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6153#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {6153#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6154#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {6154#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6154#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {6154#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6154#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {6154#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6155#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {6155#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6155#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {6155#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6155#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {6155#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6156#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {6156#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6156#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {6156#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6156#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {6156#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6157#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {6157#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6157#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {6157#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6157#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:53,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {6157#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6158#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:53,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {6158#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6158#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:53,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {6158#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6158#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:53,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {6158#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6159#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:53,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {6159#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6159#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:53,016 INFO L273 TraceCheckUtils]: 25: Hoare triple {6159#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6159#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:53,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {6159#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6160#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:53,017 INFO L273 TraceCheckUtils]: 27: Hoare triple {6160#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6160#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:53,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {6160#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6160#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:53,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {6160#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6161#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:53,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {6161#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6161#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:53,019 INFO L273 TraceCheckUtils]: 31: Hoare triple {6161#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6161#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:53,020 INFO L273 TraceCheckUtils]: 32: Hoare triple {6161#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6162#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:53,020 INFO L273 TraceCheckUtils]: 33: Hoare triple {6162#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6162#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:53,021 INFO L273 TraceCheckUtils]: 34: Hoare triple {6162#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6162#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:53,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {6162#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6163#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:53,022 INFO L273 TraceCheckUtils]: 36: Hoare triple {6163#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6163#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:53,022 INFO L273 TraceCheckUtils]: 37: Hoare triple {6163#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6163#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:53,023 INFO L273 TraceCheckUtils]: 38: Hoare triple {6163#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6164#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:53,023 INFO L273 TraceCheckUtils]: 39: Hoare triple {6164#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6164#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:53,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {6164#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6164#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:53,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {6164#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6165#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:53,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {6165#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6165#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:53,026 INFO L273 TraceCheckUtils]: 43: Hoare triple {6165#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6165#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:53,026 INFO L273 TraceCheckUtils]: 44: Hoare triple {6165#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6166#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:53,027 INFO L273 TraceCheckUtils]: 45: Hoare triple {6166#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6166#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:53,027 INFO L273 TraceCheckUtils]: 46: Hoare triple {6166#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6166#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:53,028 INFO L273 TraceCheckUtils]: 47: Hoare triple {6166#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6167#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:53,029 INFO L273 TraceCheckUtils]: 48: Hoare triple {6167#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6167#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:53,029 INFO L273 TraceCheckUtils]: 49: Hoare triple {6167#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6167#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:53,030 INFO L273 TraceCheckUtils]: 50: Hoare triple {6167#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6168#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:53,030 INFO L273 TraceCheckUtils]: 51: Hoare triple {6168#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6168#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:53,031 INFO L273 TraceCheckUtils]: 52: Hoare triple {6168#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6168#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:53,031 INFO L273 TraceCheckUtils]: 53: Hoare triple {6168#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6169#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:53,032 INFO L273 TraceCheckUtils]: 54: Hoare triple {6169#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6169#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:53,032 INFO L273 TraceCheckUtils]: 55: Hoare triple {6169#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6169#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:53,033 INFO L273 TraceCheckUtils]: 56: Hoare triple {6169#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6170#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:53,034 INFO L273 TraceCheckUtils]: 57: Hoare triple {6170#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6152#false} is VALID [2018-11-23 11:58:53,034 INFO L273 TraceCheckUtils]: 58: Hoare triple {6152#false} havoc ~x~0;~x~0 := 0; {6152#false} is VALID [2018-11-23 11:58:53,034 INFO L273 TraceCheckUtils]: 59: Hoare triple {6152#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {6152#false} is VALID [2018-11-23 11:58:53,034 INFO L256 TraceCheckUtils]: 60: Hoare triple {6152#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {6152#false} is VALID [2018-11-23 11:58:53,035 INFO L273 TraceCheckUtils]: 61: Hoare triple {6152#false} ~cond := #in~cond; {6152#false} is VALID [2018-11-23 11:58:53,035 INFO L273 TraceCheckUtils]: 62: Hoare triple {6152#false} assume 0 == ~cond; {6152#false} is VALID [2018-11-23 11:58:53,035 INFO L273 TraceCheckUtils]: 63: Hoare triple {6152#false} assume !false; {6152#false} is VALID [2018-11-23 11:58:53,039 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:58:53,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:53,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-23 11:58:53,059 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-11-23 11:58:53,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:53,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:58:53,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:53,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:58:53,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:58:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:53,144 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand 20 states. [2018-11-23 11:58:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,513 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2018-11-23 11:58:53,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:58:53,513 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-11-23 11:58:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 106 transitions. [2018-11-23 11:58:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 106 transitions. [2018-11-23 11:58:53,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 106 transitions. [2018-11-23 11:58:53,616 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:58:53,617 INFO L225 Difference]: With dead ends: 85 [2018-11-23 11:58:53,617 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:58:53,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:58:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-23 11:58:53,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:53,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-23 11:58:53,639 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-23 11:58:53,639 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-23 11:58:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,641 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 11:58:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 11:58:53,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:53,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:53,642 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-23 11:58:53,642 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-23 11:58:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,643 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 11:58:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 11:58:53,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:53,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:53,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:53,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:58:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2018-11-23 11:58:53,645 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 64 [2018-11-23 11:58:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:53,646 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-11-23 11:58:53,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:58:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-11-23 11:58:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:58:53,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:53,647 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:58:53,647 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:53,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:53,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1557680727, now seen corresponding path program 18 times [2018-11-23 11:58:53,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:53,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:53,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:54,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {6722#true} call ULTIMATE.init(); {6722#true} is VALID [2018-11-23 11:58:54,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {6722#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6722#true} is VALID [2018-11-23 11:58:54,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {6722#true} assume true; {6722#true} is VALID [2018-11-23 11:58:54,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6722#true} {6722#true} #54#return; {6722#true} is VALID [2018-11-23 11:58:54,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {6722#true} call #t~ret6 := main(); {6722#true} is VALID [2018-11-23 11:58:54,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {6722#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6724#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:54,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {6724#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6724#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:54,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {6724#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6724#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:54,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {6724#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6725#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {6725#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6725#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {6725#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6725#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {6725#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6726#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {6726#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6726#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {6726#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6726#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {6726#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6727#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {6727#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6727#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {6727#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6727#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {6727#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6728#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {6728#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6728#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {6728#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6728#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {6728#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6729#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,482 INFO L273 TraceCheckUtils]: 21: Hoare triple {6729#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6729#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,483 INFO L273 TraceCheckUtils]: 22: Hoare triple {6729#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6729#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,483 INFO L273 TraceCheckUtils]: 23: Hoare triple {6729#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6730#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {6730#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6730#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,484 INFO L273 TraceCheckUtils]: 25: Hoare triple {6730#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6730#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {6730#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6731#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,486 INFO L273 TraceCheckUtils]: 27: Hoare triple {6731#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6731#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {6731#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6731#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,487 INFO L273 TraceCheckUtils]: 29: Hoare triple {6731#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6732#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {6732#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6732#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,488 INFO L273 TraceCheckUtils]: 31: Hoare triple {6732#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6732#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,489 INFO L273 TraceCheckUtils]: 32: Hoare triple {6732#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6733#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,489 INFO L273 TraceCheckUtils]: 33: Hoare triple {6733#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6733#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,490 INFO L273 TraceCheckUtils]: 34: Hoare triple {6733#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6733#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,490 INFO L273 TraceCheckUtils]: 35: Hoare triple {6733#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6734#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {6734#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6734#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {6734#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6734#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {6734#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6735#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,493 INFO L273 TraceCheckUtils]: 39: Hoare triple {6735#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6735#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,493 INFO L273 TraceCheckUtils]: 40: Hoare triple {6735#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6735#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {6735#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6736#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:54,495 INFO L273 TraceCheckUtils]: 42: Hoare triple {6736#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6736#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:54,495 INFO L273 TraceCheckUtils]: 43: Hoare triple {6736#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6736#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:54,496 INFO L273 TraceCheckUtils]: 44: Hoare triple {6736#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6737#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:54,496 INFO L273 TraceCheckUtils]: 45: Hoare triple {6737#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6737#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:54,497 INFO L273 TraceCheckUtils]: 46: Hoare triple {6737#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6737#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:54,498 INFO L273 TraceCheckUtils]: 47: Hoare triple {6737#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6738#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:54,498 INFO L273 TraceCheckUtils]: 48: Hoare triple {6738#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6738#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:54,499 INFO L273 TraceCheckUtils]: 49: Hoare triple {6738#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6738#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:54,499 INFO L273 TraceCheckUtils]: 50: Hoare triple {6738#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6739#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:54,500 INFO L273 TraceCheckUtils]: 51: Hoare triple {6739#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6739#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:54,500 INFO L273 TraceCheckUtils]: 52: Hoare triple {6739#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6739#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:54,501 INFO L273 TraceCheckUtils]: 53: Hoare triple {6739#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6740#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:54,502 INFO L273 TraceCheckUtils]: 54: Hoare triple {6740#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6740#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:54,502 INFO L273 TraceCheckUtils]: 55: Hoare triple {6740#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6740#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:54,503 INFO L273 TraceCheckUtils]: 56: Hoare triple {6740#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6741#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:54,503 INFO L273 TraceCheckUtils]: 57: Hoare triple {6741#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6741#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:54,504 INFO L273 TraceCheckUtils]: 58: Hoare triple {6741#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6741#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:54,505 INFO L273 TraceCheckUtils]: 59: Hoare triple {6741#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6742#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:54,505 INFO L273 TraceCheckUtils]: 60: Hoare triple {6742#(<= main_~i~0 19)} assume !(~i~0 < 100000); {6723#false} is VALID [2018-11-23 11:58:54,505 INFO L273 TraceCheckUtils]: 61: Hoare triple {6723#false} havoc ~x~0;~x~0 := 0; {6723#false} is VALID [2018-11-23 11:58:54,506 INFO L273 TraceCheckUtils]: 62: Hoare triple {6723#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {6723#false} is VALID [2018-11-23 11:58:54,506 INFO L256 TraceCheckUtils]: 63: Hoare triple {6723#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {6723#false} is VALID [2018-11-23 11:58:54,506 INFO L273 TraceCheckUtils]: 64: Hoare triple {6723#false} ~cond := #in~cond; {6723#false} is VALID [2018-11-23 11:58:54,506 INFO L273 TraceCheckUtils]: 65: Hoare triple {6723#false} assume 0 == ~cond; {6723#false} is VALID [2018-11-23 11:58:54,506 INFO L273 TraceCheckUtils]: 66: Hoare triple {6723#false} assume !false; {6723#false} is VALID [2018-11-23 11:58:54,511 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:58:54,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:54,511 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:58:54,519 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:58:54,559 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 11:58:54,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:54,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:54,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {6722#true} call ULTIMATE.init(); {6722#true} is VALID [2018-11-23 11:58:54,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {6722#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6722#true} is VALID [2018-11-23 11:58:54,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {6722#true} assume true; {6722#true} is VALID [2018-11-23 11:58:54,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6722#true} {6722#true} #54#return; {6722#true} is VALID [2018-11-23 11:58:54,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {6722#true} call #t~ret6 := main(); {6722#true} is VALID [2018-11-23 11:58:54,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {6722#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6724#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:54,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {6724#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6724#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:54,735 INFO L273 TraceCheckUtils]: 7: Hoare triple {6724#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6724#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:54,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {6724#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6725#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {6725#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6725#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {6725#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6725#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {6725#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6726#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {6726#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6726#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {6726#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6726#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {6726#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6727#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {6727#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6727#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {6727#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6727#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,740 INFO L273 TraceCheckUtils]: 17: Hoare triple {6727#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6728#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {6728#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6728#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {6728#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6728#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {6728#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6729#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {6729#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6729#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {6729#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6729#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,743 INFO L273 TraceCheckUtils]: 23: Hoare triple {6729#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6730#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,743 INFO L273 TraceCheckUtils]: 24: Hoare triple {6730#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6730#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,744 INFO L273 TraceCheckUtils]: 25: Hoare triple {6730#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6730#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,745 INFO L273 TraceCheckUtils]: 26: Hoare triple {6730#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6731#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,745 INFO L273 TraceCheckUtils]: 27: Hoare triple {6731#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6731#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,746 INFO L273 TraceCheckUtils]: 28: Hoare triple {6731#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6731#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {6731#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6732#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {6732#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6732#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,747 INFO L273 TraceCheckUtils]: 31: Hoare triple {6732#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6732#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {6732#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6733#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,748 INFO L273 TraceCheckUtils]: 33: Hoare triple {6733#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6733#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {6733#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6733#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,750 INFO L273 TraceCheckUtils]: 35: Hoare triple {6733#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6734#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,750 INFO L273 TraceCheckUtils]: 36: Hoare triple {6734#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6734#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,751 INFO L273 TraceCheckUtils]: 37: Hoare triple {6734#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6734#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {6734#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6735#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {6735#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6735#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,752 INFO L273 TraceCheckUtils]: 40: Hoare triple {6735#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6735#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {6735#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6736#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:54,753 INFO L273 TraceCheckUtils]: 42: Hoare triple {6736#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6736#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:54,754 INFO L273 TraceCheckUtils]: 43: Hoare triple {6736#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6736#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:54,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {6736#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6737#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:54,755 INFO L273 TraceCheckUtils]: 45: Hoare triple {6737#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6737#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:54,756 INFO L273 TraceCheckUtils]: 46: Hoare triple {6737#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6737#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:54,756 INFO L273 TraceCheckUtils]: 47: Hoare triple {6737#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6738#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:54,757 INFO L273 TraceCheckUtils]: 48: Hoare triple {6738#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6738#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:54,757 INFO L273 TraceCheckUtils]: 49: Hoare triple {6738#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6738#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:54,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {6738#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6739#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:54,758 INFO L273 TraceCheckUtils]: 51: Hoare triple {6739#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6739#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:54,759 INFO L273 TraceCheckUtils]: 52: Hoare triple {6739#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6739#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:54,760 INFO L273 TraceCheckUtils]: 53: Hoare triple {6739#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6740#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:54,760 INFO L273 TraceCheckUtils]: 54: Hoare triple {6740#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6740#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:54,761 INFO L273 TraceCheckUtils]: 55: Hoare triple {6740#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6740#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:54,761 INFO L273 TraceCheckUtils]: 56: Hoare triple {6740#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6741#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:54,762 INFO L273 TraceCheckUtils]: 57: Hoare triple {6741#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6741#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:54,762 INFO L273 TraceCheckUtils]: 58: Hoare triple {6741#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {6741#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:54,763 INFO L273 TraceCheckUtils]: 59: Hoare triple {6741#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6742#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:54,764 INFO L273 TraceCheckUtils]: 60: Hoare triple {6742#(<= main_~i~0 19)} assume !(~i~0 < 100000); {6723#false} is VALID [2018-11-23 11:58:54,764 INFO L273 TraceCheckUtils]: 61: Hoare triple {6723#false} havoc ~x~0;~x~0 := 0; {6723#false} is VALID [2018-11-23 11:58:54,764 INFO L273 TraceCheckUtils]: 62: Hoare triple {6723#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {6723#false} is VALID [2018-11-23 11:58:54,764 INFO L256 TraceCheckUtils]: 63: Hoare triple {6723#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {6723#false} is VALID [2018-11-23 11:58:54,764 INFO L273 TraceCheckUtils]: 64: Hoare triple {6723#false} ~cond := #in~cond; {6723#false} is VALID [2018-11-23 11:58:54,765 INFO L273 TraceCheckUtils]: 65: Hoare triple {6723#false} assume 0 == ~cond; {6723#false} is VALID [2018-11-23 11:58:54,765 INFO L273 TraceCheckUtils]: 66: Hoare triple {6723#false} assume !false; {6723#false} is VALID [2018-11-23 11:58:54,769 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:58:54,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:54,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-23 11:58:54,788 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-11-23 11:58:54,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:54,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:58:54,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:54,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:58:54,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:58:54,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:58:54,853 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 21 states. [2018-11-23 11:58:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,287 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-11-23 11:58:55,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:58:55,287 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-11-23 11:58:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:58:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2018-11-23 11:58:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:58:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2018-11-23 11:58:55,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 110 transitions. [2018-11-23 11:58:55,406 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:58:55,407 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:58:55,407 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 11:58:55,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:58:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 11:58:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 11:58:55,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:55,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 11:58:55,427 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 11:58:55,428 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 11:58:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,429 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2018-11-23 11:58:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-23 11:58:55,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,430 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 11:58:55,430 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 11:58:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,432 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2018-11-23 11:58:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-23 11:58:55,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:55,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 11:58:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2018-11-23 11:58:55,434 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 67 [2018-11-23 11:58:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:55,434 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-11-23 11:58:55,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:58:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-11-23 11:58:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 11:58:55,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:55,435 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:58:55,435 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:55,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1085236900, now seen corresponding path program 19 times [2018-11-23 11:58:55,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:55,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:55,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {7317#true} call ULTIMATE.init(); {7317#true} is VALID [2018-11-23 11:58:55,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {7317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7317#true} is VALID [2018-11-23 11:58:55,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {7317#true} assume true; {7317#true} is VALID [2018-11-23 11:58:55,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7317#true} {7317#true} #54#return; {7317#true} is VALID [2018-11-23 11:58:55,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {7317#true} call #t~ret6 := main(); {7317#true} is VALID [2018-11-23 11:58:55,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {7317#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7319#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:55,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {7319#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7319#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:55,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {7319#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7319#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:55,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {7319#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7320#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:55,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {7320#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7320#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:55,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {7320#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7320#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:55,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {7320#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7321#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:55,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {7321#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7321#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:55,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {7321#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7321#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:55,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {7321#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7322#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:55,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {7322#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7322#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:55,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {7322#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7322#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:55,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {7322#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7323#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:55,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {7323#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7323#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:55,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {7323#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7323#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:55,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {7323#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7324#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:55,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {7324#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7324#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:55,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {7324#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7324#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:55,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {7324#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7325#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:55,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {7325#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7325#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:55,895 INFO L273 TraceCheckUtils]: 25: Hoare triple {7325#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7325#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:55,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {7325#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7326#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:55,896 INFO L273 TraceCheckUtils]: 27: Hoare triple {7326#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7326#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:55,897 INFO L273 TraceCheckUtils]: 28: Hoare triple {7326#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7326#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:55,898 INFO L273 TraceCheckUtils]: 29: Hoare triple {7326#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7327#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:55,898 INFO L273 TraceCheckUtils]: 30: Hoare triple {7327#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7327#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:55,899 INFO L273 TraceCheckUtils]: 31: Hoare triple {7327#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7327#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:55,899 INFO L273 TraceCheckUtils]: 32: Hoare triple {7327#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7328#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:55,900 INFO L273 TraceCheckUtils]: 33: Hoare triple {7328#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7328#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:55,900 INFO L273 TraceCheckUtils]: 34: Hoare triple {7328#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7328#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:55,901 INFO L273 TraceCheckUtils]: 35: Hoare triple {7328#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7329#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:55,902 INFO L273 TraceCheckUtils]: 36: Hoare triple {7329#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7329#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:55,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {7329#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7329#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:55,903 INFO L273 TraceCheckUtils]: 38: Hoare triple {7329#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7330#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:55,903 INFO L273 TraceCheckUtils]: 39: Hoare triple {7330#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7330#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:55,904 INFO L273 TraceCheckUtils]: 40: Hoare triple {7330#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7330#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:55,905 INFO L273 TraceCheckUtils]: 41: Hoare triple {7330#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7331#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:55,905 INFO L273 TraceCheckUtils]: 42: Hoare triple {7331#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7331#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:55,906 INFO L273 TraceCheckUtils]: 43: Hoare triple {7331#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7331#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:55,906 INFO L273 TraceCheckUtils]: 44: Hoare triple {7331#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7332#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:55,907 INFO L273 TraceCheckUtils]: 45: Hoare triple {7332#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7332#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:55,907 INFO L273 TraceCheckUtils]: 46: Hoare triple {7332#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7332#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:55,908 INFO L273 TraceCheckUtils]: 47: Hoare triple {7332#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7333#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:55,909 INFO L273 TraceCheckUtils]: 48: Hoare triple {7333#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7333#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:55,909 INFO L273 TraceCheckUtils]: 49: Hoare triple {7333#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7333#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:55,910 INFO L273 TraceCheckUtils]: 50: Hoare triple {7333#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7334#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:55,910 INFO L273 TraceCheckUtils]: 51: Hoare triple {7334#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7334#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:55,911 INFO L273 TraceCheckUtils]: 52: Hoare triple {7334#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7334#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:55,912 INFO L273 TraceCheckUtils]: 53: Hoare triple {7334#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7335#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:55,912 INFO L273 TraceCheckUtils]: 54: Hoare triple {7335#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7335#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:55,913 INFO L273 TraceCheckUtils]: 55: Hoare triple {7335#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7335#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:55,913 INFO L273 TraceCheckUtils]: 56: Hoare triple {7335#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7336#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:55,914 INFO L273 TraceCheckUtils]: 57: Hoare triple {7336#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7336#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:55,914 INFO L273 TraceCheckUtils]: 58: Hoare triple {7336#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7336#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:55,915 INFO L273 TraceCheckUtils]: 59: Hoare triple {7336#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7337#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:55,916 INFO L273 TraceCheckUtils]: 60: Hoare triple {7337#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7337#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:55,916 INFO L273 TraceCheckUtils]: 61: Hoare triple {7337#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7337#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:55,917 INFO L273 TraceCheckUtils]: 62: Hoare triple {7337#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7338#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:55,918 INFO L273 TraceCheckUtils]: 63: Hoare triple {7338#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7318#false} is VALID [2018-11-23 11:58:55,918 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#false} havoc ~x~0;~x~0 := 0; {7318#false} is VALID [2018-11-23 11:58:55,918 INFO L273 TraceCheckUtils]: 65: Hoare triple {7318#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {7318#false} is VALID [2018-11-23 11:58:55,918 INFO L256 TraceCheckUtils]: 66: Hoare triple {7318#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {7318#false} is VALID [2018-11-23 11:58:55,918 INFO L273 TraceCheckUtils]: 67: Hoare triple {7318#false} ~cond := #in~cond; {7318#false} is VALID [2018-11-23 11:58:55,919 INFO L273 TraceCheckUtils]: 68: Hoare triple {7318#false} assume 0 == ~cond; {7318#false} is VALID [2018-11-23 11:58:55,919 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#false} assume !false; {7318#false} is VALID [2018-11-23 11:58:55,923 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:58:55,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:55,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 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:58:55,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:55,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:56,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {7317#true} call ULTIMATE.init(); {7317#true} is VALID [2018-11-23 11:58:56,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {7317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7317#true} is VALID [2018-11-23 11:58:56,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {7317#true} assume true; {7317#true} is VALID [2018-11-23 11:58:56,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7317#true} {7317#true} #54#return; {7317#true} is VALID [2018-11-23 11:58:56,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {7317#true} call #t~ret6 := main(); {7317#true} is VALID [2018-11-23 11:58:56,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {7317#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7319#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:56,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {7319#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7319#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:56,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {7319#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7319#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:56,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {7319#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7320#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {7320#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7320#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {7320#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7320#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {7320#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7321#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {7321#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7321#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {7321#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7321#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {7321#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7322#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {7322#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7322#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {7322#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7322#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {7322#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7323#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {7323#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7323#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {7323#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7323#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {7323#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7324#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {7324#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7324#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {7324#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7324#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {7324#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7325#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {7325#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7325#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {7325#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7325#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {7325#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7326#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {7326#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7326#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,286 INFO L273 TraceCheckUtils]: 28: Hoare triple {7326#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7326#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,287 INFO L273 TraceCheckUtils]: 29: Hoare triple {7326#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7327#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,287 INFO L273 TraceCheckUtils]: 30: Hoare triple {7327#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7327#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,288 INFO L273 TraceCheckUtils]: 31: Hoare triple {7327#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7327#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,288 INFO L273 TraceCheckUtils]: 32: Hoare triple {7327#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7328#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,289 INFO L273 TraceCheckUtils]: 33: Hoare triple {7328#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7328#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,289 INFO L273 TraceCheckUtils]: 34: Hoare triple {7328#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7328#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,290 INFO L273 TraceCheckUtils]: 35: Hoare triple {7328#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7329#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,291 INFO L273 TraceCheckUtils]: 36: Hoare triple {7329#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7329#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,291 INFO L273 TraceCheckUtils]: 37: Hoare triple {7329#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7329#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,292 INFO L273 TraceCheckUtils]: 38: Hoare triple {7329#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7330#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,292 INFO L273 TraceCheckUtils]: 39: Hoare triple {7330#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7330#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,293 INFO L273 TraceCheckUtils]: 40: Hoare triple {7330#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7330#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,293 INFO L273 TraceCheckUtils]: 41: Hoare triple {7330#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7331#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:56,294 INFO L273 TraceCheckUtils]: 42: Hoare triple {7331#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7331#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:56,294 INFO L273 TraceCheckUtils]: 43: Hoare triple {7331#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7331#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:56,295 INFO L273 TraceCheckUtils]: 44: Hoare triple {7331#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7332#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:56,296 INFO L273 TraceCheckUtils]: 45: Hoare triple {7332#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7332#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:56,296 INFO L273 TraceCheckUtils]: 46: Hoare triple {7332#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7332#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:56,297 INFO L273 TraceCheckUtils]: 47: Hoare triple {7332#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7333#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:56,297 INFO L273 TraceCheckUtils]: 48: Hoare triple {7333#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7333#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:56,298 INFO L273 TraceCheckUtils]: 49: Hoare triple {7333#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7333#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:56,298 INFO L273 TraceCheckUtils]: 50: Hoare triple {7333#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7334#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:56,299 INFO L273 TraceCheckUtils]: 51: Hoare triple {7334#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7334#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:56,299 INFO L273 TraceCheckUtils]: 52: Hoare triple {7334#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7334#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:56,300 INFO L273 TraceCheckUtils]: 53: Hoare triple {7334#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7335#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:56,301 INFO L273 TraceCheckUtils]: 54: Hoare triple {7335#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7335#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:56,301 INFO L273 TraceCheckUtils]: 55: Hoare triple {7335#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7335#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:56,302 INFO L273 TraceCheckUtils]: 56: Hoare triple {7335#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7336#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:56,302 INFO L273 TraceCheckUtils]: 57: Hoare triple {7336#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7336#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:56,303 INFO L273 TraceCheckUtils]: 58: Hoare triple {7336#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7336#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:56,303 INFO L273 TraceCheckUtils]: 59: Hoare triple {7336#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7337#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:56,304 INFO L273 TraceCheckUtils]: 60: Hoare triple {7337#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7337#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:56,304 INFO L273 TraceCheckUtils]: 61: Hoare triple {7337#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7337#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:56,305 INFO L273 TraceCheckUtils]: 62: Hoare triple {7337#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7338#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:56,306 INFO L273 TraceCheckUtils]: 63: Hoare triple {7338#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7318#false} is VALID [2018-11-23 11:58:56,306 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#false} havoc ~x~0;~x~0 := 0; {7318#false} is VALID [2018-11-23 11:58:56,306 INFO L273 TraceCheckUtils]: 65: Hoare triple {7318#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {7318#false} is VALID [2018-11-23 11:58:56,306 INFO L256 TraceCheckUtils]: 66: Hoare triple {7318#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {7318#false} is VALID [2018-11-23 11:58:56,306 INFO L273 TraceCheckUtils]: 67: Hoare triple {7318#false} ~cond := #in~cond; {7318#false} is VALID [2018-11-23 11:58:56,307 INFO L273 TraceCheckUtils]: 68: Hoare triple {7318#false} assume 0 == ~cond; {7318#false} is VALID [2018-11-23 11:58:56,307 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#false} assume !false; {7318#false} is VALID [2018-11-23 11:58:56,310 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:58:56,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:56,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-11-23 11:58:56,329 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-11-23 11:58:56,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:56,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:58:56,395 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:58:56,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:58:56,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:58:56,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:58:56,396 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 22 states. [2018-11-23 11:58:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,766 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2018-11-23 11:58:56,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:58:56,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-11-23 11:58:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:58:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 114 transitions. [2018-11-23 11:58:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:58:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 114 transitions. [2018-11-23 11:58:56,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 114 transitions. [2018-11-23 11:58:56,944 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:58:56,946 INFO L225 Difference]: With dead ends: 91 [2018-11-23 11:58:56,946 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 11:58:56,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:58:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 11:58:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-23 11:58:56,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:56,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 78 states. [2018-11-23 11:58:56,965 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 78 states. [2018-11-23 11:58:56,965 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 78 states. [2018-11-23 11:58:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,966 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-23 11:58:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-23 11:58:56,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:56,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:56,967 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 80 states. [2018-11-23 11:58:56,967 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 80 states. [2018-11-23 11:58:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,968 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-23 11:58:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-23 11:58:56,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:56,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:56,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:56,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 11:58:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2018-11-23 11:58:56,971 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 70 [2018-11-23 11:58:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:56,971 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2018-11-23 11:58:56,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:58:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2018-11-23 11:58:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 11:58:56,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:56,972 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:58:56,973 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:56,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1119015735, now seen corresponding path program 20 times [2018-11-23 11:58:56,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:56,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:56,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:56,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:56,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:58,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {7936#true} call ULTIMATE.init(); {7936#true} is VALID [2018-11-23 11:58:58,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {7936#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7936#true} is VALID [2018-11-23 11:58:58,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {7936#true} assume true; {7936#true} is VALID [2018-11-23 11:58:58,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7936#true} {7936#true} #54#return; {7936#true} is VALID [2018-11-23 11:58:58,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {7936#true} call #t~ret6 := main(); {7936#true} is VALID [2018-11-23 11:58:58,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {7936#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7938#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {7938#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7938#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,272 INFO L273 TraceCheckUtils]: 7: Hoare triple {7938#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7938#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {7938#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7939#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {7939#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7939#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {7939#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7939#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {7939#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7940#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {7940#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7940#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,286 INFO L273 TraceCheckUtils]: 13: Hoare triple {7940#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7940#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {7940#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7941#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {7941#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7941#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {7941#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7941#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,287 INFO L273 TraceCheckUtils]: 17: Hoare triple {7941#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7942#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {7942#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7942#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {7942#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7942#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {7942#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7943#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,289 INFO L273 TraceCheckUtils]: 21: Hoare triple {7943#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7943#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,289 INFO L273 TraceCheckUtils]: 22: Hoare triple {7943#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7943#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {7943#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7944#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {7944#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7944#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {7944#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7944#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {7944#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7945#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,292 INFO L273 TraceCheckUtils]: 27: Hoare triple {7945#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7945#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,293 INFO L273 TraceCheckUtils]: 28: Hoare triple {7945#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7945#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,294 INFO L273 TraceCheckUtils]: 29: Hoare triple {7945#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7946#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,294 INFO L273 TraceCheckUtils]: 30: Hoare triple {7946#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7946#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,295 INFO L273 TraceCheckUtils]: 31: Hoare triple {7946#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7946#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {7946#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7947#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,296 INFO L273 TraceCheckUtils]: 33: Hoare triple {7947#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7947#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,296 INFO L273 TraceCheckUtils]: 34: Hoare triple {7947#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7947#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {7947#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7948#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {7948#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7948#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {7948#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7948#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {7948#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7949#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {7949#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7949#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,300 INFO L273 TraceCheckUtils]: 40: Hoare triple {7949#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7949#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,300 INFO L273 TraceCheckUtils]: 41: Hoare triple {7949#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7950#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,301 INFO L273 TraceCheckUtils]: 42: Hoare triple {7950#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7950#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,301 INFO L273 TraceCheckUtils]: 43: Hoare triple {7950#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7950#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,302 INFO L273 TraceCheckUtils]: 44: Hoare triple {7950#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7951#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:58,303 INFO L273 TraceCheckUtils]: 45: Hoare triple {7951#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7951#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:58,303 INFO L273 TraceCheckUtils]: 46: Hoare triple {7951#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7951#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:58,304 INFO L273 TraceCheckUtils]: 47: Hoare triple {7951#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7952#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:58,304 INFO L273 TraceCheckUtils]: 48: Hoare triple {7952#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7952#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:58,305 INFO L273 TraceCheckUtils]: 49: Hoare triple {7952#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7952#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:58,305 INFO L273 TraceCheckUtils]: 50: Hoare triple {7952#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7953#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:58,306 INFO L273 TraceCheckUtils]: 51: Hoare triple {7953#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7953#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:58,306 INFO L273 TraceCheckUtils]: 52: Hoare triple {7953#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7953#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:58,307 INFO L273 TraceCheckUtils]: 53: Hoare triple {7953#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7954#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:58,308 INFO L273 TraceCheckUtils]: 54: Hoare triple {7954#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7954#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:58,308 INFO L273 TraceCheckUtils]: 55: Hoare triple {7954#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7954#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:58,309 INFO L273 TraceCheckUtils]: 56: Hoare triple {7954#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7955#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:58,309 INFO L273 TraceCheckUtils]: 57: Hoare triple {7955#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7955#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:58,310 INFO L273 TraceCheckUtils]: 58: Hoare triple {7955#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7955#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:58,311 INFO L273 TraceCheckUtils]: 59: Hoare triple {7955#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7956#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:58,311 INFO L273 TraceCheckUtils]: 60: Hoare triple {7956#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7956#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:58,312 INFO L273 TraceCheckUtils]: 61: Hoare triple {7956#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7956#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:58,312 INFO L273 TraceCheckUtils]: 62: Hoare triple {7956#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7957#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:58,313 INFO L273 TraceCheckUtils]: 63: Hoare triple {7957#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7957#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:58,313 INFO L273 TraceCheckUtils]: 64: Hoare triple {7957#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7957#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:58,314 INFO L273 TraceCheckUtils]: 65: Hoare triple {7957#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7958#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:58,315 INFO L273 TraceCheckUtils]: 66: Hoare triple {7958#(<= main_~i~0 21)} assume !(~i~0 < 100000); {7937#false} is VALID [2018-11-23 11:58:58,315 INFO L273 TraceCheckUtils]: 67: Hoare triple {7937#false} havoc ~x~0;~x~0 := 0; {7937#false} is VALID [2018-11-23 11:58:58,315 INFO L273 TraceCheckUtils]: 68: Hoare triple {7937#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {7937#false} is VALID [2018-11-23 11:58:58,315 INFO L256 TraceCheckUtils]: 69: Hoare triple {7937#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {7937#false} is VALID [2018-11-23 11:58:58,315 INFO L273 TraceCheckUtils]: 70: Hoare triple {7937#false} ~cond := #in~cond; {7937#false} is VALID [2018-11-23 11:58:58,316 INFO L273 TraceCheckUtils]: 71: Hoare triple {7937#false} assume 0 == ~cond; {7937#false} is VALID [2018-11-23 11:58:58,316 INFO L273 TraceCheckUtils]: 72: Hoare triple {7937#false} assume !false; {7937#false} is VALID [2018-11-23 11:58:58,320 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:58:58,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:58,320 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:58:58,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:58,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:58,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:58,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:58,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {7936#true} call ULTIMATE.init(); {7936#true} is VALID [2018-11-23 11:58:58,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {7936#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7936#true} is VALID [2018-11-23 11:58:58,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {7936#true} assume true; {7936#true} is VALID [2018-11-23 11:58:58,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7936#true} {7936#true} #54#return; {7936#true} is VALID [2018-11-23 11:58:58,541 INFO L256 TraceCheckUtils]: 4: Hoare triple {7936#true} call #t~ret6 := main(); {7936#true} is VALID [2018-11-23 11:58:58,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {7936#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7938#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {7938#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7938#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {7938#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7938#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {7938#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7939#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {7939#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7939#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {7939#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7939#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {7939#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7940#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {7940#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7940#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {7940#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7940#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {7940#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7941#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,545 INFO L273 TraceCheckUtils]: 15: Hoare triple {7941#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7941#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {7941#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7941#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {7941#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7942#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {7942#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7942#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {7942#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7942#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,548 INFO L273 TraceCheckUtils]: 20: Hoare triple {7942#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7943#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {7943#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7943#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,549 INFO L273 TraceCheckUtils]: 22: Hoare triple {7943#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7943#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,550 INFO L273 TraceCheckUtils]: 23: Hoare triple {7943#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7944#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {7944#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7944#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,551 INFO L273 TraceCheckUtils]: 25: Hoare triple {7944#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7944#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {7944#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7945#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,552 INFO L273 TraceCheckUtils]: 27: Hoare triple {7945#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7945#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {7945#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7945#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,553 INFO L273 TraceCheckUtils]: 29: Hoare triple {7945#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7946#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,554 INFO L273 TraceCheckUtils]: 30: Hoare triple {7946#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7946#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,554 INFO L273 TraceCheckUtils]: 31: Hoare triple {7946#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7946#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,555 INFO L273 TraceCheckUtils]: 32: Hoare triple {7946#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7947#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,556 INFO L273 TraceCheckUtils]: 33: Hoare triple {7947#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7947#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,556 INFO L273 TraceCheckUtils]: 34: Hoare triple {7947#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7947#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {7947#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7948#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,557 INFO L273 TraceCheckUtils]: 36: Hoare triple {7948#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7948#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {7948#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7948#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,559 INFO L273 TraceCheckUtils]: 38: Hoare triple {7948#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7949#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,559 INFO L273 TraceCheckUtils]: 39: Hoare triple {7949#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7949#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,560 INFO L273 TraceCheckUtils]: 40: Hoare triple {7949#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7949#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,560 INFO L273 TraceCheckUtils]: 41: Hoare triple {7949#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7950#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,561 INFO L273 TraceCheckUtils]: 42: Hoare triple {7950#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7950#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,561 INFO L273 TraceCheckUtils]: 43: Hoare triple {7950#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7950#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,562 INFO L273 TraceCheckUtils]: 44: Hoare triple {7950#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7951#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:58,562 INFO L273 TraceCheckUtils]: 45: Hoare triple {7951#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7951#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:58,563 INFO L273 TraceCheckUtils]: 46: Hoare triple {7951#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7951#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:58,564 INFO L273 TraceCheckUtils]: 47: Hoare triple {7951#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7952#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:58,564 INFO L273 TraceCheckUtils]: 48: Hoare triple {7952#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7952#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:58,565 INFO L273 TraceCheckUtils]: 49: Hoare triple {7952#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7952#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:58,565 INFO L273 TraceCheckUtils]: 50: Hoare triple {7952#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7953#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:58,566 INFO L273 TraceCheckUtils]: 51: Hoare triple {7953#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7953#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:58,566 INFO L273 TraceCheckUtils]: 52: Hoare triple {7953#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7953#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:58,567 INFO L273 TraceCheckUtils]: 53: Hoare triple {7953#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7954#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:58,567 INFO L273 TraceCheckUtils]: 54: Hoare triple {7954#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7954#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:58,568 INFO L273 TraceCheckUtils]: 55: Hoare triple {7954#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7954#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:58,569 INFO L273 TraceCheckUtils]: 56: Hoare triple {7954#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7955#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:58,569 INFO L273 TraceCheckUtils]: 57: Hoare triple {7955#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7955#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:58,570 INFO L273 TraceCheckUtils]: 58: Hoare triple {7955#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7955#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:58,570 INFO L273 TraceCheckUtils]: 59: Hoare triple {7955#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7956#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:58,571 INFO L273 TraceCheckUtils]: 60: Hoare triple {7956#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7956#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:58,571 INFO L273 TraceCheckUtils]: 61: Hoare triple {7956#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7956#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:58,572 INFO L273 TraceCheckUtils]: 62: Hoare triple {7956#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7957#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:58,572 INFO L273 TraceCheckUtils]: 63: Hoare triple {7957#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7957#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:58,573 INFO L273 TraceCheckUtils]: 64: Hoare triple {7957#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {7957#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:58,574 INFO L273 TraceCheckUtils]: 65: Hoare triple {7957#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7958#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:58,574 INFO L273 TraceCheckUtils]: 66: Hoare triple {7958#(<= main_~i~0 21)} assume !(~i~0 < 100000); {7937#false} is VALID [2018-11-23 11:58:58,574 INFO L273 TraceCheckUtils]: 67: Hoare triple {7937#false} havoc ~x~0;~x~0 := 0; {7937#false} is VALID [2018-11-23 11:58:58,575 INFO L273 TraceCheckUtils]: 68: Hoare triple {7937#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {7937#false} is VALID [2018-11-23 11:58:58,575 INFO L256 TraceCheckUtils]: 69: Hoare triple {7937#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {7937#false} is VALID [2018-11-23 11:58:58,575 INFO L273 TraceCheckUtils]: 70: Hoare triple {7937#false} ~cond := #in~cond; {7937#false} is VALID [2018-11-23 11:58:58,575 INFO L273 TraceCheckUtils]: 71: Hoare triple {7937#false} assume 0 == ~cond; {7937#false} is VALID [2018-11-23 11:58:58,575 INFO L273 TraceCheckUtils]: 72: Hoare triple {7937#false} assume !false; {7937#false} is VALID [2018-11-23 11:58:58,580 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:58:58,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:58,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-23 11:58:58,599 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-11-23 11:58:58,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:58,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:58:58,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:58,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:58:58,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:58:58,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:58:58,672 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 23 states. [2018-11-23 11:58:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,183 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-23 11:58:59,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:58:59,183 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-11-23 11:58:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:58:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2018-11-23 11:58:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:58:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2018-11-23 11:58:59,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 118 transitions. [2018-11-23 11:58:59,289 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:58:59,290 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:58:59,290 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:58:59,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:58:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:58:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 11:58:59,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:59,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 11:58:59,306 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 11:58:59,306 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 11:58:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,308 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 11:58:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 11:58:59,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:59,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:59,308 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 11:58:59,309 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 11:58:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,310 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 11:58:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 11:58:59,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:59,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:59,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:59,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 11:58:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2018-11-23 11:58:59,312 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 73 [2018-11-23 11:58:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:59,312 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2018-11-23 11:58:59,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:58:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2018-11-23 11:58:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 11:58:59,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:59,313 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:58:59,313 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:59,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1893025340, now seen corresponding path program 21 times [2018-11-23 11:58:59,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:59,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:59,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:59,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:59,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:59,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {8579#true} call ULTIMATE.init(); {8579#true} is VALID [2018-11-23 11:58:59,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {8579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8579#true} is VALID [2018-11-23 11:58:59,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {8579#true} assume true; {8579#true} is VALID [2018-11-23 11:58:59,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8579#true} {8579#true} #54#return; {8579#true} is VALID [2018-11-23 11:58:59,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {8579#true} call #t~ret6 := main(); {8579#true} is VALID [2018-11-23 11:58:59,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {8579#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8581#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:59,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {8581#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8581#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:59,976 INFO L273 TraceCheckUtils]: 7: Hoare triple {8581#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8581#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:59,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {8581#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8582#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:59,977 INFO L273 TraceCheckUtils]: 9: Hoare triple {8582#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8582#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:59,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {8582#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8582#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:59,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {8582#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8583#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:59,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {8583#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8583#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:59,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {8583#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8583#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:59,980 INFO L273 TraceCheckUtils]: 14: Hoare triple {8583#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8584#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:59,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {8584#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8584#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:59,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {8584#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8584#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:59,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {8584#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8585#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:59,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {8585#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8585#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:59,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {8585#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8585#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:59,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {8585#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8586#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:59,985 INFO L273 TraceCheckUtils]: 21: Hoare triple {8586#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8586#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:59,985 INFO L273 TraceCheckUtils]: 22: Hoare triple {8586#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8586#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:59,986 INFO L273 TraceCheckUtils]: 23: Hoare triple {8586#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8587#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:59,986 INFO L273 TraceCheckUtils]: 24: Hoare triple {8587#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8587#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:59,987 INFO L273 TraceCheckUtils]: 25: Hoare triple {8587#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8587#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:59,988 INFO L273 TraceCheckUtils]: 26: Hoare triple {8587#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8588#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:59,988 INFO L273 TraceCheckUtils]: 27: Hoare triple {8588#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8588#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:59,989 INFO L273 TraceCheckUtils]: 28: Hoare triple {8588#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8588#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:59,989 INFO L273 TraceCheckUtils]: 29: Hoare triple {8588#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8589#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:59,990 INFO L273 TraceCheckUtils]: 30: Hoare triple {8589#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8589#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:59,990 INFO L273 TraceCheckUtils]: 31: Hoare triple {8589#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8589#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:59,991 INFO L273 TraceCheckUtils]: 32: Hoare triple {8589#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8590#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:59,992 INFO L273 TraceCheckUtils]: 33: Hoare triple {8590#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8590#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:59,992 INFO L273 TraceCheckUtils]: 34: Hoare triple {8590#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8590#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:59,993 INFO L273 TraceCheckUtils]: 35: Hoare triple {8590#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8591#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:59,994 INFO L273 TraceCheckUtils]: 36: Hoare triple {8591#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8591#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:59,994 INFO L273 TraceCheckUtils]: 37: Hoare triple {8591#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8591#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:59,995 INFO L273 TraceCheckUtils]: 38: Hoare triple {8591#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8592#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:59,995 INFO L273 TraceCheckUtils]: 39: Hoare triple {8592#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8592#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:59,996 INFO L273 TraceCheckUtils]: 40: Hoare triple {8592#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8592#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:59,997 INFO L273 TraceCheckUtils]: 41: Hoare triple {8592#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8593#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:59,997 INFO L273 TraceCheckUtils]: 42: Hoare triple {8593#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8593#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:59,998 INFO L273 TraceCheckUtils]: 43: Hoare triple {8593#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8593#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:59,998 INFO L273 TraceCheckUtils]: 44: Hoare triple {8593#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8594#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:59,999 INFO L273 TraceCheckUtils]: 45: Hoare triple {8594#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8594#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:59,999 INFO L273 TraceCheckUtils]: 46: Hoare triple {8594#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8594#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:00,000 INFO L273 TraceCheckUtils]: 47: Hoare triple {8594#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8595#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:00,001 INFO L273 TraceCheckUtils]: 48: Hoare triple {8595#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8595#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:00,001 INFO L273 TraceCheckUtils]: 49: Hoare triple {8595#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8595#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:00,002 INFO L273 TraceCheckUtils]: 50: Hoare triple {8595#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8596#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:00,002 INFO L273 TraceCheckUtils]: 51: Hoare triple {8596#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8596#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:00,003 INFO L273 TraceCheckUtils]: 52: Hoare triple {8596#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8596#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:00,004 INFO L273 TraceCheckUtils]: 53: Hoare triple {8596#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8597#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:00,004 INFO L273 TraceCheckUtils]: 54: Hoare triple {8597#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8597#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:00,005 INFO L273 TraceCheckUtils]: 55: Hoare triple {8597#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8597#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:00,005 INFO L273 TraceCheckUtils]: 56: Hoare triple {8597#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8598#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:00,006 INFO L273 TraceCheckUtils]: 57: Hoare triple {8598#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8598#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:00,006 INFO L273 TraceCheckUtils]: 58: Hoare triple {8598#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8598#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:00,007 INFO L273 TraceCheckUtils]: 59: Hoare triple {8598#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8599#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:00,008 INFO L273 TraceCheckUtils]: 60: Hoare triple {8599#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8599#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:00,008 INFO L273 TraceCheckUtils]: 61: Hoare triple {8599#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8599#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:00,009 INFO L273 TraceCheckUtils]: 62: Hoare triple {8599#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8600#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:00,010 INFO L273 TraceCheckUtils]: 63: Hoare triple {8600#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8600#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:00,010 INFO L273 TraceCheckUtils]: 64: Hoare triple {8600#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8600#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:00,011 INFO L273 TraceCheckUtils]: 65: Hoare triple {8600#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8601#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:00,011 INFO L273 TraceCheckUtils]: 66: Hoare triple {8601#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8601#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:00,012 INFO L273 TraceCheckUtils]: 67: Hoare triple {8601#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8601#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:00,013 INFO L273 TraceCheckUtils]: 68: Hoare triple {8601#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8602#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:00,013 INFO L273 TraceCheckUtils]: 69: Hoare triple {8602#(<= main_~i~0 22)} assume !(~i~0 < 100000); {8580#false} is VALID [2018-11-23 11:59:00,014 INFO L273 TraceCheckUtils]: 70: Hoare triple {8580#false} havoc ~x~0;~x~0 := 0; {8580#false} is VALID [2018-11-23 11:59:00,014 INFO L273 TraceCheckUtils]: 71: Hoare triple {8580#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {8580#false} is VALID [2018-11-23 11:59:00,014 INFO L256 TraceCheckUtils]: 72: Hoare triple {8580#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {8580#false} is VALID [2018-11-23 11:59:00,014 INFO L273 TraceCheckUtils]: 73: Hoare triple {8580#false} ~cond := #in~cond; {8580#false} is VALID [2018-11-23 11:59:00,014 INFO L273 TraceCheckUtils]: 74: Hoare triple {8580#false} assume 0 == ~cond; {8580#false} is VALID [2018-11-23 11:59:00,015 INFO L273 TraceCheckUtils]: 75: Hoare triple {8580#false} assume !false; {8580#false} is VALID [2018-11-23 11:59:00,019 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:59:00,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:00,019 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:59:00,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:00,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 11:59:00,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:00,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {8579#true} call ULTIMATE.init(); {8579#true} is VALID [2018-11-23 11:59:00,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {8579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8579#true} is VALID [2018-11-23 11:59:00,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {8579#true} assume true; {8579#true} is VALID [2018-11-23 11:59:00,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8579#true} {8579#true} #54#return; {8579#true} is VALID [2018-11-23 11:59:00,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {8579#true} call #t~ret6 := main(); {8579#true} is VALID [2018-11-23 11:59:00,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {8579#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8581#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {8581#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8581#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {8581#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8581#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {8581#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8582#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:00,273 INFO L273 TraceCheckUtils]: 9: Hoare triple {8582#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8582#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:00,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {8582#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8582#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:00,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {8582#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8583#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:00,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {8583#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8583#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:00,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {8583#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8583#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:00,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {8583#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8584#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:00,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {8584#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8584#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:00,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {8584#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8584#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:00,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {8584#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8585#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:00,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {8585#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8585#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:00,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {8585#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8585#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:00,279 INFO L273 TraceCheckUtils]: 20: Hoare triple {8585#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8586#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:00,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {8586#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8586#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:00,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {8586#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8586#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:00,281 INFO L273 TraceCheckUtils]: 23: Hoare triple {8586#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8587#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:00,281 INFO L273 TraceCheckUtils]: 24: Hoare triple {8587#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8587#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:00,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {8587#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8587#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:00,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {8587#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8588#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:00,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {8588#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8588#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:00,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {8588#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8588#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:00,284 INFO L273 TraceCheckUtils]: 29: Hoare triple {8588#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8589#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:00,285 INFO L273 TraceCheckUtils]: 30: Hoare triple {8589#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8589#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:00,285 INFO L273 TraceCheckUtils]: 31: Hoare triple {8589#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8589#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:00,286 INFO L273 TraceCheckUtils]: 32: Hoare triple {8589#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8590#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:00,286 INFO L273 TraceCheckUtils]: 33: Hoare triple {8590#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8590#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:00,287 INFO L273 TraceCheckUtils]: 34: Hoare triple {8590#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8590#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:00,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {8590#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8591#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:00,288 INFO L273 TraceCheckUtils]: 36: Hoare triple {8591#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8591#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:00,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {8591#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8591#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:00,289 INFO L273 TraceCheckUtils]: 38: Hoare triple {8591#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8592#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:00,290 INFO L273 TraceCheckUtils]: 39: Hoare triple {8592#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8592#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:00,290 INFO L273 TraceCheckUtils]: 40: Hoare triple {8592#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8592#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:00,291 INFO L273 TraceCheckUtils]: 41: Hoare triple {8592#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8593#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:00,291 INFO L273 TraceCheckUtils]: 42: Hoare triple {8593#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8593#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:00,292 INFO L273 TraceCheckUtils]: 43: Hoare triple {8593#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8593#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:00,292 INFO L273 TraceCheckUtils]: 44: Hoare triple {8593#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8594#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:00,293 INFO L273 TraceCheckUtils]: 45: Hoare triple {8594#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8594#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:00,293 INFO L273 TraceCheckUtils]: 46: Hoare triple {8594#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8594#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:00,294 INFO L273 TraceCheckUtils]: 47: Hoare triple {8594#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8595#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:00,295 INFO L273 TraceCheckUtils]: 48: Hoare triple {8595#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8595#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:00,295 INFO L273 TraceCheckUtils]: 49: Hoare triple {8595#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8595#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:00,296 INFO L273 TraceCheckUtils]: 50: Hoare triple {8595#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8596#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:00,296 INFO L273 TraceCheckUtils]: 51: Hoare triple {8596#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8596#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:00,297 INFO L273 TraceCheckUtils]: 52: Hoare triple {8596#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8596#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:00,298 INFO L273 TraceCheckUtils]: 53: Hoare triple {8596#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8597#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:00,299 INFO L273 TraceCheckUtils]: 54: Hoare triple {8597#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8597#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:00,299 INFO L273 TraceCheckUtils]: 55: Hoare triple {8597#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8597#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:00,300 INFO L273 TraceCheckUtils]: 56: Hoare triple {8597#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8598#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:00,300 INFO L273 TraceCheckUtils]: 57: Hoare triple {8598#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8598#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:00,301 INFO L273 TraceCheckUtils]: 58: Hoare triple {8598#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8598#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:00,302 INFO L273 TraceCheckUtils]: 59: Hoare triple {8598#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8599#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:00,302 INFO L273 TraceCheckUtils]: 60: Hoare triple {8599#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8599#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:00,303 INFO L273 TraceCheckUtils]: 61: Hoare triple {8599#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8599#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:00,303 INFO L273 TraceCheckUtils]: 62: Hoare triple {8599#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8600#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:00,304 INFO L273 TraceCheckUtils]: 63: Hoare triple {8600#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8600#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:00,304 INFO L273 TraceCheckUtils]: 64: Hoare triple {8600#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8600#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:00,305 INFO L273 TraceCheckUtils]: 65: Hoare triple {8600#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8601#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:00,305 INFO L273 TraceCheckUtils]: 66: Hoare triple {8601#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8601#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:00,306 INFO L273 TraceCheckUtils]: 67: Hoare triple {8601#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {8601#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:00,307 INFO L273 TraceCheckUtils]: 68: Hoare triple {8601#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8602#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:00,307 INFO L273 TraceCheckUtils]: 69: Hoare triple {8602#(<= main_~i~0 22)} assume !(~i~0 < 100000); {8580#false} is VALID [2018-11-23 11:59:00,307 INFO L273 TraceCheckUtils]: 70: Hoare triple {8580#false} havoc ~x~0;~x~0 := 0; {8580#false} is VALID [2018-11-23 11:59:00,308 INFO L273 TraceCheckUtils]: 71: Hoare triple {8580#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {8580#false} is VALID [2018-11-23 11:59:00,308 INFO L256 TraceCheckUtils]: 72: Hoare triple {8580#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {8580#false} is VALID [2018-11-23 11:59:00,308 INFO L273 TraceCheckUtils]: 73: Hoare triple {8580#false} ~cond := #in~cond; {8580#false} is VALID [2018-11-23 11:59:00,308 INFO L273 TraceCheckUtils]: 74: Hoare triple {8580#false} assume 0 == ~cond; {8580#false} is VALID [2018-11-23 11:59:00,308 INFO L273 TraceCheckUtils]: 75: Hoare triple {8580#false} assume !false; {8580#false} is VALID [2018-11-23 11:59:00,314 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:59:00,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:00,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-11-23 11:59:00,338 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-23 11:59:00,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:00,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:59:00,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:00,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:59:00,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:59:00,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:59:00,414 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand 24 states. [2018-11-23 11:59:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,899 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2018-11-23 11:59:00,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:59:00,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-23 11:59:00,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:59:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 122 transitions. [2018-11-23 11:59:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:59:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 122 transitions. [2018-11-23 11:59:00,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 122 transitions. [2018-11-23 11:59:01,025 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:59:01,027 INFO L225 Difference]: With dead ends: 97 [2018-11-23 11:59:01,027 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 11:59:01,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:59:01,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 11:59:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-23 11:59:01,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:01,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 84 states. [2018-11-23 11:59:01,052 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 84 states. [2018-11-23 11:59:01,052 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 84 states. [2018-11-23 11:59:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:01,054 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-23 11:59:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 11:59:01,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:01,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:01,055 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 86 states. [2018-11-23 11:59:01,055 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 86 states. [2018-11-23 11:59:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:01,057 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-23 11:59:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 11:59:01,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:01,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:01,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:01,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:59:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2018-11-23 11:59:01,059 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 76 [2018-11-23 11:59:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:01,060 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2018-11-23 11:59:01,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:59:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 11:59:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:59:01,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:01,061 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:59:01,061 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:01,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:01,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1143024663, now seen corresponding path program 22 times [2018-11-23 11:59:01,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:01,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:01,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:01,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:01,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {9246#true} call ULTIMATE.init(); {9246#true} is VALID [2018-11-23 11:59:01,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {9246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9246#true} is VALID [2018-11-23 11:59:01,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {9246#true} assume true; {9246#true} is VALID [2018-11-23 11:59:01,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9246#true} {9246#true} #54#return; {9246#true} is VALID [2018-11-23 11:59:01,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {9246#true} call #t~ret6 := main(); {9246#true} is VALID [2018-11-23 11:59:01,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {9246#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9248#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:01,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {9248#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9248#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:01,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {9248#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9248#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:01,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {9248#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9249#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {9249#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9249#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {9249#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9249#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {9249#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9250#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {9250#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9250#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {9250#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9250#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {9250#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9251#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {9251#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9251#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {9251#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9251#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,635 INFO L273 TraceCheckUtils]: 17: Hoare triple {9251#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9252#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,635 INFO L273 TraceCheckUtils]: 18: Hoare triple {9252#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9252#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,636 INFO L273 TraceCheckUtils]: 19: Hoare triple {9252#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9252#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,636 INFO L273 TraceCheckUtils]: 20: Hoare triple {9252#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9253#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,637 INFO L273 TraceCheckUtils]: 21: Hoare triple {9253#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9253#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,638 INFO L273 TraceCheckUtils]: 22: Hoare triple {9253#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9253#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,638 INFO L273 TraceCheckUtils]: 23: Hoare triple {9253#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9254#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {9254#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9254#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {9254#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9254#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {9254#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9255#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {9255#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9255#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,641 INFO L273 TraceCheckUtils]: 28: Hoare triple {9255#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9255#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,642 INFO L273 TraceCheckUtils]: 29: Hoare triple {9255#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9256#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,642 INFO L273 TraceCheckUtils]: 30: Hoare triple {9256#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9256#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,643 INFO L273 TraceCheckUtils]: 31: Hoare triple {9256#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9256#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {9256#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9257#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {9257#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9257#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,645 INFO L273 TraceCheckUtils]: 34: Hoare triple {9257#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9257#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,645 INFO L273 TraceCheckUtils]: 35: Hoare triple {9257#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9258#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,646 INFO L273 TraceCheckUtils]: 36: Hoare triple {9258#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9258#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {9258#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9258#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,647 INFO L273 TraceCheckUtils]: 38: Hoare triple {9258#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9259#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,648 INFO L273 TraceCheckUtils]: 39: Hoare triple {9259#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9259#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,648 INFO L273 TraceCheckUtils]: 40: Hoare triple {9259#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9259#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,649 INFO L273 TraceCheckUtils]: 41: Hoare triple {9259#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9260#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,650 INFO L273 TraceCheckUtils]: 42: Hoare triple {9260#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9260#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,650 INFO L273 TraceCheckUtils]: 43: Hoare triple {9260#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9260#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {9260#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9261#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {9261#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9261#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,652 INFO L273 TraceCheckUtils]: 46: Hoare triple {9261#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9261#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {9261#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9262#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,653 INFO L273 TraceCheckUtils]: 48: Hoare triple {9262#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9262#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,654 INFO L273 TraceCheckUtils]: 49: Hoare triple {9262#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9262#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,654 INFO L273 TraceCheckUtils]: 50: Hoare triple {9262#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9263#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,655 INFO L273 TraceCheckUtils]: 51: Hoare triple {9263#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9263#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,655 INFO L273 TraceCheckUtils]: 52: Hoare triple {9263#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9263#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,656 INFO L273 TraceCheckUtils]: 53: Hoare triple {9263#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9264#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,657 INFO L273 TraceCheckUtils]: 54: Hoare triple {9264#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9264#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,657 INFO L273 TraceCheckUtils]: 55: Hoare triple {9264#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9264#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {9264#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9265#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {9265#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9265#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {9265#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9265#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,660 INFO L273 TraceCheckUtils]: 59: Hoare triple {9265#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9266#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,660 INFO L273 TraceCheckUtils]: 60: Hoare triple {9266#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9266#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,661 INFO L273 TraceCheckUtils]: 61: Hoare triple {9266#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9266#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,662 INFO L273 TraceCheckUtils]: 62: Hoare triple {9266#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9267#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {9267#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9267#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,663 INFO L273 TraceCheckUtils]: 64: Hoare triple {9267#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9267#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,663 INFO L273 TraceCheckUtils]: 65: Hoare triple {9267#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9268#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,664 INFO L273 TraceCheckUtils]: 66: Hoare triple {9268#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9268#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,665 INFO L273 TraceCheckUtils]: 67: Hoare triple {9268#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9268#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,665 INFO L273 TraceCheckUtils]: 68: Hoare triple {9268#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9269#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,666 INFO L273 TraceCheckUtils]: 69: Hoare triple {9269#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9269#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,666 INFO L273 TraceCheckUtils]: 70: Hoare triple {9269#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9269#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,667 INFO L273 TraceCheckUtils]: 71: Hoare triple {9269#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9270#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:01,668 INFO L273 TraceCheckUtils]: 72: Hoare triple {9270#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9247#false} is VALID [2018-11-23 11:59:01,668 INFO L273 TraceCheckUtils]: 73: Hoare triple {9247#false} havoc ~x~0;~x~0 := 0; {9247#false} is VALID [2018-11-23 11:59:01,668 INFO L273 TraceCheckUtils]: 74: Hoare triple {9247#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {9247#false} is VALID [2018-11-23 11:59:01,668 INFO L256 TraceCheckUtils]: 75: Hoare triple {9247#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {9247#false} is VALID [2018-11-23 11:59:01,669 INFO L273 TraceCheckUtils]: 76: Hoare triple {9247#false} ~cond := #in~cond; {9247#false} is VALID [2018-11-23 11:59:01,669 INFO L273 TraceCheckUtils]: 77: Hoare triple {9247#false} assume 0 == ~cond; {9247#false} is VALID [2018-11-23 11:59:01,669 INFO L273 TraceCheckUtils]: 78: Hoare triple {9247#false} assume !false; {9247#false} is VALID [2018-11-23 11:59:01,674 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:59:01,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:01,674 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:59:01,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:01,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:01,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:01,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {9246#true} call ULTIMATE.init(); {9246#true} is VALID [2018-11-23 11:59:01,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {9246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9246#true} is VALID [2018-11-23 11:59:01,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {9246#true} assume true; {9246#true} is VALID [2018-11-23 11:59:01,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9246#true} {9246#true} #54#return; {9246#true} is VALID [2018-11-23 11:59:01,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {9246#true} call #t~ret6 := main(); {9246#true} is VALID [2018-11-23 11:59:01,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {9246#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9248#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:01,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {9248#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9248#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:01,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {9248#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9248#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:01,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {9248#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9249#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {9249#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9249#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {9249#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9249#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {9249#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9250#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {9250#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9250#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {9250#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9250#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {9250#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9251#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {9251#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9251#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {9251#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9251#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {9251#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9252#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {9252#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9252#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {9252#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9252#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {9252#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9253#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {9253#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9253#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {9253#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9253#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {9253#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9254#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,973 INFO L273 TraceCheckUtils]: 24: Hoare triple {9254#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9254#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,973 INFO L273 TraceCheckUtils]: 25: Hoare triple {9254#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9254#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {9254#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9255#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,974 INFO L273 TraceCheckUtils]: 27: Hoare triple {9255#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9255#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,975 INFO L273 TraceCheckUtils]: 28: Hoare triple {9255#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9255#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {9255#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9256#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {9256#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9256#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {9256#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9256#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {9256#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9257#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,978 INFO L273 TraceCheckUtils]: 33: Hoare triple {9257#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9257#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {9257#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9257#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {9257#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9258#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {9258#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9258#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,980 INFO L273 TraceCheckUtils]: 37: Hoare triple {9258#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9258#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,981 INFO L273 TraceCheckUtils]: 38: Hoare triple {9258#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9259#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,981 INFO L273 TraceCheckUtils]: 39: Hoare triple {9259#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9259#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,982 INFO L273 TraceCheckUtils]: 40: Hoare triple {9259#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9259#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {9259#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9260#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,983 INFO L273 TraceCheckUtils]: 42: Hoare triple {9260#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9260#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,983 INFO L273 TraceCheckUtils]: 43: Hoare triple {9260#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9260#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,984 INFO L273 TraceCheckUtils]: 44: Hoare triple {9260#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9261#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,984 INFO L273 TraceCheckUtils]: 45: Hoare triple {9261#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9261#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,985 INFO L273 TraceCheckUtils]: 46: Hoare triple {9261#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9261#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,986 INFO L273 TraceCheckUtils]: 47: Hoare triple {9261#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9262#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,986 INFO L273 TraceCheckUtils]: 48: Hoare triple {9262#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9262#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,987 INFO L273 TraceCheckUtils]: 49: Hoare triple {9262#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9262#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,987 INFO L273 TraceCheckUtils]: 50: Hoare triple {9262#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9263#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,988 INFO L273 TraceCheckUtils]: 51: Hoare triple {9263#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9263#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,988 INFO L273 TraceCheckUtils]: 52: Hoare triple {9263#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9263#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,989 INFO L273 TraceCheckUtils]: 53: Hoare triple {9263#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9264#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,989 INFO L273 TraceCheckUtils]: 54: Hoare triple {9264#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9264#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,990 INFO L273 TraceCheckUtils]: 55: Hoare triple {9264#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9264#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,991 INFO L273 TraceCheckUtils]: 56: Hoare triple {9264#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9265#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,991 INFO L273 TraceCheckUtils]: 57: Hoare triple {9265#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9265#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,992 INFO L273 TraceCheckUtils]: 58: Hoare triple {9265#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9265#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,992 INFO L273 TraceCheckUtils]: 59: Hoare triple {9265#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9266#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,993 INFO L273 TraceCheckUtils]: 60: Hoare triple {9266#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9266#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,993 INFO L273 TraceCheckUtils]: 61: Hoare triple {9266#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9266#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,994 INFO L273 TraceCheckUtils]: 62: Hoare triple {9266#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9267#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,994 INFO L273 TraceCheckUtils]: 63: Hoare triple {9267#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9267#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,995 INFO L273 TraceCheckUtils]: 64: Hoare triple {9267#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9267#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,996 INFO L273 TraceCheckUtils]: 65: Hoare triple {9267#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9268#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,996 INFO L273 TraceCheckUtils]: 66: Hoare triple {9268#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9268#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,997 INFO L273 TraceCheckUtils]: 67: Hoare triple {9268#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9268#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,997 INFO L273 TraceCheckUtils]: 68: Hoare triple {9268#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9269#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,998 INFO L273 TraceCheckUtils]: 69: Hoare triple {9269#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9269#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,998 INFO L273 TraceCheckUtils]: 70: Hoare triple {9269#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9269#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,999 INFO L273 TraceCheckUtils]: 71: Hoare triple {9269#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9270#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:02,000 INFO L273 TraceCheckUtils]: 72: Hoare triple {9270#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9247#false} is VALID [2018-11-23 11:59:02,000 INFO L273 TraceCheckUtils]: 73: Hoare triple {9247#false} havoc ~x~0;~x~0 := 0; {9247#false} is VALID [2018-11-23 11:59:02,000 INFO L273 TraceCheckUtils]: 74: Hoare triple {9247#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {9247#false} is VALID [2018-11-23 11:59:02,000 INFO L256 TraceCheckUtils]: 75: Hoare triple {9247#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {9247#false} is VALID [2018-11-23 11:59:02,000 INFO L273 TraceCheckUtils]: 76: Hoare triple {9247#false} ~cond := #in~cond; {9247#false} is VALID [2018-11-23 11:59:02,000 INFO L273 TraceCheckUtils]: 77: Hoare triple {9247#false} assume 0 == ~cond; {9247#false} is VALID [2018-11-23 11:59:02,001 INFO L273 TraceCheckUtils]: 78: Hoare triple {9247#false} assume !false; {9247#false} is VALID [2018-11-23 11:59:02,005 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:59:02,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:02,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-11-23 11:59:02,025 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-11-23 11:59:02,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:02,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:59:02,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:02,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:59:02,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:59:02,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:59:02,099 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand 25 states. [2018-11-23 11:59:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,603 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-11-23 11:59:02,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:59:02,603 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-11-23 11:59:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:59:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-23 11:59:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:59:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-23 11:59:02,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 126 transitions. [2018-11-23 11:59:02,723 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:59:02,725 INFO L225 Difference]: With dead ends: 100 [2018-11-23 11:59:02,726 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 11:59:02,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:59:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 11:59:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-11-23 11:59:02,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:02,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 87 states. [2018-11-23 11:59:02,745 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 87 states. [2018-11-23 11:59:02,745 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 87 states. [2018-11-23 11:59:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,746 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 11:59:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 11:59:02,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,747 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 89 states. [2018-11-23 11:59:02,747 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 89 states. [2018-11-23 11:59:02,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,749 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 11:59:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 11:59:02,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:02,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 11:59:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2018-11-23 11:59:02,751 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 79 [2018-11-23 11:59:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:02,751 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2018-11-23 11:59:02,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:59:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2018-11-23 11:59:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 11:59:02,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:02,752 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:59:02,753 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:02,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash 392377572, now seen corresponding path program 23 times [2018-11-23 11:59:02,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:02,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:02,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:02,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {9937#true} call ULTIMATE.init(); {9937#true} is VALID [2018-11-23 11:59:03,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {9937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9937#true} is VALID [2018-11-23 11:59:03,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {9937#true} assume true; {9937#true} is VALID [2018-11-23 11:59:03,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9937#true} {9937#true} #54#return; {9937#true} is VALID [2018-11-23 11:59:03,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {9937#true} call #t~ret6 := main(); {9937#true} is VALID [2018-11-23 11:59:03,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {9937#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9939#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {9939#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9939#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,391 INFO L273 TraceCheckUtils]: 7: Hoare triple {9939#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9939#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {9939#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9940#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {9940#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9940#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {9940#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9940#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {9940#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9941#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {9941#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9941#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {9941#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9941#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {9941#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9942#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {9942#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9942#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {9942#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9942#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {9942#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9943#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {9943#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9943#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {9943#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9943#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {9943#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9944#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {9944#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9944#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {9944#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9944#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {9944#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9945#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {9945#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9945#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {9945#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9945#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {9945#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9946#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {9946#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9946#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {9946#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9946#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,404 INFO L273 TraceCheckUtils]: 29: Hoare triple {9946#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9947#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {9947#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9947#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {9947#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9947#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {9947#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9948#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {9948#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9948#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {9948#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9948#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {9948#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9949#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {9949#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9949#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {9949#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9949#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {9949#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9950#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {9950#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9950#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,411 INFO L273 TraceCheckUtils]: 40: Hoare triple {9950#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9950#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {9950#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9951#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,412 INFO L273 TraceCheckUtils]: 42: Hoare triple {9951#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9951#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {9951#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9951#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {9951#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9952#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,414 INFO L273 TraceCheckUtils]: 45: Hoare triple {9952#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9952#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,414 INFO L273 TraceCheckUtils]: 46: Hoare triple {9952#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9952#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {9952#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9953#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,415 INFO L273 TraceCheckUtils]: 48: Hoare triple {9953#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9953#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {9953#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9953#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {9953#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9954#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:03,417 INFO L273 TraceCheckUtils]: 51: Hoare triple {9954#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9954#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:03,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {9954#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9954#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:03,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {9954#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9955#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:03,419 INFO L273 TraceCheckUtils]: 54: Hoare triple {9955#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9955#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:03,419 INFO L273 TraceCheckUtils]: 55: Hoare triple {9955#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9955#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:03,420 INFO L273 TraceCheckUtils]: 56: Hoare triple {9955#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9956#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:03,421 INFO L273 TraceCheckUtils]: 57: Hoare triple {9956#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9956#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:03,421 INFO L273 TraceCheckUtils]: 58: Hoare triple {9956#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9956#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:03,422 INFO L273 TraceCheckUtils]: 59: Hoare triple {9956#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9957#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:03,423 INFO L273 TraceCheckUtils]: 60: Hoare triple {9957#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9957#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:03,423 INFO L273 TraceCheckUtils]: 61: Hoare triple {9957#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9957#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:03,424 INFO L273 TraceCheckUtils]: 62: Hoare triple {9957#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9958#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:03,424 INFO L273 TraceCheckUtils]: 63: Hoare triple {9958#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9958#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:03,425 INFO L273 TraceCheckUtils]: 64: Hoare triple {9958#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9958#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:03,426 INFO L273 TraceCheckUtils]: 65: Hoare triple {9958#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9959#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:03,426 INFO L273 TraceCheckUtils]: 66: Hoare triple {9959#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9959#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:03,427 INFO L273 TraceCheckUtils]: 67: Hoare triple {9959#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9959#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:03,427 INFO L273 TraceCheckUtils]: 68: Hoare triple {9959#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9960#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:03,428 INFO L273 TraceCheckUtils]: 69: Hoare triple {9960#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9960#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:03,428 INFO L273 TraceCheckUtils]: 70: Hoare triple {9960#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9960#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:03,429 INFO L273 TraceCheckUtils]: 71: Hoare triple {9960#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9961#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:03,430 INFO L273 TraceCheckUtils]: 72: Hoare triple {9961#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9961#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:03,430 INFO L273 TraceCheckUtils]: 73: Hoare triple {9961#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9961#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:03,431 INFO L273 TraceCheckUtils]: 74: Hoare triple {9961#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9962#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:03,431 INFO L273 TraceCheckUtils]: 75: Hoare triple {9962#(<= main_~i~0 24)} assume !(~i~0 < 100000); {9938#false} is VALID [2018-11-23 11:59:03,432 INFO L273 TraceCheckUtils]: 76: Hoare triple {9938#false} havoc ~x~0;~x~0 := 0; {9938#false} is VALID [2018-11-23 11:59:03,432 INFO L273 TraceCheckUtils]: 77: Hoare triple {9938#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {9938#false} is VALID [2018-11-23 11:59:03,432 INFO L256 TraceCheckUtils]: 78: Hoare triple {9938#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {9938#false} is VALID [2018-11-23 11:59:03,432 INFO L273 TraceCheckUtils]: 79: Hoare triple {9938#false} ~cond := #in~cond; {9938#false} is VALID [2018-11-23 11:59:03,432 INFO L273 TraceCheckUtils]: 80: Hoare triple {9938#false} assume 0 == ~cond; {9938#false} is VALID [2018-11-23 11:59:03,432 INFO L273 TraceCheckUtils]: 81: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2018-11-23 11:59:03,438 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:59:03,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:03,438 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:59:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:03,507 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:59:03,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:03,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {9937#true} call ULTIMATE.init(); {9937#true} is VALID [2018-11-23 11:59:03,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {9937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9937#true} is VALID [2018-11-23 11:59:03,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {9937#true} assume true; {9937#true} is VALID [2018-11-23 11:59:03,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9937#true} {9937#true} #54#return; {9937#true} is VALID [2018-11-23 11:59:03,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {9937#true} call #t~ret6 := main(); {9937#true} is VALID [2018-11-23 11:59:03,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {9937#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9939#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {9939#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9939#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {9939#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9939#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {9939#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9940#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,744 INFO L273 TraceCheckUtils]: 9: Hoare triple {9940#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9940#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {9940#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9940#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {9940#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9941#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {9941#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9941#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,745 INFO L273 TraceCheckUtils]: 13: Hoare triple {9941#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9941#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,746 INFO L273 TraceCheckUtils]: 14: Hoare triple {9941#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9942#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,746 INFO L273 TraceCheckUtils]: 15: Hoare triple {9942#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9942#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {9942#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9942#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {9942#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9943#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {9943#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9943#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {9943#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9943#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {9943#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9944#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {9944#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9944#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {9944#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9944#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {9944#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9945#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {9945#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9945#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {9945#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9945#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {9945#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9946#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {9946#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9946#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {9946#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9946#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,754 INFO L273 TraceCheckUtils]: 29: Hoare triple {9946#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9947#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,755 INFO L273 TraceCheckUtils]: 30: Hoare triple {9947#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9947#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,755 INFO L273 TraceCheckUtils]: 31: Hoare triple {9947#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9947#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,756 INFO L273 TraceCheckUtils]: 32: Hoare triple {9947#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9948#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,757 INFO L273 TraceCheckUtils]: 33: Hoare triple {9948#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9948#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,757 INFO L273 TraceCheckUtils]: 34: Hoare triple {9948#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9948#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,758 INFO L273 TraceCheckUtils]: 35: Hoare triple {9948#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9949#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,758 INFO L273 TraceCheckUtils]: 36: Hoare triple {9949#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9949#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,759 INFO L273 TraceCheckUtils]: 37: Hoare triple {9949#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9949#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,759 INFO L273 TraceCheckUtils]: 38: Hoare triple {9949#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9950#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,760 INFO L273 TraceCheckUtils]: 39: Hoare triple {9950#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9950#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,760 INFO L273 TraceCheckUtils]: 40: Hoare triple {9950#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9950#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {9950#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9951#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,762 INFO L273 TraceCheckUtils]: 42: Hoare triple {9951#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9951#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,762 INFO L273 TraceCheckUtils]: 43: Hoare triple {9951#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9951#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,763 INFO L273 TraceCheckUtils]: 44: Hoare triple {9951#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9952#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {9952#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9952#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,764 INFO L273 TraceCheckUtils]: 46: Hoare triple {9952#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9952#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,764 INFO L273 TraceCheckUtils]: 47: Hoare triple {9952#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9953#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,765 INFO L273 TraceCheckUtils]: 48: Hoare triple {9953#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9953#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,765 INFO L273 TraceCheckUtils]: 49: Hoare triple {9953#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9953#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,766 INFO L273 TraceCheckUtils]: 50: Hoare triple {9953#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9954#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:03,767 INFO L273 TraceCheckUtils]: 51: Hoare triple {9954#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9954#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:03,767 INFO L273 TraceCheckUtils]: 52: Hoare triple {9954#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9954#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:03,768 INFO L273 TraceCheckUtils]: 53: Hoare triple {9954#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9955#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:03,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {9955#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9955#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:03,769 INFO L273 TraceCheckUtils]: 55: Hoare triple {9955#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9955#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:03,770 INFO L273 TraceCheckUtils]: 56: Hoare triple {9955#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9956#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:03,770 INFO L273 TraceCheckUtils]: 57: Hoare triple {9956#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9956#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:03,771 INFO L273 TraceCheckUtils]: 58: Hoare triple {9956#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9956#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:03,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {9956#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9957#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:03,772 INFO L273 TraceCheckUtils]: 60: Hoare triple {9957#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9957#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:03,773 INFO L273 TraceCheckUtils]: 61: Hoare triple {9957#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9957#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:03,774 INFO L273 TraceCheckUtils]: 62: Hoare triple {9957#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9958#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:03,775 INFO L273 TraceCheckUtils]: 63: Hoare triple {9958#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9958#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:03,775 INFO L273 TraceCheckUtils]: 64: Hoare triple {9958#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9958#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:03,776 INFO L273 TraceCheckUtils]: 65: Hoare triple {9958#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9959#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:03,777 INFO L273 TraceCheckUtils]: 66: Hoare triple {9959#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9959#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:03,777 INFO L273 TraceCheckUtils]: 67: Hoare triple {9959#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9959#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:03,778 INFO L273 TraceCheckUtils]: 68: Hoare triple {9959#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9960#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:03,779 INFO L273 TraceCheckUtils]: 69: Hoare triple {9960#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9960#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:03,779 INFO L273 TraceCheckUtils]: 70: Hoare triple {9960#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9960#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:03,780 INFO L273 TraceCheckUtils]: 71: Hoare triple {9960#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9961#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:03,781 INFO L273 TraceCheckUtils]: 72: Hoare triple {9961#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9961#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:03,781 INFO L273 TraceCheckUtils]: 73: Hoare triple {9961#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {9961#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:03,782 INFO L273 TraceCheckUtils]: 74: Hoare triple {9961#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9962#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:03,783 INFO L273 TraceCheckUtils]: 75: Hoare triple {9962#(<= main_~i~0 24)} assume !(~i~0 < 100000); {9938#false} is VALID [2018-11-23 11:59:03,783 INFO L273 TraceCheckUtils]: 76: Hoare triple {9938#false} havoc ~x~0;~x~0 := 0; {9938#false} is VALID [2018-11-23 11:59:03,783 INFO L273 TraceCheckUtils]: 77: Hoare triple {9938#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {9938#false} is VALID [2018-11-23 11:59:03,784 INFO L256 TraceCheckUtils]: 78: Hoare triple {9938#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {9938#false} is VALID [2018-11-23 11:59:03,784 INFO L273 TraceCheckUtils]: 79: Hoare triple {9938#false} ~cond := #in~cond; {9938#false} is VALID [2018-11-23 11:59:03,784 INFO L273 TraceCheckUtils]: 80: Hoare triple {9938#false} assume 0 == ~cond; {9938#false} is VALID [2018-11-23 11:59:03,784 INFO L273 TraceCheckUtils]: 81: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2018-11-23 11:59:03,793 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:59:03,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:03,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-11-23 11:59:03,812 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-11-23 11:59:03,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:03,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:59:03,898 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:59:03,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:59:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:59:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:59:03,900 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand 26 states. [2018-11-23 11:59:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,357 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2018-11-23 11:59:04,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:59:04,357 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-11-23 11:59:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:59:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-23 11:59:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:59:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-23 11:59:04,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 130 transitions. [2018-11-23 11:59:04,501 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:59:04,502 INFO L225 Difference]: With dead ends: 103 [2018-11-23 11:59:04,503 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 11:59:04,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:59:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 11:59:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-23 11:59:04,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:04,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-23 11:59:04,525 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-23 11:59:04,525 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-23 11:59:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,527 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-11-23 11:59:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-23 11:59:04,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,528 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-23 11:59:04,528 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-23 11:59:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,529 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-11-23 11:59:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-23 11:59:04,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:04,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:59:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2018-11-23 11:59:04,531 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 82 [2018-11-23 11:59:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:04,532 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-11-23 11:59:04,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:59:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2018-11-23 11:59:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:59:04,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:04,533 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:59:04,533 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:04,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:04,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1759599863, now seen corresponding path program 24 times [2018-11-23 11:59:04,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:04,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:04,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:04,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {10652#true} call ULTIMATE.init(); {10652#true} is VALID [2018-11-23 11:59:05,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {10652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10652#true} is VALID [2018-11-23 11:59:05,458 INFO L273 TraceCheckUtils]: 2: Hoare triple {10652#true} assume true; {10652#true} is VALID [2018-11-23 11:59:05,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10652#true} {10652#true} #54#return; {10652#true} is VALID [2018-11-23 11:59:05,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {10652#true} call #t~ret6 := main(); {10652#true} is VALID [2018-11-23 11:59:05,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {10652#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10654#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {10654#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10654#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {10654#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10654#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {10654#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10655#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {10655#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10655#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {10655#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10655#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {10655#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10656#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {10656#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10656#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {10656#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10656#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {10656#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10657#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {10657#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10657#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {10657#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10657#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {10657#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10658#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {10658#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10658#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {10658#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10658#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,468 INFO L273 TraceCheckUtils]: 20: Hoare triple {10658#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10659#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {10659#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10659#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {10659#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10659#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {10659#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10660#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {10660#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10660#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,471 INFO L273 TraceCheckUtils]: 25: Hoare triple {10660#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10660#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,471 INFO L273 TraceCheckUtils]: 26: Hoare triple {10660#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10661#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {10661#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10661#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,472 INFO L273 TraceCheckUtils]: 28: Hoare triple {10661#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10661#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {10661#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10662#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {10662#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10662#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,474 INFO L273 TraceCheckUtils]: 31: Hoare triple {10662#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10662#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,475 INFO L273 TraceCheckUtils]: 32: Hoare triple {10662#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10663#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,475 INFO L273 TraceCheckUtils]: 33: Hoare triple {10663#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10663#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,476 INFO L273 TraceCheckUtils]: 34: Hoare triple {10663#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10663#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,476 INFO L273 TraceCheckUtils]: 35: Hoare triple {10663#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10664#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,477 INFO L273 TraceCheckUtils]: 36: Hoare triple {10664#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10664#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,477 INFO L273 TraceCheckUtils]: 37: Hoare triple {10664#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10664#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,478 INFO L273 TraceCheckUtils]: 38: Hoare triple {10664#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10665#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,479 INFO L273 TraceCheckUtils]: 39: Hoare triple {10665#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10665#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,479 INFO L273 TraceCheckUtils]: 40: Hoare triple {10665#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10665#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {10665#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10666#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {10666#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10666#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,481 INFO L273 TraceCheckUtils]: 43: Hoare triple {10666#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10666#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,481 INFO L273 TraceCheckUtils]: 44: Hoare triple {10666#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10667#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,482 INFO L273 TraceCheckUtils]: 45: Hoare triple {10667#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10667#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,482 INFO L273 TraceCheckUtils]: 46: Hoare triple {10667#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10667#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,483 INFO L273 TraceCheckUtils]: 47: Hoare triple {10667#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10668#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,484 INFO L273 TraceCheckUtils]: 48: Hoare triple {10668#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10668#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,484 INFO L273 TraceCheckUtils]: 49: Hoare triple {10668#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10668#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,485 INFO L273 TraceCheckUtils]: 50: Hoare triple {10668#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10669#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,485 INFO L273 TraceCheckUtils]: 51: Hoare triple {10669#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10669#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,486 INFO L273 TraceCheckUtils]: 52: Hoare triple {10669#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10669#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,487 INFO L273 TraceCheckUtils]: 53: Hoare triple {10669#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10670#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:05,487 INFO L273 TraceCheckUtils]: 54: Hoare triple {10670#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10670#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:05,488 INFO L273 TraceCheckUtils]: 55: Hoare triple {10670#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10670#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:05,488 INFO L273 TraceCheckUtils]: 56: Hoare triple {10670#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10671#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:05,489 INFO L273 TraceCheckUtils]: 57: Hoare triple {10671#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10671#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:05,489 INFO L273 TraceCheckUtils]: 58: Hoare triple {10671#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10671#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:05,490 INFO L273 TraceCheckUtils]: 59: Hoare triple {10671#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10672#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:05,491 INFO L273 TraceCheckUtils]: 60: Hoare triple {10672#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10672#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:05,491 INFO L273 TraceCheckUtils]: 61: Hoare triple {10672#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10672#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:05,492 INFO L273 TraceCheckUtils]: 62: Hoare triple {10672#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10673#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:05,492 INFO L273 TraceCheckUtils]: 63: Hoare triple {10673#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10673#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:05,493 INFO L273 TraceCheckUtils]: 64: Hoare triple {10673#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10673#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:05,493 INFO L273 TraceCheckUtils]: 65: Hoare triple {10673#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10674#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:05,494 INFO L273 TraceCheckUtils]: 66: Hoare triple {10674#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10674#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:05,494 INFO L273 TraceCheckUtils]: 67: Hoare triple {10674#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10674#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:05,495 INFO L273 TraceCheckUtils]: 68: Hoare triple {10674#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10675#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:05,496 INFO L273 TraceCheckUtils]: 69: Hoare triple {10675#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10675#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:05,496 INFO L273 TraceCheckUtils]: 70: Hoare triple {10675#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10675#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:05,497 INFO L273 TraceCheckUtils]: 71: Hoare triple {10675#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10676#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:05,497 INFO L273 TraceCheckUtils]: 72: Hoare triple {10676#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10676#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:05,498 INFO L273 TraceCheckUtils]: 73: Hoare triple {10676#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10676#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:05,498 INFO L273 TraceCheckUtils]: 74: Hoare triple {10676#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10677#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:05,499 INFO L273 TraceCheckUtils]: 75: Hoare triple {10677#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10677#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:05,499 INFO L273 TraceCheckUtils]: 76: Hoare triple {10677#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10677#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:05,500 INFO L273 TraceCheckUtils]: 77: Hoare triple {10677#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10678#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:05,501 INFO L273 TraceCheckUtils]: 78: Hoare triple {10678#(<= main_~i~0 25)} assume !(~i~0 < 100000); {10653#false} is VALID [2018-11-23 11:59:05,501 INFO L273 TraceCheckUtils]: 79: Hoare triple {10653#false} havoc ~x~0;~x~0 := 0; {10653#false} is VALID [2018-11-23 11:59:05,501 INFO L273 TraceCheckUtils]: 80: Hoare triple {10653#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {10653#false} is VALID [2018-11-23 11:59:05,501 INFO L256 TraceCheckUtils]: 81: Hoare triple {10653#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {10653#false} is VALID [2018-11-23 11:59:05,501 INFO L273 TraceCheckUtils]: 82: Hoare triple {10653#false} ~cond := #in~cond; {10653#false} is VALID [2018-11-23 11:59:05,502 INFO L273 TraceCheckUtils]: 83: Hoare triple {10653#false} assume 0 == ~cond; {10653#false} is VALID [2018-11-23 11:59:05,502 INFO L273 TraceCheckUtils]: 84: Hoare triple {10653#false} assume !false; {10653#false} is VALID [2018-11-23 11:59:05,507 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:59:05,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:05,508 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:59:05,516 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:05,573 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 11:59:05,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:05,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {10652#true} call ULTIMATE.init(); {10652#true} is VALID [2018-11-23 11:59:05,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {10652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10652#true} is VALID [2018-11-23 11:59:05,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {10652#true} assume true; {10652#true} is VALID [2018-11-23 11:59:05,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10652#true} {10652#true} #54#return; {10652#true} is VALID [2018-11-23 11:59:05,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {10652#true} call #t~ret6 := main(); {10652#true} is VALID [2018-11-23 11:59:05,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {10652#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10654#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {10654#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10654#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {10654#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10654#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {10654#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10655#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {10655#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10655#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {10655#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10655#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {10655#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10656#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {10656#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10656#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {10656#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10656#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {10656#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10657#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {10657#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10657#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {10657#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10657#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {10657#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10658#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {10658#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10658#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {10658#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10658#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {10658#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10659#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {10659#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10659#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,821 INFO L273 TraceCheckUtils]: 22: Hoare triple {10659#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10659#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,821 INFO L273 TraceCheckUtils]: 23: Hoare triple {10659#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10660#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {10660#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10660#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,822 INFO L273 TraceCheckUtils]: 25: Hoare triple {10660#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10660#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {10660#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10661#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,823 INFO L273 TraceCheckUtils]: 27: Hoare triple {10661#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10661#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {10661#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10661#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {10661#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10662#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {10662#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10662#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,826 INFO L273 TraceCheckUtils]: 31: Hoare triple {10662#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10662#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,826 INFO L273 TraceCheckUtils]: 32: Hoare triple {10662#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10663#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {10663#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10663#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {10663#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10663#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,828 INFO L273 TraceCheckUtils]: 35: Hoare triple {10663#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10664#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,828 INFO L273 TraceCheckUtils]: 36: Hoare triple {10664#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10664#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,829 INFO L273 TraceCheckUtils]: 37: Hoare triple {10664#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10664#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {10664#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10665#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {10665#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10665#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,831 INFO L273 TraceCheckUtils]: 40: Hoare triple {10665#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10665#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,831 INFO L273 TraceCheckUtils]: 41: Hoare triple {10665#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10666#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,832 INFO L273 TraceCheckUtils]: 42: Hoare triple {10666#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10666#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,832 INFO L273 TraceCheckUtils]: 43: Hoare triple {10666#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10666#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,833 INFO L273 TraceCheckUtils]: 44: Hoare triple {10666#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10667#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,833 INFO L273 TraceCheckUtils]: 45: Hoare triple {10667#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10667#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,834 INFO L273 TraceCheckUtils]: 46: Hoare triple {10667#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10667#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,835 INFO L273 TraceCheckUtils]: 47: Hoare triple {10667#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10668#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,835 INFO L273 TraceCheckUtils]: 48: Hoare triple {10668#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10668#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,836 INFO L273 TraceCheckUtils]: 49: Hoare triple {10668#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10668#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,836 INFO L273 TraceCheckUtils]: 50: Hoare triple {10668#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10669#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,837 INFO L273 TraceCheckUtils]: 51: Hoare triple {10669#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10669#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,837 INFO L273 TraceCheckUtils]: 52: Hoare triple {10669#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10669#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,838 INFO L273 TraceCheckUtils]: 53: Hoare triple {10669#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10670#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:05,838 INFO L273 TraceCheckUtils]: 54: Hoare triple {10670#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10670#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:05,839 INFO L273 TraceCheckUtils]: 55: Hoare triple {10670#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10670#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:05,840 INFO L273 TraceCheckUtils]: 56: Hoare triple {10670#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10671#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:05,840 INFO L273 TraceCheckUtils]: 57: Hoare triple {10671#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10671#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:05,841 INFO L273 TraceCheckUtils]: 58: Hoare triple {10671#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10671#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:05,841 INFO L273 TraceCheckUtils]: 59: Hoare triple {10671#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10672#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:05,842 INFO L273 TraceCheckUtils]: 60: Hoare triple {10672#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10672#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:05,842 INFO L273 TraceCheckUtils]: 61: Hoare triple {10672#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10672#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:05,843 INFO L273 TraceCheckUtils]: 62: Hoare triple {10672#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10673#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:05,843 INFO L273 TraceCheckUtils]: 63: Hoare triple {10673#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10673#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:05,844 INFO L273 TraceCheckUtils]: 64: Hoare triple {10673#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10673#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:05,845 INFO L273 TraceCheckUtils]: 65: Hoare triple {10673#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10674#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:05,845 INFO L273 TraceCheckUtils]: 66: Hoare triple {10674#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10674#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:05,846 INFO L273 TraceCheckUtils]: 67: Hoare triple {10674#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10674#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:05,846 INFO L273 TraceCheckUtils]: 68: Hoare triple {10674#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10675#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:05,847 INFO L273 TraceCheckUtils]: 69: Hoare triple {10675#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10675#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:05,847 INFO L273 TraceCheckUtils]: 70: Hoare triple {10675#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10675#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:05,848 INFO L273 TraceCheckUtils]: 71: Hoare triple {10675#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10676#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:05,848 INFO L273 TraceCheckUtils]: 72: Hoare triple {10676#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10676#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:05,849 INFO L273 TraceCheckUtils]: 73: Hoare triple {10676#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10676#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:05,850 INFO L273 TraceCheckUtils]: 74: Hoare triple {10676#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10677#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:05,850 INFO L273 TraceCheckUtils]: 75: Hoare triple {10677#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10677#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:05,851 INFO L273 TraceCheckUtils]: 76: Hoare triple {10677#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {10677#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:05,851 INFO L273 TraceCheckUtils]: 77: Hoare triple {10677#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10678#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:05,852 INFO L273 TraceCheckUtils]: 78: Hoare triple {10678#(<= main_~i~0 25)} assume !(~i~0 < 100000); {10653#false} is VALID [2018-11-23 11:59:05,852 INFO L273 TraceCheckUtils]: 79: Hoare triple {10653#false} havoc ~x~0;~x~0 := 0; {10653#false} is VALID [2018-11-23 11:59:05,852 INFO L273 TraceCheckUtils]: 80: Hoare triple {10653#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {10653#false} is VALID [2018-11-23 11:59:05,853 INFO L256 TraceCheckUtils]: 81: Hoare triple {10653#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {10653#false} is VALID [2018-11-23 11:59:05,853 INFO L273 TraceCheckUtils]: 82: Hoare triple {10653#false} ~cond := #in~cond; {10653#false} is VALID [2018-11-23 11:59:05,853 INFO L273 TraceCheckUtils]: 83: Hoare triple {10653#false} assume 0 == ~cond; {10653#false} is VALID [2018-11-23 11:59:05,853 INFO L273 TraceCheckUtils]: 84: Hoare triple {10653#false} assume !false; {10653#false} is VALID [2018-11-23 11:59:05,859 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:59:05,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:05,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-11-23 11:59:05,879 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-11-23 11:59:05,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:05,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:59:05,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:05,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:59:05,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:59:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:59:05,962 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand 27 states. [2018-11-23 11:59:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,468 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2018-11-23 11:59:06,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:59:06,468 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-11-23 11:59:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:59:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 134 transitions. [2018-11-23 11:59:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:59:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 134 transitions. [2018-11-23 11:59:06,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 134 transitions. [2018-11-23 11:59:06,595 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:59:06,599 INFO L225 Difference]: With dead ends: 106 [2018-11-23 11:59:06,599 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 11:59:06,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:59:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 11:59:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 11:59:06,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:06,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 11:59:06,630 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 11:59:06,630 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 11:59:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,633 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-23 11:59:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 11:59:06,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,634 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 11:59:06,634 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 11:59:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,636 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-23 11:59:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 11:59:06,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:06,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 11:59:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 119 transitions. [2018-11-23 11:59:06,639 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 119 transitions. Word has length 85 [2018-11-23 11:59:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:06,639 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 119 transitions. [2018-11-23 11:59:06,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:59:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2018-11-23 11:59:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 11:59:06,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:06,641 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:59:06,641 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:06,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:06,641 INFO L82 PathProgramCache]: Analyzing trace with hash -790964220, now seen corresponding path program 25 times [2018-11-23 11:59:06,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:06,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:06,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:06,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {11391#true} call ULTIMATE.init(); {11391#true} is VALID [2018-11-23 11:59:07,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {11391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11391#true} is VALID [2018-11-23 11:59:07,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {11391#true} assume true; {11391#true} is VALID [2018-11-23 11:59:07,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11391#true} {11391#true} #54#return; {11391#true} is VALID [2018-11-23 11:59:07,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {11391#true} call #t~ret6 := main(); {11391#true} is VALID [2018-11-23 11:59:07,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {11391#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11393#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {11393#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11393#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {11393#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11393#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {11393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11394#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {11394#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11394#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {11394#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11394#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {11394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11395#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {11395#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11395#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {11395#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11395#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {11395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11396#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {11396#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11396#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {11396#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11396#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,352 INFO L273 TraceCheckUtils]: 17: Hoare triple {11396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11397#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {11397#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11397#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {11397#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11397#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {11397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11398#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {11398#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11398#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {11398#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11398#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {11398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11399#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {11399#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11399#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,357 INFO L273 TraceCheckUtils]: 25: Hoare triple {11399#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11399#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,357 INFO L273 TraceCheckUtils]: 26: Hoare triple {11399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11400#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,358 INFO L273 TraceCheckUtils]: 27: Hoare triple {11400#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11400#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,358 INFO L273 TraceCheckUtils]: 28: Hoare triple {11400#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11400#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,359 INFO L273 TraceCheckUtils]: 29: Hoare triple {11400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11401#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,360 INFO L273 TraceCheckUtils]: 30: Hoare triple {11401#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11401#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,360 INFO L273 TraceCheckUtils]: 31: Hoare triple {11401#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11401#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {11401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11402#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {11402#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11402#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,362 INFO L273 TraceCheckUtils]: 34: Hoare triple {11402#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11402#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,363 INFO L273 TraceCheckUtils]: 35: Hoare triple {11402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,363 INFO L273 TraceCheckUtils]: 36: Hoare triple {11403#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11403#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,364 INFO L273 TraceCheckUtils]: 37: Hoare triple {11403#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11403#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,364 INFO L273 TraceCheckUtils]: 38: Hoare triple {11403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11404#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,365 INFO L273 TraceCheckUtils]: 39: Hoare triple {11404#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11404#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,366 INFO L273 TraceCheckUtils]: 40: Hoare triple {11404#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11404#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,366 INFO L273 TraceCheckUtils]: 41: Hoare triple {11404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11405#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {11405#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11405#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,367 INFO L273 TraceCheckUtils]: 43: Hoare triple {11405#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11405#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,368 INFO L273 TraceCheckUtils]: 44: Hoare triple {11405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11406#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,369 INFO L273 TraceCheckUtils]: 45: Hoare triple {11406#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11406#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,369 INFO L273 TraceCheckUtils]: 46: Hoare triple {11406#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11406#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,370 INFO L273 TraceCheckUtils]: 47: Hoare triple {11406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11407#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,370 INFO L273 TraceCheckUtils]: 48: Hoare triple {11407#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11407#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,371 INFO L273 TraceCheckUtils]: 49: Hoare triple {11407#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11407#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,371 INFO L273 TraceCheckUtils]: 50: Hoare triple {11407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11408#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,372 INFO L273 TraceCheckUtils]: 51: Hoare triple {11408#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11408#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,373 INFO L273 TraceCheckUtils]: 52: Hoare triple {11408#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11408#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,373 INFO L273 TraceCheckUtils]: 53: Hoare triple {11408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11409#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,374 INFO L273 TraceCheckUtils]: 54: Hoare triple {11409#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11409#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,374 INFO L273 TraceCheckUtils]: 55: Hoare triple {11409#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11409#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,375 INFO L273 TraceCheckUtils]: 56: Hoare triple {11409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11410#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,376 INFO L273 TraceCheckUtils]: 57: Hoare triple {11410#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11410#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,376 INFO L273 TraceCheckUtils]: 58: Hoare triple {11410#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11410#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,377 INFO L273 TraceCheckUtils]: 59: Hoare triple {11410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11411#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,377 INFO L273 TraceCheckUtils]: 60: Hoare triple {11411#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11411#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,378 INFO L273 TraceCheckUtils]: 61: Hoare triple {11411#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11411#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,379 INFO L273 TraceCheckUtils]: 62: Hoare triple {11411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11412#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,379 INFO L273 TraceCheckUtils]: 63: Hoare triple {11412#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11412#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,380 INFO L273 TraceCheckUtils]: 64: Hoare triple {11412#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11412#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,380 INFO L273 TraceCheckUtils]: 65: Hoare triple {11412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11413#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,381 INFO L273 TraceCheckUtils]: 66: Hoare triple {11413#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11413#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,381 INFO L273 TraceCheckUtils]: 67: Hoare triple {11413#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11413#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,382 INFO L273 TraceCheckUtils]: 68: Hoare triple {11413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11414#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,383 INFO L273 TraceCheckUtils]: 69: Hoare triple {11414#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11414#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,383 INFO L273 TraceCheckUtils]: 70: Hoare triple {11414#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11414#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,384 INFO L273 TraceCheckUtils]: 71: Hoare triple {11414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11415#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,384 INFO L273 TraceCheckUtils]: 72: Hoare triple {11415#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11415#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,385 INFO L273 TraceCheckUtils]: 73: Hoare triple {11415#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11415#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,386 INFO L273 TraceCheckUtils]: 74: Hoare triple {11415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11416#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,386 INFO L273 TraceCheckUtils]: 75: Hoare triple {11416#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11416#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,387 INFO L273 TraceCheckUtils]: 76: Hoare triple {11416#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11416#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,387 INFO L273 TraceCheckUtils]: 77: Hoare triple {11416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11417#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,388 INFO L273 TraceCheckUtils]: 78: Hoare triple {11417#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11417#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,388 INFO L273 TraceCheckUtils]: 79: Hoare triple {11417#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11417#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,389 INFO L273 TraceCheckUtils]: 80: Hoare triple {11417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11418#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:07,390 INFO L273 TraceCheckUtils]: 81: Hoare triple {11418#(<= main_~i~0 26)} assume !(~i~0 < 100000); {11392#false} is VALID [2018-11-23 11:59:07,390 INFO L273 TraceCheckUtils]: 82: Hoare triple {11392#false} havoc ~x~0;~x~0 := 0; {11392#false} is VALID [2018-11-23 11:59:07,390 INFO L273 TraceCheckUtils]: 83: Hoare triple {11392#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {11392#false} is VALID [2018-11-23 11:59:07,391 INFO L256 TraceCheckUtils]: 84: Hoare triple {11392#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {11392#false} is VALID [2018-11-23 11:59:07,391 INFO L273 TraceCheckUtils]: 85: Hoare triple {11392#false} ~cond := #in~cond; {11392#false} is VALID [2018-11-23 11:59:07,391 INFO L273 TraceCheckUtils]: 86: Hoare triple {11392#false} assume 0 == ~cond; {11392#false} is VALID [2018-11-23 11:59:07,391 INFO L273 TraceCheckUtils]: 87: Hoare triple {11392#false} assume !false; {11392#false} is VALID [2018-11-23 11:59:07,398 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:59:07,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:07,398 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:59:07,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:07,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {11391#true} call ULTIMATE.init(); {11391#true} is VALID [2018-11-23 11:59:07,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {11391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11391#true} is VALID [2018-11-23 11:59:07,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {11391#true} assume true; {11391#true} is VALID [2018-11-23 11:59:07,702 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11391#true} {11391#true} #54#return; {11391#true} is VALID [2018-11-23 11:59:07,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {11391#true} call #t~ret6 := main(); {11391#true} is VALID [2018-11-23 11:59:07,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {11391#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11393#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {11393#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11393#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {11393#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11393#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {11393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11394#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {11394#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11394#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {11394#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11394#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {11394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11395#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {11395#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11395#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {11395#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11395#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,707 INFO L273 TraceCheckUtils]: 14: Hoare triple {11395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11396#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {11396#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11396#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {11396#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11396#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {11396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11397#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {11397#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11397#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,710 INFO L273 TraceCheckUtils]: 19: Hoare triple {11397#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11397#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {11397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11398#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {11398#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11398#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {11398#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11398#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {11398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11399#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {11399#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11399#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,713 INFO L273 TraceCheckUtils]: 25: Hoare triple {11399#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11399#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {11399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11400#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {11400#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11400#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,715 INFO L273 TraceCheckUtils]: 28: Hoare triple {11400#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11400#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {11400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11401#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,716 INFO L273 TraceCheckUtils]: 30: Hoare triple {11401#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11401#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,716 INFO L273 TraceCheckUtils]: 31: Hoare triple {11401#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11401#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,717 INFO L273 TraceCheckUtils]: 32: Hoare triple {11401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11402#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,718 INFO L273 TraceCheckUtils]: 33: Hoare triple {11402#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11402#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,718 INFO L273 TraceCheckUtils]: 34: Hoare triple {11402#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11402#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,719 INFO L273 TraceCheckUtils]: 35: Hoare triple {11402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,719 INFO L273 TraceCheckUtils]: 36: Hoare triple {11403#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11403#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,720 INFO L273 TraceCheckUtils]: 37: Hoare triple {11403#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11403#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,720 INFO L273 TraceCheckUtils]: 38: Hoare triple {11403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11404#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,721 INFO L273 TraceCheckUtils]: 39: Hoare triple {11404#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11404#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,721 INFO L273 TraceCheckUtils]: 40: Hoare triple {11404#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11404#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,722 INFO L273 TraceCheckUtils]: 41: Hoare triple {11404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11405#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,723 INFO L273 TraceCheckUtils]: 42: Hoare triple {11405#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11405#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,723 INFO L273 TraceCheckUtils]: 43: Hoare triple {11405#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11405#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,724 INFO L273 TraceCheckUtils]: 44: Hoare triple {11405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11406#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,724 INFO L273 TraceCheckUtils]: 45: Hoare triple {11406#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11406#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,725 INFO L273 TraceCheckUtils]: 46: Hoare triple {11406#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11406#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,725 INFO L273 TraceCheckUtils]: 47: Hoare triple {11406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11407#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,726 INFO L273 TraceCheckUtils]: 48: Hoare triple {11407#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11407#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,726 INFO L273 TraceCheckUtils]: 49: Hoare triple {11407#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11407#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,727 INFO L273 TraceCheckUtils]: 50: Hoare triple {11407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11408#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,728 INFO L273 TraceCheckUtils]: 51: Hoare triple {11408#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11408#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,728 INFO L273 TraceCheckUtils]: 52: Hoare triple {11408#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11408#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,729 INFO L273 TraceCheckUtils]: 53: Hoare triple {11408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11409#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,729 INFO L273 TraceCheckUtils]: 54: Hoare triple {11409#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11409#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,730 INFO L273 TraceCheckUtils]: 55: Hoare triple {11409#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11409#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,730 INFO L273 TraceCheckUtils]: 56: Hoare triple {11409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11410#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,731 INFO L273 TraceCheckUtils]: 57: Hoare triple {11410#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11410#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,731 INFO L273 TraceCheckUtils]: 58: Hoare triple {11410#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11410#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,732 INFO L273 TraceCheckUtils]: 59: Hoare triple {11410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11411#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,733 INFO L273 TraceCheckUtils]: 60: Hoare triple {11411#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11411#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,733 INFO L273 TraceCheckUtils]: 61: Hoare triple {11411#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11411#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,734 INFO L273 TraceCheckUtils]: 62: Hoare triple {11411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11412#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,734 INFO L273 TraceCheckUtils]: 63: Hoare triple {11412#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11412#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,735 INFO L273 TraceCheckUtils]: 64: Hoare triple {11412#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11412#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,735 INFO L273 TraceCheckUtils]: 65: Hoare triple {11412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11413#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,736 INFO L273 TraceCheckUtils]: 66: Hoare triple {11413#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11413#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,736 INFO L273 TraceCheckUtils]: 67: Hoare triple {11413#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11413#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,737 INFO L273 TraceCheckUtils]: 68: Hoare triple {11413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11414#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,738 INFO L273 TraceCheckUtils]: 69: Hoare triple {11414#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11414#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,738 INFO L273 TraceCheckUtils]: 70: Hoare triple {11414#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11414#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,739 INFO L273 TraceCheckUtils]: 71: Hoare triple {11414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11415#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,739 INFO L273 TraceCheckUtils]: 72: Hoare triple {11415#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11415#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,740 INFO L273 TraceCheckUtils]: 73: Hoare triple {11415#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11415#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 74: Hoare triple {11415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11416#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 75: Hoare triple {11416#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11416#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 76: Hoare triple {11416#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11416#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 77: Hoare triple {11416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11417#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,743 INFO L273 TraceCheckUtils]: 78: Hoare triple {11417#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11417#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,743 INFO L273 TraceCheckUtils]: 79: Hoare triple {11417#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {11417#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 80: Hoare triple {11417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11418#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 81: Hoare triple {11418#(<= main_~i~0 26)} assume !(~i~0 < 100000); {11392#false} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 82: Hoare triple {11392#false} havoc ~x~0;~x~0 := 0; {11392#false} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 83: Hoare triple {11392#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {11392#false} is VALID [2018-11-23 11:59:07,745 INFO L256 TraceCheckUtils]: 84: Hoare triple {11392#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {11392#false} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 85: Hoare triple {11392#false} ~cond := #in~cond; {11392#false} is VALID [2018-11-23 11:59:07,746 INFO L273 TraceCheckUtils]: 86: Hoare triple {11392#false} assume 0 == ~cond; {11392#false} is VALID [2018-11-23 11:59:07,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {11392#false} assume !false; {11392#false} is VALID [2018-11-23 11:59:07,751 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:59:07,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:07,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-23 11:59:07,771 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2018-11-23 11:59:07,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:07,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:59:07,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:07,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:59:07,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:59:07,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:59:07,855 INFO L87 Difference]: Start difference. First operand 93 states and 119 transitions. Second operand 28 states. [2018-11-23 11:59:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,583 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2018-11-23 11:59:08,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:59:08,584 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2018-11-23 11:59:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:59:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2018-11-23 11:59:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:59:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2018-11-23 11:59:08,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 138 transitions. [2018-11-23 11:59:08,724 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:59:08,726 INFO L225 Difference]: With dead ends: 109 [2018-11-23 11:59:08,727 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 11:59:08,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:59:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 11:59:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-23 11:59:08,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:08,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2018-11-23 11:59:08,756 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2018-11-23 11:59:08,756 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2018-11-23 11:59:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,758 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2018-11-23 11:59:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-11-23 11:59:08,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,758 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2018-11-23 11:59:08,758 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2018-11-23 11:59:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,760 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2018-11-23 11:59:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-11-23 11:59:08,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:08,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:59:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2018-11-23 11:59:08,762 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 88 [2018-11-23 11:59:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:08,762 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2018-11-23 11:59:08,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:59:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2018-11-23 11:59:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:59:08,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:08,763 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:59:08,763 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:08,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:08,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1915839959, now seen corresponding path program 26 times [2018-11-23 11:59:08,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:08,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:08,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:08,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {12154#true} call ULTIMATE.init(); {12154#true} is VALID [2018-11-23 11:59:09,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {12154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12154#true} is VALID [2018-11-23 11:59:09,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {12154#true} assume true; {12154#true} is VALID [2018-11-23 11:59:09,916 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12154#true} {12154#true} #54#return; {12154#true} is VALID [2018-11-23 11:59:09,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {12154#true} call #t~ret6 := main(); {12154#true} is VALID [2018-11-23 11:59:09,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {12154#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12156#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {12156#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12156#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,918 INFO L273 TraceCheckUtils]: 7: Hoare triple {12156#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12156#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {12156#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12157#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {12157#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12157#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {12157#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12157#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {12157#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12158#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {12158#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12158#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {12158#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12158#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {12158#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12159#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {12159#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12159#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {12159#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12159#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {12159#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12160#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {12160#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12160#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {12160#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12160#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {12160#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12161#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {12161#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12161#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {12161#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12161#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,926 INFO L273 TraceCheckUtils]: 23: Hoare triple {12161#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12162#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,926 INFO L273 TraceCheckUtils]: 24: Hoare triple {12162#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12162#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,927 INFO L273 TraceCheckUtils]: 25: Hoare triple {12162#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12162#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,927 INFO L273 TraceCheckUtils]: 26: Hoare triple {12162#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12163#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,928 INFO L273 TraceCheckUtils]: 27: Hoare triple {12163#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12163#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {12163#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12163#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,929 INFO L273 TraceCheckUtils]: 29: Hoare triple {12163#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12164#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,930 INFO L273 TraceCheckUtils]: 30: Hoare triple {12164#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12164#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,930 INFO L273 TraceCheckUtils]: 31: Hoare triple {12164#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12164#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,931 INFO L273 TraceCheckUtils]: 32: Hoare triple {12164#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12165#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,931 INFO L273 TraceCheckUtils]: 33: Hoare triple {12165#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12165#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,932 INFO L273 TraceCheckUtils]: 34: Hoare triple {12165#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12165#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {12165#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12166#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {12166#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12166#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,934 INFO L273 TraceCheckUtils]: 37: Hoare triple {12166#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12166#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,934 INFO L273 TraceCheckUtils]: 38: Hoare triple {12166#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12167#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,935 INFO L273 TraceCheckUtils]: 39: Hoare triple {12167#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12167#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,935 INFO L273 TraceCheckUtils]: 40: Hoare triple {12167#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12167#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,936 INFO L273 TraceCheckUtils]: 41: Hoare triple {12167#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12168#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,937 INFO L273 TraceCheckUtils]: 42: Hoare triple {12168#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12168#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,937 INFO L273 TraceCheckUtils]: 43: Hoare triple {12168#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12168#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,938 INFO L273 TraceCheckUtils]: 44: Hoare triple {12168#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12169#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,938 INFO L273 TraceCheckUtils]: 45: Hoare triple {12169#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12169#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,939 INFO L273 TraceCheckUtils]: 46: Hoare triple {12169#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12169#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,940 INFO L273 TraceCheckUtils]: 47: Hoare triple {12169#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12170#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,940 INFO L273 TraceCheckUtils]: 48: Hoare triple {12170#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12170#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,941 INFO L273 TraceCheckUtils]: 49: Hoare triple {12170#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12170#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,941 INFO L273 TraceCheckUtils]: 50: Hoare triple {12170#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12171#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,942 INFO L273 TraceCheckUtils]: 51: Hoare triple {12171#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12171#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,942 INFO L273 TraceCheckUtils]: 52: Hoare triple {12171#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12171#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,943 INFO L273 TraceCheckUtils]: 53: Hoare triple {12171#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12172#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,944 INFO L273 TraceCheckUtils]: 54: Hoare triple {12172#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12172#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,944 INFO L273 TraceCheckUtils]: 55: Hoare triple {12172#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12172#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,945 INFO L273 TraceCheckUtils]: 56: Hoare triple {12172#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12173#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,945 INFO L273 TraceCheckUtils]: 57: Hoare triple {12173#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12173#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,946 INFO L273 TraceCheckUtils]: 58: Hoare triple {12173#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12173#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,946 INFO L273 TraceCheckUtils]: 59: Hoare triple {12173#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12174#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:09,947 INFO L273 TraceCheckUtils]: 60: Hoare triple {12174#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12174#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:09,947 INFO L273 TraceCheckUtils]: 61: Hoare triple {12174#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12174#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:09,950 INFO L273 TraceCheckUtils]: 62: Hoare triple {12174#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12175#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:09,951 INFO L273 TraceCheckUtils]: 63: Hoare triple {12175#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12175#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:09,951 INFO L273 TraceCheckUtils]: 64: Hoare triple {12175#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12175#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:09,951 INFO L273 TraceCheckUtils]: 65: Hoare triple {12175#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12176#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:09,952 INFO L273 TraceCheckUtils]: 66: Hoare triple {12176#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12176#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:09,952 INFO L273 TraceCheckUtils]: 67: Hoare triple {12176#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12176#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:09,952 INFO L273 TraceCheckUtils]: 68: Hoare triple {12176#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12177#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:09,953 INFO L273 TraceCheckUtils]: 69: Hoare triple {12177#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12177#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:09,953 INFO L273 TraceCheckUtils]: 70: Hoare triple {12177#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12177#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:09,954 INFO L273 TraceCheckUtils]: 71: Hoare triple {12177#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12178#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:09,955 INFO L273 TraceCheckUtils]: 72: Hoare triple {12178#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12178#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:09,955 INFO L273 TraceCheckUtils]: 73: Hoare triple {12178#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12178#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:09,956 INFO L273 TraceCheckUtils]: 74: Hoare triple {12178#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12179#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:09,956 INFO L273 TraceCheckUtils]: 75: Hoare triple {12179#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12179#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:09,957 INFO L273 TraceCheckUtils]: 76: Hoare triple {12179#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12179#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:09,957 INFO L273 TraceCheckUtils]: 77: Hoare triple {12179#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12180#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:09,958 INFO L273 TraceCheckUtils]: 78: Hoare triple {12180#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12180#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:09,958 INFO L273 TraceCheckUtils]: 79: Hoare triple {12180#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12180#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:09,959 INFO L273 TraceCheckUtils]: 80: Hoare triple {12180#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12181#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:09,960 INFO L273 TraceCheckUtils]: 81: Hoare triple {12181#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12181#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:09,960 INFO L273 TraceCheckUtils]: 82: Hoare triple {12181#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12181#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:09,961 INFO L273 TraceCheckUtils]: 83: Hoare triple {12181#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12182#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:09,961 INFO L273 TraceCheckUtils]: 84: Hoare triple {12182#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12155#false} is VALID [2018-11-23 11:59:09,962 INFO L273 TraceCheckUtils]: 85: Hoare triple {12155#false} havoc ~x~0;~x~0 := 0; {12155#false} is VALID [2018-11-23 11:59:09,962 INFO L273 TraceCheckUtils]: 86: Hoare triple {12155#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {12155#false} is VALID [2018-11-23 11:59:09,962 INFO L256 TraceCheckUtils]: 87: Hoare triple {12155#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {12155#false} is VALID [2018-11-23 11:59:09,962 INFO L273 TraceCheckUtils]: 88: Hoare triple {12155#false} ~cond := #in~cond; {12155#false} is VALID [2018-11-23 11:59:09,962 INFO L273 TraceCheckUtils]: 89: Hoare triple {12155#false} assume 0 == ~cond; {12155#false} is VALID [2018-11-23 11:59:09,963 INFO L273 TraceCheckUtils]: 90: Hoare triple {12155#false} assume !false; {12155#false} is VALID [2018-11-23 11:59:09,969 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:59:09,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:09,969 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:59:09,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:10,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:10,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:10,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:10,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {12154#true} call ULTIMATE.init(); {12154#true} is VALID [2018-11-23 11:59:10,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {12154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12154#true} is VALID [2018-11-23 11:59:10,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {12154#true} assume true; {12154#true} is VALID [2018-11-23 11:59:10,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12154#true} {12154#true} #54#return; {12154#true} is VALID [2018-11-23 11:59:10,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {12154#true} call #t~ret6 := main(); {12154#true} is VALID [2018-11-23 11:59:10,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {12154#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12156#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:10,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {12156#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12156#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:10,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {12156#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12156#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:10,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {12156#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12157#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:10,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {12157#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12157#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:10,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {12157#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12157#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:10,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {12157#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12158#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:10,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {12158#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12158#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:10,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {12158#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12158#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:10,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {12158#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12159#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:10,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {12159#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12159#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:10,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {12159#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12159#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:10,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {12159#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12160#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:10,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {12160#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12160#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:10,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {12160#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12160#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:10,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {12160#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12161#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:10,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {12161#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12161#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:10,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {12161#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12161#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:10,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {12161#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12162#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:10,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {12162#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12162#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:10,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {12162#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12162#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:10,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {12162#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12163#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:10,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {12163#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12163#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:10,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {12163#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12163#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:10,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {12163#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12164#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:10,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {12164#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12164#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:10,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {12164#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12164#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:10,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {12164#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12165#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:10,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {12165#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12165#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:10,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {12165#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12165#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:10,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {12165#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12166#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:10,307 INFO L273 TraceCheckUtils]: 36: Hoare triple {12166#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12166#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:10,308 INFO L273 TraceCheckUtils]: 37: Hoare triple {12166#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12166#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:10,309 INFO L273 TraceCheckUtils]: 38: Hoare triple {12166#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12167#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:10,309 INFO L273 TraceCheckUtils]: 39: Hoare triple {12167#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12167#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:10,309 INFO L273 TraceCheckUtils]: 40: Hoare triple {12167#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12167#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:10,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {12167#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12168#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:10,310 INFO L273 TraceCheckUtils]: 42: Hoare triple {12168#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12168#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:10,310 INFO L273 TraceCheckUtils]: 43: Hoare triple {12168#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12168#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:10,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {12168#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12169#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:10,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {12169#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12169#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:10,312 INFO L273 TraceCheckUtils]: 46: Hoare triple {12169#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12169#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:10,312 INFO L273 TraceCheckUtils]: 47: Hoare triple {12169#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12170#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:10,313 INFO L273 TraceCheckUtils]: 48: Hoare triple {12170#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12170#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:10,313 INFO L273 TraceCheckUtils]: 49: Hoare triple {12170#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12170#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:10,314 INFO L273 TraceCheckUtils]: 50: Hoare triple {12170#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12171#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:10,314 INFO L273 TraceCheckUtils]: 51: Hoare triple {12171#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12171#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:10,315 INFO L273 TraceCheckUtils]: 52: Hoare triple {12171#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12171#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:10,316 INFO L273 TraceCheckUtils]: 53: Hoare triple {12171#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12172#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:10,316 INFO L273 TraceCheckUtils]: 54: Hoare triple {12172#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12172#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:10,317 INFO L273 TraceCheckUtils]: 55: Hoare triple {12172#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12172#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:10,317 INFO L273 TraceCheckUtils]: 56: Hoare triple {12172#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12173#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:10,318 INFO L273 TraceCheckUtils]: 57: Hoare triple {12173#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12173#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:10,318 INFO L273 TraceCheckUtils]: 58: Hoare triple {12173#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12173#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:10,319 INFO L273 TraceCheckUtils]: 59: Hoare triple {12173#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12174#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:10,319 INFO L273 TraceCheckUtils]: 60: Hoare triple {12174#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12174#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:10,320 INFO L273 TraceCheckUtils]: 61: Hoare triple {12174#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12174#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:10,321 INFO L273 TraceCheckUtils]: 62: Hoare triple {12174#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12175#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:10,321 INFO L273 TraceCheckUtils]: 63: Hoare triple {12175#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12175#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:10,322 INFO L273 TraceCheckUtils]: 64: Hoare triple {12175#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12175#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:10,322 INFO L273 TraceCheckUtils]: 65: Hoare triple {12175#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12176#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:10,323 INFO L273 TraceCheckUtils]: 66: Hoare triple {12176#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12176#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:10,323 INFO L273 TraceCheckUtils]: 67: Hoare triple {12176#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12176#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:10,324 INFO L273 TraceCheckUtils]: 68: Hoare triple {12176#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12177#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:10,324 INFO L273 TraceCheckUtils]: 69: Hoare triple {12177#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12177#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:10,325 INFO L273 TraceCheckUtils]: 70: Hoare triple {12177#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12177#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:10,326 INFO L273 TraceCheckUtils]: 71: Hoare triple {12177#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12178#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:10,326 INFO L273 TraceCheckUtils]: 72: Hoare triple {12178#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12178#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:10,327 INFO L273 TraceCheckUtils]: 73: Hoare triple {12178#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12178#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:10,327 INFO L273 TraceCheckUtils]: 74: Hoare triple {12178#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12179#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:10,328 INFO L273 TraceCheckUtils]: 75: Hoare triple {12179#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12179#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:10,328 INFO L273 TraceCheckUtils]: 76: Hoare triple {12179#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12179#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:10,329 INFO L273 TraceCheckUtils]: 77: Hoare triple {12179#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12180#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:10,329 INFO L273 TraceCheckUtils]: 78: Hoare triple {12180#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12180#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:10,330 INFO L273 TraceCheckUtils]: 79: Hoare triple {12180#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12180#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:10,331 INFO L273 TraceCheckUtils]: 80: Hoare triple {12180#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12181#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:10,331 INFO L273 TraceCheckUtils]: 81: Hoare triple {12181#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12181#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:10,332 INFO L273 TraceCheckUtils]: 82: Hoare triple {12181#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12181#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:10,332 INFO L273 TraceCheckUtils]: 83: Hoare triple {12181#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12182#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:10,333 INFO L273 TraceCheckUtils]: 84: Hoare triple {12182#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12155#false} is VALID [2018-11-23 11:59:10,333 INFO L273 TraceCheckUtils]: 85: Hoare triple {12155#false} havoc ~x~0;~x~0 := 0; {12155#false} is VALID [2018-11-23 11:59:10,333 INFO L273 TraceCheckUtils]: 86: Hoare triple {12155#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {12155#false} is VALID [2018-11-23 11:59:10,334 INFO L256 TraceCheckUtils]: 87: Hoare triple {12155#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {12155#false} is VALID [2018-11-23 11:59:10,334 INFO L273 TraceCheckUtils]: 88: Hoare triple {12155#false} ~cond := #in~cond; {12155#false} is VALID [2018-11-23 11:59:10,334 INFO L273 TraceCheckUtils]: 89: Hoare triple {12155#false} assume 0 == ~cond; {12155#false} is VALID [2018-11-23 11:59:10,334 INFO L273 TraceCheckUtils]: 90: Hoare triple {12155#false} assume !false; {12155#false} is VALID [2018-11-23 11:59:10,340 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:59:10,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:10,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-23 11:59:10,359 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 91 [2018-11-23 11:59:10,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:10,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:59:10,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:10,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:59:10,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:59:10,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:59:10,443 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand 29 states. [2018-11-23 11:59:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,192 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2018-11-23 11:59:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:59:11,192 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 91 [2018-11-23 11:59:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2018-11-23 11:59:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2018-11-23 11:59:11,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 142 transitions. [2018-11-23 11:59:11,464 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:59:11,466 INFO L225 Difference]: With dead ends: 112 [2018-11-23 11:59:11,466 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 11:59:11,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:59:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 11:59:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 11:59:11,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:11,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 11:59:11,540 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 11:59:11,540 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 11:59:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,542 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2018-11-23 11:59:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2018-11-23 11:59:11,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,542 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 11:59:11,542 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 11:59:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,544 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2018-11-23 11:59:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2018-11-23 11:59:11,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:11,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 11:59:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2018-11-23 11:59:11,546 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 91 [2018-11-23 11:59:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:11,546 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2018-11-23 11:59:11,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:59:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2018-11-23 11:59:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 11:59:11,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:11,547 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:59:11,548 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:11,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:11,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1986813148, now seen corresponding path program 27 times [2018-11-23 11:59:11,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:11,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:11,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:11,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {12941#true} call ULTIMATE.init(); {12941#true} is VALID [2018-11-23 11:59:12,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {12941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12941#true} is VALID [2018-11-23 11:59:12,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {12941#true} assume true; {12941#true} is VALID [2018-11-23 11:59:12,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12941#true} {12941#true} #54#return; {12941#true} is VALID [2018-11-23 11:59:12,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {12941#true} call #t~ret6 := main(); {12941#true} is VALID [2018-11-23 11:59:12,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {12941#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12943#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:12,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {12943#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12943#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:12,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {12943#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12943#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:12,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {12943#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12944#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {12944#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12944#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {12944#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12944#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,133 INFO L273 TraceCheckUtils]: 11: Hoare triple {12944#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12945#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {12945#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12945#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {12945#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12945#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {12945#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12946#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {12946#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12946#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,135 INFO L273 TraceCheckUtils]: 16: Hoare triple {12946#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12946#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,136 INFO L273 TraceCheckUtils]: 17: Hoare triple {12946#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12947#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,136 INFO L273 TraceCheckUtils]: 18: Hoare triple {12947#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12947#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,137 INFO L273 TraceCheckUtils]: 19: Hoare triple {12947#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12947#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,137 INFO L273 TraceCheckUtils]: 20: Hoare triple {12947#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12948#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,138 INFO L273 TraceCheckUtils]: 21: Hoare triple {12948#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12948#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {12948#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12948#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {12948#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12949#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,140 INFO L273 TraceCheckUtils]: 24: Hoare triple {12949#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12949#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {12949#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12949#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {12949#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12950#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,141 INFO L273 TraceCheckUtils]: 27: Hoare triple {12950#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12950#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {12950#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12950#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {12950#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12951#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {12951#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12951#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,143 INFO L273 TraceCheckUtils]: 31: Hoare triple {12951#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12951#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {12951#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12952#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {12952#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12952#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,145 INFO L273 TraceCheckUtils]: 34: Hoare triple {12952#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12952#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {12952#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12953#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,146 INFO L273 TraceCheckUtils]: 36: Hoare triple {12953#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12953#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {12953#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12953#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {12953#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12954#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,148 INFO L273 TraceCheckUtils]: 39: Hoare triple {12954#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12954#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,148 INFO L273 TraceCheckUtils]: 40: Hoare triple {12954#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12954#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,149 INFO L273 TraceCheckUtils]: 41: Hoare triple {12954#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12955#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {12955#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12955#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,150 INFO L273 TraceCheckUtils]: 43: Hoare triple {12955#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12955#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {12955#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12956#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {12956#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12956#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {12956#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12956#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {12956#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12957#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {12957#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12957#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {12957#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12957#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,154 INFO L273 TraceCheckUtils]: 50: Hoare triple {12957#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12958#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,155 INFO L273 TraceCheckUtils]: 51: Hoare triple {12958#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12958#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,155 INFO L273 TraceCheckUtils]: 52: Hoare triple {12958#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12958#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,156 INFO L273 TraceCheckUtils]: 53: Hoare triple {12958#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12959#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,157 INFO L273 TraceCheckUtils]: 54: Hoare triple {12959#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12959#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,157 INFO L273 TraceCheckUtils]: 55: Hoare triple {12959#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12959#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,158 INFO L273 TraceCheckUtils]: 56: Hoare triple {12959#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12960#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,158 INFO L273 TraceCheckUtils]: 57: Hoare triple {12960#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12960#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,159 INFO L273 TraceCheckUtils]: 58: Hoare triple {12960#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12960#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,159 INFO L273 TraceCheckUtils]: 59: Hoare triple {12960#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12961#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,160 INFO L273 TraceCheckUtils]: 60: Hoare triple {12961#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12961#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,160 INFO L273 TraceCheckUtils]: 61: Hoare triple {12961#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12961#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,161 INFO L273 TraceCheckUtils]: 62: Hoare triple {12961#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12962#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,162 INFO L273 TraceCheckUtils]: 63: Hoare triple {12962#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12962#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,162 INFO L273 TraceCheckUtils]: 64: Hoare triple {12962#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12962#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,163 INFO L273 TraceCheckUtils]: 65: Hoare triple {12962#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12963#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:12,163 INFO L273 TraceCheckUtils]: 66: Hoare triple {12963#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12963#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:12,164 INFO L273 TraceCheckUtils]: 67: Hoare triple {12963#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12963#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:12,164 INFO L273 TraceCheckUtils]: 68: Hoare triple {12963#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12964#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:12,165 INFO L273 TraceCheckUtils]: 69: Hoare triple {12964#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12964#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:12,165 INFO L273 TraceCheckUtils]: 70: Hoare triple {12964#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12964#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:12,166 INFO L273 TraceCheckUtils]: 71: Hoare triple {12964#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12965#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:12,167 INFO L273 TraceCheckUtils]: 72: Hoare triple {12965#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12965#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:12,167 INFO L273 TraceCheckUtils]: 73: Hoare triple {12965#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12965#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:12,168 INFO L273 TraceCheckUtils]: 74: Hoare triple {12965#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12966#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:12,168 INFO L273 TraceCheckUtils]: 75: Hoare triple {12966#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12966#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:12,169 INFO L273 TraceCheckUtils]: 76: Hoare triple {12966#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12966#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:12,169 INFO L273 TraceCheckUtils]: 77: Hoare triple {12966#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12967#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:12,170 INFO L273 TraceCheckUtils]: 78: Hoare triple {12967#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12967#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:12,170 INFO L273 TraceCheckUtils]: 79: Hoare triple {12967#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12967#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:12,171 INFO L273 TraceCheckUtils]: 80: Hoare triple {12967#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12968#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:12,172 INFO L273 TraceCheckUtils]: 81: Hoare triple {12968#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12968#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:12,172 INFO L273 TraceCheckUtils]: 82: Hoare triple {12968#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12968#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:12,173 INFO L273 TraceCheckUtils]: 83: Hoare triple {12968#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12969#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:12,173 INFO L273 TraceCheckUtils]: 84: Hoare triple {12969#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12969#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:12,174 INFO L273 TraceCheckUtils]: 85: Hoare triple {12969#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12969#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:12,174 INFO L273 TraceCheckUtils]: 86: Hoare triple {12969#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12970#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:12,175 INFO L273 TraceCheckUtils]: 87: Hoare triple {12970#(<= main_~i~0 28)} assume !(~i~0 < 100000); {12942#false} is VALID [2018-11-23 11:59:12,175 INFO L273 TraceCheckUtils]: 88: Hoare triple {12942#false} havoc ~x~0;~x~0 := 0; {12942#false} is VALID [2018-11-23 11:59:12,176 INFO L273 TraceCheckUtils]: 89: Hoare triple {12942#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {12942#false} is VALID [2018-11-23 11:59:12,176 INFO L256 TraceCheckUtils]: 90: Hoare triple {12942#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {12942#false} is VALID [2018-11-23 11:59:12,176 INFO L273 TraceCheckUtils]: 91: Hoare triple {12942#false} ~cond := #in~cond; {12942#false} is VALID [2018-11-23 11:59:12,176 INFO L273 TraceCheckUtils]: 92: Hoare triple {12942#false} assume 0 == ~cond; {12942#false} is VALID [2018-11-23 11:59:12,176 INFO L273 TraceCheckUtils]: 93: Hoare triple {12942#false} assume !false; {12942#false} is VALID [2018-11-23 11:59:12,183 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:59:12,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:12,183 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:59:12,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:12,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 11:59:12,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:12,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {12941#true} call ULTIMATE.init(); {12941#true} is VALID [2018-11-23 11:59:12,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {12941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12941#true} is VALID [2018-11-23 11:59:12,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {12941#true} assume true; {12941#true} is VALID [2018-11-23 11:59:12,478 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12941#true} {12941#true} #54#return; {12941#true} is VALID [2018-11-23 11:59:12,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {12941#true} call #t~ret6 := main(); {12941#true} is VALID [2018-11-23 11:59:12,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {12941#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12943#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:12,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {12943#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12943#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:12,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {12943#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12943#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:12,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {12943#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12944#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {12944#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12944#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {12944#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12944#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {12944#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12945#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {12945#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12945#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {12945#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12945#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {12945#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12946#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {12946#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12946#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {12946#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12946#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {12946#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12947#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {12947#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12947#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {12947#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12947#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {12947#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12948#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {12948#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12948#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {12948#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12948#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {12948#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12949#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {12949#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12949#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,489 INFO L273 TraceCheckUtils]: 25: Hoare triple {12949#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12949#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {12949#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12950#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,490 INFO L273 TraceCheckUtils]: 27: Hoare triple {12950#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12950#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,490 INFO L273 TraceCheckUtils]: 28: Hoare triple {12950#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12950#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,491 INFO L273 TraceCheckUtils]: 29: Hoare triple {12950#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12951#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {12951#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12951#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,492 INFO L273 TraceCheckUtils]: 31: Hoare triple {12951#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12951#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,496 INFO L273 TraceCheckUtils]: 32: Hoare triple {12951#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12952#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,497 INFO L273 TraceCheckUtils]: 33: Hoare triple {12952#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12952#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,497 INFO L273 TraceCheckUtils]: 34: Hoare triple {12952#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12952#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,497 INFO L273 TraceCheckUtils]: 35: Hoare triple {12952#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12953#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,498 INFO L273 TraceCheckUtils]: 36: Hoare triple {12953#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12953#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,498 INFO L273 TraceCheckUtils]: 37: Hoare triple {12953#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12953#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,498 INFO L273 TraceCheckUtils]: 38: Hoare triple {12953#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12954#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,499 INFO L273 TraceCheckUtils]: 39: Hoare triple {12954#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12954#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,499 INFO L273 TraceCheckUtils]: 40: Hoare triple {12954#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12954#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,499 INFO L273 TraceCheckUtils]: 41: Hoare triple {12954#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12955#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,500 INFO L273 TraceCheckUtils]: 42: Hoare triple {12955#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12955#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,500 INFO L273 TraceCheckUtils]: 43: Hoare triple {12955#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12955#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,501 INFO L273 TraceCheckUtils]: 44: Hoare triple {12955#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12956#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,501 INFO L273 TraceCheckUtils]: 45: Hoare triple {12956#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12956#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,502 INFO L273 TraceCheckUtils]: 46: Hoare triple {12956#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12956#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,503 INFO L273 TraceCheckUtils]: 47: Hoare triple {12956#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12957#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,503 INFO L273 TraceCheckUtils]: 48: Hoare triple {12957#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12957#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,504 INFO L273 TraceCheckUtils]: 49: Hoare triple {12957#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12957#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,504 INFO L273 TraceCheckUtils]: 50: Hoare triple {12957#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12958#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,505 INFO L273 TraceCheckUtils]: 51: Hoare triple {12958#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12958#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,505 INFO L273 TraceCheckUtils]: 52: Hoare triple {12958#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12958#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,506 INFO L273 TraceCheckUtils]: 53: Hoare triple {12958#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12959#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,507 INFO L273 TraceCheckUtils]: 54: Hoare triple {12959#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12959#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,507 INFO L273 TraceCheckUtils]: 55: Hoare triple {12959#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12959#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,508 INFO L273 TraceCheckUtils]: 56: Hoare triple {12959#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12960#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,508 INFO L273 TraceCheckUtils]: 57: Hoare triple {12960#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12960#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,509 INFO L273 TraceCheckUtils]: 58: Hoare triple {12960#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12960#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,510 INFO L273 TraceCheckUtils]: 59: Hoare triple {12960#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12961#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,510 INFO L273 TraceCheckUtils]: 60: Hoare triple {12961#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12961#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,511 INFO L273 TraceCheckUtils]: 61: Hoare triple {12961#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12961#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,511 INFO L273 TraceCheckUtils]: 62: Hoare triple {12961#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12962#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,512 INFO L273 TraceCheckUtils]: 63: Hoare triple {12962#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12962#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,513 INFO L273 TraceCheckUtils]: 64: Hoare triple {12962#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12962#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,513 INFO L273 TraceCheckUtils]: 65: Hoare triple {12962#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12963#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:12,514 INFO L273 TraceCheckUtils]: 66: Hoare triple {12963#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12963#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:12,514 INFO L273 TraceCheckUtils]: 67: Hoare triple {12963#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12963#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:12,515 INFO L273 TraceCheckUtils]: 68: Hoare triple {12963#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12964#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:12,516 INFO L273 TraceCheckUtils]: 69: Hoare triple {12964#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12964#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:12,516 INFO L273 TraceCheckUtils]: 70: Hoare triple {12964#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12964#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:12,517 INFO L273 TraceCheckUtils]: 71: Hoare triple {12964#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12965#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:12,517 INFO L273 TraceCheckUtils]: 72: Hoare triple {12965#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12965#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:12,518 INFO L273 TraceCheckUtils]: 73: Hoare triple {12965#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12965#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:12,519 INFO L273 TraceCheckUtils]: 74: Hoare triple {12965#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12966#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:12,519 INFO L273 TraceCheckUtils]: 75: Hoare triple {12966#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12966#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:12,520 INFO L273 TraceCheckUtils]: 76: Hoare triple {12966#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12966#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:12,520 INFO L273 TraceCheckUtils]: 77: Hoare triple {12966#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12967#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:12,521 INFO L273 TraceCheckUtils]: 78: Hoare triple {12967#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12967#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:12,521 INFO L273 TraceCheckUtils]: 79: Hoare triple {12967#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12967#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:12,522 INFO L273 TraceCheckUtils]: 80: Hoare triple {12967#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12968#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:12,523 INFO L273 TraceCheckUtils]: 81: Hoare triple {12968#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12968#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:12,523 INFO L273 TraceCheckUtils]: 82: Hoare triple {12968#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12968#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:12,524 INFO L273 TraceCheckUtils]: 83: Hoare triple {12968#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12969#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:12,524 INFO L273 TraceCheckUtils]: 84: Hoare triple {12969#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12969#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:12,525 INFO L273 TraceCheckUtils]: 85: Hoare triple {12969#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {12969#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:12,526 INFO L273 TraceCheckUtils]: 86: Hoare triple {12969#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12970#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:12,526 INFO L273 TraceCheckUtils]: 87: Hoare triple {12970#(<= main_~i~0 28)} assume !(~i~0 < 100000); {12942#false} is VALID [2018-11-23 11:59:12,527 INFO L273 TraceCheckUtils]: 88: Hoare triple {12942#false} havoc ~x~0;~x~0 := 0; {12942#false} is VALID [2018-11-23 11:59:12,527 INFO L273 TraceCheckUtils]: 89: Hoare triple {12942#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {12942#false} is VALID [2018-11-23 11:59:12,527 INFO L256 TraceCheckUtils]: 90: Hoare triple {12942#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {12942#false} is VALID [2018-11-23 11:59:12,527 INFO L273 TraceCheckUtils]: 91: Hoare triple {12942#false} ~cond := #in~cond; {12942#false} is VALID [2018-11-23 11:59:12,527 INFO L273 TraceCheckUtils]: 92: Hoare triple {12942#false} assume 0 == ~cond; {12942#false} is VALID [2018-11-23 11:59:12,528 INFO L273 TraceCheckUtils]: 93: Hoare triple {12942#false} assume !false; {12942#false} is VALID [2018-11-23 11:59:12,534 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:59:12,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:12,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-11-23 11:59:12,554 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-11-23 11:59:12,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:12,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:59:12,644 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:59:12,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:59:12,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:59:12,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:59:12,646 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand 30 states. [2018-11-23 11:59:14,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,463 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2018-11-23 11:59:14,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:59:14,463 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-11-23 11:59:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:59:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 146 transitions. [2018-11-23 11:59:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:59:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 146 transitions. [2018-11-23 11:59:14,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 146 transitions. [2018-11-23 11:59:14,595 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:59:14,597 INFO L225 Difference]: With dead ends: 115 [2018-11-23 11:59:14,597 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:59:14,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:59:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:59:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-23 11:59:14,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:14,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-23 11:59:14,636 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-23 11:59:14,636 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-23 11:59:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,638 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 11:59:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 11:59:14,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:14,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:14,639 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-23 11:59:14,639 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-23 11:59:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,640 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 11:59:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 11:59:14,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:14,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:14,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:14,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:59:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2018-11-23 11:59:14,642 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 94 [2018-11-23 11:59:14,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:14,642 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2018-11-23 11:59:14,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:59:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2018-11-23 11:59:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 11:59:14,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:14,644 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:59:14,644 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:14,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:14,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1160821065, now seen corresponding path program 28 times [2018-11-23 11:59:14,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:14,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:14,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:14,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:14,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:15,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {13752#true} call ULTIMATE.init(); {13752#true} is VALID [2018-11-23 11:59:15,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {13752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13752#true} is VALID [2018-11-23 11:59:15,181 INFO L273 TraceCheckUtils]: 2: Hoare triple {13752#true} assume true; {13752#true} is VALID [2018-11-23 11:59:15,182 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13752#true} {13752#true} #54#return; {13752#true} is VALID [2018-11-23 11:59:15,182 INFO L256 TraceCheckUtils]: 4: Hoare triple {13752#true} call #t~ret6 := main(); {13752#true} is VALID [2018-11-23 11:59:15,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {13752#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13754#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:15,183 INFO L273 TraceCheckUtils]: 6: Hoare triple {13754#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13754#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:15,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {13754#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13754#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:15,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {13754#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13755#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {13755#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13755#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {13755#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13755#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {13755#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13756#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {13756#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13756#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {13756#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13756#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {13756#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13757#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {13757#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13757#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {13757#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13757#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {13757#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13758#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {13758#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13758#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {13758#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13758#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {13758#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13759#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:15,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {13759#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13759#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:15,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {13759#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13759#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:15,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {13759#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13760#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:15,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {13760#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13760#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:15,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {13760#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13760#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:15,195 INFO L273 TraceCheckUtils]: 26: Hoare triple {13760#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13761#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:15,195 INFO L273 TraceCheckUtils]: 27: Hoare triple {13761#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13761#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:15,196 INFO L273 TraceCheckUtils]: 28: Hoare triple {13761#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13761#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:15,197 INFO L273 TraceCheckUtils]: 29: Hoare triple {13761#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13762#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:15,197 INFO L273 TraceCheckUtils]: 30: Hoare triple {13762#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13762#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:15,198 INFO L273 TraceCheckUtils]: 31: Hoare triple {13762#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13762#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:15,198 INFO L273 TraceCheckUtils]: 32: Hoare triple {13762#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13763#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:15,199 INFO L273 TraceCheckUtils]: 33: Hoare triple {13763#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13763#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:15,200 INFO L273 TraceCheckUtils]: 34: Hoare triple {13763#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13763#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:15,200 INFO L273 TraceCheckUtils]: 35: Hoare triple {13763#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13764#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:15,201 INFO L273 TraceCheckUtils]: 36: Hoare triple {13764#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13764#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:15,201 INFO L273 TraceCheckUtils]: 37: Hoare triple {13764#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13764#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:15,202 INFO L273 TraceCheckUtils]: 38: Hoare triple {13764#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13765#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:15,203 INFO L273 TraceCheckUtils]: 39: Hoare triple {13765#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13765#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:15,203 INFO L273 TraceCheckUtils]: 40: Hoare triple {13765#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13765#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:15,204 INFO L273 TraceCheckUtils]: 41: Hoare triple {13765#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13766#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:15,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {13766#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13766#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:15,205 INFO L273 TraceCheckUtils]: 43: Hoare triple {13766#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13766#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:15,206 INFO L273 TraceCheckUtils]: 44: Hoare triple {13766#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13767#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:15,206 INFO L273 TraceCheckUtils]: 45: Hoare triple {13767#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13767#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:15,207 INFO L273 TraceCheckUtils]: 46: Hoare triple {13767#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13767#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:15,208 INFO L273 TraceCheckUtils]: 47: Hoare triple {13767#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13768#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:15,208 INFO L273 TraceCheckUtils]: 48: Hoare triple {13768#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13768#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:15,209 INFO L273 TraceCheckUtils]: 49: Hoare triple {13768#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13768#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:15,209 INFO L273 TraceCheckUtils]: 50: Hoare triple {13768#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13769#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:15,210 INFO L273 TraceCheckUtils]: 51: Hoare triple {13769#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13769#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:15,211 INFO L273 TraceCheckUtils]: 52: Hoare triple {13769#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13769#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:15,211 INFO L273 TraceCheckUtils]: 53: Hoare triple {13769#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13770#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:15,212 INFO L273 TraceCheckUtils]: 54: Hoare triple {13770#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13770#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:15,212 INFO L273 TraceCheckUtils]: 55: Hoare triple {13770#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13770#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:15,213 INFO L273 TraceCheckUtils]: 56: Hoare triple {13770#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13771#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:15,214 INFO L273 TraceCheckUtils]: 57: Hoare triple {13771#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13771#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:15,214 INFO L273 TraceCheckUtils]: 58: Hoare triple {13771#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13771#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:15,215 INFO L273 TraceCheckUtils]: 59: Hoare triple {13771#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13772#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:15,215 INFO L273 TraceCheckUtils]: 60: Hoare triple {13772#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13772#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:15,216 INFO L273 TraceCheckUtils]: 61: Hoare triple {13772#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13772#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:15,217 INFO L273 TraceCheckUtils]: 62: Hoare triple {13772#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13773#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:15,217 INFO L273 TraceCheckUtils]: 63: Hoare triple {13773#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13773#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:15,218 INFO L273 TraceCheckUtils]: 64: Hoare triple {13773#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13773#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:15,218 INFO L273 TraceCheckUtils]: 65: Hoare triple {13773#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13774#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:15,219 INFO L273 TraceCheckUtils]: 66: Hoare triple {13774#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13774#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:15,219 INFO L273 TraceCheckUtils]: 67: Hoare triple {13774#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13774#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:15,220 INFO L273 TraceCheckUtils]: 68: Hoare triple {13774#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13775#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:15,221 INFO L273 TraceCheckUtils]: 69: Hoare triple {13775#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13775#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:15,221 INFO L273 TraceCheckUtils]: 70: Hoare triple {13775#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13775#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:15,222 INFO L273 TraceCheckUtils]: 71: Hoare triple {13775#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13776#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:15,223 INFO L273 TraceCheckUtils]: 72: Hoare triple {13776#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13776#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:15,223 INFO L273 TraceCheckUtils]: 73: Hoare triple {13776#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13776#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:15,224 INFO L273 TraceCheckUtils]: 74: Hoare triple {13776#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13777#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:15,224 INFO L273 TraceCheckUtils]: 75: Hoare triple {13777#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13777#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:15,225 INFO L273 TraceCheckUtils]: 76: Hoare triple {13777#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13777#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:15,226 INFO L273 TraceCheckUtils]: 77: Hoare triple {13777#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13778#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:15,226 INFO L273 TraceCheckUtils]: 78: Hoare triple {13778#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13778#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:15,227 INFO L273 TraceCheckUtils]: 79: Hoare triple {13778#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13778#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:15,227 INFO L273 TraceCheckUtils]: 80: Hoare triple {13778#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13779#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:15,228 INFO L273 TraceCheckUtils]: 81: Hoare triple {13779#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13779#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:15,228 INFO L273 TraceCheckUtils]: 82: Hoare triple {13779#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13779#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:15,229 INFO L273 TraceCheckUtils]: 83: Hoare triple {13779#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13780#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:15,230 INFO L273 TraceCheckUtils]: 84: Hoare triple {13780#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13780#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:15,249 INFO L273 TraceCheckUtils]: 85: Hoare triple {13780#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13780#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:15,258 INFO L273 TraceCheckUtils]: 86: Hoare triple {13780#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13781#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:15,272 INFO L273 TraceCheckUtils]: 87: Hoare triple {13781#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13781#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:15,280 INFO L273 TraceCheckUtils]: 88: Hoare triple {13781#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13781#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:15,280 INFO L273 TraceCheckUtils]: 89: Hoare triple {13781#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13782#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:15,281 INFO L273 TraceCheckUtils]: 90: Hoare triple {13782#(<= main_~i~0 29)} assume !(~i~0 < 100000); {13753#false} is VALID [2018-11-23 11:59:15,281 INFO L273 TraceCheckUtils]: 91: Hoare triple {13753#false} havoc ~x~0;~x~0 := 0; {13753#false} is VALID [2018-11-23 11:59:15,281 INFO L273 TraceCheckUtils]: 92: Hoare triple {13753#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {13753#false} is VALID [2018-11-23 11:59:15,281 INFO L256 TraceCheckUtils]: 93: Hoare triple {13753#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {13753#false} is VALID [2018-11-23 11:59:15,281 INFO L273 TraceCheckUtils]: 94: Hoare triple {13753#false} ~cond := #in~cond; {13753#false} is VALID [2018-11-23 11:59:15,281 INFO L273 TraceCheckUtils]: 95: Hoare triple {13753#false} assume 0 == ~cond; {13753#false} is VALID [2018-11-23 11:59:15,282 INFO L273 TraceCheckUtils]: 96: Hoare triple {13753#false} assume !false; {13753#false} is VALID [2018-11-23 11:59:15,288 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:59:15,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:15,288 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:59:15,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:15,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:15,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:15,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:15,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {13752#true} call ULTIMATE.init(); {13752#true} is VALID [2018-11-23 11:59:15,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {13752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13752#true} is VALID [2018-11-23 11:59:15,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {13752#true} assume true; {13752#true} is VALID [2018-11-23 11:59:15,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13752#true} {13752#true} #54#return; {13752#true} is VALID [2018-11-23 11:59:15,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {13752#true} call #t~ret6 := main(); {13752#true} is VALID [2018-11-23 11:59:15,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {13752#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13754#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:15,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {13754#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13754#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:15,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {13754#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13754#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:15,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {13754#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13755#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {13755#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13755#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,639 INFO L273 TraceCheckUtils]: 10: Hoare triple {13755#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13755#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {13755#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13756#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {13756#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13756#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {13756#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13756#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {13756#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13757#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {13757#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13757#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {13757#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13757#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {13757#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13758#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {13758#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13758#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {13758#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13758#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {13758#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13759#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:15,645 INFO L273 TraceCheckUtils]: 21: Hoare triple {13759#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13759#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:15,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {13759#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13759#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:15,646 INFO L273 TraceCheckUtils]: 23: Hoare triple {13759#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13760#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:15,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {13760#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13760#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:15,647 INFO L273 TraceCheckUtils]: 25: Hoare triple {13760#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13760#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:15,648 INFO L273 TraceCheckUtils]: 26: Hoare triple {13760#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13761#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:15,649 INFO L273 TraceCheckUtils]: 27: Hoare triple {13761#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13761#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:15,649 INFO L273 TraceCheckUtils]: 28: Hoare triple {13761#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13761#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:15,650 INFO L273 TraceCheckUtils]: 29: Hoare triple {13761#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13762#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:15,650 INFO L273 TraceCheckUtils]: 30: Hoare triple {13762#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13762#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:15,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {13762#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13762#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:15,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {13762#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13763#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:15,652 INFO L273 TraceCheckUtils]: 33: Hoare triple {13763#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13763#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:15,653 INFO L273 TraceCheckUtils]: 34: Hoare triple {13763#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13763#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:15,653 INFO L273 TraceCheckUtils]: 35: Hoare triple {13763#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13764#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:15,654 INFO L273 TraceCheckUtils]: 36: Hoare triple {13764#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13764#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:15,655 INFO L273 TraceCheckUtils]: 37: Hoare triple {13764#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13764#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:15,655 INFO L273 TraceCheckUtils]: 38: Hoare triple {13764#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13765#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:15,656 INFO L273 TraceCheckUtils]: 39: Hoare triple {13765#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13765#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:15,656 INFO L273 TraceCheckUtils]: 40: Hoare triple {13765#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13765#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:15,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {13765#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13766#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:15,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {13766#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13766#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:15,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {13766#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13766#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:15,659 INFO L273 TraceCheckUtils]: 44: Hoare triple {13766#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13767#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:15,659 INFO L273 TraceCheckUtils]: 45: Hoare triple {13767#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13767#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:15,660 INFO L273 TraceCheckUtils]: 46: Hoare triple {13767#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13767#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:15,660 INFO L273 TraceCheckUtils]: 47: Hoare triple {13767#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13768#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:15,661 INFO L273 TraceCheckUtils]: 48: Hoare triple {13768#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13768#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:15,662 INFO L273 TraceCheckUtils]: 49: Hoare triple {13768#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13768#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:15,662 INFO L273 TraceCheckUtils]: 50: Hoare triple {13768#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13769#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:15,663 INFO L273 TraceCheckUtils]: 51: Hoare triple {13769#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13769#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:15,663 INFO L273 TraceCheckUtils]: 52: Hoare triple {13769#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13769#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:15,664 INFO L273 TraceCheckUtils]: 53: Hoare triple {13769#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13770#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:15,665 INFO L273 TraceCheckUtils]: 54: Hoare triple {13770#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13770#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:15,665 INFO L273 TraceCheckUtils]: 55: Hoare triple {13770#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13770#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:15,666 INFO L273 TraceCheckUtils]: 56: Hoare triple {13770#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13771#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:15,666 INFO L273 TraceCheckUtils]: 57: Hoare triple {13771#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13771#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:15,667 INFO L273 TraceCheckUtils]: 58: Hoare triple {13771#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13771#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:15,668 INFO L273 TraceCheckUtils]: 59: Hoare triple {13771#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13772#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:15,668 INFO L273 TraceCheckUtils]: 60: Hoare triple {13772#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13772#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:15,669 INFO L273 TraceCheckUtils]: 61: Hoare triple {13772#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13772#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:15,669 INFO L273 TraceCheckUtils]: 62: Hoare triple {13772#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13773#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:15,670 INFO L273 TraceCheckUtils]: 63: Hoare triple {13773#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13773#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:15,671 INFO L273 TraceCheckUtils]: 64: Hoare triple {13773#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13773#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:15,671 INFO L273 TraceCheckUtils]: 65: Hoare triple {13773#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13774#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:15,672 INFO L273 TraceCheckUtils]: 66: Hoare triple {13774#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13774#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:15,673 INFO L273 TraceCheckUtils]: 67: Hoare triple {13774#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13774#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:15,673 INFO L273 TraceCheckUtils]: 68: Hoare triple {13774#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13775#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:15,674 INFO L273 TraceCheckUtils]: 69: Hoare triple {13775#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13775#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:15,674 INFO L273 TraceCheckUtils]: 70: Hoare triple {13775#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13775#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:15,675 INFO L273 TraceCheckUtils]: 71: Hoare triple {13775#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13776#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:15,676 INFO L273 TraceCheckUtils]: 72: Hoare triple {13776#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13776#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:15,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {13776#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13776#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:15,677 INFO L273 TraceCheckUtils]: 74: Hoare triple {13776#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13777#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:15,677 INFO L273 TraceCheckUtils]: 75: Hoare triple {13777#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13777#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:15,678 INFO L273 TraceCheckUtils]: 76: Hoare triple {13777#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13777#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:15,678 INFO L273 TraceCheckUtils]: 77: Hoare triple {13777#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13778#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:15,679 INFO L273 TraceCheckUtils]: 78: Hoare triple {13778#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13778#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:15,680 INFO L273 TraceCheckUtils]: 79: Hoare triple {13778#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13778#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:15,680 INFO L273 TraceCheckUtils]: 80: Hoare triple {13778#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13779#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:15,681 INFO L273 TraceCheckUtils]: 81: Hoare triple {13779#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13779#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:15,681 INFO L273 TraceCheckUtils]: 82: Hoare triple {13779#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13779#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:15,682 INFO L273 TraceCheckUtils]: 83: Hoare triple {13779#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13780#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:15,683 INFO L273 TraceCheckUtils]: 84: Hoare triple {13780#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13780#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:15,683 INFO L273 TraceCheckUtils]: 85: Hoare triple {13780#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13780#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:15,684 INFO L273 TraceCheckUtils]: 86: Hoare triple {13780#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13781#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:15,684 INFO L273 TraceCheckUtils]: 87: Hoare triple {13781#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13781#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:15,685 INFO L273 TraceCheckUtils]: 88: Hoare triple {13781#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {13781#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:15,685 INFO L273 TraceCheckUtils]: 89: Hoare triple {13781#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13782#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:15,686 INFO L273 TraceCheckUtils]: 90: Hoare triple {13782#(<= main_~i~0 29)} assume !(~i~0 < 100000); {13753#false} is VALID [2018-11-23 11:59:15,686 INFO L273 TraceCheckUtils]: 91: Hoare triple {13753#false} havoc ~x~0;~x~0 := 0; {13753#false} is VALID [2018-11-23 11:59:15,687 INFO L273 TraceCheckUtils]: 92: Hoare triple {13753#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {13753#false} is VALID [2018-11-23 11:59:15,687 INFO L256 TraceCheckUtils]: 93: Hoare triple {13753#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {13753#false} is VALID [2018-11-23 11:59:15,687 INFO L273 TraceCheckUtils]: 94: Hoare triple {13753#false} ~cond := #in~cond; {13753#false} is VALID [2018-11-23 11:59:15,687 INFO L273 TraceCheckUtils]: 95: Hoare triple {13753#false} assume 0 == ~cond; {13753#false} is VALID [2018-11-23 11:59:15,687 INFO L273 TraceCheckUtils]: 96: Hoare triple {13753#false} assume !false; {13753#false} is VALID [2018-11-23 11:59:15,695 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:59:15,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:15,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 11:59:15,714 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-11-23 11:59:15,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:15,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:59:15,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:15,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:59:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:59:15,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:59:15,810 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand 31 states. [2018-11-23 11:59:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:16,638 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2018-11-23 11:59:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:59:16,638 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-11-23 11:59:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:59:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 150 transitions. [2018-11-23 11:59:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:59:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 150 transitions. [2018-11-23 11:59:16,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 150 transitions. [2018-11-23 11:59:16,791 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:59:16,793 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:59:16,793 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 11:59:16,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:59:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 11:59:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-23 11:59:16,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:16,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 105 states. [2018-11-23 11:59:16,819 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 105 states. [2018-11-23 11:59:16,819 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 105 states. [2018-11-23 11:59:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:16,821 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2018-11-23 11:59:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2018-11-23 11:59:16,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:16,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:16,821 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 107 states. [2018-11-23 11:59:16,821 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 107 states. [2018-11-23 11:59:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:16,823 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2018-11-23 11:59:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2018-11-23 11:59:16,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:16,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:16,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:16,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 11:59:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-23 11:59:16,825 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 97 [2018-11-23 11:59:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:16,826 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-23 11:59:16,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:59:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-23 11:59:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 11:59:16,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:16,827 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:59:16,827 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:16,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash 101684804, now seen corresponding path program 29 times [2018-11-23 11:59:16,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:16,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:16,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:16,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:16,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:17,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {14587#true} call ULTIMATE.init(); {14587#true} is VALID [2018-11-23 11:59:17,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {14587#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14587#true} is VALID [2018-11-23 11:59:17,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {14587#true} assume true; {14587#true} is VALID [2018-11-23 11:59:17,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14587#true} {14587#true} #54#return; {14587#true} is VALID [2018-11-23 11:59:17,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {14587#true} call #t~ret6 := main(); {14587#true} is VALID [2018-11-23 11:59:17,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {14587#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14589#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:17,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {14589#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14589#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:17,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {14589#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14589#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:17,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {14589#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14590#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:17,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {14590#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14590#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:17,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {14590#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14590#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:17,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {14590#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14591#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:17,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {14591#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14591#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:17,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {14591#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14591#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:17,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {14591#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14592#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:17,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {14592#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14592#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:17,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {14592#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14592#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:17,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {14592#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14593#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:17,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {14593#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14593#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:17,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {14593#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14593#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:17,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {14593#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14594#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:17,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {14594#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14594#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:17,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {14594#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14594#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:17,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {14594#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14595#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:17,688 INFO L273 TraceCheckUtils]: 24: Hoare triple {14595#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14595#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:17,689 INFO L273 TraceCheckUtils]: 25: Hoare triple {14595#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14595#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:17,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {14595#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14596#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:17,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {14596#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14596#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:17,708 INFO L273 TraceCheckUtils]: 28: Hoare triple {14596#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14596#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:17,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {14596#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14597#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:17,721 INFO L273 TraceCheckUtils]: 30: Hoare triple {14597#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14597#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:17,721 INFO L273 TraceCheckUtils]: 31: Hoare triple {14597#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14597#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:17,722 INFO L273 TraceCheckUtils]: 32: Hoare triple {14597#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14598#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:17,722 INFO L273 TraceCheckUtils]: 33: Hoare triple {14598#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14598#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:17,722 INFO L273 TraceCheckUtils]: 34: Hoare triple {14598#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14598#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:17,723 INFO L273 TraceCheckUtils]: 35: Hoare triple {14598#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14599#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:17,723 INFO L273 TraceCheckUtils]: 36: Hoare triple {14599#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14599#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:17,724 INFO L273 TraceCheckUtils]: 37: Hoare triple {14599#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14599#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:17,724 INFO L273 TraceCheckUtils]: 38: Hoare triple {14599#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14600#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:17,724 INFO L273 TraceCheckUtils]: 39: Hoare triple {14600#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14600#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:17,725 INFO L273 TraceCheckUtils]: 40: Hoare triple {14600#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14600#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:17,725 INFO L273 TraceCheckUtils]: 41: Hoare triple {14600#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14601#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:17,726 INFO L273 TraceCheckUtils]: 42: Hoare triple {14601#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14601#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:17,727 INFO L273 TraceCheckUtils]: 43: Hoare triple {14601#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14601#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:17,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {14601#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14602#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:17,728 INFO L273 TraceCheckUtils]: 45: Hoare triple {14602#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14602#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:17,729 INFO L273 TraceCheckUtils]: 46: Hoare triple {14602#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14602#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:17,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {14602#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14603#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:17,730 INFO L273 TraceCheckUtils]: 48: Hoare triple {14603#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14603#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:17,731 INFO L273 TraceCheckUtils]: 49: Hoare triple {14603#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14603#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:17,732 INFO L273 TraceCheckUtils]: 50: Hoare triple {14603#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14604#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:17,732 INFO L273 TraceCheckUtils]: 51: Hoare triple {14604#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14604#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:17,733 INFO L273 TraceCheckUtils]: 52: Hoare triple {14604#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14604#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:17,734 INFO L273 TraceCheckUtils]: 53: Hoare triple {14604#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14605#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:17,734 INFO L273 TraceCheckUtils]: 54: Hoare triple {14605#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14605#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:17,735 INFO L273 TraceCheckUtils]: 55: Hoare triple {14605#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14605#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:17,736 INFO L273 TraceCheckUtils]: 56: Hoare triple {14605#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14606#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:17,736 INFO L273 TraceCheckUtils]: 57: Hoare triple {14606#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14606#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:17,737 INFO L273 TraceCheckUtils]: 58: Hoare triple {14606#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14606#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:17,738 INFO L273 TraceCheckUtils]: 59: Hoare triple {14606#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14607#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:17,738 INFO L273 TraceCheckUtils]: 60: Hoare triple {14607#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14607#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:17,739 INFO L273 TraceCheckUtils]: 61: Hoare triple {14607#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14607#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:17,740 INFO L273 TraceCheckUtils]: 62: Hoare triple {14607#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14608#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:17,740 INFO L273 TraceCheckUtils]: 63: Hoare triple {14608#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14608#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:17,741 INFO L273 TraceCheckUtils]: 64: Hoare triple {14608#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14608#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:17,742 INFO L273 TraceCheckUtils]: 65: Hoare triple {14608#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14609#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:17,742 INFO L273 TraceCheckUtils]: 66: Hoare triple {14609#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14609#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:17,743 INFO L273 TraceCheckUtils]: 67: Hoare triple {14609#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14609#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:17,744 INFO L273 TraceCheckUtils]: 68: Hoare triple {14609#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14610#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:17,744 INFO L273 TraceCheckUtils]: 69: Hoare triple {14610#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14610#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:17,745 INFO L273 TraceCheckUtils]: 70: Hoare triple {14610#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14610#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:17,746 INFO L273 TraceCheckUtils]: 71: Hoare triple {14610#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14611#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:17,747 INFO L273 TraceCheckUtils]: 72: Hoare triple {14611#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14611#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:17,747 INFO L273 TraceCheckUtils]: 73: Hoare triple {14611#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14611#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:17,748 INFO L273 TraceCheckUtils]: 74: Hoare triple {14611#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14612#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:17,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {14612#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14612#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:17,749 INFO L273 TraceCheckUtils]: 76: Hoare triple {14612#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14612#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:17,750 INFO L273 TraceCheckUtils]: 77: Hoare triple {14612#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14613#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:17,751 INFO L273 TraceCheckUtils]: 78: Hoare triple {14613#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14613#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:17,751 INFO L273 TraceCheckUtils]: 79: Hoare triple {14613#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14613#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:17,752 INFO L273 TraceCheckUtils]: 80: Hoare triple {14613#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14614#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:17,753 INFO L273 TraceCheckUtils]: 81: Hoare triple {14614#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14614#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:17,753 INFO L273 TraceCheckUtils]: 82: Hoare triple {14614#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14614#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:17,754 INFO L273 TraceCheckUtils]: 83: Hoare triple {14614#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14615#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:17,755 INFO L273 TraceCheckUtils]: 84: Hoare triple {14615#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14615#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:17,773 INFO L273 TraceCheckUtils]: 85: Hoare triple {14615#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14615#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:17,782 INFO L273 TraceCheckUtils]: 86: Hoare triple {14615#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14616#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:17,796 INFO L273 TraceCheckUtils]: 87: Hoare triple {14616#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14616#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:17,805 INFO L273 TraceCheckUtils]: 88: Hoare triple {14616#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14616#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:17,819 INFO L273 TraceCheckUtils]: 89: Hoare triple {14616#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14617#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:17,828 INFO L273 TraceCheckUtils]: 90: Hoare triple {14617#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14617#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:17,842 INFO L273 TraceCheckUtils]: 91: Hoare triple {14617#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14617#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:17,851 INFO L273 TraceCheckUtils]: 92: Hoare triple {14617#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14618#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:17,866 INFO L273 TraceCheckUtils]: 93: Hoare triple {14618#(<= main_~i~0 30)} assume !(~i~0 < 100000); {14588#false} is VALID [2018-11-23 11:59:17,866 INFO L273 TraceCheckUtils]: 94: Hoare triple {14588#false} havoc ~x~0;~x~0 := 0; {14588#false} is VALID [2018-11-23 11:59:17,866 INFO L273 TraceCheckUtils]: 95: Hoare triple {14588#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {14588#false} is VALID [2018-11-23 11:59:17,867 INFO L256 TraceCheckUtils]: 96: Hoare triple {14588#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {14588#false} is VALID [2018-11-23 11:59:17,867 INFO L273 TraceCheckUtils]: 97: Hoare triple {14588#false} ~cond := #in~cond; {14588#false} is VALID [2018-11-23 11:59:17,867 INFO L273 TraceCheckUtils]: 98: Hoare triple {14588#false} assume 0 == ~cond; {14588#false} is VALID [2018-11-23 11:59:17,867 INFO L273 TraceCheckUtils]: 99: Hoare triple {14588#false} assume !false; {14588#false} is VALID [2018-11-23 11:59:17,883 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:59:17,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:17,883 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:59:17,901 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:18,050 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 11:59:18,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:18,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:18,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {14587#true} call ULTIMATE.init(); {14587#true} is VALID [2018-11-23 11:59:18,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {14587#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14587#true} is VALID [2018-11-23 11:59:18,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {14587#true} assume true; {14587#true} is VALID [2018-11-23 11:59:18,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14587#true} {14587#true} #54#return; {14587#true} is VALID [2018-11-23 11:59:18,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {14587#true} call #t~ret6 := main(); {14587#true} is VALID [2018-11-23 11:59:18,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {14587#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14589#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:18,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {14589#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14589#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:18,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {14589#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14589#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:18,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {14589#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14590#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {14590#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14590#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {14590#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14590#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {14590#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14591#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {14591#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14591#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {14591#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14591#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,561 INFO L273 TraceCheckUtils]: 14: Hoare triple {14591#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14592#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {14592#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14592#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {14592#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14592#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {14592#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14593#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:18,563 INFO L273 TraceCheckUtils]: 18: Hoare triple {14593#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14593#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:18,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {14593#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14593#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:18,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {14593#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14594#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:18,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {14594#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14594#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:18,565 INFO L273 TraceCheckUtils]: 22: Hoare triple {14594#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14594#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:18,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {14594#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14595#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:18,566 INFO L273 TraceCheckUtils]: 24: Hoare triple {14595#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14595#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:18,567 INFO L273 TraceCheckUtils]: 25: Hoare triple {14595#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14595#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:18,568 INFO L273 TraceCheckUtils]: 26: Hoare triple {14595#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14596#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:18,568 INFO L273 TraceCheckUtils]: 27: Hoare triple {14596#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14596#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:18,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {14596#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14596#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:18,569 INFO L273 TraceCheckUtils]: 29: Hoare triple {14596#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14597#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:18,570 INFO L273 TraceCheckUtils]: 30: Hoare triple {14597#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14597#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:18,593 INFO L273 TraceCheckUtils]: 31: Hoare triple {14597#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14597#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:18,597 INFO L273 TraceCheckUtils]: 32: Hoare triple {14597#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14598#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:18,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {14598#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14598#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:18,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {14598#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14598#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:18,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {14598#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14599#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:18,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {14599#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14599#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:18,599 INFO L273 TraceCheckUtils]: 37: Hoare triple {14599#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14599#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:18,599 INFO L273 TraceCheckUtils]: 38: Hoare triple {14599#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14600#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:18,600 INFO L273 TraceCheckUtils]: 39: Hoare triple {14600#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14600#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:18,600 INFO L273 TraceCheckUtils]: 40: Hoare triple {14600#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14600#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:18,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {14600#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14601#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:18,601 INFO L273 TraceCheckUtils]: 42: Hoare triple {14601#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14601#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:18,601 INFO L273 TraceCheckUtils]: 43: Hoare triple {14601#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14601#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:18,602 INFO L273 TraceCheckUtils]: 44: Hoare triple {14601#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14602#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:18,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {14602#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14602#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:18,635 INFO L273 TraceCheckUtils]: 46: Hoare triple {14602#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14602#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:18,635 INFO L273 TraceCheckUtils]: 47: Hoare triple {14602#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14603#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:18,636 INFO L273 TraceCheckUtils]: 48: Hoare triple {14603#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14603#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:18,636 INFO L273 TraceCheckUtils]: 49: Hoare triple {14603#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14603#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:18,636 INFO L273 TraceCheckUtils]: 50: Hoare triple {14603#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14604#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:18,637 INFO L273 TraceCheckUtils]: 51: Hoare triple {14604#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14604#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:18,637 INFO L273 TraceCheckUtils]: 52: Hoare triple {14604#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14604#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:18,637 INFO L273 TraceCheckUtils]: 53: Hoare triple {14604#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14605#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:18,638 INFO L273 TraceCheckUtils]: 54: Hoare triple {14605#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14605#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:18,638 INFO L273 TraceCheckUtils]: 55: Hoare triple {14605#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14605#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:18,638 INFO L273 TraceCheckUtils]: 56: Hoare triple {14605#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14606#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:18,639 INFO L273 TraceCheckUtils]: 57: Hoare triple {14606#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14606#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:18,639 INFO L273 TraceCheckUtils]: 58: Hoare triple {14606#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14606#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:18,640 INFO L273 TraceCheckUtils]: 59: Hoare triple {14606#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14607#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:18,640 INFO L273 TraceCheckUtils]: 60: Hoare triple {14607#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14607#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:18,641 INFO L273 TraceCheckUtils]: 61: Hoare triple {14607#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14607#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:18,642 INFO L273 TraceCheckUtils]: 62: Hoare triple {14607#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14608#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:18,642 INFO L273 TraceCheckUtils]: 63: Hoare triple {14608#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14608#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:18,643 INFO L273 TraceCheckUtils]: 64: Hoare triple {14608#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14608#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:18,643 INFO L273 TraceCheckUtils]: 65: Hoare triple {14608#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14609#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:18,644 INFO L273 TraceCheckUtils]: 66: Hoare triple {14609#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14609#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:18,644 INFO L273 TraceCheckUtils]: 67: Hoare triple {14609#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14609#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:18,645 INFO L273 TraceCheckUtils]: 68: Hoare triple {14609#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14610#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:18,646 INFO L273 TraceCheckUtils]: 69: Hoare triple {14610#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14610#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:18,646 INFO L273 TraceCheckUtils]: 70: Hoare triple {14610#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14610#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:18,647 INFO L273 TraceCheckUtils]: 71: Hoare triple {14610#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14611#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:18,647 INFO L273 TraceCheckUtils]: 72: Hoare triple {14611#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14611#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:18,648 INFO L273 TraceCheckUtils]: 73: Hoare triple {14611#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14611#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:18,649 INFO L273 TraceCheckUtils]: 74: Hoare triple {14611#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14612#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:18,649 INFO L273 TraceCheckUtils]: 75: Hoare triple {14612#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14612#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:18,650 INFO L273 TraceCheckUtils]: 76: Hoare triple {14612#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14612#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:18,650 INFO L273 TraceCheckUtils]: 77: Hoare triple {14612#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14613#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:18,651 INFO L273 TraceCheckUtils]: 78: Hoare triple {14613#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14613#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:18,651 INFO L273 TraceCheckUtils]: 79: Hoare triple {14613#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14613#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:18,652 INFO L273 TraceCheckUtils]: 80: Hoare triple {14613#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14614#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:18,653 INFO L273 TraceCheckUtils]: 81: Hoare triple {14614#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14614#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:18,653 INFO L273 TraceCheckUtils]: 82: Hoare triple {14614#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14614#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:18,654 INFO L273 TraceCheckUtils]: 83: Hoare triple {14614#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14615#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:18,654 INFO L273 TraceCheckUtils]: 84: Hoare triple {14615#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14615#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:18,655 INFO L273 TraceCheckUtils]: 85: Hoare triple {14615#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14615#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:18,656 INFO L273 TraceCheckUtils]: 86: Hoare triple {14615#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14616#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:18,656 INFO L273 TraceCheckUtils]: 87: Hoare triple {14616#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14616#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:18,657 INFO L273 TraceCheckUtils]: 88: Hoare triple {14616#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14616#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:18,657 INFO L273 TraceCheckUtils]: 89: Hoare triple {14616#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14617#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:18,658 INFO L273 TraceCheckUtils]: 90: Hoare triple {14617#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14617#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:18,658 INFO L273 TraceCheckUtils]: 91: Hoare triple {14617#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {14617#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:18,659 INFO L273 TraceCheckUtils]: 92: Hoare triple {14617#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14618#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:18,659 INFO L273 TraceCheckUtils]: 93: Hoare triple {14618#(<= main_~i~0 30)} assume !(~i~0 < 100000); {14588#false} is VALID [2018-11-23 11:59:18,660 INFO L273 TraceCheckUtils]: 94: Hoare triple {14588#false} havoc ~x~0;~x~0 := 0; {14588#false} is VALID [2018-11-23 11:59:18,660 INFO L273 TraceCheckUtils]: 95: Hoare triple {14588#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {14588#false} is VALID [2018-11-23 11:59:18,660 INFO L256 TraceCheckUtils]: 96: Hoare triple {14588#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {14588#false} is VALID [2018-11-23 11:59:18,660 INFO L273 TraceCheckUtils]: 97: Hoare triple {14588#false} ~cond := #in~cond; {14588#false} is VALID [2018-11-23 11:59:18,660 INFO L273 TraceCheckUtils]: 98: Hoare triple {14588#false} assume 0 == ~cond; {14588#false} is VALID [2018-11-23 11:59:18,661 INFO L273 TraceCheckUtils]: 99: Hoare triple {14588#false} assume !false; {14588#false} is VALID [2018-11-23 11:59:18,668 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:59:18,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:18,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-11-23 11:59:18,687 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 100 [2018-11-23 11:59:18,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:18,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:59:18,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:18,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:59:18,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:59:18,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:59:18,799 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 32 states. [2018-11-23 11:59:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:19,380 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-11-23 11:59:19,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:59:19,380 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 100 [2018-11-23 11:59:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 154 transitions. [2018-11-23 11:59:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 154 transitions. [2018-11-23 11:59:19,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 154 transitions. [2018-11-23 11:59:19,516 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:59:19,518 INFO L225 Difference]: With dead ends: 121 [2018-11-23 11:59:19,518 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 11:59:19,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:59:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 11:59:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-11-23 11:59:19,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:19,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 108 states. [2018-11-23 11:59:19,544 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 108 states. [2018-11-23 11:59:19,545 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 108 states. [2018-11-23 11:59:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:19,547 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 11:59:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2018-11-23 11:59:19,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:19,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:19,548 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 110 states. [2018-11-23 11:59:19,548 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 110 states. [2018-11-23 11:59:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:19,549 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 11:59:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2018-11-23 11:59:19,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:19,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:19,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:19,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 11:59:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2018-11-23 11:59:19,552 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 100 [2018-11-23 11:59:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:19,553 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2018-11-23 11:59:19,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:59:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2018-11-23 11:59:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 11:59:19,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:19,554 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:59:19,554 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:19,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash 385417111, now seen corresponding path program 30 times [2018-11-23 11:59:19,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:19,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:19,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:20,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {15446#true} call ULTIMATE.init(); {15446#true} is VALID [2018-11-23 11:59:20,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {15446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15446#true} is VALID [2018-11-23 11:59:20,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {15446#true} assume true; {15446#true} is VALID [2018-11-23 11:59:20,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15446#true} {15446#true} #54#return; {15446#true} is VALID [2018-11-23 11:59:20,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {15446#true} call #t~ret6 := main(); {15446#true} is VALID [2018-11-23 11:59:20,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {15446#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15448#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:20,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {15448#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15448#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:20,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {15448#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15448#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:20,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {15448#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15449#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {15449#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15449#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {15449#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15449#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {15449#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15450#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {15450#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15450#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {15450#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15450#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {15450#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15451#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {15451#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15451#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {15451#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15451#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {15451#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15452#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {15452#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15452#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {15452#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15452#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {15452#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15453#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {15453#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15453#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {15453#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15453#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {15453#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15454#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:20,227 INFO L273 TraceCheckUtils]: 24: Hoare triple {15454#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15454#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:20,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {15454#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15454#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:20,228 INFO L273 TraceCheckUtils]: 26: Hoare triple {15454#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15455#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:20,229 INFO L273 TraceCheckUtils]: 27: Hoare triple {15455#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15455#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:20,229 INFO L273 TraceCheckUtils]: 28: Hoare triple {15455#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15455#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:20,230 INFO L273 TraceCheckUtils]: 29: Hoare triple {15455#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15456#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:20,230 INFO L273 TraceCheckUtils]: 30: Hoare triple {15456#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15456#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:20,231 INFO L273 TraceCheckUtils]: 31: Hoare triple {15456#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15456#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:20,231 INFO L273 TraceCheckUtils]: 32: Hoare triple {15456#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15457#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:20,232 INFO L273 TraceCheckUtils]: 33: Hoare triple {15457#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15457#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:20,232 INFO L273 TraceCheckUtils]: 34: Hoare triple {15457#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15457#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:20,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {15457#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15458#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:20,233 INFO L273 TraceCheckUtils]: 36: Hoare triple {15458#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15458#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:20,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {15458#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15458#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:20,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {15458#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15459#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:20,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {15459#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15459#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:20,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {15459#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15459#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:20,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {15459#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15460#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:20,237 INFO L273 TraceCheckUtils]: 42: Hoare triple {15460#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15460#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:20,237 INFO L273 TraceCheckUtils]: 43: Hoare triple {15460#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15460#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:20,238 INFO L273 TraceCheckUtils]: 44: Hoare triple {15460#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15461#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:20,238 INFO L273 TraceCheckUtils]: 45: Hoare triple {15461#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15461#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:20,239 INFO L273 TraceCheckUtils]: 46: Hoare triple {15461#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15461#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:20,239 INFO L273 TraceCheckUtils]: 47: Hoare triple {15461#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15462#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:20,240 INFO L273 TraceCheckUtils]: 48: Hoare triple {15462#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15462#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:20,240 INFO L273 TraceCheckUtils]: 49: Hoare triple {15462#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15462#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:20,241 INFO L273 TraceCheckUtils]: 50: Hoare triple {15462#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15463#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:20,241 INFO L273 TraceCheckUtils]: 51: Hoare triple {15463#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15463#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:20,242 INFO L273 TraceCheckUtils]: 52: Hoare triple {15463#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15463#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:20,242 INFO L273 TraceCheckUtils]: 53: Hoare triple {15463#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15464#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:20,243 INFO L273 TraceCheckUtils]: 54: Hoare triple {15464#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15464#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:20,243 INFO L273 TraceCheckUtils]: 55: Hoare triple {15464#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15464#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:20,244 INFO L273 TraceCheckUtils]: 56: Hoare triple {15464#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15465#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:20,245 INFO L273 TraceCheckUtils]: 57: Hoare triple {15465#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15465#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:20,245 INFO L273 TraceCheckUtils]: 58: Hoare triple {15465#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15465#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:20,246 INFO L273 TraceCheckUtils]: 59: Hoare triple {15465#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15466#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:20,246 INFO L273 TraceCheckUtils]: 60: Hoare triple {15466#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15466#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:20,247 INFO L273 TraceCheckUtils]: 61: Hoare triple {15466#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15466#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:20,247 INFO L273 TraceCheckUtils]: 62: Hoare triple {15466#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15467#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:20,248 INFO L273 TraceCheckUtils]: 63: Hoare triple {15467#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15467#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:20,248 INFO L273 TraceCheckUtils]: 64: Hoare triple {15467#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15467#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:20,249 INFO L273 TraceCheckUtils]: 65: Hoare triple {15467#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15468#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:20,249 INFO L273 TraceCheckUtils]: 66: Hoare triple {15468#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15468#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:20,250 INFO L273 TraceCheckUtils]: 67: Hoare triple {15468#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15468#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:20,251 INFO L273 TraceCheckUtils]: 68: Hoare triple {15468#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15469#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:20,251 INFO L273 TraceCheckUtils]: 69: Hoare triple {15469#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15469#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:20,251 INFO L273 TraceCheckUtils]: 70: Hoare triple {15469#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15469#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:20,252 INFO L273 TraceCheckUtils]: 71: Hoare triple {15469#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15470#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:20,253 INFO L273 TraceCheckUtils]: 72: Hoare triple {15470#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15470#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:20,253 INFO L273 TraceCheckUtils]: 73: Hoare triple {15470#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15470#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:20,254 INFO L273 TraceCheckUtils]: 74: Hoare triple {15470#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15471#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:20,254 INFO L273 TraceCheckUtils]: 75: Hoare triple {15471#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15471#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:20,255 INFO L273 TraceCheckUtils]: 76: Hoare triple {15471#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15471#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:20,255 INFO L273 TraceCheckUtils]: 77: Hoare triple {15471#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15472#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:20,256 INFO L273 TraceCheckUtils]: 78: Hoare triple {15472#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15472#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:20,256 INFO L273 TraceCheckUtils]: 79: Hoare triple {15472#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15472#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:20,257 INFO L273 TraceCheckUtils]: 80: Hoare triple {15472#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15473#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:20,257 INFO L273 TraceCheckUtils]: 81: Hoare triple {15473#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15473#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:20,258 INFO L273 TraceCheckUtils]: 82: Hoare triple {15473#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15473#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:20,259 INFO L273 TraceCheckUtils]: 83: Hoare triple {15473#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15474#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:20,259 INFO L273 TraceCheckUtils]: 84: Hoare triple {15474#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15474#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:20,260 INFO L273 TraceCheckUtils]: 85: Hoare triple {15474#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15474#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:20,260 INFO L273 TraceCheckUtils]: 86: Hoare triple {15474#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15475#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:20,261 INFO L273 TraceCheckUtils]: 87: Hoare triple {15475#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15475#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:20,261 INFO L273 TraceCheckUtils]: 88: Hoare triple {15475#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15475#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:20,262 INFO L273 TraceCheckUtils]: 89: Hoare triple {15475#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15476#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:20,262 INFO L273 TraceCheckUtils]: 90: Hoare triple {15476#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15476#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:20,263 INFO L273 TraceCheckUtils]: 91: Hoare triple {15476#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15476#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:20,263 INFO L273 TraceCheckUtils]: 92: Hoare triple {15476#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15477#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:20,264 INFO L273 TraceCheckUtils]: 93: Hoare triple {15477#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15477#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:20,264 INFO L273 TraceCheckUtils]: 94: Hoare triple {15477#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15477#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:20,265 INFO L273 TraceCheckUtils]: 95: Hoare triple {15477#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15478#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:20,266 INFO L273 TraceCheckUtils]: 96: Hoare triple {15478#(<= main_~i~0 31)} assume !(~i~0 < 100000); {15447#false} is VALID [2018-11-23 11:59:20,266 INFO L273 TraceCheckUtils]: 97: Hoare triple {15447#false} havoc ~x~0;~x~0 := 0; {15447#false} is VALID [2018-11-23 11:59:20,266 INFO L273 TraceCheckUtils]: 98: Hoare triple {15447#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {15447#false} is VALID [2018-11-23 11:59:20,266 INFO L256 TraceCheckUtils]: 99: Hoare triple {15447#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {15447#false} is VALID [2018-11-23 11:59:20,266 INFO L273 TraceCheckUtils]: 100: Hoare triple {15447#false} ~cond := #in~cond; {15447#false} is VALID [2018-11-23 11:59:20,267 INFO L273 TraceCheckUtils]: 101: Hoare triple {15447#false} assume 0 == ~cond; {15447#false} is VALID [2018-11-23 11:59:20,267 INFO L273 TraceCheckUtils]: 102: Hoare triple {15447#false} assume !false; {15447#false} is VALID [2018-11-23 11:59:20,275 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:59:20,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:20,275 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:59:20,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:20,356 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 11:59:20,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:20,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:20,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {15446#true} call ULTIMATE.init(); {15446#true} is VALID [2018-11-23 11:59:20,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {15446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15446#true} is VALID [2018-11-23 11:59:20,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {15446#true} assume true; {15446#true} is VALID [2018-11-23 11:59:20,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15446#true} {15446#true} #54#return; {15446#true} is VALID [2018-11-23 11:59:20,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {15446#true} call #t~ret6 := main(); {15446#true} is VALID [2018-11-23 11:59:20,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {15446#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15448#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:20,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {15448#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15448#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:20,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {15448#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15448#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:20,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {15448#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15449#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {15449#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15449#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {15449#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15449#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {15449#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15450#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {15450#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15450#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {15450#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15450#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {15450#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15451#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {15451#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15451#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {15451#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15451#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {15451#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15452#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {15452#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15452#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {15452#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15452#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {15452#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15453#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {15453#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15453#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {15453#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15453#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {15453#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15454#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:20,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {15454#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15454#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:20,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {15454#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15454#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:20,633 INFO L273 TraceCheckUtils]: 26: Hoare triple {15454#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15455#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:20,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {15455#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15455#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:20,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {15455#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15455#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:20,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {15455#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15456#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:20,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {15456#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15456#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:20,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {15456#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15456#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:20,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {15456#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15457#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:20,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {15457#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15457#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:20,638 INFO L273 TraceCheckUtils]: 34: Hoare triple {15457#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15457#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:20,638 INFO L273 TraceCheckUtils]: 35: Hoare triple {15457#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15458#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:20,639 INFO L273 TraceCheckUtils]: 36: Hoare triple {15458#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15458#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:20,639 INFO L273 TraceCheckUtils]: 37: Hoare triple {15458#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15458#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:20,640 INFO L273 TraceCheckUtils]: 38: Hoare triple {15458#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15459#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:20,641 INFO L273 TraceCheckUtils]: 39: Hoare triple {15459#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15459#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:20,641 INFO L273 TraceCheckUtils]: 40: Hoare triple {15459#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15459#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:20,642 INFO L273 TraceCheckUtils]: 41: Hoare triple {15459#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15460#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:20,642 INFO L273 TraceCheckUtils]: 42: Hoare triple {15460#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15460#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:20,643 INFO L273 TraceCheckUtils]: 43: Hoare triple {15460#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15460#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:20,643 INFO L273 TraceCheckUtils]: 44: Hoare triple {15460#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15461#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:20,644 INFO L273 TraceCheckUtils]: 45: Hoare triple {15461#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15461#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:20,644 INFO L273 TraceCheckUtils]: 46: Hoare triple {15461#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15461#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:20,645 INFO L273 TraceCheckUtils]: 47: Hoare triple {15461#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15462#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:20,646 INFO L273 TraceCheckUtils]: 48: Hoare triple {15462#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15462#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:20,646 INFO L273 TraceCheckUtils]: 49: Hoare triple {15462#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15462#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:20,647 INFO L273 TraceCheckUtils]: 50: Hoare triple {15462#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15463#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:20,647 INFO L273 TraceCheckUtils]: 51: Hoare triple {15463#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15463#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:20,648 INFO L273 TraceCheckUtils]: 52: Hoare triple {15463#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15463#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:20,648 INFO L273 TraceCheckUtils]: 53: Hoare triple {15463#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15464#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:20,649 INFO L273 TraceCheckUtils]: 54: Hoare triple {15464#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15464#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:20,649 INFO L273 TraceCheckUtils]: 55: Hoare triple {15464#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15464#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:20,650 INFO L273 TraceCheckUtils]: 56: Hoare triple {15464#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15465#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:20,650 INFO L273 TraceCheckUtils]: 57: Hoare triple {15465#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15465#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:20,651 INFO L273 TraceCheckUtils]: 58: Hoare triple {15465#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15465#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:20,652 INFO L273 TraceCheckUtils]: 59: Hoare triple {15465#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15466#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:20,652 INFO L273 TraceCheckUtils]: 60: Hoare triple {15466#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15466#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:20,653 INFO L273 TraceCheckUtils]: 61: Hoare triple {15466#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15466#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:20,653 INFO L273 TraceCheckUtils]: 62: Hoare triple {15466#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15467#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:20,654 INFO L273 TraceCheckUtils]: 63: Hoare triple {15467#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15467#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:20,654 INFO L273 TraceCheckUtils]: 64: Hoare triple {15467#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15467#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:20,655 INFO L273 TraceCheckUtils]: 65: Hoare triple {15467#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15468#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:20,656 INFO L273 TraceCheckUtils]: 66: Hoare triple {15468#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15468#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:20,656 INFO L273 TraceCheckUtils]: 67: Hoare triple {15468#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15468#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:20,657 INFO L273 TraceCheckUtils]: 68: Hoare triple {15468#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15469#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:20,657 INFO L273 TraceCheckUtils]: 69: Hoare triple {15469#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15469#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:20,658 INFO L273 TraceCheckUtils]: 70: Hoare triple {15469#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15469#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:20,659 INFO L273 TraceCheckUtils]: 71: Hoare triple {15469#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15470#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:20,659 INFO L273 TraceCheckUtils]: 72: Hoare triple {15470#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15470#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:20,659 INFO L273 TraceCheckUtils]: 73: Hoare triple {15470#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15470#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:20,660 INFO L273 TraceCheckUtils]: 74: Hoare triple {15470#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15471#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:20,661 INFO L273 TraceCheckUtils]: 75: Hoare triple {15471#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15471#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:20,661 INFO L273 TraceCheckUtils]: 76: Hoare triple {15471#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15471#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:20,662 INFO L273 TraceCheckUtils]: 77: Hoare triple {15471#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15472#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:20,662 INFO L273 TraceCheckUtils]: 78: Hoare triple {15472#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15472#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:20,663 INFO L273 TraceCheckUtils]: 79: Hoare triple {15472#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15472#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:20,663 INFO L273 TraceCheckUtils]: 80: Hoare triple {15472#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15473#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:20,664 INFO L273 TraceCheckUtils]: 81: Hoare triple {15473#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15473#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:20,664 INFO L273 TraceCheckUtils]: 82: Hoare triple {15473#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15473#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:20,665 INFO L273 TraceCheckUtils]: 83: Hoare triple {15473#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15474#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:20,666 INFO L273 TraceCheckUtils]: 84: Hoare triple {15474#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15474#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:20,666 INFO L273 TraceCheckUtils]: 85: Hoare triple {15474#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15474#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:20,667 INFO L273 TraceCheckUtils]: 86: Hoare triple {15474#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15475#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:20,667 INFO L273 TraceCheckUtils]: 87: Hoare triple {15475#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15475#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:20,668 INFO L273 TraceCheckUtils]: 88: Hoare triple {15475#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15475#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:20,669 INFO L273 TraceCheckUtils]: 89: Hoare triple {15475#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15476#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:20,669 INFO L273 TraceCheckUtils]: 90: Hoare triple {15476#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15476#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:20,670 INFO L273 TraceCheckUtils]: 91: Hoare triple {15476#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15476#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:20,670 INFO L273 TraceCheckUtils]: 92: Hoare triple {15476#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15477#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:20,671 INFO L273 TraceCheckUtils]: 93: Hoare triple {15477#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15477#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:20,671 INFO L273 TraceCheckUtils]: 94: Hoare triple {15477#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {15477#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:20,672 INFO L273 TraceCheckUtils]: 95: Hoare triple {15477#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15478#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:20,672 INFO L273 TraceCheckUtils]: 96: Hoare triple {15478#(<= main_~i~0 31)} assume !(~i~0 < 100000); {15447#false} is VALID [2018-11-23 11:59:20,673 INFO L273 TraceCheckUtils]: 97: Hoare triple {15447#false} havoc ~x~0;~x~0 := 0; {15447#false} is VALID [2018-11-23 11:59:20,673 INFO L273 TraceCheckUtils]: 98: Hoare triple {15447#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {15447#false} is VALID [2018-11-23 11:59:20,673 INFO L256 TraceCheckUtils]: 99: Hoare triple {15447#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {15447#false} is VALID [2018-11-23 11:59:20,673 INFO L273 TraceCheckUtils]: 100: Hoare triple {15447#false} ~cond := #in~cond; {15447#false} is VALID [2018-11-23 11:59:20,673 INFO L273 TraceCheckUtils]: 101: Hoare triple {15447#false} assume 0 == ~cond; {15447#false} is VALID [2018-11-23 11:59:20,674 INFO L273 TraceCheckUtils]: 102: Hoare triple {15447#false} assume !false; {15447#false} is VALID [2018-11-23 11:59:20,682 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:59:20,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:20,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-23 11:59:20,701 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 103 [2018-11-23 11:59:20,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:20,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:59:20,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:20,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:59:20,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:59:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:59:20,802 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand 33 states. [2018-11-23 11:59:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:21,699 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-23 11:59:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:59:21,699 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 103 [2018-11-23 11:59:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:59:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 158 transitions. [2018-11-23 11:59:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:59:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 158 transitions. [2018-11-23 11:59:21,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 158 transitions. [2018-11-23 11:59:21,855 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:59:21,858 INFO L225 Difference]: With dead ends: 124 [2018-11-23 11:59:21,858 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 11:59:21,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:59:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 11:59:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 11:59:21,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:21,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 11:59:21,901 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 11:59:21,902 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 11:59:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:21,904 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2018-11-23 11:59:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-11-23 11:59:21,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:21,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:21,905 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 11:59:21,905 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 11:59:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:21,906 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2018-11-23 11:59:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-11-23 11:59:21,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:21,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:21,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:21,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:59:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2018-11-23 11:59:21,908 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 103 [2018-11-23 11:59:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:21,908 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2018-11-23 11:59:21,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:59:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2018-11-23 11:59:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 11:59:21,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:21,909 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:59:21,910 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:21,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 558936420, now seen corresponding path program 31 times [2018-11-23 11:59:21,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:21,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:21,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:23,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {16329#true} call ULTIMATE.init(); {16329#true} is VALID [2018-11-23 11:59:23,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {16329#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16329#true} is VALID [2018-11-23 11:59:23,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {16329#true} assume true; {16329#true} is VALID [2018-11-23 11:59:23,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16329#true} {16329#true} #54#return; {16329#true} is VALID [2018-11-23 11:59:23,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {16329#true} call #t~ret6 := main(); {16329#true} is VALID [2018-11-23 11:59:23,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {16329#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16331#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:23,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {16331#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16331#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:23,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {16331#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16331#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:23,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {16331#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16332#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:23,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {16332#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16332#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:23,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {16332#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16332#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:23,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {16332#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16333#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:23,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {16333#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16333#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:23,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {16333#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16333#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:23,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {16333#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16334#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:23,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {16334#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16334#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:23,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {16334#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16334#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:23,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {16334#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16335#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:23,975 INFO L273 TraceCheckUtils]: 18: Hoare triple {16335#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16335#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:23,976 INFO L273 TraceCheckUtils]: 19: Hoare triple {16335#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16335#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:23,976 INFO L273 TraceCheckUtils]: 20: Hoare triple {16335#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16336#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:23,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {16336#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16336#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:23,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {16336#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16336#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:23,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {16336#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16337#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:23,978 INFO L273 TraceCheckUtils]: 24: Hoare triple {16337#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16337#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:23,979 INFO L273 TraceCheckUtils]: 25: Hoare triple {16337#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16337#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:23,979 INFO L273 TraceCheckUtils]: 26: Hoare triple {16337#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16338#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:23,980 INFO L273 TraceCheckUtils]: 27: Hoare triple {16338#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16338#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:23,980 INFO L273 TraceCheckUtils]: 28: Hoare triple {16338#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16338#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:23,981 INFO L273 TraceCheckUtils]: 29: Hoare triple {16338#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16339#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:23,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {16339#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16339#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:23,982 INFO L273 TraceCheckUtils]: 31: Hoare triple {16339#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16339#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:23,983 INFO L273 TraceCheckUtils]: 32: Hoare triple {16339#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16340#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:23,983 INFO L273 TraceCheckUtils]: 33: Hoare triple {16340#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16340#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:23,984 INFO L273 TraceCheckUtils]: 34: Hoare triple {16340#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16340#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:23,984 INFO L273 TraceCheckUtils]: 35: Hoare triple {16340#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16341#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:23,985 INFO L273 TraceCheckUtils]: 36: Hoare triple {16341#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16341#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:23,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {16341#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16341#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:23,986 INFO L273 TraceCheckUtils]: 38: Hoare triple {16341#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16342#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:23,987 INFO L273 TraceCheckUtils]: 39: Hoare triple {16342#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16342#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:23,987 INFO L273 TraceCheckUtils]: 40: Hoare triple {16342#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16342#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:23,988 INFO L273 TraceCheckUtils]: 41: Hoare triple {16342#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16343#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:23,988 INFO L273 TraceCheckUtils]: 42: Hoare triple {16343#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16343#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:23,989 INFO L273 TraceCheckUtils]: 43: Hoare triple {16343#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16343#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:23,990 INFO L273 TraceCheckUtils]: 44: Hoare triple {16343#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16344#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:23,990 INFO L273 TraceCheckUtils]: 45: Hoare triple {16344#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16344#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:23,991 INFO L273 TraceCheckUtils]: 46: Hoare triple {16344#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16344#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:23,991 INFO L273 TraceCheckUtils]: 47: Hoare triple {16344#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16345#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:23,992 INFO L273 TraceCheckUtils]: 48: Hoare triple {16345#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16345#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:23,992 INFO L273 TraceCheckUtils]: 49: Hoare triple {16345#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16345#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:23,993 INFO L273 TraceCheckUtils]: 50: Hoare triple {16345#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16346#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:23,993 INFO L273 TraceCheckUtils]: 51: Hoare triple {16346#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16346#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:23,994 INFO L273 TraceCheckUtils]: 52: Hoare triple {16346#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16346#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:23,995 INFO L273 TraceCheckUtils]: 53: Hoare triple {16346#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16347#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:23,995 INFO L273 TraceCheckUtils]: 54: Hoare triple {16347#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16347#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:23,996 INFO L273 TraceCheckUtils]: 55: Hoare triple {16347#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16347#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:23,996 INFO L273 TraceCheckUtils]: 56: Hoare triple {16347#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16348#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:23,997 INFO L273 TraceCheckUtils]: 57: Hoare triple {16348#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16348#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:23,997 INFO L273 TraceCheckUtils]: 58: Hoare triple {16348#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16348#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:23,998 INFO L273 TraceCheckUtils]: 59: Hoare triple {16348#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16349#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:23,998 INFO L273 TraceCheckUtils]: 60: Hoare triple {16349#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16349#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:23,999 INFO L273 TraceCheckUtils]: 61: Hoare triple {16349#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16349#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:24,000 INFO L273 TraceCheckUtils]: 62: Hoare triple {16349#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16350#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:24,000 INFO L273 TraceCheckUtils]: 63: Hoare triple {16350#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16350#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:24,001 INFO L273 TraceCheckUtils]: 64: Hoare triple {16350#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16350#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:24,001 INFO L273 TraceCheckUtils]: 65: Hoare triple {16350#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16351#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:24,002 INFO L273 TraceCheckUtils]: 66: Hoare triple {16351#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16351#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:24,002 INFO L273 TraceCheckUtils]: 67: Hoare triple {16351#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16351#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:24,003 INFO L273 TraceCheckUtils]: 68: Hoare triple {16351#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16352#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:24,003 INFO L273 TraceCheckUtils]: 69: Hoare triple {16352#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16352#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:24,004 INFO L273 TraceCheckUtils]: 70: Hoare triple {16352#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16352#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:24,004 INFO L273 TraceCheckUtils]: 71: Hoare triple {16352#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16353#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:24,005 INFO L273 TraceCheckUtils]: 72: Hoare triple {16353#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16353#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:24,005 INFO L273 TraceCheckUtils]: 73: Hoare triple {16353#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16353#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:24,006 INFO L273 TraceCheckUtils]: 74: Hoare triple {16353#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16354#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:24,007 INFO L273 TraceCheckUtils]: 75: Hoare triple {16354#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16354#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:24,007 INFO L273 TraceCheckUtils]: 76: Hoare triple {16354#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16354#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:24,008 INFO L273 TraceCheckUtils]: 77: Hoare triple {16354#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16355#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:24,008 INFO L273 TraceCheckUtils]: 78: Hoare triple {16355#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16355#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:24,009 INFO L273 TraceCheckUtils]: 79: Hoare triple {16355#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16355#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:24,009 INFO L273 TraceCheckUtils]: 80: Hoare triple {16355#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16356#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:24,010 INFO L273 TraceCheckUtils]: 81: Hoare triple {16356#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16356#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:24,010 INFO L273 TraceCheckUtils]: 82: Hoare triple {16356#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16356#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:24,011 INFO L273 TraceCheckUtils]: 83: Hoare triple {16356#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16357#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:24,012 INFO L273 TraceCheckUtils]: 84: Hoare triple {16357#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16357#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:24,012 INFO L273 TraceCheckUtils]: 85: Hoare triple {16357#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16357#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:24,013 INFO L273 TraceCheckUtils]: 86: Hoare triple {16357#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16358#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:24,013 INFO L273 TraceCheckUtils]: 87: Hoare triple {16358#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16358#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:24,014 INFO L273 TraceCheckUtils]: 88: Hoare triple {16358#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16358#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:24,014 INFO L273 TraceCheckUtils]: 89: Hoare triple {16358#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16359#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:24,015 INFO L273 TraceCheckUtils]: 90: Hoare triple {16359#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16359#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:24,015 INFO L273 TraceCheckUtils]: 91: Hoare triple {16359#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16359#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:24,016 INFO L273 TraceCheckUtils]: 92: Hoare triple {16359#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16360#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:24,016 INFO L273 TraceCheckUtils]: 93: Hoare triple {16360#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16360#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:24,017 INFO L273 TraceCheckUtils]: 94: Hoare triple {16360#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16360#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:24,017 INFO L273 TraceCheckUtils]: 95: Hoare triple {16360#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16361#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:24,018 INFO L273 TraceCheckUtils]: 96: Hoare triple {16361#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16361#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:24,018 INFO L273 TraceCheckUtils]: 97: Hoare triple {16361#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16361#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:24,019 INFO L273 TraceCheckUtils]: 98: Hoare triple {16361#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16362#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:24,020 INFO L273 TraceCheckUtils]: 99: Hoare triple {16362#(<= main_~i~0 32)} assume !(~i~0 < 100000); {16330#false} is VALID [2018-11-23 11:59:24,020 INFO L273 TraceCheckUtils]: 100: Hoare triple {16330#false} havoc ~x~0;~x~0 := 0; {16330#false} is VALID [2018-11-23 11:59:24,020 INFO L273 TraceCheckUtils]: 101: Hoare triple {16330#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {16330#false} is VALID [2018-11-23 11:59:24,020 INFO L256 TraceCheckUtils]: 102: Hoare triple {16330#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {16330#false} is VALID [2018-11-23 11:59:24,020 INFO L273 TraceCheckUtils]: 103: Hoare triple {16330#false} ~cond := #in~cond; {16330#false} is VALID [2018-11-23 11:59:24,021 INFO L273 TraceCheckUtils]: 104: Hoare triple {16330#false} assume 0 == ~cond; {16330#false} is VALID [2018-11-23 11:59:24,021 INFO L273 TraceCheckUtils]: 105: Hoare triple {16330#false} assume !false; {16330#false} is VALID [2018-11-23 11:59:24,030 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:59:24,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:24,030 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:59:24,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:24,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:25,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {16329#true} call ULTIMATE.init(); {16329#true} is VALID [2018-11-23 11:59:25,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {16329#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16329#true} is VALID [2018-11-23 11:59:25,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {16329#true} assume true; {16329#true} is VALID [2018-11-23 11:59:25,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16329#true} {16329#true} #54#return; {16329#true} is VALID [2018-11-23 11:59:25,277 INFO L256 TraceCheckUtils]: 4: Hoare triple {16329#true} call #t~ret6 := main(); {16329#true} is VALID [2018-11-23 11:59:25,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {16329#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16331#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:25,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {16331#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16331#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:25,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {16331#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16331#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:25,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {16331#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16332#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {16332#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16332#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {16332#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16332#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,280 INFO L273 TraceCheckUtils]: 11: Hoare triple {16332#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16333#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {16333#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16333#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {16333#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16333#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {16333#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16334#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {16334#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16334#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {16334#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16334#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {16334#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16335#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {16335#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16335#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {16335#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16335#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {16335#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16336#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,285 INFO L273 TraceCheckUtils]: 21: Hoare triple {16336#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16336#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,285 INFO L273 TraceCheckUtils]: 22: Hoare triple {16336#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16336#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,286 INFO L273 TraceCheckUtils]: 23: Hoare triple {16336#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16337#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,287 INFO L273 TraceCheckUtils]: 24: Hoare triple {16337#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16337#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,289 INFO L273 TraceCheckUtils]: 25: Hoare triple {16337#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16337#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {16337#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16338#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,290 INFO L273 TraceCheckUtils]: 27: Hoare triple {16338#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16338#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,290 INFO L273 TraceCheckUtils]: 28: Hoare triple {16338#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16338#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {16338#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16339#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,291 INFO L273 TraceCheckUtils]: 30: Hoare triple {16339#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16339#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,291 INFO L273 TraceCheckUtils]: 31: Hoare triple {16339#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16339#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,292 INFO L273 TraceCheckUtils]: 32: Hoare triple {16339#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16340#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,292 INFO L273 TraceCheckUtils]: 33: Hoare triple {16340#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16340#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {16340#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16340#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,293 INFO L273 TraceCheckUtils]: 35: Hoare triple {16340#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16341#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,294 INFO L273 TraceCheckUtils]: 36: Hoare triple {16341#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16341#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,294 INFO L273 TraceCheckUtils]: 37: Hoare triple {16341#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16341#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,295 INFO L273 TraceCheckUtils]: 38: Hoare triple {16341#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16342#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,296 INFO L273 TraceCheckUtils]: 39: Hoare triple {16342#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16342#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,296 INFO L273 TraceCheckUtils]: 40: Hoare triple {16342#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16342#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,297 INFO L273 TraceCheckUtils]: 41: Hoare triple {16342#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16343#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,297 INFO L273 TraceCheckUtils]: 42: Hoare triple {16343#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16343#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,298 INFO L273 TraceCheckUtils]: 43: Hoare triple {16343#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16343#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,298 INFO L273 TraceCheckUtils]: 44: Hoare triple {16343#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16344#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,299 INFO L273 TraceCheckUtils]: 45: Hoare triple {16344#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16344#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,299 INFO L273 TraceCheckUtils]: 46: Hoare triple {16344#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16344#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,300 INFO L273 TraceCheckUtils]: 47: Hoare triple {16344#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16345#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,301 INFO L273 TraceCheckUtils]: 48: Hoare triple {16345#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16345#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,301 INFO L273 TraceCheckUtils]: 49: Hoare triple {16345#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16345#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,302 INFO L273 TraceCheckUtils]: 50: Hoare triple {16345#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16346#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,302 INFO L273 TraceCheckUtils]: 51: Hoare triple {16346#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16346#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,303 INFO L273 TraceCheckUtils]: 52: Hoare triple {16346#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16346#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,304 INFO L273 TraceCheckUtils]: 53: Hoare triple {16346#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16347#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,304 INFO L273 TraceCheckUtils]: 54: Hoare triple {16347#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16347#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,305 INFO L273 TraceCheckUtils]: 55: Hoare triple {16347#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16347#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,305 INFO L273 TraceCheckUtils]: 56: Hoare triple {16347#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16348#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,306 INFO L273 TraceCheckUtils]: 57: Hoare triple {16348#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16348#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,306 INFO L273 TraceCheckUtils]: 58: Hoare triple {16348#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16348#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,307 INFO L273 TraceCheckUtils]: 59: Hoare triple {16348#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16349#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,308 INFO L273 TraceCheckUtils]: 60: Hoare triple {16349#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16349#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,308 INFO L273 TraceCheckUtils]: 61: Hoare triple {16349#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16349#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,309 INFO L273 TraceCheckUtils]: 62: Hoare triple {16349#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16350#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,309 INFO L273 TraceCheckUtils]: 63: Hoare triple {16350#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16350#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,310 INFO L273 TraceCheckUtils]: 64: Hoare triple {16350#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16350#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,311 INFO L273 TraceCheckUtils]: 65: Hoare triple {16350#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16351#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,311 INFO L273 TraceCheckUtils]: 66: Hoare triple {16351#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16351#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,312 INFO L273 TraceCheckUtils]: 67: Hoare triple {16351#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16351#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,312 INFO L273 TraceCheckUtils]: 68: Hoare triple {16351#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16352#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,313 INFO L273 TraceCheckUtils]: 69: Hoare triple {16352#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16352#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,313 INFO L273 TraceCheckUtils]: 70: Hoare triple {16352#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16352#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,314 INFO L273 TraceCheckUtils]: 71: Hoare triple {16352#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16353#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,315 INFO L273 TraceCheckUtils]: 72: Hoare triple {16353#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16353#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,315 INFO L273 TraceCheckUtils]: 73: Hoare triple {16353#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16353#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,316 INFO L273 TraceCheckUtils]: 74: Hoare triple {16353#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16354#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,316 INFO L273 TraceCheckUtils]: 75: Hoare triple {16354#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16354#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,317 INFO L273 TraceCheckUtils]: 76: Hoare triple {16354#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16354#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,317 INFO L273 TraceCheckUtils]: 77: Hoare triple {16354#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16355#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:25,318 INFO L273 TraceCheckUtils]: 78: Hoare triple {16355#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16355#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:25,318 INFO L273 TraceCheckUtils]: 79: Hoare triple {16355#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16355#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:25,319 INFO L273 TraceCheckUtils]: 80: Hoare triple {16355#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16356#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:25,320 INFO L273 TraceCheckUtils]: 81: Hoare triple {16356#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16356#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:25,320 INFO L273 TraceCheckUtils]: 82: Hoare triple {16356#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16356#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:25,321 INFO L273 TraceCheckUtils]: 83: Hoare triple {16356#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16357#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:25,321 INFO L273 TraceCheckUtils]: 84: Hoare triple {16357#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16357#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:25,322 INFO L273 TraceCheckUtils]: 85: Hoare triple {16357#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16357#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:25,323 INFO L273 TraceCheckUtils]: 86: Hoare triple {16357#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16358#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:25,323 INFO L273 TraceCheckUtils]: 87: Hoare triple {16358#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16358#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:25,324 INFO L273 TraceCheckUtils]: 88: Hoare triple {16358#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16358#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:25,324 INFO L273 TraceCheckUtils]: 89: Hoare triple {16358#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16359#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:25,325 INFO L273 TraceCheckUtils]: 90: Hoare triple {16359#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16359#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:25,325 INFO L273 TraceCheckUtils]: 91: Hoare triple {16359#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16359#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:25,326 INFO L273 TraceCheckUtils]: 92: Hoare triple {16359#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16360#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:25,327 INFO L273 TraceCheckUtils]: 93: Hoare triple {16360#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16360#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:25,327 INFO L273 TraceCheckUtils]: 94: Hoare triple {16360#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16360#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:25,328 INFO L273 TraceCheckUtils]: 95: Hoare triple {16360#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16361#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:25,328 INFO L273 TraceCheckUtils]: 96: Hoare triple {16361#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16361#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:25,329 INFO L273 TraceCheckUtils]: 97: Hoare triple {16361#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {16361#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:25,330 INFO L273 TraceCheckUtils]: 98: Hoare triple {16361#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16362#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:25,330 INFO L273 TraceCheckUtils]: 99: Hoare triple {16362#(<= main_~i~0 32)} assume !(~i~0 < 100000); {16330#false} is VALID [2018-11-23 11:59:25,330 INFO L273 TraceCheckUtils]: 100: Hoare triple {16330#false} havoc ~x~0;~x~0 := 0; {16330#false} is VALID [2018-11-23 11:59:25,331 INFO L273 TraceCheckUtils]: 101: Hoare triple {16330#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {16330#false} is VALID [2018-11-23 11:59:25,331 INFO L256 TraceCheckUtils]: 102: Hoare triple {16330#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {16330#false} is VALID [2018-11-23 11:59:25,331 INFO L273 TraceCheckUtils]: 103: Hoare triple {16330#false} ~cond := #in~cond; {16330#false} is VALID [2018-11-23 11:59:25,331 INFO L273 TraceCheckUtils]: 104: Hoare triple {16330#false} assume 0 == ~cond; {16330#false} is VALID [2018-11-23 11:59:25,331 INFO L273 TraceCheckUtils]: 105: Hoare triple {16330#false} assume !false; {16330#false} is VALID [2018-11-23 11:59:25,340 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:59:25,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:25,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-11-23 11:59:25,359 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 106 [2018-11-23 11:59:25,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:25,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:59:25,462 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:59:25,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:59:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:59:25,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:59:25,463 INFO L87 Difference]: Start difference. First operand 111 states and 143 transitions. Second operand 34 states. [2018-11-23 11:59:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:26,143 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-23 11:59:26,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:59:26,144 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 106 [2018-11-23 11:59:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:59:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 162 transitions. [2018-11-23 11:59:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:59:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 162 transitions. [2018-11-23 11:59:26,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 162 transitions. [2018-11-23 11:59:26,364 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:59:26,366 INFO L225 Difference]: With dead ends: 127 [2018-11-23 11:59:26,366 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 11:59:26,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:59:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 11:59:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-11-23 11:59:26,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:26,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 114 states. [2018-11-23 11:59:26,397 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 114 states. [2018-11-23 11:59:26,398 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 114 states. [2018-11-23 11:59:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:26,400 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2018-11-23 11:59:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2018-11-23 11:59:26,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:26,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:26,401 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 116 states. [2018-11-23 11:59:26,401 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 116 states. [2018-11-23 11:59:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:26,403 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2018-11-23 11:59:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2018-11-23 11:59:26,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:26,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:26,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:26,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:59:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2018-11-23 11:59:26,406 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 106 [2018-11-23 11:59:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:26,406 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2018-11-23 11:59:26,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:59:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2018-11-23 11:59:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:59:26,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:26,407 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:59:26,407 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:26,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1267953545, now seen corresponding path program 32 times [2018-11-23 11:59:26,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:26,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:26,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:26,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:26,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:27,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {17236#true} call ULTIMATE.init(); {17236#true} is VALID [2018-11-23 11:59:27,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {17236#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17236#true} is VALID [2018-11-23 11:59:27,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {17236#true} assume true; {17236#true} is VALID [2018-11-23 11:59:27,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17236#true} {17236#true} #54#return; {17236#true} is VALID [2018-11-23 11:59:27,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {17236#true} call #t~ret6 := main(); {17236#true} is VALID [2018-11-23 11:59:27,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {17236#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17238#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:27,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {17238#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17238#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:27,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {17238#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17238#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:27,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {17238#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17239#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:27,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {17239#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17239#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:27,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {17239#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17239#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:27,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {17239#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17240#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:27,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {17240#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17240#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:27,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {17240#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17240#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:27,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {17240#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17241#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:27,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {17241#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17241#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:27,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {17241#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17241#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:27,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {17241#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17242#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:27,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {17242#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17242#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:27,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {17242#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17242#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:27,085 INFO L273 TraceCheckUtils]: 20: Hoare triple {17242#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17243#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:27,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {17243#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17243#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:27,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {17243#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17243#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:27,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {17243#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17244#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:27,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {17244#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17244#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:27,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {17244#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17244#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:27,088 INFO L273 TraceCheckUtils]: 26: Hoare triple {17244#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17245#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:27,089 INFO L273 TraceCheckUtils]: 27: Hoare triple {17245#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17245#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:27,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {17245#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17245#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:27,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {17245#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17246#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:27,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {17246#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17246#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:27,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {17246#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17246#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:27,092 INFO L273 TraceCheckUtils]: 32: Hoare triple {17246#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17247#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:27,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {17247#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17247#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:27,093 INFO L273 TraceCheckUtils]: 34: Hoare triple {17247#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17247#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:27,093 INFO L273 TraceCheckUtils]: 35: Hoare triple {17247#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17248#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:27,094 INFO L273 TraceCheckUtils]: 36: Hoare triple {17248#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17248#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:27,094 INFO L273 TraceCheckUtils]: 37: Hoare triple {17248#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17248#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:27,095 INFO L273 TraceCheckUtils]: 38: Hoare triple {17248#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17249#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:27,095 INFO L273 TraceCheckUtils]: 39: Hoare triple {17249#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17249#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:27,096 INFO L273 TraceCheckUtils]: 40: Hoare triple {17249#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17249#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:27,097 INFO L273 TraceCheckUtils]: 41: Hoare triple {17249#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17250#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:27,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {17250#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17250#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:27,098 INFO L273 TraceCheckUtils]: 43: Hoare triple {17250#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17250#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:27,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {17250#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17251#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:27,099 INFO L273 TraceCheckUtils]: 45: Hoare triple {17251#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17251#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:27,099 INFO L273 TraceCheckUtils]: 46: Hoare triple {17251#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17251#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:27,100 INFO L273 TraceCheckUtils]: 47: Hoare triple {17251#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17252#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:27,101 INFO L273 TraceCheckUtils]: 48: Hoare triple {17252#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17252#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:27,101 INFO L273 TraceCheckUtils]: 49: Hoare triple {17252#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17252#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:27,102 INFO L273 TraceCheckUtils]: 50: Hoare triple {17252#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17253#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:27,102 INFO L273 TraceCheckUtils]: 51: Hoare triple {17253#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17253#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:27,103 INFO L273 TraceCheckUtils]: 52: Hoare triple {17253#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17253#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:27,103 INFO L273 TraceCheckUtils]: 53: Hoare triple {17253#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17254#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:27,104 INFO L273 TraceCheckUtils]: 54: Hoare triple {17254#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17254#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:27,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {17254#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17254#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:27,105 INFO L273 TraceCheckUtils]: 56: Hoare triple {17254#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17255#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:27,106 INFO L273 TraceCheckUtils]: 57: Hoare triple {17255#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17255#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:27,106 INFO L273 TraceCheckUtils]: 58: Hoare triple {17255#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17255#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:27,107 INFO L273 TraceCheckUtils]: 59: Hoare triple {17255#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17256#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:27,107 INFO L273 TraceCheckUtils]: 60: Hoare triple {17256#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17256#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:27,108 INFO L273 TraceCheckUtils]: 61: Hoare triple {17256#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17256#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:27,109 INFO L273 TraceCheckUtils]: 62: Hoare triple {17256#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17257#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:27,109 INFO L273 TraceCheckUtils]: 63: Hoare triple {17257#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17257#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:27,110 INFO L273 TraceCheckUtils]: 64: Hoare triple {17257#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17257#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:27,110 INFO L273 TraceCheckUtils]: 65: Hoare triple {17257#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17258#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:27,111 INFO L273 TraceCheckUtils]: 66: Hoare triple {17258#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17258#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:27,111 INFO L273 TraceCheckUtils]: 67: Hoare triple {17258#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17258#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:27,112 INFO L273 TraceCheckUtils]: 68: Hoare triple {17258#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17259#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:27,112 INFO L273 TraceCheckUtils]: 69: Hoare triple {17259#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17259#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:27,113 INFO L273 TraceCheckUtils]: 70: Hoare triple {17259#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17259#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:27,114 INFO L273 TraceCheckUtils]: 71: Hoare triple {17259#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17260#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:27,114 INFO L273 TraceCheckUtils]: 72: Hoare triple {17260#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17260#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:27,115 INFO L273 TraceCheckUtils]: 73: Hoare triple {17260#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17260#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:27,115 INFO L273 TraceCheckUtils]: 74: Hoare triple {17260#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17261#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:27,116 INFO L273 TraceCheckUtils]: 75: Hoare triple {17261#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17261#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:27,116 INFO L273 TraceCheckUtils]: 76: Hoare triple {17261#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17261#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:27,117 INFO L273 TraceCheckUtils]: 77: Hoare triple {17261#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17262#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:27,118 INFO L273 TraceCheckUtils]: 78: Hoare triple {17262#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17262#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:27,118 INFO L273 TraceCheckUtils]: 79: Hoare triple {17262#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17262#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:27,119 INFO L273 TraceCheckUtils]: 80: Hoare triple {17262#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17263#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:27,119 INFO L273 TraceCheckUtils]: 81: Hoare triple {17263#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17263#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:27,120 INFO L273 TraceCheckUtils]: 82: Hoare triple {17263#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17263#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:27,121 INFO L273 TraceCheckUtils]: 83: Hoare triple {17263#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17264#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:27,121 INFO L273 TraceCheckUtils]: 84: Hoare triple {17264#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17264#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:27,122 INFO L273 TraceCheckUtils]: 85: Hoare triple {17264#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17264#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:27,122 INFO L273 TraceCheckUtils]: 86: Hoare triple {17264#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17265#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:27,123 INFO L273 TraceCheckUtils]: 87: Hoare triple {17265#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17265#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:27,123 INFO L273 TraceCheckUtils]: 88: Hoare triple {17265#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17265#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:27,124 INFO L273 TraceCheckUtils]: 89: Hoare triple {17265#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17266#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:27,125 INFO L273 TraceCheckUtils]: 90: Hoare triple {17266#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17266#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:27,125 INFO L273 TraceCheckUtils]: 91: Hoare triple {17266#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17266#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:27,126 INFO L273 TraceCheckUtils]: 92: Hoare triple {17266#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17267#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:27,126 INFO L273 TraceCheckUtils]: 93: Hoare triple {17267#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17267#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:27,127 INFO L273 TraceCheckUtils]: 94: Hoare triple {17267#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17267#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:27,127 INFO L273 TraceCheckUtils]: 95: Hoare triple {17267#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17268#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:27,128 INFO L273 TraceCheckUtils]: 96: Hoare triple {17268#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17268#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:27,128 INFO L273 TraceCheckUtils]: 97: Hoare triple {17268#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17268#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:27,129 INFO L273 TraceCheckUtils]: 98: Hoare triple {17268#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17269#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:27,130 INFO L273 TraceCheckUtils]: 99: Hoare triple {17269#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17269#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:27,130 INFO L273 TraceCheckUtils]: 100: Hoare triple {17269#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17269#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:27,131 INFO L273 TraceCheckUtils]: 101: Hoare triple {17269#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17270#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:27,132 INFO L273 TraceCheckUtils]: 102: Hoare triple {17270#(<= main_~i~0 33)} assume !(~i~0 < 100000); {17237#false} is VALID [2018-11-23 11:59:27,132 INFO L273 TraceCheckUtils]: 103: Hoare triple {17237#false} havoc ~x~0;~x~0 := 0; {17237#false} is VALID [2018-11-23 11:59:27,132 INFO L273 TraceCheckUtils]: 104: Hoare triple {17237#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {17237#false} is VALID [2018-11-23 11:59:27,132 INFO L256 TraceCheckUtils]: 105: Hoare triple {17237#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {17237#false} is VALID [2018-11-23 11:59:27,132 INFO L273 TraceCheckUtils]: 106: Hoare triple {17237#false} ~cond := #in~cond; {17237#false} is VALID [2018-11-23 11:59:27,132 INFO L273 TraceCheckUtils]: 107: Hoare triple {17237#false} assume 0 == ~cond; {17237#false} is VALID [2018-11-23 11:59:27,133 INFO L273 TraceCheckUtils]: 108: Hoare triple {17237#false} assume !false; {17237#false} is VALID [2018-11-23 11:59:27,141 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:59:27,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:27,141 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:59:27,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:27,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:27,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:27,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:27,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {17236#true} call ULTIMATE.init(); {17236#true} is VALID [2018-11-23 11:59:27,441 INFO L273 TraceCheckUtils]: 1: Hoare triple {17236#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17236#true} is VALID [2018-11-23 11:59:27,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {17236#true} assume true; {17236#true} is VALID [2018-11-23 11:59:27,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17236#true} {17236#true} #54#return; {17236#true} is VALID [2018-11-23 11:59:27,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {17236#true} call #t~ret6 := main(); {17236#true} is VALID [2018-11-23 11:59:27,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {17236#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17238#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:27,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {17238#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17238#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:27,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {17238#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17238#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:27,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {17238#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17239#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:27,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {17239#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17239#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:27,445 INFO L273 TraceCheckUtils]: 10: Hoare triple {17239#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17239#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:27,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {17239#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17240#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:27,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {17240#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17240#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:27,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {17240#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17240#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:27,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {17240#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17241#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:27,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {17241#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17241#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:27,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {17241#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17241#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:27,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {17241#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17242#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:27,449 INFO L273 TraceCheckUtils]: 18: Hoare triple {17242#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17242#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:27,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {17242#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17242#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:27,450 INFO L273 TraceCheckUtils]: 20: Hoare triple {17242#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17243#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:27,450 INFO L273 TraceCheckUtils]: 21: Hoare triple {17243#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17243#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:27,451 INFO L273 TraceCheckUtils]: 22: Hoare triple {17243#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17243#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:27,452 INFO L273 TraceCheckUtils]: 23: Hoare triple {17243#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17244#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:27,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {17244#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17244#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:27,453 INFO L273 TraceCheckUtils]: 25: Hoare triple {17244#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17244#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:27,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {17244#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17245#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:27,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {17245#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17245#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:27,454 INFO L273 TraceCheckUtils]: 28: Hoare triple {17245#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17245#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:27,455 INFO L273 TraceCheckUtils]: 29: Hoare triple {17245#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17246#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:27,456 INFO L273 TraceCheckUtils]: 30: Hoare triple {17246#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17246#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:27,456 INFO L273 TraceCheckUtils]: 31: Hoare triple {17246#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17246#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:27,457 INFO L273 TraceCheckUtils]: 32: Hoare triple {17246#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17247#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:27,457 INFO L273 TraceCheckUtils]: 33: Hoare triple {17247#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17247#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:27,458 INFO L273 TraceCheckUtils]: 34: Hoare triple {17247#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17247#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:27,459 INFO L273 TraceCheckUtils]: 35: Hoare triple {17247#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17248#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:27,459 INFO L273 TraceCheckUtils]: 36: Hoare triple {17248#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17248#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:27,460 INFO L273 TraceCheckUtils]: 37: Hoare triple {17248#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17248#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:27,460 INFO L273 TraceCheckUtils]: 38: Hoare triple {17248#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17249#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:27,461 INFO L273 TraceCheckUtils]: 39: Hoare triple {17249#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17249#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:27,461 INFO L273 TraceCheckUtils]: 40: Hoare triple {17249#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17249#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:27,462 INFO L273 TraceCheckUtils]: 41: Hoare triple {17249#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17250#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:27,463 INFO L273 TraceCheckUtils]: 42: Hoare triple {17250#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17250#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:27,463 INFO L273 TraceCheckUtils]: 43: Hoare triple {17250#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17250#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:27,464 INFO L273 TraceCheckUtils]: 44: Hoare triple {17250#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17251#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:27,464 INFO L273 TraceCheckUtils]: 45: Hoare triple {17251#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17251#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:27,465 INFO L273 TraceCheckUtils]: 46: Hoare triple {17251#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17251#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:27,466 INFO L273 TraceCheckUtils]: 47: Hoare triple {17251#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17252#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:27,466 INFO L273 TraceCheckUtils]: 48: Hoare triple {17252#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17252#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:27,467 INFO L273 TraceCheckUtils]: 49: Hoare triple {17252#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17252#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:27,467 INFO L273 TraceCheckUtils]: 50: Hoare triple {17252#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17253#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:27,468 INFO L273 TraceCheckUtils]: 51: Hoare triple {17253#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17253#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:27,468 INFO L273 TraceCheckUtils]: 52: Hoare triple {17253#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17253#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:27,469 INFO L273 TraceCheckUtils]: 53: Hoare triple {17253#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17254#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:27,470 INFO L273 TraceCheckUtils]: 54: Hoare triple {17254#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17254#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:27,470 INFO L273 TraceCheckUtils]: 55: Hoare triple {17254#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17254#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:27,471 INFO L273 TraceCheckUtils]: 56: Hoare triple {17254#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17255#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:27,471 INFO L273 TraceCheckUtils]: 57: Hoare triple {17255#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17255#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:27,472 INFO L273 TraceCheckUtils]: 58: Hoare triple {17255#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17255#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:27,472 INFO L273 TraceCheckUtils]: 59: Hoare triple {17255#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17256#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:27,473 INFO L273 TraceCheckUtils]: 60: Hoare triple {17256#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17256#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:27,473 INFO L273 TraceCheckUtils]: 61: Hoare triple {17256#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17256#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:27,474 INFO L273 TraceCheckUtils]: 62: Hoare triple {17256#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17257#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:27,475 INFO L273 TraceCheckUtils]: 63: Hoare triple {17257#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17257#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:27,475 INFO L273 TraceCheckUtils]: 64: Hoare triple {17257#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17257#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:27,479 INFO L273 TraceCheckUtils]: 65: Hoare triple {17257#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17258#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:27,480 INFO L273 TraceCheckUtils]: 66: Hoare triple {17258#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17258#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:27,480 INFO L273 TraceCheckUtils]: 67: Hoare triple {17258#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17258#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:27,482 INFO L273 TraceCheckUtils]: 68: Hoare triple {17258#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17259#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:27,485 INFO L273 TraceCheckUtils]: 69: Hoare triple {17259#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17259#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:27,485 INFO L273 TraceCheckUtils]: 70: Hoare triple {17259#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17259#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:27,487 INFO L273 TraceCheckUtils]: 71: Hoare triple {17259#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17260#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:27,487 INFO L273 TraceCheckUtils]: 72: Hoare triple {17260#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17260#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:27,487 INFO L273 TraceCheckUtils]: 73: Hoare triple {17260#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17260#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:27,488 INFO L273 TraceCheckUtils]: 74: Hoare triple {17260#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17261#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:27,488 INFO L273 TraceCheckUtils]: 75: Hoare triple {17261#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17261#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:27,488 INFO L273 TraceCheckUtils]: 76: Hoare triple {17261#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17261#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:27,489 INFO L273 TraceCheckUtils]: 77: Hoare triple {17261#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17262#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:27,489 INFO L273 TraceCheckUtils]: 78: Hoare triple {17262#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17262#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:27,489 INFO L273 TraceCheckUtils]: 79: Hoare triple {17262#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17262#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:27,490 INFO L273 TraceCheckUtils]: 80: Hoare triple {17262#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17263#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:27,493 INFO L273 TraceCheckUtils]: 81: Hoare triple {17263#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17263#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:27,493 INFO L273 TraceCheckUtils]: 82: Hoare triple {17263#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17263#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:27,494 INFO L273 TraceCheckUtils]: 83: Hoare triple {17263#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17264#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:27,494 INFO L273 TraceCheckUtils]: 84: Hoare triple {17264#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17264#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:27,495 INFO L273 TraceCheckUtils]: 85: Hoare triple {17264#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17264#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:27,496 INFO L273 TraceCheckUtils]: 86: Hoare triple {17264#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17265#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:27,496 INFO L273 TraceCheckUtils]: 87: Hoare triple {17265#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17265#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:27,496 INFO L273 TraceCheckUtils]: 88: Hoare triple {17265#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17265#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:27,497 INFO L273 TraceCheckUtils]: 89: Hoare triple {17265#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17266#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:27,497 INFO L273 TraceCheckUtils]: 90: Hoare triple {17266#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17266#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:27,497 INFO L273 TraceCheckUtils]: 91: Hoare triple {17266#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17266#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:27,498 INFO L273 TraceCheckUtils]: 92: Hoare triple {17266#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17267#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:27,498 INFO L273 TraceCheckUtils]: 93: Hoare triple {17267#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17267#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:27,499 INFO L273 TraceCheckUtils]: 94: Hoare triple {17267#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17267#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:27,499 INFO L273 TraceCheckUtils]: 95: Hoare triple {17267#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17268#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:27,500 INFO L273 TraceCheckUtils]: 96: Hoare triple {17268#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17268#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:27,500 INFO L273 TraceCheckUtils]: 97: Hoare triple {17268#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17268#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:27,501 INFO L273 TraceCheckUtils]: 98: Hoare triple {17268#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17269#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:27,502 INFO L273 TraceCheckUtils]: 99: Hoare triple {17269#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17269#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:27,502 INFO L273 TraceCheckUtils]: 100: Hoare triple {17269#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {17269#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:27,503 INFO L273 TraceCheckUtils]: 101: Hoare triple {17269#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17270#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:27,503 INFO L273 TraceCheckUtils]: 102: Hoare triple {17270#(<= main_~i~0 33)} assume !(~i~0 < 100000); {17237#false} is VALID [2018-11-23 11:59:27,504 INFO L273 TraceCheckUtils]: 103: Hoare triple {17237#false} havoc ~x~0;~x~0 := 0; {17237#false} is VALID [2018-11-23 11:59:27,504 INFO L273 TraceCheckUtils]: 104: Hoare triple {17237#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {17237#false} is VALID [2018-11-23 11:59:27,504 INFO L256 TraceCheckUtils]: 105: Hoare triple {17237#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {17237#false} is VALID [2018-11-23 11:59:27,504 INFO L273 TraceCheckUtils]: 106: Hoare triple {17237#false} ~cond := #in~cond; {17237#false} is VALID [2018-11-23 11:59:27,504 INFO L273 TraceCheckUtils]: 107: Hoare triple {17237#false} assume 0 == ~cond; {17237#false} is VALID [2018-11-23 11:59:27,505 INFO L273 TraceCheckUtils]: 108: Hoare triple {17237#false} assume !false; {17237#false} is VALID [2018-11-23 11:59:27,514 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:59:27,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:27,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-11-23 11:59:27,533 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 109 [2018-11-23 11:59:27,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:27,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 11:59:27,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:27,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 11:59:27,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 11:59:27,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:59:27,642 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand 35 states. [2018-11-23 11:59:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:28,362 INFO L93 Difference]: Finished difference Result 130 states and 166 transitions. [2018-11-23 11:59:28,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 11:59:28,362 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 109 [2018-11-23 11:59:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:59:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 166 transitions. [2018-11-23 11:59:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:59:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 166 transitions. [2018-11-23 11:59:28,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 166 transitions. [2018-11-23 11:59:28,547 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:59:28,549 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:59:28,549 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 11:59:28,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:59:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 11:59:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 11:59:28,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:28,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-23 11:59:28,667 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-23 11:59:28,667 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-23 11:59:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:28,669 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-11-23 11:59:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-23 11:59:28,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:28,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:28,670 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-23 11:59:28,670 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-23 11:59:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:28,672 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-11-23 11:59:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-23 11:59:28,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:28,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:28,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:28,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 11:59:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2018-11-23 11:59:28,675 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 109 [2018-11-23 11:59:28,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:28,675 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2018-11-23 11:59:28,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 11:59:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2018-11-23 11:59:28,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 11:59:28,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:28,676 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:59:28,676 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:28,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:28,677 INFO L82 PathProgramCache]: Analyzing trace with hash -321325948, now seen corresponding path program 33 times [2018-11-23 11:59:28,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:28,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:28,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:28,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:29,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {18167#true} call ULTIMATE.init(); {18167#true} is VALID [2018-11-23 11:59:29,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {18167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18167#true} is VALID [2018-11-23 11:59:29,417 INFO L273 TraceCheckUtils]: 2: Hoare triple {18167#true} assume true; {18167#true} is VALID [2018-11-23 11:59:29,417 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18167#true} {18167#true} #54#return; {18167#true} is VALID [2018-11-23 11:59:29,417 INFO L256 TraceCheckUtils]: 4: Hoare triple {18167#true} call #t~ret6 := main(); {18167#true} is VALID [2018-11-23 11:59:29,418 INFO L273 TraceCheckUtils]: 5: Hoare triple {18167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {18169#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {18169#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18169#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {18169#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18169#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {18169#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18170#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {18170#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18170#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {18170#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18170#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {18170#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18171#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {18171#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18171#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {18171#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18171#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {18171#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18172#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {18172#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18172#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {18172#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18172#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {18172#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18173#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {18173#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18173#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {18173#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18173#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,427 INFO L273 TraceCheckUtils]: 20: Hoare triple {18173#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18174#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,427 INFO L273 TraceCheckUtils]: 21: Hoare triple {18174#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18174#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,428 INFO L273 TraceCheckUtils]: 22: Hoare triple {18174#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18174#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,428 INFO L273 TraceCheckUtils]: 23: Hoare triple {18174#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18175#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,429 INFO L273 TraceCheckUtils]: 24: Hoare triple {18175#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18175#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,429 INFO L273 TraceCheckUtils]: 25: Hoare triple {18175#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18175#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,430 INFO L273 TraceCheckUtils]: 26: Hoare triple {18175#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18176#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,431 INFO L273 TraceCheckUtils]: 27: Hoare triple {18176#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18176#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,431 INFO L273 TraceCheckUtils]: 28: Hoare triple {18176#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18176#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,432 INFO L273 TraceCheckUtils]: 29: Hoare triple {18176#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18177#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,432 INFO L273 TraceCheckUtils]: 30: Hoare triple {18177#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18177#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,433 INFO L273 TraceCheckUtils]: 31: Hoare triple {18177#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18177#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,433 INFO L273 TraceCheckUtils]: 32: Hoare triple {18177#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18178#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {18178#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18178#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,434 INFO L273 TraceCheckUtils]: 34: Hoare triple {18178#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18178#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,435 INFO L273 TraceCheckUtils]: 35: Hoare triple {18178#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18179#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,436 INFO L273 TraceCheckUtils]: 36: Hoare triple {18179#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18179#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,436 INFO L273 TraceCheckUtils]: 37: Hoare triple {18179#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18179#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,437 INFO L273 TraceCheckUtils]: 38: Hoare triple {18179#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18180#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,437 INFO L273 TraceCheckUtils]: 39: Hoare triple {18180#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18180#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {18180#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18180#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,440 INFO L273 TraceCheckUtils]: 41: Hoare triple {18180#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18181#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {18181#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18181#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {18181#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18181#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,441 INFO L273 TraceCheckUtils]: 44: Hoare triple {18181#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18182#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,442 INFO L273 TraceCheckUtils]: 45: Hoare triple {18182#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18182#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,442 INFO L273 TraceCheckUtils]: 46: Hoare triple {18182#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18182#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,442 INFO L273 TraceCheckUtils]: 47: Hoare triple {18182#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18183#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,443 INFO L273 TraceCheckUtils]: 48: Hoare triple {18183#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18183#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,443 INFO L273 TraceCheckUtils]: 49: Hoare triple {18183#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18183#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,444 INFO L273 TraceCheckUtils]: 50: Hoare triple {18183#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18184#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,444 INFO L273 TraceCheckUtils]: 51: Hoare triple {18184#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18184#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,445 INFO L273 TraceCheckUtils]: 52: Hoare triple {18184#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18184#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,445 INFO L273 TraceCheckUtils]: 53: Hoare triple {18184#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18185#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,446 INFO L273 TraceCheckUtils]: 54: Hoare triple {18185#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18185#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,446 INFO L273 TraceCheckUtils]: 55: Hoare triple {18185#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18185#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,447 INFO L273 TraceCheckUtils]: 56: Hoare triple {18185#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18186#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,447 INFO L273 TraceCheckUtils]: 57: Hoare triple {18186#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18186#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,448 INFO L273 TraceCheckUtils]: 58: Hoare triple {18186#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18186#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,449 INFO L273 TraceCheckUtils]: 59: Hoare triple {18186#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18187#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,449 INFO L273 TraceCheckUtils]: 60: Hoare triple {18187#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18187#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,450 INFO L273 TraceCheckUtils]: 61: Hoare triple {18187#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18187#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,450 INFO L273 TraceCheckUtils]: 62: Hoare triple {18187#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18188#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,451 INFO L273 TraceCheckUtils]: 63: Hoare triple {18188#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18188#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,451 INFO L273 TraceCheckUtils]: 64: Hoare triple {18188#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18188#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,452 INFO L273 TraceCheckUtils]: 65: Hoare triple {18188#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18189#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,453 INFO L273 TraceCheckUtils]: 66: Hoare triple {18189#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18189#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,453 INFO L273 TraceCheckUtils]: 67: Hoare triple {18189#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18189#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,454 INFO L273 TraceCheckUtils]: 68: Hoare triple {18189#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18190#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,454 INFO L273 TraceCheckUtils]: 69: Hoare triple {18190#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18190#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,455 INFO L273 TraceCheckUtils]: 70: Hoare triple {18190#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18190#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,456 INFO L273 TraceCheckUtils]: 71: Hoare triple {18190#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18191#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,456 INFO L273 TraceCheckUtils]: 72: Hoare triple {18191#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18191#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,457 INFO L273 TraceCheckUtils]: 73: Hoare triple {18191#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18191#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,457 INFO L273 TraceCheckUtils]: 74: Hoare triple {18191#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18192#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,458 INFO L273 TraceCheckUtils]: 75: Hoare triple {18192#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18192#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,458 INFO L273 TraceCheckUtils]: 76: Hoare triple {18192#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18192#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,459 INFO L273 TraceCheckUtils]: 77: Hoare triple {18192#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18193#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,459 INFO L273 TraceCheckUtils]: 78: Hoare triple {18193#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18193#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,460 INFO L273 TraceCheckUtils]: 79: Hoare triple {18193#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18193#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,460 INFO L273 TraceCheckUtils]: 80: Hoare triple {18193#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18194#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:29,461 INFO L273 TraceCheckUtils]: 81: Hoare triple {18194#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18194#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:29,461 INFO L273 TraceCheckUtils]: 82: Hoare triple {18194#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18194#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:29,462 INFO L273 TraceCheckUtils]: 83: Hoare triple {18194#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18195#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:29,463 INFO L273 TraceCheckUtils]: 84: Hoare triple {18195#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18195#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:29,463 INFO L273 TraceCheckUtils]: 85: Hoare triple {18195#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18195#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:29,464 INFO L273 TraceCheckUtils]: 86: Hoare triple {18195#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18196#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:29,464 INFO L273 TraceCheckUtils]: 87: Hoare triple {18196#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18196#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:29,465 INFO L273 TraceCheckUtils]: 88: Hoare triple {18196#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18196#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:29,466 INFO L273 TraceCheckUtils]: 89: Hoare triple {18196#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18197#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:29,466 INFO L273 TraceCheckUtils]: 90: Hoare triple {18197#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18197#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:29,466 INFO L273 TraceCheckUtils]: 91: Hoare triple {18197#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18197#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:29,467 INFO L273 TraceCheckUtils]: 92: Hoare triple {18197#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18198#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:29,468 INFO L273 TraceCheckUtils]: 93: Hoare triple {18198#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18198#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:29,468 INFO L273 TraceCheckUtils]: 94: Hoare triple {18198#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18198#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:29,469 INFO L273 TraceCheckUtils]: 95: Hoare triple {18198#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18199#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:29,469 INFO L273 TraceCheckUtils]: 96: Hoare triple {18199#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18199#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:29,470 INFO L273 TraceCheckUtils]: 97: Hoare triple {18199#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18199#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:29,471 INFO L273 TraceCheckUtils]: 98: Hoare triple {18199#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18200#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:29,471 INFO L273 TraceCheckUtils]: 99: Hoare triple {18200#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18200#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:29,472 INFO L273 TraceCheckUtils]: 100: Hoare triple {18200#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18200#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:29,472 INFO L273 TraceCheckUtils]: 101: Hoare triple {18200#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18201#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:29,473 INFO L273 TraceCheckUtils]: 102: Hoare triple {18201#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18201#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:29,473 INFO L273 TraceCheckUtils]: 103: Hoare triple {18201#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18201#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:29,474 INFO L273 TraceCheckUtils]: 104: Hoare triple {18201#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18202#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:29,475 INFO L273 TraceCheckUtils]: 105: Hoare triple {18202#(<= main_~i~0 34)} assume !(~i~0 < 100000); {18168#false} is VALID [2018-11-23 11:59:29,475 INFO L273 TraceCheckUtils]: 106: Hoare triple {18168#false} havoc ~x~0;~x~0 := 0; {18168#false} is VALID [2018-11-23 11:59:29,475 INFO L273 TraceCheckUtils]: 107: Hoare triple {18168#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {18168#false} is VALID [2018-11-23 11:59:29,475 INFO L256 TraceCheckUtils]: 108: Hoare triple {18168#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {18168#false} is VALID [2018-11-23 11:59:29,476 INFO L273 TraceCheckUtils]: 109: Hoare triple {18168#false} ~cond := #in~cond; {18168#false} is VALID [2018-11-23 11:59:29,476 INFO L273 TraceCheckUtils]: 110: Hoare triple {18168#false} assume 0 == ~cond; {18168#false} is VALID [2018-11-23 11:59:29,476 INFO L273 TraceCheckUtils]: 111: Hoare triple {18168#false} assume !false; {18168#false} is VALID [2018-11-23 11:59:29,485 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:59:29,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:29,485 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:59:29,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:29,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 11:59:29,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:29,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:29,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {18167#true} call ULTIMATE.init(); {18167#true} is VALID [2018-11-23 11:59:29,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {18167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18167#true} is VALID [2018-11-23 11:59:29,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {18167#true} assume true; {18167#true} is VALID [2018-11-23 11:59:29,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18167#true} {18167#true} #54#return; {18167#true} is VALID [2018-11-23 11:59:29,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {18167#true} call #t~ret6 := main(); {18167#true} is VALID [2018-11-23 11:59:29,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {18167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {18169#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {18169#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18169#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {18169#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18169#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {18169#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18170#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {18170#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18170#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {18170#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18170#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {18170#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18171#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {18171#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18171#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {18171#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18171#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {18171#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18172#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {18172#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18172#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,864 INFO L273 TraceCheckUtils]: 16: Hoare triple {18172#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18172#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {18172#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18173#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {18173#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18173#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,865 INFO L273 TraceCheckUtils]: 19: Hoare triple {18173#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18173#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,866 INFO L273 TraceCheckUtils]: 20: Hoare triple {18173#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18174#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,866 INFO L273 TraceCheckUtils]: 21: Hoare triple {18174#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18174#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,867 INFO L273 TraceCheckUtils]: 22: Hoare triple {18174#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18174#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,868 INFO L273 TraceCheckUtils]: 23: Hoare triple {18174#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18175#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,868 INFO L273 TraceCheckUtils]: 24: Hoare triple {18175#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18175#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {18175#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18175#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,869 INFO L273 TraceCheckUtils]: 26: Hoare triple {18175#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18176#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,870 INFO L273 TraceCheckUtils]: 27: Hoare triple {18176#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18176#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {18176#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18176#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {18176#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18177#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,871 INFO L273 TraceCheckUtils]: 30: Hoare triple {18177#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18177#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,872 INFO L273 TraceCheckUtils]: 31: Hoare triple {18177#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18177#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,872 INFO L273 TraceCheckUtils]: 32: Hoare triple {18177#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18178#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {18178#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18178#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {18178#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18178#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,874 INFO L273 TraceCheckUtils]: 35: Hoare triple {18178#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18179#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,875 INFO L273 TraceCheckUtils]: 36: Hoare triple {18179#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18179#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,875 INFO L273 TraceCheckUtils]: 37: Hoare triple {18179#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18179#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,876 INFO L273 TraceCheckUtils]: 38: Hoare triple {18179#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18180#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,876 INFO L273 TraceCheckUtils]: 39: Hoare triple {18180#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18180#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,877 INFO L273 TraceCheckUtils]: 40: Hoare triple {18180#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18180#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {18180#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18181#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,878 INFO L273 TraceCheckUtils]: 42: Hoare triple {18181#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18181#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,878 INFO L273 TraceCheckUtils]: 43: Hoare triple {18181#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18181#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,879 INFO L273 TraceCheckUtils]: 44: Hoare triple {18181#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18182#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,879 INFO L273 TraceCheckUtils]: 45: Hoare triple {18182#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18182#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,880 INFO L273 TraceCheckUtils]: 46: Hoare triple {18182#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18182#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,880 INFO L273 TraceCheckUtils]: 47: Hoare triple {18182#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18183#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,881 INFO L273 TraceCheckUtils]: 48: Hoare triple {18183#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18183#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,881 INFO L273 TraceCheckUtils]: 49: Hoare triple {18183#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18183#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,882 INFO L273 TraceCheckUtils]: 50: Hoare triple {18183#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18184#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,883 INFO L273 TraceCheckUtils]: 51: Hoare triple {18184#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18184#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,883 INFO L273 TraceCheckUtils]: 52: Hoare triple {18184#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18184#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,884 INFO L273 TraceCheckUtils]: 53: Hoare triple {18184#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18185#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,884 INFO L273 TraceCheckUtils]: 54: Hoare triple {18185#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18185#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,885 INFO L273 TraceCheckUtils]: 55: Hoare triple {18185#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18185#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,885 INFO L273 TraceCheckUtils]: 56: Hoare triple {18185#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18186#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,886 INFO L273 TraceCheckUtils]: 57: Hoare triple {18186#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18186#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,886 INFO L273 TraceCheckUtils]: 58: Hoare triple {18186#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18186#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,887 INFO L273 TraceCheckUtils]: 59: Hoare triple {18186#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18187#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,887 INFO L273 TraceCheckUtils]: 60: Hoare triple {18187#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18187#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,888 INFO L273 TraceCheckUtils]: 61: Hoare triple {18187#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18187#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,889 INFO L273 TraceCheckUtils]: 62: Hoare triple {18187#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18188#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,889 INFO L273 TraceCheckUtils]: 63: Hoare triple {18188#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18188#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,889 INFO L273 TraceCheckUtils]: 64: Hoare triple {18188#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18188#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,890 INFO L273 TraceCheckUtils]: 65: Hoare triple {18188#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18189#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,891 INFO L273 TraceCheckUtils]: 66: Hoare triple {18189#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18189#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,891 INFO L273 TraceCheckUtils]: 67: Hoare triple {18189#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18189#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,892 INFO L273 TraceCheckUtils]: 68: Hoare triple {18189#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18190#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,892 INFO L273 TraceCheckUtils]: 69: Hoare triple {18190#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18190#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,893 INFO L273 TraceCheckUtils]: 70: Hoare triple {18190#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18190#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,893 INFO L273 TraceCheckUtils]: 71: Hoare triple {18190#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18191#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,894 INFO L273 TraceCheckUtils]: 72: Hoare triple {18191#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18191#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,894 INFO L273 TraceCheckUtils]: 73: Hoare triple {18191#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18191#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,895 INFO L273 TraceCheckUtils]: 74: Hoare triple {18191#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18192#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,895 INFO L273 TraceCheckUtils]: 75: Hoare triple {18192#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18192#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,896 INFO L273 TraceCheckUtils]: 76: Hoare triple {18192#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18192#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,897 INFO L273 TraceCheckUtils]: 77: Hoare triple {18192#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18193#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,897 INFO L273 TraceCheckUtils]: 78: Hoare triple {18193#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18193#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,898 INFO L273 TraceCheckUtils]: 79: Hoare triple {18193#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18193#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,898 INFO L273 TraceCheckUtils]: 80: Hoare triple {18193#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18194#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:29,899 INFO L273 TraceCheckUtils]: 81: Hoare triple {18194#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18194#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:29,899 INFO L273 TraceCheckUtils]: 82: Hoare triple {18194#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18194#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:29,900 INFO L273 TraceCheckUtils]: 83: Hoare triple {18194#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18195#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:29,900 INFO L273 TraceCheckUtils]: 84: Hoare triple {18195#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18195#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:29,901 INFO L273 TraceCheckUtils]: 85: Hoare triple {18195#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18195#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:29,901 INFO L273 TraceCheckUtils]: 86: Hoare triple {18195#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18196#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:29,902 INFO L273 TraceCheckUtils]: 87: Hoare triple {18196#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18196#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:29,902 INFO L273 TraceCheckUtils]: 88: Hoare triple {18196#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18196#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:29,903 INFO L273 TraceCheckUtils]: 89: Hoare triple {18196#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18197#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:29,904 INFO L273 TraceCheckUtils]: 90: Hoare triple {18197#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18197#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:29,904 INFO L273 TraceCheckUtils]: 91: Hoare triple {18197#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18197#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:29,905 INFO L273 TraceCheckUtils]: 92: Hoare triple {18197#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18198#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:29,905 INFO L273 TraceCheckUtils]: 93: Hoare triple {18198#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18198#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:29,906 INFO L273 TraceCheckUtils]: 94: Hoare triple {18198#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18198#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:29,906 INFO L273 TraceCheckUtils]: 95: Hoare triple {18198#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18199#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:29,907 INFO L273 TraceCheckUtils]: 96: Hoare triple {18199#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18199#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:29,907 INFO L273 TraceCheckUtils]: 97: Hoare triple {18199#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18199#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:29,908 INFO L273 TraceCheckUtils]: 98: Hoare triple {18199#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18200#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:29,908 INFO L273 TraceCheckUtils]: 99: Hoare triple {18200#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18200#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:29,909 INFO L273 TraceCheckUtils]: 100: Hoare triple {18200#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18200#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:29,910 INFO L273 TraceCheckUtils]: 101: Hoare triple {18200#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18201#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:29,910 INFO L273 TraceCheckUtils]: 102: Hoare triple {18201#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18201#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:29,910 INFO L273 TraceCheckUtils]: 103: Hoare triple {18201#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {18201#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:29,911 INFO L273 TraceCheckUtils]: 104: Hoare triple {18201#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18202#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:29,912 INFO L273 TraceCheckUtils]: 105: Hoare triple {18202#(<= main_~i~0 34)} assume !(~i~0 < 100000); {18168#false} is VALID [2018-11-23 11:59:29,912 INFO L273 TraceCheckUtils]: 106: Hoare triple {18168#false} havoc ~x~0;~x~0 := 0; {18168#false} is VALID [2018-11-23 11:59:29,912 INFO L273 TraceCheckUtils]: 107: Hoare triple {18168#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {18168#false} is VALID [2018-11-23 11:59:29,912 INFO L256 TraceCheckUtils]: 108: Hoare triple {18168#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {18168#false} is VALID [2018-11-23 11:59:29,912 INFO L273 TraceCheckUtils]: 109: Hoare triple {18168#false} ~cond := #in~cond; {18168#false} is VALID [2018-11-23 11:59:29,913 INFO L273 TraceCheckUtils]: 110: Hoare triple {18168#false} assume 0 == ~cond; {18168#false} is VALID [2018-11-23 11:59:29,913 INFO L273 TraceCheckUtils]: 111: Hoare triple {18168#false} assume !false; {18168#false} is VALID [2018-11-23 11:59:29,923 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:59:29,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:29,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-11-23 11:59:29,941 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 112 [2018-11-23 11:59:29,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:29,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:59:30,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:30,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:59:30,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:59:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:59:30,044 INFO L87 Difference]: Start difference. First operand 117 states and 151 transitions. Second operand 36 states. [2018-11-23 11:59:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:30,687 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2018-11-23 11:59:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:59:30,687 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 112 [2018-11-23 11:59:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:59:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 170 transitions. [2018-11-23 11:59:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:59:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 170 transitions. [2018-11-23 11:59:30,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 170 transitions. [2018-11-23 11:59:30,859 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:59:30,861 INFO L225 Difference]: With dead ends: 133 [2018-11-23 11:59:30,861 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 11:59:30,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:59:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 11:59:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-23 11:59:30,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:30,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 120 states. [2018-11-23 11:59:30,909 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 120 states. [2018-11-23 11:59:30,909 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 120 states. [2018-11-23 11:59:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:30,910 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2018-11-23 11:59:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2018-11-23 11:59:30,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:30,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:30,911 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 122 states. [2018-11-23 11:59:30,911 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 122 states. [2018-11-23 11:59:30,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:30,913 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2018-11-23 11:59:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2018-11-23 11:59:30,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:30,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:30,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:30,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 11:59:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2018-11-23 11:59:30,915 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 155 transitions. Word has length 112 [2018-11-23 11:59:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:30,916 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 155 transitions. [2018-11-23 11:59:30,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:59:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 155 transitions. [2018-11-23 11:59:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 11:59:30,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:30,917 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:59:30,917 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:30,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash -93849257, now seen corresponding path program 34 times [2018-11-23 11:59:30,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:30,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:30,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:31,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {19122#true} call ULTIMATE.init(); {19122#true} is VALID [2018-11-23 11:59:31,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {19122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19122#true} is VALID [2018-11-23 11:59:31,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {19122#true} assume true; {19122#true} is VALID [2018-11-23 11:59:31,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19122#true} {19122#true} #54#return; {19122#true} is VALID [2018-11-23 11:59:31,826 INFO L256 TraceCheckUtils]: 4: Hoare triple {19122#true} call #t~ret6 := main(); {19122#true} is VALID [2018-11-23 11:59:31,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {19122#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19124#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:31,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {19124#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19124#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:31,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {19124#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19124#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:31,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {19124#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19125#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:31,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {19125#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19125#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:31,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {19125#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19125#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:31,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {19125#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19126#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:31,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {19126#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19126#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:31,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {19126#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19126#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:31,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {19126#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19127#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:31,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {19127#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19127#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:31,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {19127#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19127#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:31,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {19127#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19128#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:31,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {19128#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19128#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:31,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {19128#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19128#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:31,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {19128#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19129#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:31,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {19129#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19129#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:31,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {19129#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19129#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:31,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {19129#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19130#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:31,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {19130#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19130#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:31,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {19130#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19130#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:31,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {19130#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19131#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:31,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {19131#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19131#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:31,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {19131#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19131#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:31,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {19131#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19132#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:31,839 INFO L273 TraceCheckUtils]: 30: Hoare triple {19132#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19132#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:31,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {19132#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19132#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:31,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {19132#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19133#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:31,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {19133#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19133#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:31,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {19133#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19133#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:31,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {19133#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19134#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:31,842 INFO L273 TraceCheckUtils]: 36: Hoare triple {19134#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19134#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:31,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {19134#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19134#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:31,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {19134#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19135#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:31,844 INFO L273 TraceCheckUtils]: 39: Hoare triple {19135#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19135#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:31,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {19135#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19135#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:31,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {19135#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19136#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:31,846 INFO L273 TraceCheckUtils]: 42: Hoare triple {19136#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19136#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:31,846 INFO L273 TraceCheckUtils]: 43: Hoare triple {19136#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19136#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:31,847 INFO L273 TraceCheckUtils]: 44: Hoare triple {19136#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19137#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:31,847 INFO L273 TraceCheckUtils]: 45: Hoare triple {19137#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19137#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:31,848 INFO L273 TraceCheckUtils]: 46: Hoare triple {19137#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19137#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:31,849 INFO L273 TraceCheckUtils]: 47: Hoare triple {19137#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19138#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:31,849 INFO L273 TraceCheckUtils]: 48: Hoare triple {19138#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19138#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:31,850 INFO L273 TraceCheckUtils]: 49: Hoare triple {19138#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19138#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:31,850 INFO L273 TraceCheckUtils]: 50: Hoare triple {19138#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19139#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:31,851 INFO L273 TraceCheckUtils]: 51: Hoare triple {19139#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19139#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:31,851 INFO L273 TraceCheckUtils]: 52: Hoare triple {19139#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19139#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:31,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {19139#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19140#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:31,852 INFO L273 TraceCheckUtils]: 54: Hoare triple {19140#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19140#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:31,853 INFO L273 TraceCheckUtils]: 55: Hoare triple {19140#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19140#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:31,854 INFO L273 TraceCheckUtils]: 56: Hoare triple {19140#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19141#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:31,854 INFO L273 TraceCheckUtils]: 57: Hoare triple {19141#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19141#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:31,855 INFO L273 TraceCheckUtils]: 58: Hoare triple {19141#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19141#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:31,855 INFO L273 TraceCheckUtils]: 59: Hoare triple {19141#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19142#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:31,856 INFO L273 TraceCheckUtils]: 60: Hoare triple {19142#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19142#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:31,856 INFO L273 TraceCheckUtils]: 61: Hoare triple {19142#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19142#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:31,857 INFO L273 TraceCheckUtils]: 62: Hoare triple {19142#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19143#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:31,858 INFO L273 TraceCheckUtils]: 63: Hoare triple {19143#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19143#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:31,858 INFO L273 TraceCheckUtils]: 64: Hoare triple {19143#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19143#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:31,859 INFO L273 TraceCheckUtils]: 65: Hoare triple {19143#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19144#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:31,859 INFO L273 TraceCheckUtils]: 66: Hoare triple {19144#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19144#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:31,860 INFO L273 TraceCheckUtils]: 67: Hoare triple {19144#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19144#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:31,860 INFO L273 TraceCheckUtils]: 68: Hoare triple {19144#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19145#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:31,861 INFO L273 TraceCheckUtils]: 69: Hoare triple {19145#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19145#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:31,861 INFO L273 TraceCheckUtils]: 70: Hoare triple {19145#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19145#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:31,862 INFO L273 TraceCheckUtils]: 71: Hoare triple {19145#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19146#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:31,863 INFO L273 TraceCheckUtils]: 72: Hoare triple {19146#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19146#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:31,863 INFO L273 TraceCheckUtils]: 73: Hoare triple {19146#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19146#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:31,864 INFO L273 TraceCheckUtils]: 74: Hoare triple {19146#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19147#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:31,864 INFO L273 TraceCheckUtils]: 75: Hoare triple {19147#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19147#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:31,865 INFO L273 TraceCheckUtils]: 76: Hoare triple {19147#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19147#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:31,866 INFO L273 TraceCheckUtils]: 77: Hoare triple {19147#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19148#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:31,866 INFO L273 TraceCheckUtils]: 78: Hoare triple {19148#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19148#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:31,867 INFO L273 TraceCheckUtils]: 79: Hoare triple {19148#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19148#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:31,867 INFO L273 TraceCheckUtils]: 80: Hoare triple {19148#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19149#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:31,868 INFO L273 TraceCheckUtils]: 81: Hoare triple {19149#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19149#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:31,868 INFO L273 TraceCheckUtils]: 82: Hoare triple {19149#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19149#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:31,869 INFO L273 TraceCheckUtils]: 83: Hoare triple {19149#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19150#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:31,870 INFO L273 TraceCheckUtils]: 84: Hoare triple {19150#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19150#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:31,870 INFO L273 TraceCheckUtils]: 85: Hoare triple {19150#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19150#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:31,871 INFO L273 TraceCheckUtils]: 86: Hoare triple {19150#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19151#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:31,871 INFO L273 TraceCheckUtils]: 87: Hoare triple {19151#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19151#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:31,872 INFO L273 TraceCheckUtils]: 88: Hoare triple {19151#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19151#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:31,873 INFO L273 TraceCheckUtils]: 89: Hoare triple {19151#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19152#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:31,873 INFO L273 TraceCheckUtils]: 90: Hoare triple {19152#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19152#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:31,874 INFO L273 TraceCheckUtils]: 91: Hoare triple {19152#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19152#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:31,874 INFO L273 TraceCheckUtils]: 92: Hoare triple {19152#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19153#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:31,875 INFO L273 TraceCheckUtils]: 93: Hoare triple {19153#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19153#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:31,875 INFO L273 TraceCheckUtils]: 94: Hoare triple {19153#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19153#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:31,876 INFO L273 TraceCheckUtils]: 95: Hoare triple {19153#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19154#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:31,877 INFO L273 TraceCheckUtils]: 96: Hoare triple {19154#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19154#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:31,877 INFO L273 TraceCheckUtils]: 97: Hoare triple {19154#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19154#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:31,878 INFO L273 TraceCheckUtils]: 98: Hoare triple {19154#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19155#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:31,878 INFO L273 TraceCheckUtils]: 99: Hoare triple {19155#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19155#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:31,879 INFO L273 TraceCheckUtils]: 100: Hoare triple {19155#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19155#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:31,880 INFO L273 TraceCheckUtils]: 101: Hoare triple {19155#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19156#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:31,880 INFO L273 TraceCheckUtils]: 102: Hoare triple {19156#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19156#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:31,881 INFO L273 TraceCheckUtils]: 103: Hoare triple {19156#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19156#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:31,881 INFO L273 TraceCheckUtils]: 104: Hoare triple {19156#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19157#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:31,882 INFO L273 TraceCheckUtils]: 105: Hoare triple {19157#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19157#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:31,882 INFO L273 TraceCheckUtils]: 106: Hoare triple {19157#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19157#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:31,883 INFO L273 TraceCheckUtils]: 107: Hoare triple {19157#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19158#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:31,884 INFO L273 TraceCheckUtils]: 108: Hoare triple {19158#(<= main_~i~0 35)} assume !(~i~0 < 100000); {19123#false} is VALID [2018-11-23 11:59:31,884 INFO L273 TraceCheckUtils]: 109: Hoare triple {19123#false} havoc ~x~0;~x~0 := 0; {19123#false} is VALID [2018-11-23 11:59:31,884 INFO L273 TraceCheckUtils]: 110: Hoare triple {19123#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {19123#false} is VALID [2018-11-23 11:59:31,884 INFO L256 TraceCheckUtils]: 111: Hoare triple {19123#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {19123#false} is VALID [2018-11-23 11:59:31,884 INFO L273 TraceCheckUtils]: 112: Hoare triple {19123#false} ~cond := #in~cond; {19123#false} is VALID [2018-11-23 11:59:31,885 INFO L273 TraceCheckUtils]: 113: Hoare triple {19123#false} assume 0 == ~cond; {19123#false} is VALID [2018-11-23 11:59:31,885 INFO L273 TraceCheckUtils]: 114: Hoare triple {19123#false} assume !false; {19123#false} is VALID [2018-11-23 11:59:31,895 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:59:31,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:31,895 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:59:31,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:31,955 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:31,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:31,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:32,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {19122#true} call ULTIMATE.init(); {19122#true} is VALID [2018-11-23 11:59:32,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {19122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19122#true} is VALID [2018-11-23 11:59:32,260 INFO L273 TraceCheckUtils]: 2: Hoare triple {19122#true} assume true; {19122#true} is VALID [2018-11-23 11:59:32,260 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19122#true} {19122#true} #54#return; {19122#true} is VALID [2018-11-23 11:59:32,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {19122#true} call #t~ret6 := main(); {19122#true} is VALID [2018-11-23 11:59:32,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {19122#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19124#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:32,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {19124#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19124#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:32,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {19124#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19124#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:32,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {19124#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19125#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:32,263 INFO L273 TraceCheckUtils]: 9: Hoare triple {19125#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19125#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:32,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {19125#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19125#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:32,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {19125#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19126#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:32,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {19126#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19126#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:32,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {19126#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19126#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:32,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {19126#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19127#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:32,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {19127#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19127#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:32,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {19127#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19127#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:32,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {19127#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19128#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:32,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {19128#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19128#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:32,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {19128#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19128#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:32,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {19128#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19129#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:32,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {19129#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19129#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:32,270 INFO L273 TraceCheckUtils]: 22: Hoare triple {19129#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19129#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:32,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {19129#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19130#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:32,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {19130#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19130#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:32,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {19130#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19130#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:32,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {19130#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19131#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:32,273 INFO L273 TraceCheckUtils]: 27: Hoare triple {19131#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19131#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:32,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {19131#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19131#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:32,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {19131#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19132#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:32,274 INFO L273 TraceCheckUtils]: 30: Hoare triple {19132#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19132#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:32,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {19132#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19132#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:32,276 INFO L273 TraceCheckUtils]: 32: Hoare triple {19132#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19133#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:32,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {19133#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19133#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:32,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {19133#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19133#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:32,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {19133#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19134#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:32,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {19134#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19134#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:32,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {19134#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19134#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:32,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {19134#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19135#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:32,280 INFO L273 TraceCheckUtils]: 39: Hoare triple {19135#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19135#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:32,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {19135#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19135#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:32,281 INFO L273 TraceCheckUtils]: 41: Hoare triple {19135#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19136#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:32,281 INFO L273 TraceCheckUtils]: 42: Hoare triple {19136#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19136#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:32,282 INFO L273 TraceCheckUtils]: 43: Hoare triple {19136#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19136#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:32,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {19136#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19137#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:32,283 INFO L273 TraceCheckUtils]: 45: Hoare triple {19137#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19137#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:32,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {19137#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19137#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:32,284 INFO L273 TraceCheckUtils]: 47: Hoare triple {19137#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19138#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:32,285 INFO L273 TraceCheckUtils]: 48: Hoare triple {19138#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19138#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:32,285 INFO L273 TraceCheckUtils]: 49: Hoare triple {19138#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19138#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:32,286 INFO L273 TraceCheckUtils]: 50: Hoare triple {19138#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19139#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:32,286 INFO L273 TraceCheckUtils]: 51: Hoare triple {19139#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19139#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:32,287 INFO L273 TraceCheckUtils]: 52: Hoare triple {19139#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19139#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:32,288 INFO L273 TraceCheckUtils]: 53: Hoare triple {19139#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19140#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:32,288 INFO L273 TraceCheckUtils]: 54: Hoare triple {19140#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19140#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:32,289 INFO L273 TraceCheckUtils]: 55: Hoare triple {19140#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19140#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:32,289 INFO L273 TraceCheckUtils]: 56: Hoare triple {19140#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19141#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:32,290 INFO L273 TraceCheckUtils]: 57: Hoare triple {19141#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19141#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:32,290 INFO L273 TraceCheckUtils]: 58: Hoare triple {19141#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19141#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:32,291 INFO L273 TraceCheckUtils]: 59: Hoare triple {19141#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19142#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:32,292 INFO L273 TraceCheckUtils]: 60: Hoare triple {19142#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19142#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:32,292 INFO L273 TraceCheckUtils]: 61: Hoare triple {19142#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19142#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:32,293 INFO L273 TraceCheckUtils]: 62: Hoare triple {19142#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19143#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:32,293 INFO L273 TraceCheckUtils]: 63: Hoare triple {19143#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19143#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:32,294 INFO L273 TraceCheckUtils]: 64: Hoare triple {19143#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19143#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:32,294 INFO L273 TraceCheckUtils]: 65: Hoare triple {19143#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19144#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:32,295 INFO L273 TraceCheckUtils]: 66: Hoare triple {19144#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19144#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:32,295 INFO L273 TraceCheckUtils]: 67: Hoare triple {19144#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19144#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:32,296 INFO L273 TraceCheckUtils]: 68: Hoare triple {19144#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19145#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:32,297 INFO L273 TraceCheckUtils]: 69: Hoare triple {19145#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19145#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:32,297 INFO L273 TraceCheckUtils]: 70: Hoare triple {19145#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19145#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:32,298 INFO L273 TraceCheckUtils]: 71: Hoare triple {19145#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19146#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:32,298 INFO L273 TraceCheckUtils]: 72: Hoare triple {19146#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19146#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:32,299 INFO L273 TraceCheckUtils]: 73: Hoare triple {19146#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19146#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:32,300 INFO L273 TraceCheckUtils]: 74: Hoare triple {19146#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19147#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:32,300 INFO L273 TraceCheckUtils]: 75: Hoare triple {19147#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19147#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:32,301 INFO L273 TraceCheckUtils]: 76: Hoare triple {19147#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19147#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:32,301 INFO L273 TraceCheckUtils]: 77: Hoare triple {19147#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19148#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:32,302 INFO L273 TraceCheckUtils]: 78: Hoare triple {19148#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19148#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:32,302 INFO L273 TraceCheckUtils]: 79: Hoare triple {19148#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19148#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:32,303 INFO L273 TraceCheckUtils]: 80: Hoare triple {19148#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19149#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:32,304 INFO L273 TraceCheckUtils]: 81: Hoare triple {19149#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19149#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:32,304 INFO L273 TraceCheckUtils]: 82: Hoare triple {19149#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19149#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:32,305 INFO L273 TraceCheckUtils]: 83: Hoare triple {19149#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19150#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:32,305 INFO L273 TraceCheckUtils]: 84: Hoare triple {19150#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19150#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:32,306 INFO L273 TraceCheckUtils]: 85: Hoare triple {19150#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19150#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:32,306 INFO L273 TraceCheckUtils]: 86: Hoare triple {19150#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19151#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:32,307 INFO L273 TraceCheckUtils]: 87: Hoare triple {19151#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19151#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:32,307 INFO L273 TraceCheckUtils]: 88: Hoare triple {19151#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19151#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:32,308 INFO L273 TraceCheckUtils]: 89: Hoare triple {19151#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19152#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:32,309 INFO L273 TraceCheckUtils]: 90: Hoare triple {19152#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19152#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:32,309 INFO L273 TraceCheckUtils]: 91: Hoare triple {19152#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19152#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:32,310 INFO L273 TraceCheckUtils]: 92: Hoare triple {19152#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19153#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:32,310 INFO L273 TraceCheckUtils]: 93: Hoare triple {19153#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19153#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:32,311 INFO L273 TraceCheckUtils]: 94: Hoare triple {19153#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19153#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:32,312 INFO L273 TraceCheckUtils]: 95: Hoare triple {19153#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19154#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:32,312 INFO L273 TraceCheckUtils]: 96: Hoare triple {19154#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19154#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:32,313 INFO L273 TraceCheckUtils]: 97: Hoare triple {19154#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19154#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:32,313 INFO L273 TraceCheckUtils]: 98: Hoare triple {19154#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19155#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:32,314 INFO L273 TraceCheckUtils]: 99: Hoare triple {19155#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19155#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:32,314 INFO L273 TraceCheckUtils]: 100: Hoare triple {19155#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19155#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:32,315 INFO L273 TraceCheckUtils]: 101: Hoare triple {19155#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19156#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:32,316 INFO L273 TraceCheckUtils]: 102: Hoare triple {19156#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19156#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:32,316 INFO L273 TraceCheckUtils]: 103: Hoare triple {19156#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19156#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:32,317 INFO L273 TraceCheckUtils]: 104: Hoare triple {19156#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19157#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:32,317 INFO L273 TraceCheckUtils]: 105: Hoare triple {19157#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {19157#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:32,318 INFO L273 TraceCheckUtils]: 106: Hoare triple {19157#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {19157#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:32,319 INFO L273 TraceCheckUtils]: 107: Hoare triple {19157#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19158#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:32,319 INFO L273 TraceCheckUtils]: 108: Hoare triple {19158#(<= main_~i~0 35)} assume !(~i~0 < 100000); {19123#false} is VALID [2018-11-23 11:59:32,319 INFO L273 TraceCheckUtils]: 109: Hoare triple {19123#false} havoc ~x~0;~x~0 := 0; {19123#false} is VALID [2018-11-23 11:59:32,320 INFO L273 TraceCheckUtils]: 110: Hoare triple {19123#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {19123#false} is VALID [2018-11-23 11:59:32,320 INFO L256 TraceCheckUtils]: 111: Hoare triple {19123#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {19123#false} is VALID [2018-11-23 11:59:32,320 INFO L273 TraceCheckUtils]: 112: Hoare triple {19123#false} ~cond := #in~cond; {19123#false} is VALID [2018-11-23 11:59:32,320 INFO L273 TraceCheckUtils]: 113: Hoare triple {19123#false} assume 0 == ~cond; {19123#false} is VALID [2018-11-23 11:59:32,320 INFO L273 TraceCheckUtils]: 114: Hoare triple {19123#false} assume !false; {19123#false} is VALID [2018-11-23 11:59:32,329 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:59:32,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:32,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-11-23 11:59:32,348 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2018-11-23 11:59:32,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:32,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 11:59:32,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:32,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 11:59:32,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 11:59:32,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:59:32,460 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand 37 states. [2018-11-23 11:59:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:33,100 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2018-11-23 11:59:33,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 11:59:33,100 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2018-11-23 11:59:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:59:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 174 transitions. [2018-11-23 11:59:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:59:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 174 transitions. [2018-11-23 11:59:33,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 174 transitions. [2018-11-23 11:59:33,595 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:59:33,597 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:59:33,597 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 11:59:33,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:59:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 11:59:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 11:59:33,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:33,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 11:59:33,713 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 11:59:33,713 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 11:59:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:33,715 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2018-11-23 11:59:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2018-11-23 11:59:33,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:33,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:33,715 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 11:59:33,716 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 11:59:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:33,717 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2018-11-23 11:59:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2018-11-23 11:59:33,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:33,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:33,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:33,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 11:59:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 159 transitions. [2018-11-23 11:59:33,719 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 159 transitions. Word has length 115 [2018-11-23 11:59:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:33,720 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 159 transitions. [2018-11-23 11:59:33,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 11:59:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 159 transitions. [2018-11-23 11:59:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 11:59:33,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:33,720 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:59:33,721 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:33,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:33,721 INFO L82 PathProgramCache]: Analyzing trace with hash -794140764, now seen corresponding path program 35 times [2018-11-23 11:59:33,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:33,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:33,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:33,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:34,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {20101#true} call ULTIMATE.init(); {20101#true} is VALID [2018-11-23 11:59:34,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {20101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20101#true} is VALID [2018-11-23 11:59:34,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {20101#true} assume true; {20101#true} is VALID [2018-11-23 11:59:34,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20101#true} {20101#true} #54#return; {20101#true} is VALID [2018-11-23 11:59:34,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {20101#true} call #t~ret6 := main(); {20101#true} is VALID [2018-11-23 11:59:34,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {20101#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20103#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:34,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {20103#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20103#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:34,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {20103#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20103#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:34,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {20103#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20104#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:34,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {20104#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20104#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:34,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {20104#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20104#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:34,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {20104#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20105#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:34,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {20105#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20105#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:34,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {20105#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20105#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:34,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {20105#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20106#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:34,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {20106#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20106#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:34,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {20106#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20106#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:34,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {20106#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20107#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:34,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {20107#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20107#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:34,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {20107#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20107#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:34,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {20107#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:34,499 INFO L273 TraceCheckUtils]: 21: Hoare triple {20108#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20108#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:34,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {20108#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20108#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:34,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {20108#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20109#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:34,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {20109#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20109#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:34,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {20109#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20109#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:34,502 INFO L273 TraceCheckUtils]: 26: Hoare triple {20109#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20110#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:34,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {20110#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20110#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:34,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {20110#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20110#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:34,504 INFO L273 TraceCheckUtils]: 29: Hoare triple {20110#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20111#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:34,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {20111#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20111#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:34,505 INFO L273 TraceCheckUtils]: 31: Hoare triple {20111#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20111#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:34,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {20111#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20112#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:34,506 INFO L273 TraceCheckUtils]: 33: Hoare triple {20112#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20112#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:34,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {20112#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20112#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:34,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {20112#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20113#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:34,508 INFO L273 TraceCheckUtils]: 36: Hoare triple {20113#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20113#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:34,509 INFO L273 TraceCheckUtils]: 37: Hoare triple {20113#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20113#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:34,509 INFO L273 TraceCheckUtils]: 38: Hoare triple {20113#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20114#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:34,510 INFO L273 TraceCheckUtils]: 39: Hoare triple {20114#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20114#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:34,510 INFO L273 TraceCheckUtils]: 40: Hoare triple {20114#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20114#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:34,511 INFO L273 TraceCheckUtils]: 41: Hoare triple {20114#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20115#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:34,511 INFO L273 TraceCheckUtils]: 42: Hoare triple {20115#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20115#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:34,512 INFO L273 TraceCheckUtils]: 43: Hoare triple {20115#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20115#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:34,513 INFO L273 TraceCheckUtils]: 44: Hoare triple {20115#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20116#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:34,513 INFO L273 TraceCheckUtils]: 45: Hoare triple {20116#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20116#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:34,514 INFO L273 TraceCheckUtils]: 46: Hoare triple {20116#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20116#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:34,514 INFO L273 TraceCheckUtils]: 47: Hoare triple {20116#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20117#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:34,515 INFO L273 TraceCheckUtils]: 48: Hoare triple {20117#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20117#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:34,515 INFO L273 TraceCheckUtils]: 49: Hoare triple {20117#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20117#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:34,516 INFO L273 TraceCheckUtils]: 50: Hoare triple {20117#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20118#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:34,517 INFO L273 TraceCheckUtils]: 51: Hoare triple {20118#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20118#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:34,517 INFO L273 TraceCheckUtils]: 52: Hoare triple {20118#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20118#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:34,518 INFO L273 TraceCheckUtils]: 53: Hoare triple {20118#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20119#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:34,518 INFO L273 TraceCheckUtils]: 54: Hoare triple {20119#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20119#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:34,519 INFO L273 TraceCheckUtils]: 55: Hoare triple {20119#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20119#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:34,519 INFO L273 TraceCheckUtils]: 56: Hoare triple {20119#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20120#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:34,520 INFO L273 TraceCheckUtils]: 57: Hoare triple {20120#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20120#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:34,520 INFO L273 TraceCheckUtils]: 58: Hoare triple {20120#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20120#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:34,521 INFO L273 TraceCheckUtils]: 59: Hoare triple {20120#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20121#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:34,522 INFO L273 TraceCheckUtils]: 60: Hoare triple {20121#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20121#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:34,522 INFO L273 TraceCheckUtils]: 61: Hoare triple {20121#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20121#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:34,523 INFO L273 TraceCheckUtils]: 62: Hoare triple {20121#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20122#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:34,523 INFO L273 TraceCheckUtils]: 63: Hoare triple {20122#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20122#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:34,524 INFO L273 TraceCheckUtils]: 64: Hoare triple {20122#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20122#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:34,525 INFO L273 TraceCheckUtils]: 65: Hoare triple {20122#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20123#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:34,525 INFO L273 TraceCheckUtils]: 66: Hoare triple {20123#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20123#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:34,526 INFO L273 TraceCheckUtils]: 67: Hoare triple {20123#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20123#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:34,526 INFO L273 TraceCheckUtils]: 68: Hoare triple {20123#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20124#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:34,527 INFO L273 TraceCheckUtils]: 69: Hoare triple {20124#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20124#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:34,527 INFO L273 TraceCheckUtils]: 70: Hoare triple {20124#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20124#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:34,528 INFO L273 TraceCheckUtils]: 71: Hoare triple {20124#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20125#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:34,529 INFO L273 TraceCheckUtils]: 72: Hoare triple {20125#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20125#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:34,529 INFO L273 TraceCheckUtils]: 73: Hoare triple {20125#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20125#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:34,530 INFO L273 TraceCheckUtils]: 74: Hoare triple {20125#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20126#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:34,530 INFO L273 TraceCheckUtils]: 75: Hoare triple {20126#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20126#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:34,531 INFO L273 TraceCheckUtils]: 76: Hoare triple {20126#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20126#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:34,531 INFO L273 TraceCheckUtils]: 77: Hoare triple {20126#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20127#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:34,532 INFO L273 TraceCheckUtils]: 78: Hoare triple {20127#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20127#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:34,532 INFO L273 TraceCheckUtils]: 79: Hoare triple {20127#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20127#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:34,533 INFO L273 TraceCheckUtils]: 80: Hoare triple {20127#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20128#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:34,534 INFO L273 TraceCheckUtils]: 81: Hoare triple {20128#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20128#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:34,534 INFO L273 TraceCheckUtils]: 82: Hoare triple {20128#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20128#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:34,535 INFO L273 TraceCheckUtils]: 83: Hoare triple {20128#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20129#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:34,535 INFO L273 TraceCheckUtils]: 84: Hoare triple {20129#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20129#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:34,536 INFO L273 TraceCheckUtils]: 85: Hoare triple {20129#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20129#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:34,537 INFO L273 TraceCheckUtils]: 86: Hoare triple {20129#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20130#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:34,537 INFO L273 TraceCheckUtils]: 87: Hoare triple {20130#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20130#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:34,538 INFO L273 TraceCheckUtils]: 88: Hoare triple {20130#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20130#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:34,538 INFO L273 TraceCheckUtils]: 89: Hoare triple {20130#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20131#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:34,539 INFO L273 TraceCheckUtils]: 90: Hoare triple {20131#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20131#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:34,539 INFO L273 TraceCheckUtils]: 91: Hoare triple {20131#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20131#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:34,540 INFO L273 TraceCheckUtils]: 92: Hoare triple {20131#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:34,540 INFO L273 TraceCheckUtils]: 93: Hoare triple {20132#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20132#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:34,541 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20132#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:34,542 INFO L273 TraceCheckUtils]: 95: Hoare triple {20132#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20133#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:34,542 INFO L273 TraceCheckUtils]: 96: Hoare triple {20133#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20133#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:34,543 INFO L273 TraceCheckUtils]: 97: Hoare triple {20133#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20133#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:34,543 INFO L273 TraceCheckUtils]: 98: Hoare triple {20133#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20134#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:34,544 INFO L273 TraceCheckUtils]: 99: Hoare triple {20134#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20134#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:34,544 INFO L273 TraceCheckUtils]: 100: Hoare triple {20134#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20134#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:34,545 INFO L273 TraceCheckUtils]: 101: Hoare triple {20134#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20135#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:34,546 INFO L273 TraceCheckUtils]: 102: Hoare triple {20135#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20135#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:34,546 INFO L273 TraceCheckUtils]: 103: Hoare triple {20135#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20135#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:34,547 INFO L273 TraceCheckUtils]: 104: Hoare triple {20135#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20136#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:34,547 INFO L273 TraceCheckUtils]: 105: Hoare triple {20136#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20136#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:34,548 INFO L273 TraceCheckUtils]: 106: Hoare triple {20136#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20136#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:34,549 INFO L273 TraceCheckUtils]: 107: Hoare triple {20136#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20137#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:34,549 INFO L273 TraceCheckUtils]: 108: Hoare triple {20137#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20137#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:34,550 INFO L273 TraceCheckUtils]: 109: Hoare triple {20137#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20137#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:34,550 INFO L273 TraceCheckUtils]: 110: Hoare triple {20137#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20138#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:34,551 INFO L273 TraceCheckUtils]: 111: Hoare triple {20138#(<= main_~i~0 36)} assume !(~i~0 < 100000); {20102#false} is VALID [2018-11-23 11:59:34,551 INFO L273 TraceCheckUtils]: 112: Hoare triple {20102#false} havoc ~x~0;~x~0 := 0; {20102#false} is VALID [2018-11-23 11:59:34,551 INFO L273 TraceCheckUtils]: 113: Hoare triple {20102#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {20102#false} is VALID [2018-11-23 11:59:34,551 INFO L256 TraceCheckUtils]: 114: Hoare triple {20102#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {20102#false} is VALID [2018-11-23 11:59:34,552 INFO L273 TraceCheckUtils]: 115: Hoare triple {20102#false} ~cond := #in~cond; {20102#false} is VALID [2018-11-23 11:59:34,552 INFO L273 TraceCheckUtils]: 116: Hoare triple {20102#false} assume 0 == ~cond; {20102#false} is VALID [2018-11-23 11:59:34,552 INFO L273 TraceCheckUtils]: 117: Hoare triple {20102#false} assume !false; {20102#false} is VALID [2018-11-23 11:59:34,562 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:59:34,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:34,562 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:59:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:34,647 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 11:59:34,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:34,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:34,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {20101#true} call ULTIMATE.init(); {20101#true} is VALID [2018-11-23 11:59:34,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {20101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20101#true} is VALID [2018-11-23 11:59:34,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {20101#true} assume true; {20101#true} is VALID [2018-11-23 11:59:34,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20101#true} {20101#true} #54#return; {20101#true} is VALID [2018-11-23 11:59:34,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {20101#true} call #t~ret6 := main(); {20101#true} is VALID [2018-11-23 11:59:34,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {20101#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20103#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:34,926 INFO L273 TraceCheckUtils]: 6: Hoare triple {20103#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20103#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:34,927 INFO L273 TraceCheckUtils]: 7: Hoare triple {20103#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20103#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:34,927 INFO L273 TraceCheckUtils]: 8: Hoare triple {20103#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20104#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:34,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {20104#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20104#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:34,928 INFO L273 TraceCheckUtils]: 10: Hoare triple {20104#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20104#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:34,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {20104#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20105#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:34,929 INFO L273 TraceCheckUtils]: 12: Hoare triple {20105#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20105#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:34,929 INFO L273 TraceCheckUtils]: 13: Hoare triple {20105#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20105#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:34,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {20105#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20106#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:34,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {20106#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20106#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:34,930 INFO L273 TraceCheckUtils]: 16: Hoare triple {20106#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20106#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:34,931 INFO L273 TraceCheckUtils]: 17: Hoare triple {20106#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20107#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:34,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {20107#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20107#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:34,932 INFO L273 TraceCheckUtils]: 19: Hoare triple {20107#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20107#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:34,932 INFO L273 TraceCheckUtils]: 20: Hoare triple {20107#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:34,933 INFO L273 TraceCheckUtils]: 21: Hoare triple {20108#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20108#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:34,933 INFO L273 TraceCheckUtils]: 22: Hoare triple {20108#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20108#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:34,934 INFO L273 TraceCheckUtils]: 23: Hoare triple {20108#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20109#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:34,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {20109#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20109#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:34,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {20109#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20109#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:34,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {20109#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20110#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:34,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {20110#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20110#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:34,937 INFO L273 TraceCheckUtils]: 28: Hoare triple {20110#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20110#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:34,938 INFO L273 TraceCheckUtils]: 29: Hoare triple {20110#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20111#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:34,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {20111#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20111#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:34,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {20111#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20111#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:34,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {20111#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20112#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:34,940 INFO L273 TraceCheckUtils]: 33: Hoare triple {20112#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20112#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:34,940 INFO L273 TraceCheckUtils]: 34: Hoare triple {20112#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20112#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:34,941 INFO L273 TraceCheckUtils]: 35: Hoare triple {20112#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20113#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:34,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {20113#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20113#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:34,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {20113#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20113#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:34,943 INFO L273 TraceCheckUtils]: 38: Hoare triple {20113#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20114#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:34,943 INFO L273 TraceCheckUtils]: 39: Hoare triple {20114#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20114#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:34,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {20114#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20114#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:34,944 INFO L273 TraceCheckUtils]: 41: Hoare triple {20114#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20115#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:34,945 INFO L273 TraceCheckUtils]: 42: Hoare triple {20115#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20115#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:34,946 INFO L273 TraceCheckUtils]: 43: Hoare triple {20115#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20115#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:34,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {20115#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20116#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:34,947 INFO L273 TraceCheckUtils]: 45: Hoare triple {20116#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20116#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:34,947 INFO L273 TraceCheckUtils]: 46: Hoare triple {20116#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20116#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:34,948 INFO L273 TraceCheckUtils]: 47: Hoare triple {20116#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20117#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:34,948 INFO L273 TraceCheckUtils]: 48: Hoare triple {20117#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20117#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:34,949 INFO L273 TraceCheckUtils]: 49: Hoare triple {20117#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20117#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:34,950 INFO L273 TraceCheckUtils]: 50: Hoare triple {20117#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20118#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:34,950 INFO L273 TraceCheckUtils]: 51: Hoare triple {20118#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20118#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:34,951 INFO L273 TraceCheckUtils]: 52: Hoare triple {20118#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20118#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:34,951 INFO L273 TraceCheckUtils]: 53: Hoare triple {20118#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20119#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:34,952 INFO L273 TraceCheckUtils]: 54: Hoare triple {20119#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20119#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:34,952 INFO L273 TraceCheckUtils]: 55: Hoare triple {20119#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20119#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:34,953 INFO L273 TraceCheckUtils]: 56: Hoare triple {20119#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20120#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:34,954 INFO L273 TraceCheckUtils]: 57: Hoare triple {20120#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20120#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:34,954 INFO L273 TraceCheckUtils]: 58: Hoare triple {20120#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20120#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:34,955 INFO L273 TraceCheckUtils]: 59: Hoare triple {20120#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20121#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:34,955 INFO L273 TraceCheckUtils]: 60: Hoare triple {20121#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20121#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:34,956 INFO L273 TraceCheckUtils]: 61: Hoare triple {20121#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20121#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:34,957 INFO L273 TraceCheckUtils]: 62: Hoare triple {20121#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20122#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:34,957 INFO L273 TraceCheckUtils]: 63: Hoare triple {20122#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20122#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:34,958 INFO L273 TraceCheckUtils]: 64: Hoare triple {20122#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20122#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:34,958 INFO L273 TraceCheckUtils]: 65: Hoare triple {20122#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20123#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:34,959 INFO L273 TraceCheckUtils]: 66: Hoare triple {20123#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20123#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:34,959 INFO L273 TraceCheckUtils]: 67: Hoare triple {20123#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20123#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:34,960 INFO L273 TraceCheckUtils]: 68: Hoare triple {20123#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20124#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:34,961 INFO L273 TraceCheckUtils]: 69: Hoare triple {20124#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20124#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:34,961 INFO L273 TraceCheckUtils]: 70: Hoare triple {20124#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20124#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:34,962 INFO L273 TraceCheckUtils]: 71: Hoare triple {20124#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20125#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:34,962 INFO L273 TraceCheckUtils]: 72: Hoare triple {20125#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20125#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:34,963 INFO L273 TraceCheckUtils]: 73: Hoare triple {20125#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20125#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:34,963 INFO L273 TraceCheckUtils]: 74: Hoare triple {20125#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20126#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:34,964 INFO L273 TraceCheckUtils]: 75: Hoare triple {20126#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20126#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:34,964 INFO L273 TraceCheckUtils]: 76: Hoare triple {20126#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20126#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:34,965 INFO L273 TraceCheckUtils]: 77: Hoare triple {20126#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20127#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:34,966 INFO L273 TraceCheckUtils]: 78: Hoare triple {20127#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20127#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:34,966 INFO L273 TraceCheckUtils]: 79: Hoare triple {20127#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20127#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:34,967 INFO L273 TraceCheckUtils]: 80: Hoare triple {20127#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20128#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:34,967 INFO L273 TraceCheckUtils]: 81: Hoare triple {20128#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20128#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:34,968 INFO L273 TraceCheckUtils]: 82: Hoare triple {20128#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20128#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:34,969 INFO L273 TraceCheckUtils]: 83: Hoare triple {20128#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20129#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:34,969 INFO L273 TraceCheckUtils]: 84: Hoare triple {20129#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20129#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:34,970 INFO L273 TraceCheckUtils]: 85: Hoare triple {20129#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20129#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:34,970 INFO L273 TraceCheckUtils]: 86: Hoare triple {20129#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20130#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:34,971 INFO L273 TraceCheckUtils]: 87: Hoare triple {20130#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20130#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:34,971 INFO L273 TraceCheckUtils]: 88: Hoare triple {20130#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20130#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:34,972 INFO L273 TraceCheckUtils]: 89: Hoare triple {20130#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20131#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:34,972 INFO L273 TraceCheckUtils]: 90: Hoare triple {20131#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20131#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:34,973 INFO L273 TraceCheckUtils]: 91: Hoare triple {20131#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20131#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:34,974 INFO L273 TraceCheckUtils]: 92: Hoare triple {20131#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:34,974 INFO L273 TraceCheckUtils]: 93: Hoare triple {20132#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20132#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:34,975 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20132#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:34,975 INFO L273 TraceCheckUtils]: 95: Hoare triple {20132#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20133#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:34,976 INFO L273 TraceCheckUtils]: 96: Hoare triple {20133#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20133#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:34,976 INFO L273 TraceCheckUtils]: 97: Hoare triple {20133#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20133#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:34,977 INFO L273 TraceCheckUtils]: 98: Hoare triple {20133#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20134#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:34,978 INFO L273 TraceCheckUtils]: 99: Hoare triple {20134#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20134#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:34,978 INFO L273 TraceCheckUtils]: 100: Hoare triple {20134#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20134#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:34,979 INFO L273 TraceCheckUtils]: 101: Hoare triple {20134#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20135#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:34,979 INFO L273 TraceCheckUtils]: 102: Hoare triple {20135#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20135#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:34,980 INFO L273 TraceCheckUtils]: 103: Hoare triple {20135#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20135#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:34,981 INFO L273 TraceCheckUtils]: 104: Hoare triple {20135#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20136#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:34,981 INFO L273 TraceCheckUtils]: 105: Hoare triple {20136#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20136#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:34,982 INFO L273 TraceCheckUtils]: 106: Hoare triple {20136#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20136#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:34,982 INFO L273 TraceCheckUtils]: 107: Hoare triple {20136#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20137#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:34,983 INFO L273 TraceCheckUtils]: 108: Hoare triple {20137#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20137#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:34,983 INFO L273 TraceCheckUtils]: 109: Hoare triple {20137#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {20137#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:34,984 INFO L273 TraceCheckUtils]: 110: Hoare triple {20137#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20138#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:34,985 INFO L273 TraceCheckUtils]: 111: Hoare triple {20138#(<= main_~i~0 36)} assume !(~i~0 < 100000); {20102#false} is VALID [2018-11-23 11:59:34,985 INFO L273 TraceCheckUtils]: 112: Hoare triple {20102#false} havoc ~x~0;~x~0 := 0; {20102#false} is VALID [2018-11-23 11:59:34,985 INFO L273 TraceCheckUtils]: 113: Hoare triple {20102#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {20102#false} is VALID [2018-11-23 11:59:34,985 INFO L256 TraceCheckUtils]: 114: Hoare triple {20102#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {20102#false} is VALID [2018-11-23 11:59:34,985 INFO L273 TraceCheckUtils]: 115: Hoare triple {20102#false} ~cond := #in~cond; {20102#false} is VALID [2018-11-23 11:59:34,986 INFO L273 TraceCheckUtils]: 116: Hoare triple {20102#false} assume 0 == ~cond; {20102#false} is VALID [2018-11-23 11:59:34,986 INFO L273 TraceCheckUtils]: 117: Hoare triple {20102#false} assume !false; {20102#false} is VALID [2018-11-23 11:59:34,997 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:59:35,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:35,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-11-23 11:59:35,016 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 118 [2018-11-23 11:59:35,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:35,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:59:35,132 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:59:35,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:59:35,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:59:35,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:59:35,134 INFO L87 Difference]: Start difference. First operand 123 states and 159 transitions. Second operand 38 states. [2018-11-23 11:59:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:36,185 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2018-11-23 11:59:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 11:59:36,185 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 118 [2018-11-23 11:59:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2018-11-23 11:59:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2018-11-23 11:59:36,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 178 transitions. [2018-11-23 11:59:36,357 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:59:36,360 INFO L225 Difference]: With dead ends: 139 [2018-11-23 11:59:36,360 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 11:59:36,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:59:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 11:59:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-23 11:59:36,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:36,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 126 states. [2018-11-23 11:59:36,746 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 126 states. [2018-11-23 11:59:36,746 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 126 states. [2018-11-23 11:59:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:36,748 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-11-23 11:59:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2018-11-23 11:59:36,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:36,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:36,748 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 128 states. [2018-11-23 11:59:36,748 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 128 states. [2018-11-23 11:59:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:36,751 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-11-23 11:59:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2018-11-23 11:59:36,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:36,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:36,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:36,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:59:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2018-11-23 11:59:36,754 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 118 [2018-11-23 11:59:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:36,754 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2018-11-23 11:59:36,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:59:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2018-11-23 11:59:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 11:59:36,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:36,755 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:59:36,755 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:36,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:36,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1772698167, now seen corresponding path program 36 times [2018-11-23 11:59:36,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:36,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:36,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:36,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:36,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:37,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {21104#true} call ULTIMATE.init(); {21104#true} is VALID [2018-11-23 11:59:37,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {21104#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21104#true} is VALID [2018-11-23 11:59:37,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {21104#true} assume true; {21104#true} is VALID [2018-11-23 11:59:37,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21104#true} {21104#true} #54#return; {21104#true} is VALID [2018-11-23 11:59:37,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {21104#true} call #t~ret6 := main(); {21104#true} is VALID [2018-11-23 11:59:37,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {21104#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21106#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:37,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {21106#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21106#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:37,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {21106#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21106#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:37,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {21106#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21107#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:37,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {21107#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21107#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:37,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {21107#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21107#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:37,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {21107#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21108#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:37,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {21108#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21108#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:37,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {21108#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21108#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:37,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {21108#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21109#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:37,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {21109#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21109#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:37,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {21109#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21109#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:37,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {21109#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21110#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:37,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {21110#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21110#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:37,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {21110#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21110#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:37,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {21110#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21111#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:37,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {21111#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21111#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:37,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {21111#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21111#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:37,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {21111#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21112#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:37,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {21112#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21112#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:37,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {21112#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21112#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:37,508 INFO L273 TraceCheckUtils]: 26: Hoare triple {21112#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21113#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:37,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {21113#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21113#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:37,509 INFO L273 TraceCheckUtils]: 28: Hoare triple {21113#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21113#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:37,510 INFO L273 TraceCheckUtils]: 29: Hoare triple {21113#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21114#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:37,510 INFO L273 TraceCheckUtils]: 30: Hoare triple {21114#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21114#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:37,511 INFO L273 TraceCheckUtils]: 31: Hoare triple {21114#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21114#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:37,512 INFO L273 TraceCheckUtils]: 32: Hoare triple {21114#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21115#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:37,512 INFO L273 TraceCheckUtils]: 33: Hoare triple {21115#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21115#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:37,513 INFO L273 TraceCheckUtils]: 34: Hoare triple {21115#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21115#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:37,513 INFO L273 TraceCheckUtils]: 35: Hoare triple {21115#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21116#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:37,514 INFO L273 TraceCheckUtils]: 36: Hoare triple {21116#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21116#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:37,514 INFO L273 TraceCheckUtils]: 37: Hoare triple {21116#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21116#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:37,515 INFO L273 TraceCheckUtils]: 38: Hoare triple {21116#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21117#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:37,516 INFO L273 TraceCheckUtils]: 39: Hoare triple {21117#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21117#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:37,516 INFO L273 TraceCheckUtils]: 40: Hoare triple {21117#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21117#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:37,517 INFO L273 TraceCheckUtils]: 41: Hoare triple {21117#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21118#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:37,517 INFO L273 TraceCheckUtils]: 42: Hoare triple {21118#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21118#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:37,518 INFO L273 TraceCheckUtils]: 43: Hoare triple {21118#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21118#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:37,518 INFO L273 TraceCheckUtils]: 44: Hoare triple {21118#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21119#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:37,519 INFO L273 TraceCheckUtils]: 45: Hoare triple {21119#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21119#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:37,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {21119#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21119#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:37,520 INFO L273 TraceCheckUtils]: 47: Hoare triple {21119#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21120#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:37,521 INFO L273 TraceCheckUtils]: 48: Hoare triple {21120#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21120#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:37,521 INFO L273 TraceCheckUtils]: 49: Hoare triple {21120#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21120#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:37,522 INFO L273 TraceCheckUtils]: 50: Hoare triple {21120#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21121#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:37,522 INFO L273 TraceCheckUtils]: 51: Hoare triple {21121#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21121#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:37,523 INFO L273 TraceCheckUtils]: 52: Hoare triple {21121#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21121#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:37,524 INFO L273 TraceCheckUtils]: 53: Hoare triple {21121#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21122#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:37,524 INFO L273 TraceCheckUtils]: 54: Hoare triple {21122#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21122#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:37,525 INFO L273 TraceCheckUtils]: 55: Hoare triple {21122#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21122#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:37,525 INFO L273 TraceCheckUtils]: 56: Hoare triple {21122#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21123#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:37,526 INFO L273 TraceCheckUtils]: 57: Hoare triple {21123#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21123#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:37,526 INFO L273 TraceCheckUtils]: 58: Hoare triple {21123#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21123#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:37,527 INFO L273 TraceCheckUtils]: 59: Hoare triple {21123#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21124#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:37,528 INFO L273 TraceCheckUtils]: 60: Hoare triple {21124#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21124#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:37,528 INFO L273 TraceCheckUtils]: 61: Hoare triple {21124#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21124#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:37,529 INFO L273 TraceCheckUtils]: 62: Hoare triple {21124#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21125#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:37,529 INFO L273 TraceCheckUtils]: 63: Hoare triple {21125#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21125#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:37,530 INFO L273 TraceCheckUtils]: 64: Hoare triple {21125#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21125#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:37,531 INFO L273 TraceCheckUtils]: 65: Hoare triple {21125#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21126#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:37,531 INFO L273 TraceCheckUtils]: 66: Hoare triple {21126#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21126#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:37,532 INFO L273 TraceCheckUtils]: 67: Hoare triple {21126#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21126#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:37,532 INFO L273 TraceCheckUtils]: 68: Hoare triple {21126#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21127#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:37,533 INFO L273 TraceCheckUtils]: 69: Hoare triple {21127#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21127#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:37,533 INFO L273 TraceCheckUtils]: 70: Hoare triple {21127#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21127#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:37,534 INFO L273 TraceCheckUtils]: 71: Hoare triple {21127#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21128#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:37,535 INFO L273 TraceCheckUtils]: 72: Hoare triple {21128#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21128#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:37,535 INFO L273 TraceCheckUtils]: 73: Hoare triple {21128#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21128#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:37,536 INFO L273 TraceCheckUtils]: 74: Hoare triple {21128#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21129#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:37,536 INFO L273 TraceCheckUtils]: 75: Hoare triple {21129#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21129#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:37,537 INFO L273 TraceCheckUtils]: 76: Hoare triple {21129#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21129#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:37,537 INFO L273 TraceCheckUtils]: 77: Hoare triple {21129#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21130#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:37,538 INFO L273 TraceCheckUtils]: 78: Hoare triple {21130#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21130#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:37,538 INFO L273 TraceCheckUtils]: 79: Hoare triple {21130#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21130#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:37,539 INFO L273 TraceCheckUtils]: 80: Hoare triple {21130#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21131#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:37,540 INFO L273 TraceCheckUtils]: 81: Hoare triple {21131#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21131#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:37,540 INFO L273 TraceCheckUtils]: 82: Hoare triple {21131#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21131#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:37,541 INFO L273 TraceCheckUtils]: 83: Hoare triple {21131#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21132#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:37,541 INFO L273 TraceCheckUtils]: 84: Hoare triple {21132#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21132#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:37,542 INFO L273 TraceCheckUtils]: 85: Hoare triple {21132#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21132#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:37,543 INFO L273 TraceCheckUtils]: 86: Hoare triple {21132#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21133#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:37,543 INFO L273 TraceCheckUtils]: 87: Hoare triple {21133#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21133#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:37,544 INFO L273 TraceCheckUtils]: 88: Hoare triple {21133#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21133#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:37,544 INFO L273 TraceCheckUtils]: 89: Hoare triple {21133#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21134#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:37,545 INFO L273 TraceCheckUtils]: 90: Hoare triple {21134#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21134#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:37,545 INFO L273 TraceCheckUtils]: 91: Hoare triple {21134#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21134#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:37,546 INFO L273 TraceCheckUtils]: 92: Hoare triple {21134#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21135#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:37,547 INFO L273 TraceCheckUtils]: 93: Hoare triple {21135#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21135#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:37,547 INFO L273 TraceCheckUtils]: 94: Hoare triple {21135#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21135#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:37,548 INFO L273 TraceCheckUtils]: 95: Hoare triple {21135#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21136#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:37,548 INFO L273 TraceCheckUtils]: 96: Hoare triple {21136#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21136#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:37,549 INFO L273 TraceCheckUtils]: 97: Hoare triple {21136#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21136#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:37,549 INFO L273 TraceCheckUtils]: 98: Hoare triple {21136#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21137#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:37,550 INFO L273 TraceCheckUtils]: 99: Hoare triple {21137#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21137#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:37,550 INFO L273 TraceCheckUtils]: 100: Hoare triple {21137#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21137#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:37,551 INFO L273 TraceCheckUtils]: 101: Hoare triple {21137#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21138#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:37,552 INFO L273 TraceCheckUtils]: 102: Hoare triple {21138#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21138#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:37,552 INFO L273 TraceCheckUtils]: 103: Hoare triple {21138#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21138#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:37,553 INFO L273 TraceCheckUtils]: 104: Hoare triple {21138#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21139#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:37,553 INFO L273 TraceCheckUtils]: 105: Hoare triple {21139#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21139#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:37,554 INFO L273 TraceCheckUtils]: 106: Hoare triple {21139#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21139#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:37,555 INFO L273 TraceCheckUtils]: 107: Hoare triple {21139#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21140#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:37,555 INFO L273 TraceCheckUtils]: 108: Hoare triple {21140#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21140#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:37,556 INFO L273 TraceCheckUtils]: 109: Hoare triple {21140#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21140#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:37,556 INFO L273 TraceCheckUtils]: 110: Hoare triple {21140#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21141#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:37,557 INFO L273 TraceCheckUtils]: 111: Hoare triple {21141#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21141#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:37,557 INFO L273 TraceCheckUtils]: 112: Hoare triple {21141#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21141#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:37,558 INFO L273 TraceCheckUtils]: 113: Hoare triple {21141#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21142#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:37,559 INFO L273 TraceCheckUtils]: 114: Hoare triple {21142#(<= main_~i~0 37)} assume !(~i~0 < 100000); {21105#false} is VALID [2018-11-23 11:59:37,559 INFO L273 TraceCheckUtils]: 115: Hoare triple {21105#false} havoc ~x~0;~x~0 := 0; {21105#false} is VALID [2018-11-23 11:59:37,559 INFO L273 TraceCheckUtils]: 116: Hoare triple {21105#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {21105#false} is VALID [2018-11-23 11:59:37,559 INFO L256 TraceCheckUtils]: 117: Hoare triple {21105#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {21105#false} is VALID [2018-11-23 11:59:37,560 INFO L273 TraceCheckUtils]: 118: Hoare triple {21105#false} ~cond := #in~cond; {21105#false} is VALID [2018-11-23 11:59:37,560 INFO L273 TraceCheckUtils]: 119: Hoare triple {21105#false} assume 0 == ~cond; {21105#false} is VALID [2018-11-23 11:59:37,560 INFO L273 TraceCheckUtils]: 120: Hoare triple {21105#false} assume !false; {21105#false} is VALID [2018-11-23 11:59:37,570 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:59:37,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:37,571 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:59:37,580 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:37,687 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 11:59:37,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:37,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:38,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {21104#true} call ULTIMATE.init(); {21104#true} is VALID [2018-11-23 11:59:38,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {21104#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21104#true} is VALID [2018-11-23 11:59:38,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {21104#true} assume true; {21104#true} is VALID [2018-11-23 11:59:38,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21104#true} {21104#true} #54#return; {21104#true} is VALID [2018-11-23 11:59:38,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {21104#true} call #t~ret6 := main(); {21104#true} is VALID [2018-11-23 11:59:38,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {21104#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21106#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:38,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {21106#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21106#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:38,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {21106#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21106#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:38,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {21106#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21107#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:38,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {21107#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21107#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:38,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {21107#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21107#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:38,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {21107#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21108#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:38,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {21108#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21108#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:38,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {21108#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21108#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:38,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {21108#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21109#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:38,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {21109#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21109#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:38,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {21109#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21109#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:38,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {21109#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21110#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:38,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {21110#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21110#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:38,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {21110#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21110#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:38,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {21110#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21111#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:38,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {21111#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21111#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:38,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {21111#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21111#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:38,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {21111#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21112#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:38,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {21112#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21112#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:38,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {21112#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21112#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:38,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {21112#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21113#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:38,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {21113#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21113#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:38,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {21113#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21113#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:38,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {21113#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21114#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:38,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {21114#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21114#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:38,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {21114#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21114#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:38,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {21114#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21115#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:38,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {21115#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21115#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:38,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {21115#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21115#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:38,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {21115#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21116#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:38,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {21116#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21116#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:38,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {21116#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21116#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:38,306 INFO L273 TraceCheckUtils]: 38: Hoare triple {21116#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21117#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:38,306 INFO L273 TraceCheckUtils]: 39: Hoare triple {21117#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21117#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:38,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {21117#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21117#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:38,307 INFO L273 TraceCheckUtils]: 41: Hoare triple {21117#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21118#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:38,308 INFO L273 TraceCheckUtils]: 42: Hoare triple {21118#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21118#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:38,308 INFO L273 TraceCheckUtils]: 43: Hoare triple {21118#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21118#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:38,309 INFO L273 TraceCheckUtils]: 44: Hoare triple {21118#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21119#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:38,309 INFO L273 TraceCheckUtils]: 45: Hoare triple {21119#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21119#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:38,310 INFO L273 TraceCheckUtils]: 46: Hoare triple {21119#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21119#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:38,311 INFO L273 TraceCheckUtils]: 47: Hoare triple {21119#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21120#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:38,311 INFO L273 TraceCheckUtils]: 48: Hoare triple {21120#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21120#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:38,312 INFO L273 TraceCheckUtils]: 49: Hoare triple {21120#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21120#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:38,312 INFO L273 TraceCheckUtils]: 50: Hoare triple {21120#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21121#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:38,313 INFO L273 TraceCheckUtils]: 51: Hoare triple {21121#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21121#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:38,313 INFO L273 TraceCheckUtils]: 52: Hoare triple {21121#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21121#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:38,314 INFO L273 TraceCheckUtils]: 53: Hoare triple {21121#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21122#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:38,314 INFO L273 TraceCheckUtils]: 54: Hoare triple {21122#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21122#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:38,315 INFO L273 TraceCheckUtils]: 55: Hoare triple {21122#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21122#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:38,316 INFO L273 TraceCheckUtils]: 56: Hoare triple {21122#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21123#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:38,316 INFO L273 TraceCheckUtils]: 57: Hoare triple {21123#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21123#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:38,316 INFO L273 TraceCheckUtils]: 58: Hoare triple {21123#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21123#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:38,317 INFO L273 TraceCheckUtils]: 59: Hoare triple {21123#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21124#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:38,318 INFO L273 TraceCheckUtils]: 60: Hoare triple {21124#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21124#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:38,318 INFO L273 TraceCheckUtils]: 61: Hoare triple {21124#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21124#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:38,319 INFO L273 TraceCheckUtils]: 62: Hoare triple {21124#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21125#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:38,319 INFO L273 TraceCheckUtils]: 63: Hoare triple {21125#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21125#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:38,320 INFO L273 TraceCheckUtils]: 64: Hoare triple {21125#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21125#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:38,320 INFO L273 TraceCheckUtils]: 65: Hoare triple {21125#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21126#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:38,321 INFO L273 TraceCheckUtils]: 66: Hoare triple {21126#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21126#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:38,321 INFO L273 TraceCheckUtils]: 67: Hoare triple {21126#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21126#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:38,322 INFO L273 TraceCheckUtils]: 68: Hoare triple {21126#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21127#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:38,323 INFO L273 TraceCheckUtils]: 69: Hoare triple {21127#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21127#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:38,323 INFO L273 TraceCheckUtils]: 70: Hoare triple {21127#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21127#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:38,324 INFO L273 TraceCheckUtils]: 71: Hoare triple {21127#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21128#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:38,324 INFO L273 TraceCheckUtils]: 72: Hoare triple {21128#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21128#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:38,325 INFO L273 TraceCheckUtils]: 73: Hoare triple {21128#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21128#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:38,325 INFO L273 TraceCheckUtils]: 74: Hoare triple {21128#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21129#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:38,326 INFO L273 TraceCheckUtils]: 75: Hoare triple {21129#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21129#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:38,326 INFO L273 TraceCheckUtils]: 76: Hoare triple {21129#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21129#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:38,327 INFO L273 TraceCheckUtils]: 77: Hoare triple {21129#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21130#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:38,327 INFO L273 TraceCheckUtils]: 78: Hoare triple {21130#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21130#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:38,328 INFO L273 TraceCheckUtils]: 79: Hoare triple {21130#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21130#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:38,329 INFO L273 TraceCheckUtils]: 80: Hoare triple {21130#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21131#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:38,329 INFO L273 TraceCheckUtils]: 81: Hoare triple {21131#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21131#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:38,330 INFO L273 TraceCheckUtils]: 82: Hoare triple {21131#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21131#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:38,330 INFO L273 TraceCheckUtils]: 83: Hoare triple {21131#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21132#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:38,331 INFO L273 TraceCheckUtils]: 84: Hoare triple {21132#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21132#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:38,331 INFO L273 TraceCheckUtils]: 85: Hoare triple {21132#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21132#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:38,332 INFO L273 TraceCheckUtils]: 86: Hoare triple {21132#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21133#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:38,332 INFO L273 TraceCheckUtils]: 87: Hoare triple {21133#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21133#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:38,333 INFO L273 TraceCheckUtils]: 88: Hoare triple {21133#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21133#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:38,333 INFO L273 TraceCheckUtils]: 89: Hoare triple {21133#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21134#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:38,334 INFO L273 TraceCheckUtils]: 90: Hoare triple {21134#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21134#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:38,334 INFO L273 TraceCheckUtils]: 91: Hoare triple {21134#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21134#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:38,335 INFO L273 TraceCheckUtils]: 92: Hoare triple {21134#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21135#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:38,336 INFO L273 TraceCheckUtils]: 93: Hoare triple {21135#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21135#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:38,336 INFO L273 TraceCheckUtils]: 94: Hoare triple {21135#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21135#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:38,337 INFO L273 TraceCheckUtils]: 95: Hoare triple {21135#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21136#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:38,337 INFO L273 TraceCheckUtils]: 96: Hoare triple {21136#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21136#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:38,338 INFO L273 TraceCheckUtils]: 97: Hoare triple {21136#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21136#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:38,338 INFO L273 TraceCheckUtils]: 98: Hoare triple {21136#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21137#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:38,339 INFO L273 TraceCheckUtils]: 99: Hoare triple {21137#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21137#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:38,339 INFO L273 TraceCheckUtils]: 100: Hoare triple {21137#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21137#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:38,340 INFO L273 TraceCheckUtils]: 101: Hoare triple {21137#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21138#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:38,341 INFO L273 TraceCheckUtils]: 102: Hoare triple {21138#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21138#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:38,341 INFO L273 TraceCheckUtils]: 103: Hoare triple {21138#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21138#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:38,342 INFO L273 TraceCheckUtils]: 104: Hoare triple {21138#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21139#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:38,342 INFO L273 TraceCheckUtils]: 105: Hoare triple {21139#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21139#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:38,343 INFO L273 TraceCheckUtils]: 106: Hoare triple {21139#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21139#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:38,343 INFO L273 TraceCheckUtils]: 107: Hoare triple {21139#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21140#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:38,344 INFO L273 TraceCheckUtils]: 108: Hoare triple {21140#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21140#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:38,344 INFO L273 TraceCheckUtils]: 109: Hoare triple {21140#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21140#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:38,345 INFO L273 TraceCheckUtils]: 110: Hoare triple {21140#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21141#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:38,345 INFO L273 TraceCheckUtils]: 111: Hoare triple {21141#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21141#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:38,346 INFO L273 TraceCheckUtils]: 112: Hoare triple {21141#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {21141#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:38,347 INFO L273 TraceCheckUtils]: 113: Hoare triple {21141#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21142#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:38,347 INFO L273 TraceCheckUtils]: 114: Hoare triple {21142#(<= main_~i~0 37)} assume !(~i~0 < 100000); {21105#false} is VALID [2018-11-23 11:59:38,347 INFO L273 TraceCheckUtils]: 115: Hoare triple {21105#false} havoc ~x~0;~x~0 := 0; {21105#false} is VALID [2018-11-23 11:59:38,348 INFO L273 TraceCheckUtils]: 116: Hoare triple {21105#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {21105#false} is VALID [2018-11-23 11:59:38,348 INFO L256 TraceCheckUtils]: 117: Hoare triple {21105#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {21105#false} is VALID [2018-11-23 11:59:38,348 INFO L273 TraceCheckUtils]: 118: Hoare triple {21105#false} ~cond := #in~cond; {21105#false} is VALID [2018-11-23 11:59:38,348 INFO L273 TraceCheckUtils]: 119: Hoare triple {21105#false} assume 0 == ~cond; {21105#false} is VALID [2018-11-23 11:59:38,348 INFO L273 TraceCheckUtils]: 120: Hoare triple {21105#false} assume !false; {21105#false} is VALID [2018-11-23 11:59:38,359 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:59:38,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:38,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-11-23 11:59:38,378 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 121 [2018-11-23 11:59:38,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:38,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 11:59:38,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:38,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 11:59:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 11:59:38,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:59:38,494 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 39 states. [2018-11-23 11:59:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:39,259 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2018-11-23 11:59:39,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:59:39,259 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 121 [2018-11-23 11:59:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:59:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 182 transitions. [2018-11-23 11:59:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:59:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 182 transitions. [2018-11-23 11:59:39,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 182 transitions. [2018-11-23 11:59:39,423 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:59:39,425 INFO L225 Difference]: With dead ends: 142 [2018-11-23 11:59:39,425 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 11:59:39,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:59:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 11:59:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-11-23 11:59:39,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:39,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 129 states. [2018-11-23 11:59:39,494 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 129 states. [2018-11-23 11:59:39,494 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 129 states. [2018-11-23 11:59:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:39,496 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2018-11-23 11:59:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2018-11-23 11:59:39,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:39,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:39,496 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 131 states. [2018-11-23 11:59:39,496 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 131 states. [2018-11-23 11:59:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:39,498 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2018-11-23 11:59:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2018-11-23 11:59:39,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:39,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:39,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:39,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 11:59:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2018-11-23 11:59:39,500 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 121 [2018-11-23 11:59:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:39,500 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2018-11-23 11:59:39,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 11:59:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2018-11-23 11:59:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 11:59:39,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:39,501 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:59:39,501 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:39,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:39,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1421413692, now seen corresponding path program 37 times [2018-11-23 11:59:39,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:39,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:39,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:40,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {22131#true} call ULTIMATE.init(); {22131#true} is VALID [2018-11-23 11:59:40,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {22131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22131#true} is VALID [2018-11-23 11:59:40,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {22131#true} assume true; {22131#true} is VALID [2018-11-23 11:59:40,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22131#true} {22131#true} #54#return; {22131#true} is VALID [2018-11-23 11:59:40,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {22131#true} call #t~ret6 := main(); {22131#true} is VALID [2018-11-23 11:59:40,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {22131#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22133#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:40,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {22133#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22133#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:40,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {22133#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22133#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:40,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {22133#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22134#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {22134#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22134#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {22134#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22134#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {22134#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22135#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {22135#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22135#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {22135#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22135#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {22135#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22136#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {22136#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22136#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {22136#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22136#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {22136#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22137#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {22137#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22137#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {22137#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22137#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {22137#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22138#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,519 INFO L273 TraceCheckUtils]: 21: Hoare triple {22138#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22138#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,520 INFO L273 TraceCheckUtils]: 22: Hoare triple {22138#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22138#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,520 INFO L273 TraceCheckUtils]: 23: Hoare triple {22138#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22139#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {22139#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22139#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,521 INFO L273 TraceCheckUtils]: 25: Hoare triple {22139#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22139#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,522 INFO L273 TraceCheckUtils]: 26: Hoare triple {22139#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22140#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,523 INFO L273 TraceCheckUtils]: 27: Hoare triple {22140#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22140#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,523 INFO L273 TraceCheckUtils]: 28: Hoare triple {22140#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22140#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,524 INFO L273 TraceCheckUtils]: 29: Hoare triple {22140#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22141#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {22141#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22141#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,525 INFO L273 TraceCheckUtils]: 31: Hoare triple {22141#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22141#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,525 INFO L273 TraceCheckUtils]: 32: Hoare triple {22141#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22142#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,526 INFO L273 TraceCheckUtils]: 33: Hoare triple {22142#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22142#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,526 INFO L273 TraceCheckUtils]: 34: Hoare triple {22142#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22142#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,527 INFO L273 TraceCheckUtils]: 35: Hoare triple {22142#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22143#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,528 INFO L273 TraceCheckUtils]: 36: Hoare triple {22143#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22143#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,528 INFO L273 TraceCheckUtils]: 37: Hoare triple {22143#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22143#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,529 INFO L273 TraceCheckUtils]: 38: Hoare triple {22143#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22144#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {22144#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22144#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {22144#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22144#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,531 INFO L273 TraceCheckUtils]: 41: Hoare triple {22144#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22145#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,531 INFO L273 TraceCheckUtils]: 42: Hoare triple {22145#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22145#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {22145#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22145#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {22145#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22146#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:40,533 INFO L273 TraceCheckUtils]: 45: Hoare triple {22146#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22146#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:40,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {22146#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22146#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:40,534 INFO L273 TraceCheckUtils]: 47: Hoare triple {22146#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22147#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:40,535 INFO L273 TraceCheckUtils]: 48: Hoare triple {22147#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22147#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:40,535 INFO L273 TraceCheckUtils]: 49: Hoare triple {22147#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22147#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:40,536 INFO L273 TraceCheckUtils]: 50: Hoare triple {22147#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22148#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:40,536 INFO L273 TraceCheckUtils]: 51: Hoare triple {22148#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22148#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:40,537 INFO L273 TraceCheckUtils]: 52: Hoare triple {22148#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22148#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:40,537 INFO L273 TraceCheckUtils]: 53: Hoare triple {22148#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22149#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:40,538 INFO L273 TraceCheckUtils]: 54: Hoare triple {22149#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22149#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:40,538 INFO L273 TraceCheckUtils]: 55: Hoare triple {22149#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22149#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:40,539 INFO L273 TraceCheckUtils]: 56: Hoare triple {22149#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22150#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:40,540 INFO L273 TraceCheckUtils]: 57: Hoare triple {22150#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22150#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:40,540 INFO L273 TraceCheckUtils]: 58: Hoare triple {22150#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22150#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:40,541 INFO L273 TraceCheckUtils]: 59: Hoare triple {22150#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22151#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:40,541 INFO L273 TraceCheckUtils]: 60: Hoare triple {22151#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22151#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:40,542 INFO L273 TraceCheckUtils]: 61: Hoare triple {22151#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22151#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:40,543 INFO L273 TraceCheckUtils]: 62: Hoare triple {22151#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22152#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:40,543 INFO L273 TraceCheckUtils]: 63: Hoare triple {22152#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22152#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:40,544 INFO L273 TraceCheckUtils]: 64: Hoare triple {22152#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22152#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:40,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {22152#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22153#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:40,545 INFO L273 TraceCheckUtils]: 66: Hoare triple {22153#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22153#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:40,545 INFO L273 TraceCheckUtils]: 67: Hoare triple {22153#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22153#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:40,546 INFO L273 TraceCheckUtils]: 68: Hoare triple {22153#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22154#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:40,547 INFO L273 TraceCheckUtils]: 69: Hoare triple {22154#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22154#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:40,547 INFO L273 TraceCheckUtils]: 70: Hoare triple {22154#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22154#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:40,548 INFO L273 TraceCheckUtils]: 71: Hoare triple {22154#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22155#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:40,548 INFO L273 TraceCheckUtils]: 72: Hoare triple {22155#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22155#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:40,549 INFO L273 TraceCheckUtils]: 73: Hoare triple {22155#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22155#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:40,549 INFO L273 TraceCheckUtils]: 74: Hoare triple {22155#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22156#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:40,550 INFO L273 TraceCheckUtils]: 75: Hoare triple {22156#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22156#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:40,550 INFO L273 TraceCheckUtils]: 76: Hoare triple {22156#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22156#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:40,551 INFO L273 TraceCheckUtils]: 77: Hoare triple {22156#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22157#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:40,552 INFO L273 TraceCheckUtils]: 78: Hoare triple {22157#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22157#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:40,552 INFO L273 TraceCheckUtils]: 79: Hoare triple {22157#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22157#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:40,553 INFO L273 TraceCheckUtils]: 80: Hoare triple {22157#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22158#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:40,553 INFO L273 TraceCheckUtils]: 81: Hoare triple {22158#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22158#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:40,554 INFO L273 TraceCheckUtils]: 82: Hoare triple {22158#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22158#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:40,555 INFO L273 TraceCheckUtils]: 83: Hoare triple {22158#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22159#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:40,555 INFO L273 TraceCheckUtils]: 84: Hoare triple {22159#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22159#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:40,556 INFO L273 TraceCheckUtils]: 85: Hoare triple {22159#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22159#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:40,556 INFO L273 TraceCheckUtils]: 86: Hoare triple {22159#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22160#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:40,557 INFO L273 TraceCheckUtils]: 87: Hoare triple {22160#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22160#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:40,557 INFO L273 TraceCheckUtils]: 88: Hoare triple {22160#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22160#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:40,558 INFO L273 TraceCheckUtils]: 89: Hoare triple {22160#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22161#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:40,558 INFO L273 TraceCheckUtils]: 90: Hoare triple {22161#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22161#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:40,559 INFO L273 TraceCheckUtils]: 91: Hoare triple {22161#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22161#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:40,560 INFO L273 TraceCheckUtils]: 92: Hoare triple {22161#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22162#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:40,560 INFO L273 TraceCheckUtils]: 93: Hoare triple {22162#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22162#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:40,561 INFO L273 TraceCheckUtils]: 94: Hoare triple {22162#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22162#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:40,561 INFO L273 TraceCheckUtils]: 95: Hoare triple {22162#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22163#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:40,562 INFO L273 TraceCheckUtils]: 96: Hoare triple {22163#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22163#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:40,562 INFO L273 TraceCheckUtils]: 97: Hoare triple {22163#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22163#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:40,563 INFO L273 TraceCheckUtils]: 98: Hoare triple {22163#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22164#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:40,563 INFO L273 TraceCheckUtils]: 99: Hoare triple {22164#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22164#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:40,564 INFO L273 TraceCheckUtils]: 100: Hoare triple {22164#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22164#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:40,565 INFO L273 TraceCheckUtils]: 101: Hoare triple {22164#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22165#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:40,565 INFO L273 TraceCheckUtils]: 102: Hoare triple {22165#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22165#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:40,566 INFO L273 TraceCheckUtils]: 103: Hoare triple {22165#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22165#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:40,566 INFO L273 TraceCheckUtils]: 104: Hoare triple {22165#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22166#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:40,567 INFO L273 TraceCheckUtils]: 105: Hoare triple {22166#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22166#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:40,567 INFO L273 TraceCheckUtils]: 106: Hoare triple {22166#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22166#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:40,568 INFO L273 TraceCheckUtils]: 107: Hoare triple {22166#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22167#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:40,568 INFO L273 TraceCheckUtils]: 108: Hoare triple {22167#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22167#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:40,569 INFO L273 TraceCheckUtils]: 109: Hoare triple {22167#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22167#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:40,569 INFO L273 TraceCheckUtils]: 110: Hoare triple {22167#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22168#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:40,570 INFO L273 TraceCheckUtils]: 111: Hoare triple {22168#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22168#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:40,570 INFO L273 TraceCheckUtils]: 112: Hoare triple {22168#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22168#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:40,571 INFO L273 TraceCheckUtils]: 113: Hoare triple {22168#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22169#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:40,572 INFO L273 TraceCheckUtils]: 114: Hoare triple {22169#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22169#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:40,572 INFO L273 TraceCheckUtils]: 115: Hoare triple {22169#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22169#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:40,573 INFO L273 TraceCheckUtils]: 116: Hoare triple {22169#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22170#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:40,573 INFO L273 TraceCheckUtils]: 117: Hoare triple {22170#(<= main_~i~0 38)} assume !(~i~0 < 100000); {22132#false} is VALID [2018-11-23 11:59:40,574 INFO L273 TraceCheckUtils]: 118: Hoare triple {22132#false} havoc ~x~0;~x~0 := 0; {22132#false} is VALID [2018-11-23 11:59:40,574 INFO L273 TraceCheckUtils]: 119: Hoare triple {22132#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {22132#false} is VALID [2018-11-23 11:59:40,574 INFO L256 TraceCheckUtils]: 120: Hoare triple {22132#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {22132#false} is VALID [2018-11-23 11:59:40,574 INFO L273 TraceCheckUtils]: 121: Hoare triple {22132#false} ~cond := #in~cond; {22132#false} is VALID [2018-11-23 11:59:40,574 INFO L273 TraceCheckUtils]: 122: Hoare triple {22132#false} assume 0 == ~cond; {22132#false} is VALID [2018-11-23 11:59:40,575 INFO L273 TraceCheckUtils]: 123: Hoare triple {22132#false} assume !false; {22132#false} is VALID [2018-11-23 11:59:40,585 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:59:40,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:40,585 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:59:40,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:40,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:40,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {22131#true} call ULTIMATE.init(); {22131#true} is VALID [2018-11-23 11:59:40,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {22131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22131#true} is VALID [2018-11-23 11:59:40,978 INFO L273 TraceCheckUtils]: 2: Hoare triple {22131#true} assume true; {22131#true} is VALID [2018-11-23 11:59:40,978 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22131#true} {22131#true} #54#return; {22131#true} is VALID [2018-11-23 11:59:40,978 INFO L256 TraceCheckUtils]: 4: Hoare triple {22131#true} call #t~ret6 := main(); {22131#true} is VALID [2018-11-23 11:59:40,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {22131#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22133#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:40,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {22133#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22133#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:40,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {22133#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22133#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:40,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {22133#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22134#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {22134#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22134#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {22134#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22134#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {22134#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22135#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,982 INFO L273 TraceCheckUtils]: 12: Hoare triple {22135#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22135#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {22135#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22135#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {22135#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22136#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {22136#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22136#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {22136#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22136#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,984 INFO L273 TraceCheckUtils]: 17: Hoare triple {22136#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22137#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {22137#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22137#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,985 INFO L273 TraceCheckUtils]: 19: Hoare triple {22137#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22137#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,986 INFO L273 TraceCheckUtils]: 20: Hoare triple {22137#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22138#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,987 INFO L273 TraceCheckUtils]: 21: Hoare triple {22138#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22138#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,987 INFO L273 TraceCheckUtils]: 22: Hoare triple {22138#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22138#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,988 INFO L273 TraceCheckUtils]: 23: Hoare triple {22138#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22139#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,988 INFO L273 TraceCheckUtils]: 24: Hoare triple {22139#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22139#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,989 INFO L273 TraceCheckUtils]: 25: Hoare triple {22139#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22139#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,989 INFO L273 TraceCheckUtils]: 26: Hoare triple {22139#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22140#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,990 INFO L273 TraceCheckUtils]: 27: Hoare triple {22140#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22140#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,990 INFO L273 TraceCheckUtils]: 28: Hoare triple {22140#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22140#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,991 INFO L273 TraceCheckUtils]: 29: Hoare triple {22140#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22141#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,991 INFO L273 TraceCheckUtils]: 30: Hoare triple {22141#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22141#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,992 INFO L273 TraceCheckUtils]: 31: Hoare triple {22141#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22141#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,992 INFO L273 TraceCheckUtils]: 32: Hoare triple {22141#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22142#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,993 INFO L273 TraceCheckUtils]: 33: Hoare triple {22142#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22142#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,993 INFO L273 TraceCheckUtils]: 34: Hoare triple {22142#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22142#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,994 INFO L273 TraceCheckUtils]: 35: Hoare triple {22142#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22143#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,995 INFO L273 TraceCheckUtils]: 36: Hoare triple {22143#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22143#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,995 INFO L273 TraceCheckUtils]: 37: Hoare triple {22143#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22143#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,996 INFO L273 TraceCheckUtils]: 38: Hoare triple {22143#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22144#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,996 INFO L273 TraceCheckUtils]: 39: Hoare triple {22144#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22144#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,997 INFO L273 TraceCheckUtils]: 40: Hoare triple {22144#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22144#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,997 INFO L273 TraceCheckUtils]: 41: Hoare triple {22144#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22145#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,998 INFO L273 TraceCheckUtils]: 42: Hoare triple {22145#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22145#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,998 INFO L273 TraceCheckUtils]: 43: Hoare triple {22145#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22145#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,999 INFO L273 TraceCheckUtils]: 44: Hoare triple {22145#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22146#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:40,999 INFO L273 TraceCheckUtils]: 45: Hoare triple {22146#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22146#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:41,000 INFO L273 TraceCheckUtils]: 46: Hoare triple {22146#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22146#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:41,001 INFO L273 TraceCheckUtils]: 47: Hoare triple {22146#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22147#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:41,001 INFO L273 TraceCheckUtils]: 48: Hoare triple {22147#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22147#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:41,002 INFO L273 TraceCheckUtils]: 49: Hoare triple {22147#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22147#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:41,002 INFO L273 TraceCheckUtils]: 50: Hoare triple {22147#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22148#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:41,003 INFO L273 TraceCheckUtils]: 51: Hoare triple {22148#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22148#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:41,003 INFO L273 TraceCheckUtils]: 52: Hoare triple {22148#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22148#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:41,004 INFO L273 TraceCheckUtils]: 53: Hoare triple {22148#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22149#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:41,005 INFO L273 TraceCheckUtils]: 54: Hoare triple {22149#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22149#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:41,005 INFO L273 TraceCheckUtils]: 55: Hoare triple {22149#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22149#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:41,006 INFO L273 TraceCheckUtils]: 56: Hoare triple {22149#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22150#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:41,006 INFO L273 TraceCheckUtils]: 57: Hoare triple {22150#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22150#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:41,007 INFO L273 TraceCheckUtils]: 58: Hoare triple {22150#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22150#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:41,008 INFO L273 TraceCheckUtils]: 59: Hoare triple {22150#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22151#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:41,008 INFO L273 TraceCheckUtils]: 60: Hoare triple {22151#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22151#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:41,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {22151#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22151#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:41,009 INFO L273 TraceCheckUtils]: 62: Hoare triple {22151#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22152#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:41,010 INFO L273 TraceCheckUtils]: 63: Hoare triple {22152#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22152#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:41,010 INFO L273 TraceCheckUtils]: 64: Hoare triple {22152#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22152#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:41,011 INFO L273 TraceCheckUtils]: 65: Hoare triple {22152#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22153#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:41,011 INFO L273 TraceCheckUtils]: 66: Hoare triple {22153#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22153#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:41,012 INFO L273 TraceCheckUtils]: 67: Hoare triple {22153#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22153#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:41,013 INFO L273 TraceCheckUtils]: 68: Hoare triple {22153#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22154#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:41,013 INFO L273 TraceCheckUtils]: 69: Hoare triple {22154#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22154#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:41,014 INFO L273 TraceCheckUtils]: 70: Hoare triple {22154#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22154#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:41,014 INFO L273 TraceCheckUtils]: 71: Hoare triple {22154#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22155#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:41,015 INFO L273 TraceCheckUtils]: 72: Hoare triple {22155#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22155#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:41,015 INFO L273 TraceCheckUtils]: 73: Hoare triple {22155#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22155#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:41,016 INFO L273 TraceCheckUtils]: 74: Hoare triple {22155#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22156#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:41,017 INFO L273 TraceCheckUtils]: 75: Hoare triple {22156#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22156#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:41,017 INFO L273 TraceCheckUtils]: 76: Hoare triple {22156#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22156#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:41,018 INFO L273 TraceCheckUtils]: 77: Hoare triple {22156#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22157#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:41,018 INFO L273 TraceCheckUtils]: 78: Hoare triple {22157#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22157#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:41,019 INFO L273 TraceCheckUtils]: 79: Hoare triple {22157#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22157#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:41,020 INFO L273 TraceCheckUtils]: 80: Hoare triple {22157#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22158#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:41,020 INFO L273 TraceCheckUtils]: 81: Hoare triple {22158#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22158#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:41,021 INFO L273 TraceCheckUtils]: 82: Hoare triple {22158#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22158#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:41,021 INFO L273 TraceCheckUtils]: 83: Hoare triple {22158#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22159#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:41,022 INFO L273 TraceCheckUtils]: 84: Hoare triple {22159#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22159#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:41,022 INFO L273 TraceCheckUtils]: 85: Hoare triple {22159#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22159#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:41,023 INFO L273 TraceCheckUtils]: 86: Hoare triple {22159#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22160#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:41,023 INFO L273 TraceCheckUtils]: 87: Hoare triple {22160#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22160#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:41,024 INFO L273 TraceCheckUtils]: 88: Hoare triple {22160#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22160#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:41,025 INFO L273 TraceCheckUtils]: 89: Hoare triple {22160#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22161#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:41,025 INFO L273 TraceCheckUtils]: 90: Hoare triple {22161#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22161#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:41,025 INFO L273 TraceCheckUtils]: 91: Hoare triple {22161#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22161#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:41,026 INFO L273 TraceCheckUtils]: 92: Hoare triple {22161#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22162#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:41,027 INFO L273 TraceCheckUtils]: 93: Hoare triple {22162#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22162#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:41,027 INFO L273 TraceCheckUtils]: 94: Hoare triple {22162#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22162#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:41,028 INFO L273 TraceCheckUtils]: 95: Hoare triple {22162#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22163#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:41,028 INFO L273 TraceCheckUtils]: 96: Hoare triple {22163#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22163#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:41,029 INFO L273 TraceCheckUtils]: 97: Hoare triple {22163#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22163#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:41,029 INFO L273 TraceCheckUtils]: 98: Hoare triple {22163#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22164#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:41,030 INFO L273 TraceCheckUtils]: 99: Hoare triple {22164#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22164#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:41,030 INFO L273 TraceCheckUtils]: 100: Hoare triple {22164#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22164#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:41,031 INFO L273 TraceCheckUtils]: 101: Hoare triple {22164#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22165#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:41,032 INFO L273 TraceCheckUtils]: 102: Hoare triple {22165#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22165#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:41,032 INFO L273 TraceCheckUtils]: 103: Hoare triple {22165#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22165#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:41,033 INFO L273 TraceCheckUtils]: 104: Hoare triple {22165#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22166#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:41,033 INFO L273 TraceCheckUtils]: 105: Hoare triple {22166#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22166#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:41,034 INFO L273 TraceCheckUtils]: 106: Hoare triple {22166#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22166#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:41,034 INFO L273 TraceCheckUtils]: 107: Hoare triple {22166#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22167#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:41,035 INFO L273 TraceCheckUtils]: 108: Hoare triple {22167#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22167#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:41,035 INFO L273 TraceCheckUtils]: 109: Hoare triple {22167#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22167#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:41,036 INFO L273 TraceCheckUtils]: 110: Hoare triple {22167#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22168#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:41,036 INFO L273 TraceCheckUtils]: 111: Hoare triple {22168#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22168#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:41,037 INFO L273 TraceCheckUtils]: 112: Hoare triple {22168#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22168#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:41,038 INFO L273 TraceCheckUtils]: 113: Hoare triple {22168#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22169#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:41,038 INFO L273 TraceCheckUtils]: 114: Hoare triple {22169#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22169#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:41,039 INFO L273 TraceCheckUtils]: 115: Hoare triple {22169#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {22169#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:41,039 INFO L273 TraceCheckUtils]: 116: Hoare triple {22169#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22170#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:41,040 INFO L273 TraceCheckUtils]: 117: Hoare triple {22170#(<= main_~i~0 38)} assume !(~i~0 < 100000); {22132#false} is VALID [2018-11-23 11:59:41,040 INFO L273 TraceCheckUtils]: 118: Hoare triple {22132#false} havoc ~x~0;~x~0 := 0; {22132#false} is VALID [2018-11-23 11:59:41,040 INFO L273 TraceCheckUtils]: 119: Hoare triple {22132#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {22132#false} is VALID [2018-11-23 11:59:41,040 INFO L256 TraceCheckUtils]: 120: Hoare triple {22132#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {22132#false} is VALID [2018-11-23 11:59:41,041 INFO L273 TraceCheckUtils]: 121: Hoare triple {22132#false} ~cond := #in~cond; {22132#false} is VALID [2018-11-23 11:59:41,041 INFO L273 TraceCheckUtils]: 122: Hoare triple {22132#false} assume 0 == ~cond; {22132#false} is VALID [2018-11-23 11:59:41,041 INFO L273 TraceCheckUtils]: 123: Hoare triple {22132#false} assume !false; {22132#false} is VALID [2018-11-23 11:59:41,051 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:59:41,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:41,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-11-23 11:59:41,071 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 124 [2018-11-23 11:59:41,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:41,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 11:59:41,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:41,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 11:59:41,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 11:59:41,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:59:41,223 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand 40 states. [2018-11-23 11:59:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:41,900 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2018-11-23 11:59:41,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 11:59:41,900 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 124 [2018-11-23 11:59:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:59:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 186 transitions. [2018-11-23 11:59:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:59:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 186 transitions. [2018-11-23 11:59:41,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 186 transitions. [2018-11-23 11:59:42,085 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:59:42,088 INFO L225 Difference]: With dead ends: 145 [2018-11-23 11:59:42,088 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 11:59:42,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:59:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 11:59:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-11-23 11:59:42,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:42,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 132 states. [2018-11-23 11:59:42,121 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 132 states. [2018-11-23 11:59:42,121 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 132 states. [2018-11-23 11:59:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:42,123 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2018-11-23 11:59:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2018-11-23 11:59:42,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:42,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:42,123 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 134 states. [2018-11-23 11:59:42,123 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 134 states. [2018-11-23 11:59:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:42,125 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2018-11-23 11:59:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2018-11-23 11:59:42,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:42,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:42,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:42,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 11:59:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-11-23 11:59:42,127 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 124 [2018-11-23 11:59:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:42,127 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-11-23 11:59:42,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 11:59:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2018-11-23 11:59:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 11:59:42,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:42,128 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:59:42,128 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:42,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2087605015, now seen corresponding path program 38 times [2018-11-23 11:59:42,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:42,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:42,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:42,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:42,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:43,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {23182#true} call ULTIMATE.init(); {23182#true} is VALID [2018-11-23 11:59:43,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {23182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23182#true} is VALID [2018-11-23 11:59:43,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {23182#true} assume true; {23182#true} is VALID [2018-11-23 11:59:43,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23182#true} {23182#true} #54#return; {23182#true} is VALID [2018-11-23 11:59:43,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {23182#true} call #t~ret6 := main(); {23182#true} is VALID [2018-11-23 11:59:43,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {23182#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23184#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {23184#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23184#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {23184#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23184#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {23184#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23185#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {23185#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23185#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {23185#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23185#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {23185#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23186#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {23186#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23186#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {23186#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23186#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,042 INFO L273 TraceCheckUtils]: 14: Hoare triple {23186#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23187#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,043 INFO L273 TraceCheckUtils]: 15: Hoare triple {23187#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23187#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,043 INFO L273 TraceCheckUtils]: 16: Hoare triple {23187#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23187#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,044 INFO L273 TraceCheckUtils]: 17: Hoare triple {23187#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23188#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {23188#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23188#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,045 INFO L273 TraceCheckUtils]: 19: Hoare triple {23188#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23188#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,045 INFO L273 TraceCheckUtils]: 20: Hoare triple {23188#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23189#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,046 INFO L273 TraceCheckUtils]: 21: Hoare triple {23189#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23189#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {23189#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23189#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {23189#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23190#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {23190#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23190#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,048 INFO L273 TraceCheckUtils]: 25: Hoare triple {23190#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23190#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {23190#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23191#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,049 INFO L273 TraceCheckUtils]: 27: Hoare triple {23191#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23191#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,050 INFO L273 TraceCheckUtils]: 28: Hoare triple {23191#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23191#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {23191#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23192#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:43,051 INFO L273 TraceCheckUtils]: 30: Hoare triple {23192#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23192#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:43,051 INFO L273 TraceCheckUtils]: 31: Hoare triple {23192#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23192#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:43,052 INFO L273 TraceCheckUtils]: 32: Hoare triple {23192#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23193#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:43,052 INFO L273 TraceCheckUtils]: 33: Hoare triple {23193#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23193#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:43,053 INFO L273 TraceCheckUtils]: 34: Hoare triple {23193#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23193#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:43,053 INFO L273 TraceCheckUtils]: 35: Hoare triple {23193#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23194#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:43,054 INFO L273 TraceCheckUtils]: 36: Hoare triple {23194#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23194#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:43,054 INFO L273 TraceCheckUtils]: 37: Hoare triple {23194#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23194#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:43,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {23194#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23195#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:43,055 INFO L273 TraceCheckUtils]: 39: Hoare triple {23195#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23195#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:43,056 INFO L273 TraceCheckUtils]: 40: Hoare triple {23195#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23195#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:43,057 INFO L273 TraceCheckUtils]: 41: Hoare triple {23195#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23196#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:43,057 INFO L273 TraceCheckUtils]: 42: Hoare triple {23196#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23196#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:43,058 INFO L273 TraceCheckUtils]: 43: Hoare triple {23196#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23196#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:43,058 INFO L273 TraceCheckUtils]: 44: Hoare triple {23196#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23197#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:43,059 INFO L273 TraceCheckUtils]: 45: Hoare triple {23197#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23197#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:43,059 INFO L273 TraceCheckUtils]: 46: Hoare triple {23197#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23197#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:43,060 INFO L273 TraceCheckUtils]: 47: Hoare triple {23197#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23198#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:43,060 INFO L273 TraceCheckUtils]: 48: Hoare triple {23198#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23198#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:43,061 INFO L273 TraceCheckUtils]: 49: Hoare triple {23198#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23198#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:43,061 INFO L273 TraceCheckUtils]: 50: Hoare triple {23198#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23199#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:43,062 INFO L273 TraceCheckUtils]: 51: Hoare triple {23199#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23199#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:43,062 INFO L273 TraceCheckUtils]: 52: Hoare triple {23199#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23199#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:43,063 INFO L273 TraceCheckUtils]: 53: Hoare triple {23199#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23200#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:43,064 INFO L273 TraceCheckUtils]: 54: Hoare triple {23200#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23200#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:43,064 INFO L273 TraceCheckUtils]: 55: Hoare triple {23200#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23200#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:43,065 INFO L273 TraceCheckUtils]: 56: Hoare triple {23200#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23201#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:43,065 INFO L273 TraceCheckUtils]: 57: Hoare triple {23201#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23201#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:43,066 INFO L273 TraceCheckUtils]: 58: Hoare triple {23201#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23201#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:43,066 INFO L273 TraceCheckUtils]: 59: Hoare triple {23201#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23202#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:43,067 INFO L273 TraceCheckUtils]: 60: Hoare triple {23202#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23202#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:43,067 INFO L273 TraceCheckUtils]: 61: Hoare triple {23202#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23202#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:43,068 INFO L273 TraceCheckUtils]: 62: Hoare triple {23202#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23203#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:43,068 INFO L273 TraceCheckUtils]: 63: Hoare triple {23203#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23203#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:43,069 INFO L273 TraceCheckUtils]: 64: Hoare triple {23203#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23203#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:43,070 INFO L273 TraceCheckUtils]: 65: Hoare triple {23203#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23204#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:43,070 INFO L273 TraceCheckUtils]: 66: Hoare triple {23204#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23204#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:43,071 INFO L273 TraceCheckUtils]: 67: Hoare triple {23204#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23204#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:43,071 INFO L273 TraceCheckUtils]: 68: Hoare triple {23204#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23205#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:43,072 INFO L273 TraceCheckUtils]: 69: Hoare triple {23205#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23205#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:43,072 INFO L273 TraceCheckUtils]: 70: Hoare triple {23205#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23205#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:43,073 INFO L273 TraceCheckUtils]: 71: Hoare triple {23205#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23206#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:43,073 INFO L273 TraceCheckUtils]: 72: Hoare triple {23206#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23206#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:43,074 INFO L273 TraceCheckUtils]: 73: Hoare triple {23206#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23206#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:43,075 INFO L273 TraceCheckUtils]: 74: Hoare triple {23206#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23207#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:43,075 INFO L273 TraceCheckUtils]: 75: Hoare triple {23207#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23207#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:43,076 INFO L273 TraceCheckUtils]: 76: Hoare triple {23207#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23207#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:43,076 INFO L273 TraceCheckUtils]: 77: Hoare triple {23207#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23208#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:43,077 INFO L273 TraceCheckUtils]: 78: Hoare triple {23208#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23208#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:43,077 INFO L273 TraceCheckUtils]: 79: Hoare triple {23208#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23208#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:43,078 INFO L273 TraceCheckUtils]: 80: Hoare triple {23208#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23209#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:43,078 INFO L273 TraceCheckUtils]: 81: Hoare triple {23209#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23209#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:43,079 INFO L273 TraceCheckUtils]: 82: Hoare triple {23209#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23209#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:43,080 INFO L273 TraceCheckUtils]: 83: Hoare triple {23209#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23210#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:43,080 INFO L273 TraceCheckUtils]: 84: Hoare triple {23210#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23210#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:43,081 INFO L273 TraceCheckUtils]: 85: Hoare triple {23210#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23210#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:43,081 INFO L273 TraceCheckUtils]: 86: Hoare triple {23210#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23211#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:43,082 INFO L273 TraceCheckUtils]: 87: Hoare triple {23211#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23211#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:43,082 INFO L273 TraceCheckUtils]: 88: Hoare triple {23211#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23211#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:43,083 INFO L273 TraceCheckUtils]: 89: Hoare triple {23211#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23212#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:43,083 INFO L273 TraceCheckUtils]: 90: Hoare triple {23212#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23212#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:43,084 INFO L273 TraceCheckUtils]: 91: Hoare triple {23212#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23212#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:43,085 INFO L273 TraceCheckUtils]: 92: Hoare triple {23212#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23213#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:43,085 INFO L273 TraceCheckUtils]: 93: Hoare triple {23213#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23213#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:43,086 INFO L273 TraceCheckUtils]: 94: Hoare triple {23213#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23213#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:43,086 INFO L273 TraceCheckUtils]: 95: Hoare triple {23213#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23214#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:43,087 INFO L273 TraceCheckUtils]: 96: Hoare triple {23214#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23214#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:43,087 INFO L273 TraceCheckUtils]: 97: Hoare triple {23214#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23214#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:43,088 INFO L273 TraceCheckUtils]: 98: Hoare triple {23214#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23215#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:43,089 INFO L273 TraceCheckUtils]: 99: Hoare triple {23215#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23215#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:43,089 INFO L273 TraceCheckUtils]: 100: Hoare triple {23215#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23215#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:43,090 INFO L273 TraceCheckUtils]: 101: Hoare triple {23215#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23216#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:43,090 INFO L273 TraceCheckUtils]: 102: Hoare triple {23216#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23216#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:43,091 INFO L273 TraceCheckUtils]: 103: Hoare triple {23216#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23216#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:43,092 INFO L273 TraceCheckUtils]: 104: Hoare triple {23216#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23217#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:43,092 INFO L273 TraceCheckUtils]: 105: Hoare triple {23217#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23217#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:43,093 INFO L273 TraceCheckUtils]: 106: Hoare triple {23217#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23217#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:43,093 INFO L273 TraceCheckUtils]: 107: Hoare triple {23217#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23218#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:43,094 INFO L273 TraceCheckUtils]: 108: Hoare triple {23218#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23218#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:43,094 INFO L273 TraceCheckUtils]: 109: Hoare triple {23218#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23218#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:43,095 INFO L273 TraceCheckUtils]: 110: Hoare triple {23218#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23219#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:43,095 INFO L273 TraceCheckUtils]: 111: Hoare triple {23219#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23219#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:43,096 INFO L273 TraceCheckUtils]: 112: Hoare triple {23219#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23219#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:43,096 INFO L273 TraceCheckUtils]: 113: Hoare triple {23219#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23220#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:43,097 INFO L273 TraceCheckUtils]: 114: Hoare triple {23220#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23220#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:43,097 INFO L273 TraceCheckUtils]: 115: Hoare triple {23220#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23220#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:43,098 INFO L273 TraceCheckUtils]: 116: Hoare triple {23220#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23221#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:43,099 INFO L273 TraceCheckUtils]: 117: Hoare triple {23221#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23221#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:43,099 INFO L273 TraceCheckUtils]: 118: Hoare triple {23221#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23221#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:43,100 INFO L273 TraceCheckUtils]: 119: Hoare triple {23221#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23222#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:43,100 INFO L273 TraceCheckUtils]: 120: Hoare triple {23222#(<= main_~i~0 39)} assume !(~i~0 < 100000); {23183#false} is VALID [2018-11-23 11:59:43,101 INFO L273 TraceCheckUtils]: 121: Hoare triple {23183#false} havoc ~x~0;~x~0 := 0; {23183#false} is VALID [2018-11-23 11:59:43,101 INFO L273 TraceCheckUtils]: 122: Hoare triple {23183#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {23183#false} is VALID [2018-11-23 11:59:43,101 INFO L256 TraceCheckUtils]: 123: Hoare triple {23183#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {23183#false} is VALID [2018-11-23 11:59:43,101 INFO L273 TraceCheckUtils]: 124: Hoare triple {23183#false} ~cond := #in~cond; {23183#false} is VALID [2018-11-23 11:59:43,101 INFO L273 TraceCheckUtils]: 125: Hoare triple {23183#false} assume 0 == ~cond; {23183#false} is VALID [2018-11-23 11:59:43,101 INFO L273 TraceCheckUtils]: 126: Hoare triple {23183#false} assume !false; {23183#false} is VALID [2018-11-23 11:59:43,112 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:59:43,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:43,113 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:59:43,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:43,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:43,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:43,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:43,854 INFO L256 TraceCheckUtils]: 0: Hoare triple {23182#true} call ULTIMATE.init(); {23182#true} is VALID [2018-11-23 11:59:43,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {23182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23182#true} is VALID [2018-11-23 11:59:43,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {23182#true} assume true; {23182#true} is VALID [2018-11-23 11:59:43,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23182#true} {23182#true} #54#return; {23182#true} is VALID [2018-11-23 11:59:43,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {23182#true} call #t~ret6 := main(); {23182#true} is VALID [2018-11-23 11:59:43,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {23182#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23184#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {23184#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23184#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {23184#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23184#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {23184#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23185#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {23185#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23185#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {23185#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23185#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {23185#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23186#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {23186#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23186#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {23186#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23186#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {23186#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23187#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {23187#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23187#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {23187#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23187#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {23187#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23188#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {23188#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23188#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {23188#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23188#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {23188#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23189#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {23189#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23189#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {23189#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23189#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {23189#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23190#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,879 INFO L273 TraceCheckUtils]: 24: Hoare triple {23190#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23190#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {23190#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23190#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {23190#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23191#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,884 INFO L273 TraceCheckUtils]: 27: Hoare triple {23191#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23191#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {23191#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23191#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {23191#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23192#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:43,886 INFO L273 TraceCheckUtils]: 30: Hoare triple {23192#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23192#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:43,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {23192#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23192#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:43,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {23192#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23193#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:43,891 INFO L273 TraceCheckUtils]: 33: Hoare triple {23193#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23193#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:43,891 INFO L273 TraceCheckUtils]: 34: Hoare triple {23193#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23193#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:43,894 INFO L273 TraceCheckUtils]: 35: Hoare triple {23193#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23194#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:43,894 INFO L273 TraceCheckUtils]: 36: Hoare triple {23194#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23194#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:43,896 INFO L273 TraceCheckUtils]: 37: Hoare triple {23194#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23194#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:43,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {23194#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23195#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:43,899 INFO L273 TraceCheckUtils]: 39: Hoare triple {23195#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23195#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:43,899 INFO L273 TraceCheckUtils]: 40: Hoare triple {23195#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23195#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:43,901 INFO L273 TraceCheckUtils]: 41: Hoare triple {23195#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23196#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:43,916 INFO L273 TraceCheckUtils]: 42: Hoare triple {23196#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23196#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:43,928 INFO L273 TraceCheckUtils]: 43: Hoare triple {23196#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23196#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:43,941 INFO L273 TraceCheckUtils]: 44: Hoare triple {23196#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23197#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:43,948 INFO L273 TraceCheckUtils]: 45: Hoare triple {23197#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23197#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:43,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {23197#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23197#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:43,950 INFO L273 TraceCheckUtils]: 47: Hoare triple {23197#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23198#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:43,950 INFO L273 TraceCheckUtils]: 48: Hoare triple {23198#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23198#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:43,953 INFO L273 TraceCheckUtils]: 49: Hoare triple {23198#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23198#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:43,953 INFO L273 TraceCheckUtils]: 50: Hoare triple {23198#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23199#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:43,955 INFO L273 TraceCheckUtils]: 51: Hoare triple {23199#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23199#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:43,955 INFO L273 TraceCheckUtils]: 52: Hoare triple {23199#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23199#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:43,957 INFO L273 TraceCheckUtils]: 53: Hoare triple {23199#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23200#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:43,957 INFO L273 TraceCheckUtils]: 54: Hoare triple {23200#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23200#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:43,959 INFO L273 TraceCheckUtils]: 55: Hoare triple {23200#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23200#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:43,959 INFO L273 TraceCheckUtils]: 56: Hoare triple {23200#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23201#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:43,961 INFO L273 TraceCheckUtils]: 57: Hoare triple {23201#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23201#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:43,961 INFO L273 TraceCheckUtils]: 58: Hoare triple {23201#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23201#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:43,963 INFO L273 TraceCheckUtils]: 59: Hoare triple {23201#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23202#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:43,963 INFO L273 TraceCheckUtils]: 60: Hoare triple {23202#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23202#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:43,965 INFO L273 TraceCheckUtils]: 61: Hoare triple {23202#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23202#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:43,965 INFO L273 TraceCheckUtils]: 62: Hoare triple {23202#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23203#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:43,968 INFO L273 TraceCheckUtils]: 63: Hoare triple {23203#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23203#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:43,968 INFO L273 TraceCheckUtils]: 64: Hoare triple {23203#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23203#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:43,970 INFO L273 TraceCheckUtils]: 65: Hoare triple {23203#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23204#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:43,970 INFO L273 TraceCheckUtils]: 66: Hoare triple {23204#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23204#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:43,972 INFO L273 TraceCheckUtils]: 67: Hoare triple {23204#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23204#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:43,972 INFO L273 TraceCheckUtils]: 68: Hoare triple {23204#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23205#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:43,974 INFO L273 TraceCheckUtils]: 69: Hoare triple {23205#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23205#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:43,974 INFO L273 TraceCheckUtils]: 70: Hoare triple {23205#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23205#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:43,976 INFO L273 TraceCheckUtils]: 71: Hoare triple {23205#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23206#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:43,976 INFO L273 TraceCheckUtils]: 72: Hoare triple {23206#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23206#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:43,978 INFO L273 TraceCheckUtils]: 73: Hoare triple {23206#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23206#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:43,978 INFO L273 TraceCheckUtils]: 74: Hoare triple {23206#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23207#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:43,980 INFO L273 TraceCheckUtils]: 75: Hoare triple {23207#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23207#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:43,982 INFO L273 TraceCheckUtils]: 76: Hoare triple {23207#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23207#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:43,982 INFO L273 TraceCheckUtils]: 77: Hoare triple {23207#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23208#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:43,984 INFO L273 TraceCheckUtils]: 78: Hoare triple {23208#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23208#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:43,984 INFO L273 TraceCheckUtils]: 79: Hoare triple {23208#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23208#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:43,986 INFO L273 TraceCheckUtils]: 80: Hoare triple {23208#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23209#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:43,986 INFO L273 TraceCheckUtils]: 81: Hoare triple {23209#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23209#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:43,988 INFO L273 TraceCheckUtils]: 82: Hoare triple {23209#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23209#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:43,988 INFO L273 TraceCheckUtils]: 83: Hoare triple {23209#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23210#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:43,990 INFO L273 TraceCheckUtils]: 84: Hoare triple {23210#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23210#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:43,990 INFO L273 TraceCheckUtils]: 85: Hoare triple {23210#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23210#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:43,992 INFO L273 TraceCheckUtils]: 86: Hoare triple {23210#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23211#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:43,992 INFO L273 TraceCheckUtils]: 87: Hoare triple {23211#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23211#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:43,994 INFO L273 TraceCheckUtils]: 88: Hoare triple {23211#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23211#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:43,994 INFO L273 TraceCheckUtils]: 89: Hoare triple {23211#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23212#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:43,996 INFO L273 TraceCheckUtils]: 90: Hoare triple {23212#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23212#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:43,996 INFO L273 TraceCheckUtils]: 91: Hoare triple {23212#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23212#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:43,998 INFO L273 TraceCheckUtils]: 92: Hoare triple {23212#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23213#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:43,998 INFO L273 TraceCheckUtils]: 93: Hoare triple {23213#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23213#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:44,000 INFO L273 TraceCheckUtils]: 94: Hoare triple {23213#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23213#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:44,000 INFO L273 TraceCheckUtils]: 95: Hoare triple {23213#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23214#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:44,002 INFO L273 TraceCheckUtils]: 96: Hoare triple {23214#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23214#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:44,004 INFO L273 TraceCheckUtils]: 97: Hoare triple {23214#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23214#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:44,004 INFO L273 TraceCheckUtils]: 98: Hoare triple {23214#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23215#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:44,006 INFO L273 TraceCheckUtils]: 99: Hoare triple {23215#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23215#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:44,006 INFO L273 TraceCheckUtils]: 100: Hoare triple {23215#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23215#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:44,008 INFO L273 TraceCheckUtils]: 101: Hoare triple {23215#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23216#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:44,008 INFO L273 TraceCheckUtils]: 102: Hoare triple {23216#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23216#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:44,010 INFO L273 TraceCheckUtils]: 103: Hoare triple {23216#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23216#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:44,010 INFO L273 TraceCheckUtils]: 104: Hoare triple {23216#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23217#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:44,012 INFO L273 TraceCheckUtils]: 105: Hoare triple {23217#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23217#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:44,012 INFO L273 TraceCheckUtils]: 106: Hoare triple {23217#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23217#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:44,015 INFO L273 TraceCheckUtils]: 107: Hoare triple {23217#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23218#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:44,015 INFO L273 TraceCheckUtils]: 108: Hoare triple {23218#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23218#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:44,017 INFO L273 TraceCheckUtils]: 109: Hoare triple {23218#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23218#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:44,017 INFO L273 TraceCheckUtils]: 110: Hoare triple {23218#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23219#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:44,019 INFO L273 TraceCheckUtils]: 111: Hoare triple {23219#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23219#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:44,019 INFO L273 TraceCheckUtils]: 112: Hoare triple {23219#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23219#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:44,021 INFO L273 TraceCheckUtils]: 113: Hoare triple {23219#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23220#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:44,021 INFO L273 TraceCheckUtils]: 114: Hoare triple {23220#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23220#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:44,024 INFO L273 TraceCheckUtils]: 115: Hoare triple {23220#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23220#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:44,024 INFO L273 TraceCheckUtils]: 116: Hoare triple {23220#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23221#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:44,026 INFO L273 TraceCheckUtils]: 117: Hoare triple {23221#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23221#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:44,026 INFO L273 TraceCheckUtils]: 118: Hoare triple {23221#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {23221#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:44,028 INFO L273 TraceCheckUtils]: 119: Hoare triple {23221#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23222#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:44,028 INFO L273 TraceCheckUtils]: 120: Hoare triple {23222#(<= main_~i~0 39)} assume !(~i~0 < 100000); {23183#false} is VALID [2018-11-23 11:59:44,028 INFO L273 TraceCheckUtils]: 121: Hoare triple {23183#false} havoc ~x~0;~x~0 := 0; {23183#false} is VALID [2018-11-23 11:59:44,028 INFO L273 TraceCheckUtils]: 122: Hoare triple {23183#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {23183#false} is VALID [2018-11-23 11:59:44,029 INFO L256 TraceCheckUtils]: 123: Hoare triple {23183#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {23183#false} is VALID [2018-11-23 11:59:44,029 INFO L273 TraceCheckUtils]: 124: Hoare triple {23183#false} ~cond := #in~cond; {23183#false} is VALID [2018-11-23 11:59:44,029 INFO L273 TraceCheckUtils]: 125: Hoare triple {23183#false} assume 0 == ~cond; {23183#false} is VALID [2018-11-23 11:59:44,029 INFO L273 TraceCheckUtils]: 126: Hoare triple {23183#false} assume !false; {23183#false} is VALID [2018-11-23 11:59:44,063 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:59:44,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:44,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-11-23 11:59:44,083 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 127 [2018-11-23 11:59:44,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:44,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 11:59:44,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:44,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 11:59:44,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 11:59:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:59:44,256 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand 41 states. [2018-11-23 11:59:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:45,072 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2018-11-23 11:59:45,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 11:59:45,072 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 127 [2018-11-23 11:59:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:59:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 190 transitions. [2018-11-23 11:59:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:59:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 190 transitions. [2018-11-23 11:59:45,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 190 transitions. [2018-11-23 11:59:45,252 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:59:45,255 INFO L225 Difference]: With dead ends: 148 [2018-11-23 11:59:45,255 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 11:59:45,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:59:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 11:59:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 11:59:45,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:45,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 11:59:45,321 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 11:59:45,321 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 11:59:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:45,324 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2018-11-23 11:59:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2018-11-23 11:59:45,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:45,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:45,325 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 11:59:45,325 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 11:59:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:45,327 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2018-11-23 11:59:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2018-11-23 11:59:45,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:45,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:45,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:45,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 11:59:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2018-11-23 11:59:45,330 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 127 [2018-11-23 11:59:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:45,330 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2018-11-23 11:59:45,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 11:59:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2018-11-23 11:59:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 11:59:45,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:45,331 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:59:45,331 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:45,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash -240079388, now seen corresponding path program 39 times [2018-11-23 11:59:45,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:45,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:45,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:47,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {24257#true} call ULTIMATE.init(); {24257#true} is VALID [2018-11-23 11:59:47,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {24257#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24257#true} is VALID [2018-11-23 11:59:47,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {24257#true} assume true; {24257#true} is VALID [2018-11-23 11:59:47,337 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24257#true} {24257#true} #54#return; {24257#true} is VALID [2018-11-23 11:59:47,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {24257#true} call #t~ret6 := main(); {24257#true} is VALID [2018-11-23 11:59:47,338 INFO L273 TraceCheckUtils]: 5: Hoare triple {24257#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24259#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:47,338 INFO L273 TraceCheckUtils]: 6: Hoare triple {24259#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24259#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:47,339 INFO L273 TraceCheckUtils]: 7: Hoare triple {24259#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24259#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:47,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {24259#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24260#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {24260#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24260#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {24260#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24260#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {24260#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24261#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {24261#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24261#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {24261#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24261#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {24261#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24262#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {24262#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24262#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {24262#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24262#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {24262#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24263#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {24263#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24263#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {24263#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24263#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {24263#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24264#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {24264#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24264#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,346 INFO L273 TraceCheckUtils]: 22: Hoare triple {24264#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24264#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,347 INFO L273 TraceCheckUtils]: 23: Hoare triple {24264#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24265#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {24265#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24265#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,348 INFO L273 TraceCheckUtils]: 25: Hoare triple {24265#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24265#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {24265#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24266#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,349 INFO L273 TraceCheckUtils]: 27: Hoare triple {24266#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24266#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,349 INFO L273 TraceCheckUtils]: 28: Hoare triple {24266#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24266#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,350 INFO L273 TraceCheckUtils]: 29: Hoare triple {24266#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24267#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {24267#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24267#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {24267#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24267#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,352 INFO L273 TraceCheckUtils]: 32: Hoare triple {24267#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24268#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {24268#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24268#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {24268#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24268#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {24268#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24269#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {24269#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24269#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {24269#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24269#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,355 INFO L273 TraceCheckUtils]: 38: Hoare triple {24269#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24270#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {24270#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24270#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,356 INFO L273 TraceCheckUtils]: 40: Hoare triple {24270#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24270#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,357 INFO L273 TraceCheckUtils]: 41: Hoare triple {24270#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24271#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,357 INFO L273 TraceCheckUtils]: 42: Hoare triple {24271#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24271#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,358 INFO L273 TraceCheckUtils]: 43: Hoare triple {24271#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24271#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,359 INFO L273 TraceCheckUtils]: 44: Hoare triple {24271#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24272#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,360 INFO L273 TraceCheckUtils]: 45: Hoare triple {24272#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24272#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,361 INFO L273 TraceCheckUtils]: 46: Hoare triple {24272#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24272#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,361 INFO L273 TraceCheckUtils]: 47: Hoare triple {24272#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24273#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,362 INFO L273 TraceCheckUtils]: 48: Hoare triple {24273#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24273#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,362 INFO L273 TraceCheckUtils]: 49: Hoare triple {24273#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24273#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,363 INFO L273 TraceCheckUtils]: 50: Hoare triple {24273#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24274#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,363 INFO L273 TraceCheckUtils]: 51: Hoare triple {24274#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24274#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,364 INFO L273 TraceCheckUtils]: 52: Hoare triple {24274#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24274#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,365 INFO L273 TraceCheckUtils]: 53: Hoare triple {24274#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24275#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,365 INFO L273 TraceCheckUtils]: 54: Hoare triple {24275#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24275#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,366 INFO L273 TraceCheckUtils]: 55: Hoare triple {24275#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24275#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,366 INFO L273 TraceCheckUtils]: 56: Hoare triple {24275#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24276#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,367 INFO L273 TraceCheckUtils]: 57: Hoare triple {24276#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24276#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,367 INFO L273 TraceCheckUtils]: 58: Hoare triple {24276#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24276#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,368 INFO L273 TraceCheckUtils]: 59: Hoare triple {24276#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24277#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,369 INFO L273 TraceCheckUtils]: 60: Hoare triple {24277#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24277#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,369 INFO L273 TraceCheckUtils]: 61: Hoare triple {24277#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24277#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,370 INFO L273 TraceCheckUtils]: 62: Hoare triple {24277#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24278#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,370 INFO L273 TraceCheckUtils]: 63: Hoare triple {24278#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24278#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,371 INFO L273 TraceCheckUtils]: 64: Hoare triple {24278#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24278#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,371 INFO L273 TraceCheckUtils]: 65: Hoare triple {24278#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24279#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,372 INFO L273 TraceCheckUtils]: 66: Hoare triple {24279#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24279#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,372 INFO L273 TraceCheckUtils]: 67: Hoare triple {24279#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24279#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,373 INFO L273 TraceCheckUtils]: 68: Hoare triple {24279#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24280#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,374 INFO L273 TraceCheckUtils]: 69: Hoare triple {24280#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24280#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,374 INFO L273 TraceCheckUtils]: 70: Hoare triple {24280#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24280#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,375 INFO L273 TraceCheckUtils]: 71: Hoare triple {24280#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24281#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,375 INFO L273 TraceCheckUtils]: 72: Hoare triple {24281#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24281#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,376 INFO L273 TraceCheckUtils]: 73: Hoare triple {24281#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24281#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,377 INFO L273 TraceCheckUtils]: 74: Hoare triple {24281#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24282#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,377 INFO L273 TraceCheckUtils]: 75: Hoare triple {24282#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24282#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,378 INFO L273 TraceCheckUtils]: 76: Hoare triple {24282#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24282#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,378 INFO L273 TraceCheckUtils]: 77: Hoare triple {24282#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24283#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,379 INFO L273 TraceCheckUtils]: 78: Hoare triple {24283#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24283#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,379 INFO L273 TraceCheckUtils]: 79: Hoare triple {24283#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24283#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,380 INFO L273 TraceCheckUtils]: 80: Hoare triple {24283#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24284#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,380 INFO L273 TraceCheckUtils]: 81: Hoare triple {24284#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24284#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,381 INFO L273 TraceCheckUtils]: 82: Hoare triple {24284#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24284#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,382 INFO L273 TraceCheckUtils]: 83: Hoare triple {24284#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24285#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,382 INFO L273 TraceCheckUtils]: 84: Hoare triple {24285#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24285#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,383 INFO L273 TraceCheckUtils]: 85: Hoare triple {24285#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24285#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,383 INFO L273 TraceCheckUtils]: 86: Hoare triple {24285#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24286#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,384 INFO L273 TraceCheckUtils]: 87: Hoare triple {24286#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24286#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,384 INFO L273 TraceCheckUtils]: 88: Hoare triple {24286#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24286#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,385 INFO L273 TraceCheckUtils]: 89: Hoare triple {24286#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24287#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,386 INFO L273 TraceCheckUtils]: 90: Hoare triple {24287#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24287#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,386 INFO L273 TraceCheckUtils]: 91: Hoare triple {24287#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24287#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,387 INFO L273 TraceCheckUtils]: 92: Hoare triple {24287#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24288#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,387 INFO L273 TraceCheckUtils]: 93: Hoare triple {24288#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24288#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,388 INFO L273 TraceCheckUtils]: 94: Hoare triple {24288#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24288#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,388 INFO L273 TraceCheckUtils]: 95: Hoare triple {24288#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24289#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:47,389 INFO L273 TraceCheckUtils]: 96: Hoare triple {24289#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24289#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:47,389 INFO L273 TraceCheckUtils]: 97: Hoare triple {24289#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24289#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:47,390 INFO L273 TraceCheckUtils]: 98: Hoare triple {24289#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24290#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:47,390 INFO L273 TraceCheckUtils]: 99: Hoare triple {24290#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24290#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:47,391 INFO L273 TraceCheckUtils]: 100: Hoare triple {24290#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24290#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:47,392 INFO L273 TraceCheckUtils]: 101: Hoare triple {24290#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24291#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:47,392 INFO L273 TraceCheckUtils]: 102: Hoare triple {24291#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24291#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:47,393 INFO L273 TraceCheckUtils]: 103: Hoare triple {24291#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24291#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:47,393 INFO L273 TraceCheckUtils]: 104: Hoare triple {24291#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24292#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:47,394 INFO L273 TraceCheckUtils]: 105: Hoare triple {24292#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24292#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:47,394 INFO L273 TraceCheckUtils]: 106: Hoare triple {24292#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24292#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:47,395 INFO L273 TraceCheckUtils]: 107: Hoare triple {24292#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24293#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:47,395 INFO L273 TraceCheckUtils]: 108: Hoare triple {24293#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24293#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:47,396 INFO L273 TraceCheckUtils]: 109: Hoare triple {24293#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24293#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:47,397 INFO L273 TraceCheckUtils]: 110: Hoare triple {24293#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24294#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:47,397 INFO L273 TraceCheckUtils]: 111: Hoare triple {24294#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24294#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:47,398 INFO L273 TraceCheckUtils]: 112: Hoare triple {24294#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24294#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:47,398 INFO L273 TraceCheckUtils]: 113: Hoare triple {24294#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24295#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:47,399 INFO L273 TraceCheckUtils]: 114: Hoare triple {24295#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24295#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:47,399 INFO L273 TraceCheckUtils]: 115: Hoare triple {24295#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24295#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:47,400 INFO L273 TraceCheckUtils]: 116: Hoare triple {24295#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24296#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:47,400 INFO L273 TraceCheckUtils]: 117: Hoare triple {24296#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24296#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:47,401 INFO L273 TraceCheckUtils]: 118: Hoare triple {24296#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24296#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:47,402 INFO L273 TraceCheckUtils]: 119: Hoare triple {24296#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24297#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:47,402 INFO L273 TraceCheckUtils]: 120: Hoare triple {24297#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24297#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:47,403 INFO L273 TraceCheckUtils]: 121: Hoare triple {24297#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24297#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:47,403 INFO L273 TraceCheckUtils]: 122: Hoare triple {24297#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24298#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:47,404 INFO L273 TraceCheckUtils]: 123: Hoare triple {24298#(<= main_~i~0 40)} assume !(~i~0 < 100000); {24258#false} is VALID [2018-11-23 11:59:47,404 INFO L273 TraceCheckUtils]: 124: Hoare triple {24258#false} havoc ~x~0;~x~0 := 0; {24258#false} is VALID [2018-11-23 11:59:47,404 INFO L273 TraceCheckUtils]: 125: Hoare triple {24258#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {24258#false} is VALID [2018-11-23 11:59:47,404 INFO L256 TraceCheckUtils]: 126: Hoare triple {24258#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {24258#false} is VALID [2018-11-23 11:59:47,405 INFO L273 TraceCheckUtils]: 127: Hoare triple {24258#false} ~cond := #in~cond; {24258#false} is VALID [2018-11-23 11:59:47,405 INFO L273 TraceCheckUtils]: 128: Hoare triple {24258#false} assume 0 == ~cond; {24258#false} is VALID [2018-11-23 11:59:47,405 INFO L273 TraceCheckUtils]: 129: Hoare triple {24258#false} assume !false; {24258#false} is VALID [2018-11-23 11:59:47,418 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:59:47,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:47,419 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:59:47,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:47,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-23 11:59:47,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:47,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:47,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {24257#true} call ULTIMATE.init(); {24257#true} is VALID [2018-11-23 11:59:47,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {24257#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24257#true} is VALID [2018-11-23 11:59:47,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {24257#true} assume true; {24257#true} is VALID [2018-11-23 11:59:47,907 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24257#true} {24257#true} #54#return; {24257#true} is VALID [2018-11-23 11:59:47,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {24257#true} call #t~ret6 := main(); {24257#true} is VALID [2018-11-23 11:59:47,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {24257#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24259#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:47,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {24259#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24259#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:47,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {24259#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24259#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:47,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {24259#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24260#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,909 INFO L273 TraceCheckUtils]: 9: Hoare triple {24260#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24260#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {24260#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24260#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {24260#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24261#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {24261#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24261#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {24261#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24261#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {24261#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24262#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {24262#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24262#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {24262#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24262#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {24262#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24263#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {24263#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24263#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {24263#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24263#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {24263#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24264#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {24264#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24264#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,916 INFO L273 TraceCheckUtils]: 22: Hoare triple {24264#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24264#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,917 INFO L273 TraceCheckUtils]: 23: Hoare triple {24264#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24265#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,917 INFO L273 TraceCheckUtils]: 24: Hoare triple {24265#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24265#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,918 INFO L273 TraceCheckUtils]: 25: Hoare triple {24265#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24265#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,919 INFO L273 TraceCheckUtils]: 26: Hoare triple {24265#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24266#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,919 INFO L273 TraceCheckUtils]: 27: Hoare triple {24266#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24266#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,920 INFO L273 TraceCheckUtils]: 28: Hoare triple {24266#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24266#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,920 INFO L273 TraceCheckUtils]: 29: Hoare triple {24266#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24267#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,921 INFO L273 TraceCheckUtils]: 30: Hoare triple {24267#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24267#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,921 INFO L273 TraceCheckUtils]: 31: Hoare triple {24267#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24267#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,922 INFO L273 TraceCheckUtils]: 32: Hoare triple {24267#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24268#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,922 INFO L273 TraceCheckUtils]: 33: Hoare triple {24268#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24268#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {24268#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24268#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,924 INFO L273 TraceCheckUtils]: 35: Hoare triple {24268#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24269#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {24269#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24269#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,924 INFO L273 TraceCheckUtils]: 37: Hoare triple {24269#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24269#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,925 INFO L273 TraceCheckUtils]: 38: Hoare triple {24269#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24270#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,926 INFO L273 TraceCheckUtils]: 39: Hoare triple {24270#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24270#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,926 INFO L273 TraceCheckUtils]: 40: Hoare triple {24270#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24270#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,927 INFO L273 TraceCheckUtils]: 41: Hoare triple {24270#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24271#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,948 INFO L273 TraceCheckUtils]: 42: Hoare triple {24271#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24271#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,961 INFO L273 TraceCheckUtils]: 43: Hoare triple {24271#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24271#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,969 INFO L273 TraceCheckUtils]: 44: Hoare triple {24271#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24272#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,974 INFO L273 TraceCheckUtils]: 45: Hoare triple {24272#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24272#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,975 INFO L273 TraceCheckUtils]: 46: Hoare triple {24272#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24272#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,975 INFO L273 TraceCheckUtils]: 47: Hoare triple {24272#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24273#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,976 INFO L273 TraceCheckUtils]: 48: Hoare triple {24273#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24273#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,976 INFO L273 TraceCheckUtils]: 49: Hoare triple {24273#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24273#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,976 INFO L273 TraceCheckUtils]: 50: Hoare triple {24273#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24274#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,977 INFO L273 TraceCheckUtils]: 51: Hoare triple {24274#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24274#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,977 INFO L273 TraceCheckUtils]: 52: Hoare triple {24274#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24274#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,977 INFO L273 TraceCheckUtils]: 53: Hoare triple {24274#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24275#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,978 INFO L273 TraceCheckUtils]: 54: Hoare triple {24275#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24275#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,978 INFO L273 TraceCheckUtils]: 55: Hoare triple {24275#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24275#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,978 INFO L273 TraceCheckUtils]: 56: Hoare triple {24275#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24276#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,979 INFO L273 TraceCheckUtils]: 57: Hoare triple {24276#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24276#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,979 INFO L273 TraceCheckUtils]: 58: Hoare triple {24276#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24276#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,980 INFO L273 TraceCheckUtils]: 59: Hoare triple {24276#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24277#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,981 INFO L273 TraceCheckUtils]: 60: Hoare triple {24277#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24277#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,981 INFO L273 TraceCheckUtils]: 61: Hoare triple {24277#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24277#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,982 INFO L273 TraceCheckUtils]: 62: Hoare triple {24277#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24278#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,982 INFO L273 TraceCheckUtils]: 63: Hoare triple {24278#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24278#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,983 INFO L273 TraceCheckUtils]: 64: Hoare triple {24278#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24278#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,983 INFO L273 TraceCheckUtils]: 65: Hoare triple {24278#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24279#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,984 INFO L273 TraceCheckUtils]: 66: Hoare triple {24279#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24279#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,984 INFO L273 TraceCheckUtils]: 67: Hoare triple {24279#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24279#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,985 INFO L273 TraceCheckUtils]: 68: Hoare triple {24279#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24280#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,986 INFO L273 TraceCheckUtils]: 69: Hoare triple {24280#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24280#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,986 INFO L273 TraceCheckUtils]: 70: Hoare triple {24280#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24280#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,987 INFO L273 TraceCheckUtils]: 71: Hoare triple {24280#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24281#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,987 INFO L273 TraceCheckUtils]: 72: Hoare triple {24281#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24281#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,988 INFO L273 TraceCheckUtils]: 73: Hoare triple {24281#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24281#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,989 INFO L273 TraceCheckUtils]: 74: Hoare triple {24281#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24282#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,989 INFO L273 TraceCheckUtils]: 75: Hoare triple {24282#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24282#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,990 INFO L273 TraceCheckUtils]: 76: Hoare triple {24282#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24282#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,990 INFO L273 TraceCheckUtils]: 77: Hoare triple {24282#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24283#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,991 INFO L273 TraceCheckUtils]: 78: Hoare triple {24283#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24283#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,991 INFO L273 TraceCheckUtils]: 79: Hoare triple {24283#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24283#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,992 INFO L273 TraceCheckUtils]: 80: Hoare triple {24283#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24284#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,992 INFO L273 TraceCheckUtils]: 81: Hoare triple {24284#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24284#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,993 INFO L273 TraceCheckUtils]: 82: Hoare triple {24284#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24284#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,994 INFO L273 TraceCheckUtils]: 83: Hoare triple {24284#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24285#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,994 INFO L273 TraceCheckUtils]: 84: Hoare triple {24285#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24285#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,995 INFO L273 TraceCheckUtils]: 85: Hoare triple {24285#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24285#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,995 INFO L273 TraceCheckUtils]: 86: Hoare triple {24285#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24286#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,996 INFO L273 TraceCheckUtils]: 87: Hoare triple {24286#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24286#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,996 INFO L273 TraceCheckUtils]: 88: Hoare triple {24286#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24286#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,997 INFO L273 TraceCheckUtils]: 89: Hoare triple {24286#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24287#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,998 INFO L273 TraceCheckUtils]: 90: Hoare triple {24287#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24287#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,998 INFO L273 TraceCheckUtils]: 91: Hoare triple {24287#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24287#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,999 INFO L273 TraceCheckUtils]: 92: Hoare triple {24287#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24288#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,999 INFO L273 TraceCheckUtils]: 93: Hoare triple {24288#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24288#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:48,000 INFO L273 TraceCheckUtils]: 94: Hoare triple {24288#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24288#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:48,000 INFO L273 TraceCheckUtils]: 95: Hoare triple {24288#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24289#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:48,001 INFO L273 TraceCheckUtils]: 96: Hoare triple {24289#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24289#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:48,001 INFO L273 TraceCheckUtils]: 97: Hoare triple {24289#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24289#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:48,002 INFO L273 TraceCheckUtils]: 98: Hoare triple {24289#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24290#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:48,003 INFO L273 TraceCheckUtils]: 99: Hoare triple {24290#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24290#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:48,003 INFO L273 TraceCheckUtils]: 100: Hoare triple {24290#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24290#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:48,004 INFO L273 TraceCheckUtils]: 101: Hoare triple {24290#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24291#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:48,004 INFO L273 TraceCheckUtils]: 102: Hoare triple {24291#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24291#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:48,005 INFO L273 TraceCheckUtils]: 103: Hoare triple {24291#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24291#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:48,006 INFO L273 TraceCheckUtils]: 104: Hoare triple {24291#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24292#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:48,007 INFO L273 TraceCheckUtils]: 105: Hoare triple {24292#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24292#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:48,008 INFO L273 TraceCheckUtils]: 106: Hoare triple {24292#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24292#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:48,008 INFO L273 TraceCheckUtils]: 107: Hoare triple {24292#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24293#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:48,009 INFO L273 TraceCheckUtils]: 108: Hoare triple {24293#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24293#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:48,009 INFO L273 TraceCheckUtils]: 109: Hoare triple {24293#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24293#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:48,009 INFO L273 TraceCheckUtils]: 110: Hoare triple {24293#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24294#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:48,010 INFO L273 TraceCheckUtils]: 111: Hoare triple {24294#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24294#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:48,010 INFO L273 TraceCheckUtils]: 112: Hoare triple {24294#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24294#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:48,010 INFO L273 TraceCheckUtils]: 113: Hoare triple {24294#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24295#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:48,011 INFO L273 TraceCheckUtils]: 114: Hoare triple {24295#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24295#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:48,011 INFO L273 TraceCheckUtils]: 115: Hoare triple {24295#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24295#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:48,011 INFO L273 TraceCheckUtils]: 116: Hoare triple {24295#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24296#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:48,012 INFO L273 TraceCheckUtils]: 117: Hoare triple {24296#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24296#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:48,012 INFO L273 TraceCheckUtils]: 118: Hoare triple {24296#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24296#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:48,013 INFO L273 TraceCheckUtils]: 119: Hoare triple {24296#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24297#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:48,014 INFO L273 TraceCheckUtils]: 120: Hoare triple {24297#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24297#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:48,014 INFO L273 TraceCheckUtils]: 121: Hoare triple {24297#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {24297#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:48,015 INFO L273 TraceCheckUtils]: 122: Hoare triple {24297#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24298#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:48,016 INFO L273 TraceCheckUtils]: 123: Hoare triple {24298#(<= main_~i~0 40)} assume !(~i~0 < 100000); {24258#false} is VALID [2018-11-23 11:59:48,016 INFO L273 TraceCheckUtils]: 124: Hoare triple {24258#false} havoc ~x~0;~x~0 := 0; {24258#false} is VALID [2018-11-23 11:59:48,016 INFO L273 TraceCheckUtils]: 125: Hoare triple {24258#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {24258#false} is VALID [2018-11-23 11:59:48,016 INFO L256 TraceCheckUtils]: 126: Hoare triple {24258#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {24258#false} is VALID [2018-11-23 11:59:48,016 INFO L273 TraceCheckUtils]: 127: Hoare triple {24258#false} ~cond := #in~cond; {24258#false} is VALID [2018-11-23 11:59:48,016 INFO L273 TraceCheckUtils]: 128: Hoare triple {24258#false} assume 0 == ~cond; {24258#false} is VALID [2018-11-23 11:59:48,017 INFO L273 TraceCheckUtils]: 129: Hoare triple {24258#false} assume !false; {24258#false} is VALID [2018-11-23 11:59:48,028 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:59:48,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:48,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-11-23 11:59:48,047 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 130 [2018-11-23 11:59:48,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:48,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 11:59:48,174 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:59:48,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 11:59:48,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 11:59:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:59:48,176 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 42 states. [2018-11-23 11:59:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:49,136 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2018-11-23 11:59:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 11:59:49,137 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 130 [2018-11-23 11:59:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:59:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 194 transitions. [2018-11-23 11:59:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:59:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 194 transitions. [2018-11-23 11:59:49,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 194 transitions. [2018-11-23 11:59:49,332 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:59:49,335 INFO L225 Difference]: With dead ends: 151 [2018-11-23 11:59:49,335 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 11:59:49,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:59:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 11:59:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-11-23 11:59:49,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:49,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 138 states. [2018-11-23 11:59:49,374 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 138 states. [2018-11-23 11:59:49,374 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 138 states. [2018-11-23 11:59:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:49,377 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2018-11-23 11:59:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 11:59:49,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:49,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:49,377 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 140 states. [2018-11-23 11:59:49,377 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 140 states. [2018-11-23 11:59:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:49,379 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2018-11-23 11:59:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 11:59:49,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:49,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:49,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:49,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 11:59:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2018-11-23 11:59:49,381 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 130 [2018-11-23 11:59:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:49,381 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2018-11-23 11:59:49,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 11:59:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2018-11-23 11:59:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 11:59:49,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:49,382 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:59:49,382 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:49,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2039135241, now seen corresponding path program 40 times [2018-11-23 11:59:49,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:49,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:49,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:49,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:49,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:50,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {25356#true} call ULTIMATE.init(); {25356#true} is VALID [2018-11-23 11:59:50,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {25356#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25356#true} is VALID [2018-11-23 11:59:50,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {25356#true} assume true; {25356#true} is VALID [2018-11-23 11:59:50,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25356#true} {25356#true} #54#return; {25356#true} is VALID [2018-11-23 11:59:50,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {25356#true} call #t~ret6 := main(); {25356#true} is VALID [2018-11-23 11:59:50,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {25356#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {25358#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:50,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {25358#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25358#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:50,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {25358#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25358#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:50,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {25358#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25359#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:50,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {25359#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25359#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:50,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {25359#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25359#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:50,614 INFO L273 TraceCheckUtils]: 11: Hoare triple {25359#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25360#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:50,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {25360#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25360#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:50,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {25360#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25360#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:50,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {25360#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25361#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:50,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {25361#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25361#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:50,617 INFO L273 TraceCheckUtils]: 16: Hoare triple {25361#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25361#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:50,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {25361#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25362#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:50,618 INFO L273 TraceCheckUtils]: 18: Hoare triple {25362#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25362#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:50,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {25362#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25362#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:50,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {25362#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25363#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:50,620 INFO L273 TraceCheckUtils]: 21: Hoare triple {25363#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25363#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:50,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {25363#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25363#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:50,621 INFO L273 TraceCheckUtils]: 23: Hoare triple {25363#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25364#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:50,621 INFO L273 TraceCheckUtils]: 24: Hoare triple {25364#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25364#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:50,622 INFO L273 TraceCheckUtils]: 25: Hoare triple {25364#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25364#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:50,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {25364#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25365#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:50,623 INFO L273 TraceCheckUtils]: 27: Hoare triple {25365#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25365#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:50,624 INFO L273 TraceCheckUtils]: 28: Hoare triple {25365#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25365#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:50,624 INFO L273 TraceCheckUtils]: 29: Hoare triple {25365#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25366#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:50,625 INFO L273 TraceCheckUtils]: 30: Hoare triple {25366#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25366#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:50,625 INFO L273 TraceCheckUtils]: 31: Hoare triple {25366#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25366#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:50,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {25366#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25367#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:50,627 INFO L273 TraceCheckUtils]: 33: Hoare triple {25367#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25367#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:50,627 INFO L273 TraceCheckUtils]: 34: Hoare triple {25367#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25367#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:50,628 INFO L273 TraceCheckUtils]: 35: Hoare triple {25367#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25368#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:50,628 INFO L273 TraceCheckUtils]: 36: Hoare triple {25368#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25368#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:50,629 INFO L273 TraceCheckUtils]: 37: Hoare triple {25368#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25368#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:50,630 INFO L273 TraceCheckUtils]: 38: Hoare triple {25368#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25369#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:50,630 INFO L273 TraceCheckUtils]: 39: Hoare triple {25369#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25369#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:50,631 INFO L273 TraceCheckUtils]: 40: Hoare triple {25369#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25369#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:50,631 INFO L273 TraceCheckUtils]: 41: Hoare triple {25369#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25370#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:50,632 INFO L273 TraceCheckUtils]: 42: Hoare triple {25370#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25370#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:50,632 INFO L273 TraceCheckUtils]: 43: Hoare triple {25370#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25370#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:50,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {25370#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25371#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:50,634 INFO L273 TraceCheckUtils]: 45: Hoare triple {25371#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25371#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:50,634 INFO L273 TraceCheckUtils]: 46: Hoare triple {25371#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25371#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:50,635 INFO L273 TraceCheckUtils]: 47: Hoare triple {25371#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25372#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:50,635 INFO L273 TraceCheckUtils]: 48: Hoare triple {25372#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25372#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:50,636 INFO L273 TraceCheckUtils]: 49: Hoare triple {25372#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25372#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:50,636 INFO L273 TraceCheckUtils]: 50: Hoare triple {25372#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25373#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:50,637 INFO L273 TraceCheckUtils]: 51: Hoare triple {25373#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25373#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:50,637 INFO L273 TraceCheckUtils]: 52: Hoare triple {25373#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25373#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:50,638 INFO L273 TraceCheckUtils]: 53: Hoare triple {25373#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25374#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:50,639 INFO L273 TraceCheckUtils]: 54: Hoare triple {25374#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25374#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:50,639 INFO L273 TraceCheckUtils]: 55: Hoare triple {25374#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25374#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:50,640 INFO L273 TraceCheckUtils]: 56: Hoare triple {25374#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25375#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:50,640 INFO L273 TraceCheckUtils]: 57: Hoare triple {25375#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25375#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:50,641 INFO L273 TraceCheckUtils]: 58: Hoare triple {25375#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25375#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:50,642 INFO L273 TraceCheckUtils]: 59: Hoare triple {25375#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25376#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:50,642 INFO L273 TraceCheckUtils]: 60: Hoare triple {25376#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25376#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:50,643 INFO L273 TraceCheckUtils]: 61: Hoare triple {25376#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25376#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:50,643 INFO L273 TraceCheckUtils]: 62: Hoare triple {25376#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25377#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:50,644 INFO L273 TraceCheckUtils]: 63: Hoare triple {25377#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25377#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:50,644 INFO L273 TraceCheckUtils]: 64: Hoare triple {25377#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25377#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:50,645 INFO L273 TraceCheckUtils]: 65: Hoare triple {25377#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25378#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:50,646 INFO L273 TraceCheckUtils]: 66: Hoare triple {25378#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25378#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:50,646 INFO L273 TraceCheckUtils]: 67: Hoare triple {25378#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25378#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:50,647 INFO L273 TraceCheckUtils]: 68: Hoare triple {25378#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25379#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:50,647 INFO L273 TraceCheckUtils]: 69: Hoare triple {25379#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25379#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:50,648 INFO L273 TraceCheckUtils]: 70: Hoare triple {25379#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25379#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:50,648 INFO L273 TraceCheckUtils]: 71: Hoare triple {25379#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25380#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:50,649 INFO L273 TraceCheckUtils]: 72: Hoare triple {25380#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25380#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:50,649 INFO L273 TraceCheckUtils]: 73: Hoare triple {25380#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25380#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:50,650 INFO L273 TraceCheckUtils]: 74: Hoare triple {25380#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25381#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:50,651 INFO L273 TraceCheckUtils]: 75: Hoare triple {25381#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25381#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:50,651 INFO L273 TraceCheckUtils]: 76: Hoare triple {25381#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25381#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:50,652 INFO L273 TraceCheckUtils]: 77: Hoare triple {25381#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25382#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:50,652 INFO L273 TraceCheckUtils]: 78: Hoare triple {25382#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25382#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:50,653 INFO L273 TraceCheckUtils]: 79: Hoare triple {25382#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25382#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:50,654 INFO L273 TraceCheckUtils]: 80: Hoare triple {25382#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25383#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:50,654 INFO L273 TraceCheckUtils]: 81: Hoare triple {25383#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25383#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:50,655 INFO L273 TraceCheckUtils]: 82: Hoare triple {25383#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25383#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:50,655 INFO L273 TraceCheckUtils]: 83: Hoare triple {25383#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25384#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:50,656 INFO L273 TraceCheckUtils]: 84: Hoare triple {25384#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25384#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:50,656 INFO L273 TraceCheckUtils]: 85: Hoare triple {25384#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25384#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:50,657 INFO L273 TraceCheckUtils]: 86: Hoare triple {25384#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25385#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:50,658 INFO L273 TraceCheckUtils]: 87: Hoare triple {25385#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25385#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:50,658 INFO L273 TraceCheckUtils]: 88: Hoare triple {25385#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25385#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:50,659 INFO L273 TraceCheckUtils]: 89: Hoare triple {25385#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25386#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:50,659 INFO L273 TraceCheckUtils]: 90: Hoare triple {25386#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25386#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:50,660 INFO L273 TraceCheckUtils]: 91: Hoare triple {25386#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25386#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:50,660 INFO L273 TraceCheckUtils]: 92: Hoare triple {25386#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25387#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:50,661 INFO L273 TraceCheckUtils]: 93: Hoare triple {25387#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25387#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:50,661 INFO L273 TraceCheckUtils]: 94: Hoare triple {25387#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25387#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:50,662 INFO L273 TraceCheckUtils]: 95: Hoare triple {25387#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25388#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:50,663 INFO L273 TraceCheckUtils]: 96: Hoare triple {25388#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25388#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:50,663 INFO L273 TraceCheckUtils]: 97: Hoare triple {25388#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25388#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:50,664 INFO L273 TraceCheckUtils]: 98: Hoare triple {25388#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25389#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:50,664 INFO L273 TraceCheckUtils]: 99: Hoare triple {25389#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25389#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:50,665 INFO L273 TraceCheckUtils]: 100: Hoare triple {25389#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25389#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:50,666 INFO L273 TraceCheckUtils]: 101: Hoare triple {25389#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25390#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:50,666 INFO L273 TraceCheckUtils]: 102: Hoare triple {25390#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25390#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:50,667 INFO L273 TraceCheckUtils]: 103: Hoare triple {25390#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25390#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:50,667 INFO L273 TraceCheckUtils]: 104: Hoare triple {25390#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25391#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:50,668 INFO L273 TraceCheckUtils]: 105: Hoare triple {25391#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25391#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:50,668 INFO L273 TraceCheckUtils]: 106: Hoare triple {25391#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25391#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:50,669 INFO L273 TraceCheckUtils]: 107: Hoare triple {25391#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25392#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:50,670 INFO L273 TraceCheckUtils]: 108: Hoare triple {25392#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25392#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:50,670 INFO L273 TraceCheckUtils]: 109: Hoare triple {25392#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25392#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:50,671 INFO L273 TraceCheckUtils]: 110: Hoare triple {25392#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25393#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:50,671 INFO L273 TraceCheckUtils]: 111: Hoare triple {25393#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25393#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:50,672 INFO L273 TraceCheckUtils]: 112: Hoare triple {25393#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25393#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:50,673 INFO L273 TraceCheckUtils]: 113: Hoare triple {25393#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25394#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:50,673 INFO L273 TraceCheckUtils]: 114: Hoare triple {25394#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25394#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:50,674 INFO L273 TraceCheckUtils]: 115: Hoare triple {25394#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25394#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:50,674 INFO L273 TraceCheckUtils]: 116: Hoare triple {25394#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25395#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:50,675 INFO L273 TraceCheckUtils]: 117: Hoare triple {25395#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25395#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:50,675 INFO L273 TraceCheckUtils]: 118: Hoare triple {25395#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25395#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:50,676 INFO L273 TraceCheckUtils]: 119: Hoare triple {25395#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25396#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:50,676 INFO L273 TraceCheckUtils]: 120: Hoare triple {25396#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25396#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:50,677 INFO L273 TraceCheckUtils]: 121: Hoare triple {25396#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25396#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:50,678 INFO L273 TraceCheckUtils]: 122: Hoare triple {25396#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25397#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:50,678 INFO L273 TraceCheckUtils]: 123: Hoare triple {25397#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25397#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:50,679 INFO L273 TraceCheckUtils]: 124: Hoare triple {25397#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25397#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:50,679 INFO L273 TraceCheckUtils]: 125: Hoare triple {25397#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25398#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:50,680 INFO L273 TraceCheckUtils]: 126: Hoare triple {25398#(<= main_~i~0 41)} assume !(~i~0 < 100000); {25357#false} is VALID [2018-11-23 11:59:50,680 INFO L273 TraceCheckUtils]: 127: Hoare triple {25357#false} havoc ~x~0;~x~0 := 0; {25357#false} is VALID [2018-11-23 11:59:50,680 INFO L273 TraceCheckUtils]: 128: Hoare triple {25357#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {25357#false} is VALID [2018-11-23 11:59:50,681 INFO L256 TraceCheckUtils]: 129: Hoare triple {25357#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {25357#false} is VALID [2018-11-23 11:59:50,681 INFO L273 TraceCheckUtils]: 130: Hoare triple {25357#false} ~cond := #in~cond; {25357#false} is VALID [2018-11-23 11:59:50,681 INFO L273 TraceCheckUtils]: 131: Hoare triple {25357#false} assume 0 == ~cond; {25357#false} is VALID [2018-11-23 11:59:50,681 INFO L273 TraceCheckUtils]: 132: Hoare triple {25357#false} assume !false; {25357#false} is VALID [2018-11-23 11:59:50,692 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:59:50,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:50,693 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:59:50,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:50,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:50,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:50,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:51,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {25356#true} call ULTIMATE.init(); {25356#true} is VALID [2018-11-23 11:59:51,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {25356#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25356#true} is VALID [2018-11-23 11:59:51,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {25356#true} assume true; {25356#true} is VALID [2018-11-23 11:59:51,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25356#true} {25356#true} #54#return; {25356#true} is VALID [2018-11-23 11:59:51,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {25356#true} call #t~ret6 := main(); {25356#true} is VALID [2018-11-23 11:59:51,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {25356#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {25358#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:51,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {25358#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25358#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:51,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {25358#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25358#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:51,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {25358#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25359#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:51,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {25359#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25359#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:51,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {25359#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25359#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:51,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {25359#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25360#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:51,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {25360#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25360#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:51,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {25360#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25360#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:51,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {25360#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25361#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:51,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {25361#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25361#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:51,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {25361#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25361#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:51,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {25361#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25362#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:51,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {25362#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25362#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:51,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {25362#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25362#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:51,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {25362#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25363#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:51,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {25363#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25363#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:51,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {25363#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25363#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:51,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {25363#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25364#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:51,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {25364#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25364#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:51,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {25364#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25364#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:51,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {25364#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25365#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:51,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {25365#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25365#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:51,119 INFO L273 TraceCheckUtils]: 28: Hoare triple {25365#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25365#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:51,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {25365#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25366#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:51,120 INFO L273 TraceCheckUtils]: 30: Hoare triple {25366#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25366#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:51,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {25366#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25366#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:51,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {25366#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25367#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:51,122 INFO L273 TraceCheckUtils]: 33: Hoare triple {25367#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25367#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:51,122 INFO L273 TraceCheckUtils]: 34: Hoare triple {25367#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25367#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:51,123 INFO L273 TraceCheckUtils]: 35: Hoare triple {25367#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25368#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:51,124 INFO L273 TraceCheckUtils]: 36: Hoare triple {25368#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25368#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:51,124 INFO L273 TraceCheckUtils]: 37: Hoare triple {25368#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25368#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:51,125 INFO L273 TraceCheckUtils]: 38: Hoare triple {25368#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25369#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:51,125 INFO L273 TraceCheckUtils]: 39: Hoare triple {25369#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25369#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:51,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {25369#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25369#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:51,127 INFO L273 TraceCheckUtils]: 41: Hoare triple {25369#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25370#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:51,127 INFO L273 TraceCheckUtils]: 42: Hoare triple {25370#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25370#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:51,128 INFO L273 TraceCheckUtils]: 43: Hoare triple {25370#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25370#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:51,128 INFO L273 TraceCheckUtils]: 44: Hoare triple {25370#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25371#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:51,129 INFO L273 TraceCheckUtils]: 45: Hoare triple {25371#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25371#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:51,129 INFO L273 TraceCheckUtils]: 46: Hoare triple {25371#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25371#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:51,130 INFO L273 TraceCheckUtils]: 47: Hoare triple {25371#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25372#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:51,131 INFO L273 TraceCheckUtils]: 48: Hoare triple {25372#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25372#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:51,131 INFO L273 TraceCheckUtils]: 49: Hoare triple {25372#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25372#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:51,132 INFO L273 TraceCheckUtils]: 50: Hoare triple {25372#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25373#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:51,132 INFO L273 TraceCheckUtils]: 51: Hoare triple {25373#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25373#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:51,133 INFO L273 TraceCheckUtils]: 52: Hoare triple {25373#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25373#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:51,133 INFO L273 TraceCheckUtils]: 53: Hoare triple {25373#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25374#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:51,134 INFO L273 TraceCheckUtils]: 54: Hoare triple {25374#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25374#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:51,134 INFO L273 TraceCheckUtils]: 55: Hoare triple {25374#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25374#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:51,135 INFO L273 TraceCheckUtils]: 56: Hoare triple {25374#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25375#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:51,136 INFO L273 TraceCheckUtils]: 57: Hoare triple {25375#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25375#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:51,136 INFO L273 TraceCheckUtils]: 58: Hoare triple {25375#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25375#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:51,137 INFO L273 TraceCheckUtils]: 59: Hoare triple {25375#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25376#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:51,137 INFO L273 TraceCheckUtils]: 60: Hoare triple {25376#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25376#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:51,138 INFO L273 TraceCheckUtils]: 61: Hoare triple {25376#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25376#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:51,139 INFO L273 TraceCheckUtils]: 62: Hoare triple {25376#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25377#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:51,139 INFO L273 TraceCheckUtils]: 63: Hoare triple {25377#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25377#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:51,140 INFO L273 TraceCheckUtils]: 64: Hoare triple {25377#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25377#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:51,140 INFO L273 TraceCheckUtils]: 65: Hoare triple {25377#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25378#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:51,141 INFO L273 TraceCheckUtils]: 66: Hoare triple {25378#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25378#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:51,141 INFO L273 TraceCheckUtils]: 67: Hoare triple {25378#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25378#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:51,142 INFO L273 TraceCheckUtils]: 68: Hoare triple {25378#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25379#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:51,143 INFO L273 TraceCheckUtils]: 69: Hoare triple {25379#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25379#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:51,143 INFO L273 TraceCheckUtils]: 70: Hoare triple {25379#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25379#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:51,144 INFO L273 TraceCheckUtils]: 71: Hoare triple {25379#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25380#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:51,144 INFO L273 TraceCheckUtils]: 72: Hoare triple {25380#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25380#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:51,145 INFO L273 TraceCheckUtils]: 73: Hoare triple {25380#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25380#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:51,146 INFO L273 TraceCheckUtils]: 74: Hoare triple {25380#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25381#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:51,146 INFO L273 TraceCheckUtils]: 75: Hoare triple {25381#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25381#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:51,147 INFO L273 TraceCheckUtils]: 76: Hoare triple {25381#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25381#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:51,147 INFO L273 TraceCheckUtils]: 77: Hoare triple {25381#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25382#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:51,148 INFO L273 TraceCheckUtils]: 78: Hoare triple {25382#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25382#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:51,148 INFO L273 TraceCheckUtils]: 79: Hoare triple {25382#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25382#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:51,149 INFO L273 TraceCheckUtils]: 80: Hoare triple {25382#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25383#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:51,149 INFO L273 TraceCheckUtils]: 81: Hoare triple {25383#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25383#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:51,150 INFO L273 TraceCheckUtils]: 82: Hoare triple {25383#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25383#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:51,151 INFO L273 TraceCheckUtils]: 83: Hoare triple {25383#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25384#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:51,151 INFO L273 TraceCheckUtils]: 84: Hoare triple {25384#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25384#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:51,152 INFO L273 TraceCheckUtils]: 85: Hoare triple {25384#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25384#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:51,152 INFO L273 TraceCheckUtils]: 86: Hoare triple {25384#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25385#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:51,153 INFO L273 TraceCheckUtils]: 87: Hoare triple {25385#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25385#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:51,153 INFO L273 TraceCheckUtils]: 88: Hoare triple {25385#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25385#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:51,154 INFO L273 TraceCheckUtils]: 89: Hoare triple {25385#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25386#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:51,155 INFO L273 TraceCheckUtils]: 90: Hoare triple {25386#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25386#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:51,155 INFO L273 TraceCheckUtils]: 91: Hoare triple {25386#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25386#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:51,156 INFO L273 TraceCheckUtils]: 92: Hoare triple {25386#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25387#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:51,156 INFO L273 TraceCheckUtils]: 93: Hoare triple {25387#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25387#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:51,157 INFO L273 TraceCheckUtils]: 94: Hoare triple {25387#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25387#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:51,158 INFO L273 TraceCheckUtils]: 95: Hoare triple {25387#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25388#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:51,158 INFO L273 TraceCheckUtils]: 96: Hoare triple {25388#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25388#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:51,159 INFO L273 TraceCheckUtils]: 97: Hoare triple {25388#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25388#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:51,159 INFO L273 TraceCheckUtils]: 98: Hoare triple {25388#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25389#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:51,160 INFO L273 TraceCheckUtils]: 99: Hoare triple {25389#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25389#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:51,160 INFO L273 TraceCheckUtils]: 100: Hoare triple {25389#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25389#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:51,161 INFO L273 TraceCheckUtils]: 101: Hoare triple {25389#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25390#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:51,161 INFO L273 TraceCheckUtils]: 102: Hoare triple {25390#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25390#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:51,162 INFO L273 TraceCheckUtils]: 103: Hoare triple {25390#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25390#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:51,163 INFO L273 TraceCheckUtils]: 104: Hoare triple {25390#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25391#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:51,163 INFO L273 TraceCheckUtils]: 105: Hoare triple {25391#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25391#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:51,164 INFO L273 TraceCheckUtils]: 106: Hoare triple {25391#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25391#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:51,164 INFO L273 TraceCheckUtils]: 107: Hoare triple {25391#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25392#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:51,165 INFO L273 TraceCheckUtils]: 108: Hoare triple {25392#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25392#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:51,165 INFO L273 TraceCheckUtils]: 109: Hoare triple {25392#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25392#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:51,166 INFO L273 TraceCheckUtils]: 110: Hoare triple {25392#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25393#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:51,167 INFO L273 TraceCheckUtils]: 111: Hoare triple {25393#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25393#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:51,167 INFO L273 TraceCheckUtils]: 112: Hoare triple {25393#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25393#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:51,168 INFO L273 TraceCheckUtils]: 113: Hoare triple {25393#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25394#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:51,168 INFO L273 TraceCheckUtils]: 114: Hoare triple {25394#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25394#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:51,169 INFO L273 TraceCheckUtils]: 115: Hoare triple {25394#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25394#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:51,169 INFO L273 TraceCheckUtils]: 116: Hoare triple {25394#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25395#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:51,170 INFO L273 TraceCheckUtils]: 117: Hoare triple {25395#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25395#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:51,170 INFO L273 TraceCheckUtils]: 118: Hoare triple {25395#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25395#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:51,171 INFO L273 TraceCheckUtils]: 119: Hoare triple {25395#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25396#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:51,172 INFO L273 TraceCheckUtils]: 120: Hoare triple {25396#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25396#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:51,172 INFO L273 TraceCheckUtils]: 121: Hoare triple {25396#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25396#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:51,173 INFO L273 TraceCheckUtils]: 122: Hoare triple {25396#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25397#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:51,173 INFO L273 TraceCheckUtils]: 123: Hoare triple {25397#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25397#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:51,174 INFO L273 TraceCheckUtils]: 124: Hoare triple {25397#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {25397#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:51,175 INFO L273 TraceCheckUtils]: 125: Hoare triple {25397#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25398#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:51,175 INFO L273 TraceCheckUtils]: 126: Hoare triple {25398#(<= main_~i~0 41)} assume !(~i~0 < 100000); {25357#false} is VALID [2018-11-23 11:59:51,175 INFO L273 TraceCheckUtils]: 127: Hoare triple {25357#false} havoc ~x~0;~x~0 := 0; {25357#false} is VALID [2018-11-23 11:59:51,176 INFO L273 TraceCheckUtils]: 128: Hoare triple {25357#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {25357#false} is VALID [2018-11-23 11:59:51,176 INFO L256 TraceCheckUtils]: 129: Hoare triple {25357#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {25357#false} is VALID [2018-11-23 11:59:51,176 INFO L273 TraceCheckUtils]: 130: Hoare triple {25357#false} ~cond := #in~cond; {25357#false} is VALID [2018-11-23 11:59:51,176 INFO L273 TraceCheckUtils]: 131: Hoare triple {25357#false} assume 0 == ~cond; {25357#false} is VALID [2018-11-23 11:59:51,176 INFO L273 TraceCheckUtils]: 132: Hoare triple {25357#false} assume !false; {25357#false} is VALID [2018-11-23 11:59:51,188 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:59:51,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:51,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-11-23 11:59:51,208 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 133 [2018-11-23 11:59:51,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:51,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 11:59:51,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:51,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 11:59:51,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 11:59:51,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:59:51,337 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand 43 states. [2018-11-23 11:59:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:52,210 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2018-11-23 11:59:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 11:59:52,211 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 133 [2018-11-23 11:59:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:59:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 198 transitions. [2018-11-23 11:59:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:59:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 198 transitions. [2018-11-23 11:59:52,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 198 transitions. [2018-11-23 11:59:52,399 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:59:52,402 INFO L225 Difference]: With dead ends: 154 [2018-11-23 11:59:52,403 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 11:59:52,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:59:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 11:59:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-23 11:59:52,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:52,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 141 states. [2018-11-23 11:59:52,438 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 141 states. [2018-11-23 11:59:52,438 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 141 states. [2018-11-23 11:59:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:52,441 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2018-11-23 11:59:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2018-11-23 11:59:52,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:52,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:52,441 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 143 states. [2018-11-23 11:59:52,442 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 143 states. [2018-11-23 11:59:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:52,444 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2018-11-23 11:59:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2018-11-23 11:59:52,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:52,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:52,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:52,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 11:59:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2018-11-23 11:59:52,447 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 133 [2018-11-23 11:59:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:52,447 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2018-11-23 11:59:52,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 11:59:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2018-11-23 11:59:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 11:59:52,448 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:52,448 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:59:52,449 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:52,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:52,449 INFO L82 PathProgramCache]: Analyzing trace with hash -815165180, now seen corresponding path program 41 times [2018-11-23 11:59:52,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:52,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:52,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:52,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:52,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:54,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {26479#true} call ULTIMATE.init(); {26479#true} is VALID [2018-11-23 11:59:54,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {26479#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26479#true} is VALID [2018-11-23 11:59:54,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {26479#true} assume true; {26479#true} is VALID [2018-11-23 11:59:54,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26479#true} {26479#true} #54#return; {26479#true} is VALID [2018-11-23 11:59:54,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {26479#true} call #t~ret6 := main(); {26479#true} is VALID [2018-11-23 11:59:54,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {26479#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26481#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:54,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {26481#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26481#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:54,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {26481#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26481#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:54,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {26481#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26482#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:54,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {26482#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26482#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:54,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {26482#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26482#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:54,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {26482#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26483#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:54,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {26483#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26483#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:54,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {26483#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26483#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:54,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {26483#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26484#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:54,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {26484#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26484#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:54,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {26484#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26484#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:54,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {26484#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26485#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:54,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {26485#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26485#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:54,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {26485#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26485#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:54,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {26485#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26486#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:54,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {26486#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26486#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:54,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {26486#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26486#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:54,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {26486#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26487#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:54,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {26487#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26487#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:54,991 INFO L273 TraceCheckUtils]: 25: Hoare triple {26487#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26487#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:54,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {26487#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26488#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:54,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {26488#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26488#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:54,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {26488#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26488#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:54,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {26488#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26489#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:54,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {26489#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26489#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:54,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {26489#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26489#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:54,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {26489#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26490#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:54,996 INFO L273 TraceCheckUtils]: 33: Hoare triple {26490#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26490#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:54,996 INFO L273 TraceCheckUtils]: 34: Hoare triple {26490#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26490#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:54,997 INFO L273 TraceCheckUtils]: 35: Hoare triple {26490#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26491#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:54,998 INFO L273 TraceCheckUtils]: 36: Hoare triple {26491#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26491#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:54,998 INFO L273 TraceCheckUtils]: 37: Hoare triple {26491#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26491#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:54,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {26491#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26492#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:54,999 INFO L273 TraceCheckUtils]: 39: Hoare triple {26492#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26492#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:55,000 INFO L273 TraceCheckUtils]: 40: Hoare triple {26492#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26492#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:55,001 INFO L273 TraceCheckUtils]: 41: Hoare triple {26492#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26493#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:55,001 INFO L273 TraceCheckUtils]: 42: Hoare triple {26493#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26493#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:55,002 INFO L273 TraceCheckUtils]: 43: Hoare triple {26493#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26493#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:55,002 INFO L273 TraceCheckUtils]: 44: Hoare triple {26493#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26494#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:55,003 INFO L273 TraceCheckUtils]: 45: Hoare triple {26494#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26494#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:55,003 INFO L273 TraceCheckUtils]: 46: Hoare triple {26494#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26494#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:55,004 INFO L273 TraceCheckUtils]: 47: Hoare triple {26494#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26495#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:55,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {26495#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26495#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:55,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {26495#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26495#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:55,006 INFO L273 TraceCheckUtils]: 50: Hoare triple {26495#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26496#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:55,006 INFO L273 TraceCheckUtils]: 51: Hoare triple {26496#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26496#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:55,007 INFO L273 TraceCheckUtils]: 52: Hoare triple {26496#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26496#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:55,007 INFO L273 TraceCheckUtils]: 53: Hoare triple {26496#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26497#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:55,008 INFO L273 TraceCheckUtils]: 54: Hoare triple {26497#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26497#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:55,008 INFO L273 TraceCheckUtils]: 55: Hoare triple {26497#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26497#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:55,009 INFO L273 TraceCheckUtils]: 56: Hoare triple {26497#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:55,010 INFO L273 TraceCheckUtils]: 57: Hoare triple {26498#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26498#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:55,010 INFO L273 TraceCheckUtils]: 58: Hoare triple {26498#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26498#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:55,011 INFO L273 TraceCheckUtils]: 59: Hoare triple {26498#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26499#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:55,011 INFO L273 TraceCheckUtils]: 60: Hoare triple {26499#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26499#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:55,012 INFO L273 TraceCheckUtils]: 61: Hoare triple {26499#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26499#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:55,013 INFO L273 TraceCheckUtils]: 62: Hoare triple {26499#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26500#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:55,013 INFO L273 TraceCheckUtils]: 63: Hoare triple {26500#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26500#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:55,014 INFO L273 TraceCheckUtils]: 64: Hoare triple {26500#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26500#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:55,014 INFO L273 TraceCheckUtils]: 65: Hoare triple {26500#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26501#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:55,015 INFO L273 TraceCheckUtils]: 66: Hoare triple {26501#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26501#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:55,015 INFO L273 TraceCheckUtils]: 67: Hoare triple {26501#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26501#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:55,016 INFO L273 TraceCheckUtils]: 68: Hoare triple {26501#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26502#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:55,017 INFO L273 TraceCheckUtils]: 69: Hoare triple {26502#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26502#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:55,017 INFO L273 TraceCheckUtils]: 70: Hoare triple {26502#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26502#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:55,018 INFO L273 TraceCheckUtils]: 71: Hoare triple {26502#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26503#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:55,018 INFO L273 TraceCheckUtils]: 72: Hoare triple {26503#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26503#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:55,019 INFO L273 TraceCheckUtils]: 73: Hoare triple {26503#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26503#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:55,020 INFO L273 TraceCheckUtils]: 74: Hoare triple {26503#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26504#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:55,020 INFO L273 TraceCheckUtils]: 75: Hoare triple {26504#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26504#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:55,021 INFO L273 TraceCheckUtils]: 76: Hoare triple {26504#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26504#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:55,021 INFO L273 TraceCheckUtils]: 77: Hoare triple {26504#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26505#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:55,022 INFO L273 TraceCheckUtils]: 78: Hoare triple {26505#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26505#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:55,022 INFO L273 TraceCheckUtils]: 79: Hoare triple {26505#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26505#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:55,023 INFO L273 TraceCheckUtils]: 80: Hoare triple {26505#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26506#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:55,024 INFO L273 TraceCheckUtils]: 81: Hoare triple {26506#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26506#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:55,024 INFO L273 TraceCheckUtils]: 82: Hoare triple {26506#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26506#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:55,025 INFO L273 TraceCheckUtils]: 83: Hoare triple {26506#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26507#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:55,025 INFO L273 TraceCheckUtils]: 84: Hoare triple {26507#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26507#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:55,026 INFO L273 TraceCheckUtils]: 85: Hoare triple {26507#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26507#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:55,026 INFO L273 TraceCheckUtils]: 86: Hoare triple {26507#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26508#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:55,027 INFO L273 TraceCheckUtils]: 87: Hoare triple {26508#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26508#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:55,027 INFO L273 TraceCheckUtils]: 88: Hoare triple {26508#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26508#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:55,028 INFO L273 TraceCheckUtils]: 89: Hoare triple {26508#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26509#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:55,029 INFO L273 TraceCheckUtils]: 90: Hoare triple {26509#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26509#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:55,029 INFO L273 TraceCheckUtils]: 91: Hoare triple {26509#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26509#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:55,030 INFO L273 TraceCheckUtils]: 92: Hoare triple {26509#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26510#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:55,030 INFO L273 TraceCheckUtils]: 93: Hoare triple {26510#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26510#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:55,031 INFO L273 TraceCheckUtils]: 94: Hoare triple {26510#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26510#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:55,032 INFO L273 TraceCheckUtils]: 95: Hoare triple {26510#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26511#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:55,032 INFO L273 TraceCheckUtils]: 96: Hoare triple {26511#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26511#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:55,033 INFO L273 TraceCheckUtils]: 97: Hoare triple {26511#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26511#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:55,033 INFO L273 TraceCheckUtils]: 98: Hoare triple {26511#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26512#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:55,034 INFO L273 TraceCheckUtils]: 99: Hoare triple {26512#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26512#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:55,034 INFO L273 TraceCheckUtils]: 100: Hoare triple {26512#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26512#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:55,035 INFO L273 TraceCheckUtils]: 101: Hoare triple {26512#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26513#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:55,036 INFO L273 TraceCheckUtils]: 102: Hoare triple {26513#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26513#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:55,036 INFO L273 TraceCheckUtils]: 103: Hoare triple {26513#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26513#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:55,037 INFO L273 TraceCheckUtils]: 104: Hoare triple {26513#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26514#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:55,037 INFO L273 TraceCheckUtils]: 105: Hoare triple {26514#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26514#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:55,038 INFO L273 TraceCheckUtils]: 106: Hoare triple {26514#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26514#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:55,039 INFO L273 TraceCheckUtils]: 107: Hoare triple {26514#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26515#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:55,039 INFO L273 TraceCheckUtils]: 108: Hoare triple {26515#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26515#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:55,040 INFO L273 TraceCheckUtils]: 109: Hoare triple {26515#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26515#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:55,040 INFO L273 TraceCheckUtils]: 110: Hoare triple {26515#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26516#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:55,041 INFO L273 TraceCheckUtils]: 111: Hoare triple {26516#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26516#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:55,041 INFO L273 TraceCheckUtils]: 112: Hoare triple {26516#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26516#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:55,042 INFO L273 TraceCheckUtils]: 113: Hoare triple {26516#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26517#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:55,043 INFO L273 TraceCheckUtils]: 114: Hoare triple {26517#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26517#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:55,043 INFO L273 TraceCheckUtils]: 115: Hoare triple {26517#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26517#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:55,044 INFO L273 TraceCheckUtils]: 116: Hoare triple {26517#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26518#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:55,044 INFO L273 TraceCheckUtils]: 117: Hoare triple {26518#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26518#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:55,045 INFO L273 TraceCheckUtils]: 118: Hoare triple {26518#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26518#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:55,045 INFO L273 TraceCheckUtils]: 119: Hoare triple {26518#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26519#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:55,046 INFO L273 TraceCheckUtils]: 120: Hoare triple {26519#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26519#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:55,046 INFO L273 TraceCheckUtils]: 121: Hoare triple {26519#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26519#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:55,047 INFO L273 TraceCheckUtils]: 122: Hoare triple {26519#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26520#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:55,048 INFO L273 TraceCheckUtils]: 123: Hoare triple {26520#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26520#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:55,048 INFO L273 TraceCheckUtils]: 124: Hoare triple {26520#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26520#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:55,049 INFO L273 TraceCheckUtils]: 125: Hoare triple {26520#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26521#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:55,049 INFO L273 TraceCheckUtils]: 126: Hoare triple {26521#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26521#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:55,050 INFO L273 TraceCheckUtils]: 127: Hoare triple {26521#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26521#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:55,051 INFO L273 TraceCheckUtils]: 128: Hoare triple {26521#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26522#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:55,051 INFO L273 TraceCheckUtils]: 129: Hoare triple {26522#(<= main_~i~0 42)} assume !(~i~0 < 100000); {26480#false} is VALID [2018-11-23 11:59:55,052 INFO L273 TraceCheckUtils]: 130: Hoare triple {26480#false} havoc ~x~0;~x~0 := 0; {26480#false} is VALID [2018-11-23 11:59:55,052 INFO L273 TraceCheckUtils]: 131: Hoare triple {26480#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {26480#false} is VALID [2018-11-23 11:59:55,052 INFO L256 TraceCheckUtils]: 132: Hoare triple {26480#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {26480#false} is VALID [2018-11-23 11:59:55,052 INFO L273 TraceCheckUtils]: 133: Hoare triple {26480#false} ~cond := #in~cond; {26480#false} is VALID [2018-11-23 11:59:55,052 INFO L273 TraceCheckUtils]: 134: Hoare triple {26480#false} assume 0 == ~cond; {26480#false} is VALID [2018-11-23 11:59:55,052 INFO L273 TraceCheckUtils]: 135: Hoare triple {26480#false} assume !false; {26480#false} is VALID [2018-11-23 11:59:55,065 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:59:55,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:55,065 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:59:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:55,313 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-11-23 11:59:55,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:55,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:55,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {26479#true} call ULTIMATE.init(); {26479#true} is VALID [2018-11-23 11:59:55,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {26479#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26479#true} is VALID [2018-11-23 11:59:55,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {26479#true} assume true; {26479#true} is VALID [2018-11-23 11:59:55,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26479#true} {26479#true} #54#return; {26479#true} is VALID [2018-11-23 11:59:55,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {26479#true} call #t~ret6 := main(); {26479#true} is VALID [2018-11-23 11:59:55,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {26479#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26481#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:55,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {26481#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26481#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:55,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {26481#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26481#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:55,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {26481#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26482#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:55,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {26482#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26482#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:55,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {26482#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26482#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:55,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {26482#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26483#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:55,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {26483#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26483#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:55,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {26483#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26483#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:55,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {26483#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26484#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:55,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {26484#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26484#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:55,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {26484#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26484#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:55,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {26484#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26485#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:55,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {26485#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26485#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:55,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {26485#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26485#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:55,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {26485#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26486#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:55,645 INFO L273 TraceCheckUtils]: 21: Hoare triple {26486#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26486#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:55,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {26486#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26486#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:55,646 INFO L273 TraceCheckUtils]: 23: Hoare triple {26486#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26487#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:55,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {26487#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26487#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:55,647 INFO L273 TraceCheckUtils]: 25: Hoare triple {26487#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26487#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:55,648 INFO L273 TraceCheckUtils]: 26: Hoare triple {26487#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26488#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:55,649 INFO L273 TraceCheckUtils]: 27: Hoare triple {26488#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26488#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:55,649 INFO L273 TraceCheckUtils]: 28: Hoare triple {26488#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26488#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:55,650 INFO L273 TraceCheckUtils]: 29: Hoare triple {26488#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26489#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:55,650 INFO L273 TraceCheckUtils]: 30: Hoare triple {26489#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26489#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:55,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {26489#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26489#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:55,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {26489#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26490#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:55,652 INFO L273 TraceCheckUtils]: 33: Hoare triple {26490#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26490#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:55,653 INFO L273 TraceCheckUtils]: 34: Hoare triple {26490#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26490#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:55,653 INFO L273 TraceCheckUtils]: 35: Hoare triple {26490#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26491#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:55,654 INFO L273 TraceCheckUtils]: 36: Hoare triple {26491#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26491#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:55,654 INFO L273 TraceCheckUtils]: 37: Hoare triple {26491#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26491#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:55,655 INFO L273 TraceCheckUtils]: 38: Hoare triple {26491#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26492#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:55,656 INFO L273 TraceCheckUtils]: 39: Hoare triple {26492#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26492#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:55,656 INFO L273 TraceCheckUtils]: 40: Hoare triple {26492#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26492#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:55,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {26492#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26493#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:55,657 INFO L273 TraceCheckUtils]: 42: Hoare triple {26493#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26493#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:55,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {26493#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26493#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:55,658 INFO L273 TraceCheckUtils]: 44: Hoare triple {26493#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26494#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:55,659 INFO L273 TraceCheckUtils]: 45: Hoare triple {26494#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26494#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:55,659 INFO L273 TraceCheckUtils]: 46: Hoare triple {26494#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26494#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:55,660 INFO L273 TraceCheckUtils]: 47: Hoare triple {26494#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26495#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:55,661 INFO L273 TraceCheckUtils]: 48: Hoare triple {26495#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26495#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:55,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {26495#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26495#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:55,662 INFO L273 TraceCheckUtils]: 50: Hoare triple {26495#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26496#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:55,662 INFO L273 TraceCheckUtils]: 51: Hoare triple {26496#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26496#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:55,663 INFO L273 TraceCheckUtils]: 52: Hoare triple {26496#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26496#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:55,664 INFO L273 TraceCheckUtils]: 53: Hoare triple {26496#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26497#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:55,664 INFO L273 TraceCheckUtils]: 54: Hoare triple {26497#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26497#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:55,665 INFO L273 TraceCheckUtils]: 55: Hoare triple {26497#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26497#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:55,665 INFO L273 TraceCheckUtils]: 56: Hoare triple {26497#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:55,666 INFO L273 TraceCheckUtils]: 57: Hoare triple {26498#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26498#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:55,666 INFO L273 TraceCheckUtils]: 58: Hoare triple {26498#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26498#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:55,667 INFO L273 TraceCheckUtils]: 59: Hoare triple {26498#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26499#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:55,668 INFO L273 TraceCheckUtils]: 60: Hoare triple {26499#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26499#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:55,668 INFO L273 TraceCheckUtils]: 61: Hoare triple {26499#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26499#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:55,669 INFO L273 TraceCheckUtils]: 62: Hoare triple {26499#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26500#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:55,669 INFO L273 TraceCheckUtils]: 63: Hoare triple {26500#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26500#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:55,670 INFO L273 TraceCheckUtils]: 64: Hoare triple {26500#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26500#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:55,670 INFO L273 TraceCheckUtils]: 65: Hoare triple {26500#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26501#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:55,671 INFO L273 TraceCheckUtils]: 66: Hoare triple {26501#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26501#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:55,671 INFO L273 TraceCheckUtils]: 67: Hoare triple {26501#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26501#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:55,672 INFO L273 TraceCheckUtils]: 68: Hoare triple {26501#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26502#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:55,673 INFO L273 TraceCheckUtils]: 69: Hoare triple {26502#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26502#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:55,673 INFO L273 TraceCheckUtils]: 70: Hoare triple {26502#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26502#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:55,674 INFO L273 TraceCheckUtils]: 71: Hoare triple {26502#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26503#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:55,674 INFO L273 TraceCheckUtils]: 72: Hoare triple {26503#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26503#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:55,675 INFO L273 TraceCheckUtils]: 73: Hoare triple {26503#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26503#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:55,676 INFO L273 TraceCheckUtils]: 74: Hoare triple {26503#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26504#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:55,676 INFO L273 TraceCheckUtils]: 75: Hoare triple {26504#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26504#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:55,677 INFO L273 TraceCheckUtils]: 76: Hoare triple {26504#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26504#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:55,677 INFO L273 TraceCheckUtils]: 77: Hoare triple {26504#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26505#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:55,678 INFO L273 TraceCheckUtils]: 78: Hoare triple {26505#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26505#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:55,678 INFO L273 TraceCheckUtils]: 79: Hoare triple {26505#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26505#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:55,679 INFO L273 TraceCheckUtils]: 80: Hoare triple {26505#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26506#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:55,679 INFO L273 TraceCheckUtils]: 81: Hoare triple {26506#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26506#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:55,680 INFO L273 TraceCheckUtils]: 82: Hoare triple {26506#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26506#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:55,681 INFO L273 TraceCheckUtils]: 83: Hoare triple {26506#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26507#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:55,681 INFO L273 TraceCheckUtils]: 84: Hoare triple {26507#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26507#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:55,682 INFO L273 TraceCheckUtils]: 85: Hoare triple {26507#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26507#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:55,682 INFO L273 TraceCheckUtils]: 86: Hoare triple {26507#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26508#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:55,683 INFO L273 TraceCheckUtils]: 87: Hoare triple {26508#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26508#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:55,683 INFO L273 TraceCheckUtils]: 88: Hoare triple {26508#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26508#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:55,684 INFO L273 TraceCheckUtils]: 89: Hoare triple {26508#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26509#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:55,685 INFO L273 TraceCheckUtils]: 90: Hoare triple {26509#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26509#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:55,685 INFO L273 TraceCheckUtils]: 91: Hoare triple {26509#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26509#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:55,686 INFO L273 TraceCheckUtils]: 92: Hoare triple {26509#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26510#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:55,686 INFO L273 TraceCheckUtils]: 93: Hoare triple {26510#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26510#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:55,687 INFO L273 TraceCheckUtils]: 94: Hoare triple {26510#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26510#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:55,688 INFO L273 TraceCheckUtils]: 95: Hoare triple {26510#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26511#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:55,688 INFO L273 TraceCheckUtils]: 96: Hoare triple {26511#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26511#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:55,689 INFO L273 TraceCheckUtils]: 97: Hoare triple {26511#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26511#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:55,689 INFO L273 TraceCheckUtils]: 98: Hoare triple {26511#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26512#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:55,690 INFO L273 TraceCheckUtils]: 99: Hoare triple {26512#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26512#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:55,690 INFO L273 TraceCheckUtils]: 100: Hoare triple {26512#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26512#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:55,691 INFO L273 TraceCheckUtils]: 101: Hoare triple {26512#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26513#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:55,691 INFO L273 TraceCheckUtils]: 102: Hoare triple {26513#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26513#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:55,692 INFO L273 TraceCheckUtils]: 103: Hoare triple {26513#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26513#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:55,693 INFO L273 TraceCheckUtils]: 104: Hoare triple {26513#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26514#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:55,693 INFO L273 TraceCheckUtils]: 105: Hoare triple {26514#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26514#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:55,694 INFO L273 TraceCheckUtils]: 106: Hoare triple {26514#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26514#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:55,694 INFO L273 TraceCheckUtils]: 107: Hoare triple {26514#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26515#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:55,695 INFO L273 TraceCheckUtils]: 108: Hoare triple {26515#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26515#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:55,695 INFO L273 TraceCheckUtils]: 109: Hoare triple {26515#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26515#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:55,696 INFO L273 TraceCheckUtils]: 110: Hoare triple {26515#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26516#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:55,697 INFO L273 TraceCheckUtils]: 111: Hoare triple {26516#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26516#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:55,697 INFO L273 TraceCheckUtils]: 112: Hoare triple {26516#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26516#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:55,698 INFO L273 TraceCheckUtils]: 113: Hoare triple {26516#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26517#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:55,698 INFO L273 TraceCheckUtils]: 114: Hoare triple {26517#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26517#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:55,699 INFO L273 TraceCheckUtils]: 115: Hoare triple {26517#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26517#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:55,699 INFO L273 TraceCheckUtils]: 116: Hoare triple {26517#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26518#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:55,700 INFO L273 TraceCheckUtils]: 117: Hoare triple {26518#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26518#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:55,700 INFO L273 TraceCheckUtils]: 118: Hoare triple {26518#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26518#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:55,701 INFO L273 TraceCheckUtils]: 119: Hoare triple {26518#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26519#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:55,702 INFO L273 TraceCheckUtils]: 120: Hoare triple {26519#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26519#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:55,702 INFO L273 TraceCheckUtils]: 121: Hoare triple {26519#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26519#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:55,703 INFO L273 TraceCheckUtils]: 122: Hoare triple {26519#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26520#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:55,703 INFO L273 TraceCheckUtils]: 123: Hoare triple {26520#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26520#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:55,704 INFO L273 TraceCheckUtils]: 124: Hoare triple {26520#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26520#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:55,705 INFO L273 TraceCheckUtils]: 125: Hoare triple {26520#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26521#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:55,705 INFO L273 TraceCheckUtils]: 126: Hoare triple {26521#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26521#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:55,706 INFO L273 TraceCheckUtils]: 127: Hoare triple {26521#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {26521#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:55,706 INFO L273 TraceCheckUtils]: 128: Hoare triple {26521#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26522#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:55,707 INFO L273 TraceCheckUtils]: 129: Hoare triple {26522#(<= main_~i~0 42)} assume !(~i~0 < 100000); {26480#false} is VALID [2018-11-23 11:59:55,707 INFO L273 TraceCheckUtils]: 130: Hoare triple {26480#false} havoc ~x~0;~x~0 := 0; {26480#false} is VALID [2018-11-23 11:59:55,707 INFO L273 TraceCheckUtils]: 131: Hoare triple {26480#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {26480#false} is VALID [2018-11-23 11:59:55,708 INFO L256 TraceCheckUtils]: 132: Hoare triple {26480#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {26480#false} is VALID [2018-11-23 11:59:55,708 INFO L273 TraceCheckUtils]: 133: Hoare triple {26480#false} ~cond := #in~cond; {26480#false} is VALID [2018-11-23 11:59:55,708 INFO L273 TraceCheckUtils]: 134: Hoare triple {26480#false} assume 0 == ~cond; {26480#false} is VALID [2018-11-23 11:59:55,708 INFO L273 TraceCheckUtils]: 135: Hoare triple {26480#false} assume !false; {26480#false} is VALID [2018-11-23 11:59:55,720 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:59:55,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:55,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-11-23 11:59:55,740 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 136 [2018-11-23 11:59:55,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:55,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 11:59:55,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:55,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 11:59:55,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 11:59:55,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:59:55,876 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand 44 states. [2018-11-23 11:59:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:56,591 INFO L93 Difference]: Finished difference Result 157 states and 202 transitions. [2018-11-23 11:59:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 11:59:56,591 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 136 [2018-11-23 11:59:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:59:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 202 transitions. [2018-11-23 11:59:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:59:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 202 transitions. [2018-11-23 11:59:56,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 202 transitions. [2018-11-23 11:59:56,785 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:59:56,788 INFO L225 Difference]: With dead ends: 157 [2018-11-23 11:59:56,788 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 11:59:56,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:59:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 11:59:56,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-11-23 11:59:56,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:56,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 144 states. [2018-11-23 11:59:56,827 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 144 states. [2018-11-23 11:59:56,827 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 144 states. [2018-11-23 11:59:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:56,829 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2018-11-23 11:59:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-23 11:59:56,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:56,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:56,830 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 146 states. [2018-11-23 11:59:56,830 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 146 states. [2018-11-23 11:59:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:56,834 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2018-11-23 11:59:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-23 11:59:56,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:56,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:56,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:56,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 11:59:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2018-11-23 11:59:56,836 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 136 [2018-11-23 11:59:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:56,836 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2018-11-23 11:59:56,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 11:59:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2018-11-23 11:59:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 11:59:56,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:56,837 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:59:56,837 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:56,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1795420969, now seen corresponding path program 42 times [2018-11-23 11:59:56,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:56,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:56,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:56,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:56,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:58,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {27626#true} call ULTIMATE.init(); {27626#true} is VALID [2018-11-23 11:59:58,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {27626#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27626#true} is VALID [2018-11-23 11:59:58,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {27626#true} assume true; {27626#true} is VALID [2018-11-23 11:59:58,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27626#true} {27626#true} #54#return; {27626#true} is VALID [2018-11-23 11:59:58,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {27626#true} call #t~ret6 := main(); {27626#true} is VALID [2018-11-23 11:59:58,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {27626#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27628#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {27628#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27628#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {27628#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27628#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {27628#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27629#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {27629#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27629#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {27629#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27629#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {27629#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27630#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {27630#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27630#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {27630#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27630#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {27630#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27631#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {27631#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27631#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {27631#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27631#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {27631#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27632#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {27632#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27632#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {27632#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27632#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {27632#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27633#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {27633#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27633#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {27633#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27633#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,888 INFO L273 TraceCheckUtils]: 23: Hoare triple {27633#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27634#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {27634#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27634#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,889 INFO L273 TraceCheckUtils]: 25: Hoare triple {27634#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27634#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {27634#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27635#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,890 INFO L273 TraceCheckUtils]: 27: Hoare triple {27635#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27635#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,890 INFO L273 TraceCheckUtils]: 28: Hoare triple {27635#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27635#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,891 INFO L273 TraceCheckUtils]: 29: Hoare triple {27635#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27636#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {27636#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27636#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,892 INFO L273 TraceCheckUtils]: 31: Hoare triple {27636#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27636#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,893 INFO L273 TraceCheckUtils]: 32: Hoare triple {27636#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27637#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,893 INFO L273 TraceCheckUtils]: 33: Hoare triple {27637#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27637#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,894 INFO L273 TraceCheckUtils]: 34: Hoare triple {27637#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27637#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,894 INFO L273 TraceCheckUtils]: 35: Hoare triple {27637#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27638#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,895 INFO L273 TraceCheckUtils]: 36: Hoare triple {27638#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27638#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,895 INFO L273 TraceCheckUtils]: 37: Hoare triple {27638#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27638#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {27638#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27639#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,896 INFO L273 TraceCheckUtils]: 39: Hoare triple {27639#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27639#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {27639#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27639#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,898 INFO L273 TraceCheckUtils]: 41: Hoare triple {27639#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27640#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,898 INFO L273 TraceCheckUtils]: 42: Hoare triple {27640#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27640#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,899 INFO L273 TraceCheckUtils]: 43: Hoare triple {27640#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27640#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,899 INFO L273 TraceCheckUtils]: 44: Hoare triple {27640#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27641#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,900 INFO L273 TraceCheckUtils]: 45: Hoare triple {27641#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27641#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {27641#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27641#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,901 INFO L273 TraceCheckUtils]: 47: Hoare triple {27641#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27642#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,901 INFO L273 TraceCheckUtils]: 48: Hoare triple {27642#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27642#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,902 INFO L273 TraceCheckUtils]: 49: Hoare triple {27642#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27642#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,902 INFO L273 TraceCheckUtils]: 50: Hoare triple {27642#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27643#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,903 INFO L273 TraceCheckUtils]: 51: Hoare triple {27643#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27643#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,903 INFO L273 TraceCheckUtils]: 52: Hoare triple {27643#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27643#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,904 INFO L273 TraceCheckUtils]: 53: Hoare triple {27643#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27644#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,904 INFO L273 TraceCheckUtils]: 54: Hoare triple {27644#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27644#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,905 INFO L273 TraceCheckUtils]: 55: Hoare triple {27644#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27644#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,906 INFO L273 TraceCheckUtils]: 56: Hoare triple {27644#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27645#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,906 INFO L273 TraceCheckUtils]: 57: Hoare triple {27645#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27645#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,907 INFO L273 TraceCheckUtils]: 58: Hoare triple {27645#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27645#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,907 INFO L273 TraceCheckUtils]: 59: Hoare triple {27645#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27646#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,908 INFO L273 TraceCheckUtils]: 60: Hoare triple {27646#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27646#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,908 INFO L273 TraceCheckUtils]: 61: Hoare triple {27646#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27646#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,909 INFO L273 TraceCheckUtils]: 62: Hoare triple {27646#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27647#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,909 INFO L273 TraceCheckUtils]: 63: Hoare triple {27647#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27647#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,910 INFO L273 TraceCheckUtils]: 64: Hoare triple {27647#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27647#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,910 INFO L273 TraceCheckUtils]: 65: Hoare triple {27647#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27648#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,911 INFO L273 TraceCheckUtils]: 66: Hoare triple {27648#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27648#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,911 INFO L273 TraceCheckUtils]: 67: Hoare triple {27648#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27648#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,912 INFO L273 TraceCheckUtils]: 68: Hoare triple {27648#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27649#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,913 INFO L273 TraceCheckUtils]: 69: Hoare triple {27649#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27649#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,913 INFO L273 TraceCheckUtils]: 70: Hoare triple {27649#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27649#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,914 INFO L273 TraceCheckUtils]: 71: Hoare triple {27649#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27650#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,914 INFO L273 TraceCheckUtils]: 72: Hoare triple {27650#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27650#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,915 INFO L273 TraceCheckUtils]: 73: Hoare triple {27650#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27650#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,915 INFO L273 TraceCheckUtils]: 74: Hoare triple {27650#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27651#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,916 INFO L273 TraceCheckUtils]: 75: Hoare triple {27651#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27651#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,916 INFO L273 TraceCheckUtils]: 76: Hoare triple {27651#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27651#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,917 INFO L273 TraceCheckUtils]: 77: Hoare triple {27651#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27652#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,917 INFO L273 TraceCheckUtils]: 78: Hoare triple {27652#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27652#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,918 INFO L273 TraceCheckUtils]: 79: Hoare triple {27652#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27652#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,918 INFO L273 TraceCheckUtils]: 80: Hoare triple {27652#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27653#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,919 INFO L273 TraceCheckUtils]: 81: Hoare triple {27653#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27653#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,919 INFO L273 TraceCheckUtils]: 82: Hoare triple {27653#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27653#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,920 INFO L273 TraceCheckUtils]: 83: Hoare triple {27653#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27654#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,921 INFO L273 TraceCheckUtils]: 84: Hoare triple {27654#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27654#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,921 INFO L273 TraceCheckUtils]: 85: Hoare triple {27654#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27654#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,922 INFO L273 TraceCheckUtils]: 86: Hoare triple {27654#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27655#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,922 INFO L273 TraceCheckUtils]: 87: Hoare triple {27655#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27655#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,923 INFO L273 TraceCheckUtils]: 88: Hoare triple {27655#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27655#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,923 INFO L273 TraceCheckUtils]: 89: Hoare triple {27655#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27656#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,924 INFO L273 TraceCheckUtils]: 90: Hoare triple {27656#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27656#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,924 INFO L273 TraceCheckUtils]: 91: Hoare triple {27656#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27656#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,925 INFO L273 TraceCheckUtils]: 92: Hoare triple {27656#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27657#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,925 INFO L273 TraceCheckUtils]: 93: Hoare triple {27657#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27657#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,926 INFO L273 TraceCheckUtils]: 94: Hoare triple {27657#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27657#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,936 INFO L273 TraceCheckUtils]: 95: Hoare triple {27657#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27658#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:58,936 INFO L273 TraceCheckUtils]: 96: Hoare triple {27658#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27658#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:58,936 INFO L273 TraceCheckUtils]: 97: Hoare triple {27658#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27658#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:58,937 INFO L273 TraceCheckUtils]: 98: Hoare triple {27658#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27659#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:58,937 INFO L273 TraceCheckUtils]: 99: Hoare triple {27659#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27659#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:58,937 INFO L273 TraceCheckUtils]: 100: Hoare triple {27659#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27659#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:58,938 INFO L273 TraceCheckUtils]: 101: Hoare triple {27659#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27660#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:58,938 INFO L273 TraceCheckUtils]: 102: Hoare triple {27660#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27660#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:58,938 INFO L273 TraceCheckUtils]: 103: Hoare triple {27660#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27660#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:58,939 INFO L273 TraceCheckUtils]: 104: Hoare triple {27660#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27661#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:58,939 INFO L273 TraceCheckUtils]: 105: Hoare triple {27661#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27661#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:58,939 INFO L273 TraceCheckUtils]: 106: Hoare triple {27661#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27661#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:58,940 INFO L273 TraceCheckUtils]: 107: Hoare triple {27661#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27662#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:58,940 INFO L273 TraceCheckUtils]: 108: Hoare triple {27662#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27662#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:58,940 INFO L273 TraceCheckUtils]: 109: Hoare triple {27662#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27662#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:58,941 INFO L273 TraceCheckUtils]: 110: Hoare triple {27662#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27663#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:58,942 INFO L273 TraceCheckUtils]: 111: Hoare triple {27663#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27663#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:58,942 INFO L273 TraceCheckUtils]: 112: Hoare triple {27663#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27663#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:58,943 INFO L273 TraceCheckUtils]: 113: Hoare triple {27663#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27664#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:58,943 INFO L273 TraceCheckUtils]: 114: Hoare triple {27664#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27664#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:58,944 INFO L273 TraceCheckUtils]: 115: Hoare triple {27664#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27664#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:58,945 INFO L273 TraceCheckUtils]: 116: Hoare triple {27664#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27665#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:58,945 INFO L273 TraceCheckUtils]: 117: Hoare triple {27665#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27665#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:58,946 INFO L273 TraceCheckUtils]: 118: Hoare triple {27665#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27665#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:58,946 INFO L273 TraceCheckUtils]: 119: Hoare triple {27665#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27666#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:58,947 INFO L273 TraceCheckUtils]: 120: Hoare triple {27666#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27666#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:58,947 INFO L273 TraceCheckUtils]: 121: Hoare triple {27666#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27666#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:58,948 INFO L273 TraceCheckUtils]: 122: Hoare triple {27666#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27667#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:58,949 INFO L273 TraceCheckUtils]: 123: Hoare triple {27667#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27667#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:58,949 INFO L273 TraceCheckUtils]: 124: Hoare triple {27667#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27667#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:58,950 INFO L273 TraceCheckUtils]: 125: Hoare triple {27667#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27668#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:58,950 INFO L273 TraceCheckUtils]: 126: Hoare triple {27668#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27668#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:58,951 INFO L273 TraceCheckUtils]: 127: Hoare triple {27668#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27668#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:58,951 INFO L273 TraceCheckUtils]: 128: Hoare triple {27668#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27669#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:58,952 INFO L273 TraceCheckUtils]: 129: Hoare triple {27669#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27669#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:58,952 INFO L273 TraceCheckUtils]: 130: Hoare triple {27669#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27669#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:58,953 INFO L273 TraceCheckUtils]: 131: Hoare triple {27669#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27670#(<= main_~i~0 43)} is VALID [2018-11-23 11:59:58,954 INFO L273 TraceCheckUtils]: 132: Hoare triple {27670#(<= main_~i~0 43)} assume !(~i~0 < 100000); {27627#false} is VALID [2018-11-23 11:59:58,954 INFO L273 TraceCheckUtils]: 133: Hoare triple {27627#false} havoc ~x~0;~x~0 := 0; {27627#false} is VALID [2018-11-23 11:59:58,954 INFO L273 TraceCheckUtils]: 134: Hoare triple {27627#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {27627#false} is VALID [2018-11-23 11:59:58,954 INFO L256 TraceCheckUtils]: 135: Hoare triple {27627#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {27627#false} is VALID [2018-11-23 11:59:58,955 INFO L273 TraceCheckUtils]: 136: Hoare triple {27627#false} ~cond := #in~cond; {27627#false} is VALID [2018-11-23 11:59:58,955 INFO L273 TraceCheckUtils]: 137: Hoare triple {27627#false} assume 0 == ~cond; {27627#false} is VALID [2018-11-23 11:59:58,955 INFO L273 TraceCheckUtils]: 138: Hoare triple {27627#false} assume !false; {27627#false} is VALID [2018-11-23 11:59:58,968 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:59:58,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:58,968 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:59:58,996 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:59,113 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-11-23 11:59:59,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:59,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:59,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {27626#true} call ULTIMATE.init(); {27626#true} is VALID [2018-11-23 11:59:59,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {27626#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27626#true} is VALID [2018-11-23 11:59:59,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {27626#true} assume true; {27626#true} is VALID [2018-11-23 11:59:59,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27626#true} {27626#true} #54#return; {27626#true} is VALID [2018-11-23 11:59:59,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {27626#true} call #t~ret6 := main(); {27626#true} is VALID [2018-11-23 11:59:59,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {27626#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27628#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:59,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {27628#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27628#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:59,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {27628#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27628#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:59,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {27628#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27629#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:59,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {27629#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27629#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:59,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {27629#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27629#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:59,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {27629#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27630#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:59,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {27630#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27630#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:59,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {27630#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27630#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:59,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {27630#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27631#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:59,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {27631#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27631#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:59,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {27631#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27631#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:59,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {27631#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27632#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:59,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {27632#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27632#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:59,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {27632#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27632#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:59,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {27632#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27633#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:59,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {27633#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27633#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:59,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {27633#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27633#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:59,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {27633#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27634#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:59,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {27634#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27634#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:59,643 INFO L273 TraceCheckUtils]: 25: Hoare triple {27634#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27634#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:59,644 INFO L273 TraceCheckUtils]: 26: Hoare triple {27634#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27635#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:59,645 INFO L273 TraceCheckUtils]: 27: Hoare triple {27635#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27635#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:59,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {27635#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27635#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:59,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {27635#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27636#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:59,646 INFO L273 TraceCheckUtils]: 30: Hoare triple {27636#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27636#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:59,647 INFO L273 TraceCheckUtils]: 31: Hoare triple {27636#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27636#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:59,647 INFO L273 TraceCheckUtils]: 32: Hoare triple {27636#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27637#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:59,648 INFO L273 TraceCheckUtils]: 33: Hoare triple {27637#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27637#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:59,648 INFO L273 TraceCheckUtils]: 34: Hoare triple {27637#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27637#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:59,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {27637#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27638#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:59,649 INFO L273 TraceCheckUtils]: 36: Hoare triple {27638#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27638#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:59,650 INFO L273 TraceCheckUtils]: 37: Hoare triple {27638#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27638#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:59,650 INFO L273 TraceCheckUtils]: 38: Hoare triple {27638#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27639#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:59,651 INFO L273 TraceCheckUtils]: 39: Hoare triple {27639#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27639#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:59,651 INFO L273 TraceCheckUtils]: 40: Hoare triple {27639#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27639#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:59,652 INFO L273 TraceCheckUtils]: 41: Hoare triple {27639#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27640#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:59,653 INFO L273 TraceCheckUtils]: 42: Hoare triple {27640#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27640#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:59,653 INFO L273 TraceCheckUtils]: 43: Hoare triple {27640#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27640#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:59,654 INFO L273 TraceCheckUtils]: 44: Hoare triple {27640#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27641#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:59,654 INFO L273 TraceCheckUtils]: 45: Hoare triple {27641#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27641#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:59,655 INFO L273 TraceCheckUtils]: 46: Hoare triple {27641#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27641#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:59,655 INFO L273 TraceCheckUtils]: 47: Hoare triple {27641#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27642#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:59,656 INFO L273 TraceCheckUtils]: 48: Hoare triple {27642#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27642#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:59,656 INFO L273 TraceCheckUtils]: 49: Hoare triple {27642#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27642#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:59,657 INFO L273 TraceCheckUtils]: 50: Hoare triple {27642#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27643#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:59,657 INFO L273 TraceCheckUtils]: 51: Hoare triple {27643#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27643#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:59,658 INFO L273 TraceCheckUtils]: 52: Hoare triple {27643#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27643#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:59,658 INFO L273 TraceCheckUtils]: 53: Hoare triple {27643#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27644#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:59,659 INFO L273 TraceCheckUtils]: 54: Hoare triple {27644#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27644#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:59,659 INFO L273 TraceCheckUtils]: 55: Hoare triple {27644#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27644#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:59,660 INFO L273 TraceCheckUtils]: 56: Hoare triple {27644#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27645#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:59,660 INFO L273 TraceCheckUtils]: 57: Hoare triple {27645#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27645#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:59,661 INFO L273 TraceCheckUtils]: 58: Hoare triple {27645#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27645#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:59,662 INFO L273 TraceCheckUtils]: 59: Hoare triple {27645#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27646#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:59,662 INFO L273 TraceCheckUtils]: 60: Hoare triple {27646#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27646#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:59,663 INFO L273 TraceCheckUtils]: 61: Hoare triple {27646#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27646#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:59,663 INFO L273 TraceCheckUtils]: 62: Hoare triple {27646#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27647#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:59,664 INFO L273 TraceCheckUtils]: 63: Hoare triple {27647#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27647#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:59,664 INFO L273 TraceCheckUtils]: 64: Hoare triple {27647#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27647#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:59,665 INFO L273 TraceCheckUtils]: 65: Hoare triple {27647#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27648#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:59,665 INFO L273 TraceCheckUtils]: 66: Hoare triple {27648#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27648#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:59,666 INFO L273 TraceCheckUtils]: 67: Hoare triple {27648#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27648#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:59,666 INFO L273 TraceCheckUtils]: 68: Hoare triple {27648#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27649#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:59,667 INFO L273 TraceCheckUtils]: 69: Hoare triple {27649#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27649#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:59,667 INFO L273 TraceCheckUtils]: 70: Hoare triple {27649#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27649#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:59,668 INFO L273 TraceCheckUtils]: 71: Hoare triple {27649#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27650#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:59,668 INFO L273 TraceCheckUtils]: 72: Hoare triple {27650#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27650#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:59,669 INFO L273 TraceCheckUtils]: 73: Hoare triple {27650#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27650#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:59,670 INFO L273 TraceCheckUtils]: 74: Hoare triple {27650#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27651#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:59,670 INFO L273 TraceCheckUtils]: 75: Hoare triple {27651#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27651#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:59,671 INFO L273 TraceCheckUtils]: 76: Hoare triple {27651#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27651#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:59,671 INFO L273 TraceCheckUtils]: 77: Hoare triple {27651#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27652#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:59,672 INFO L273 TraceCheckUtils]: 78: Hoare triple {27652#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27652#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:59,672 INFO L273 TraceCheckUtils]: 79: Hoare triple {27652#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27652#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:59,673 INFO L273 TraceCheckUtils]: 80: Hoare triple {27652#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27653#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:59,673 INFO L273 TraceCheckUtils]: 81: Hoare triple {27653#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27653#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:59,674 INFO L273 TraceCheckUtils]: 82: Hoare triple {27653#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27653#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:59,674 INFO L273 TraceCheckUtils]: 83: Hoare triple {27653#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27654#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:59,675 INFO L273 TraceCheckUtils]: 84: Hoare triple {27654#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27654#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:59,675 INFO L273 TraceCheckUtils]: 85: Hoare triple {27654#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27654#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:59,676 INFO L273 TraceCheckUtils]: 86: Hoare triple {27654#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27655#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:59,676 INFO L273 TraceCheckUtils]: 87: Hoare triple {27655#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27655#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:59,677 INFO L273 TraceCheckUtils]: 88: Hoare triple {27655#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27655#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:59,678 INFO L273 TraceCheckUtils]: 89: Hoare triple {27655#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27656#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:59,678 INFO L273 TraceCheckUtils]: 90: Hoare triple {27656#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27656#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:59,678 INFO L273 TraceCheckUtils]: 91: Hoare triple {27656#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27656#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:59,679 INFO L273 TraceCheckUtils]: 92: Hoare triple {27656#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27657#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:59,680 INFO L273 TraceCheckUtils]: 93: Hoare triple {27657#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27657#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:59,680 INFO L273 TraceCheckUtils]: 94: Hoare triple {27657#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27657#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:59,681 INFO L273 TraceCheckUtils]: 95: Hoare triple {27657#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27658#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:59,681 INFO L273 TraceCheckUtils]: 96: Hoare triple {27658#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27658#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:59,682 INFO L273 TraceCheckUtils]: 97: Hoare triple {27658#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27658#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:59,682 INFO L273 TraceCheckUtils]: 98: Hoare triple {27658#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27659#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:59,683 INFO L273 TraceCheckUtils]: 99: Hoare triple {27659#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27659#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:59,683 INFO L273 TraceCheckUtils]: 100: Hoare triple {27659#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27659#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:59,684 INFO L273 TraceCheckUtils]: 101: Hoare triple {27659#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27660#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:59,684 INFO L273 TraceCheckUtils]: 102: Hoare triple {27660#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27660#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:59,685 INFO L273 TraceCheckUtils]: 103: Hoare triple {27660#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27660#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:59,686 INFO L273 TraceCheckUtils]: 104: Hoare triple {27660#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27661#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:59,686 INFO L273 TraceCheckUtils]: 105: Hoare triple {27661#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27661#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:59,686 INFO L273 TraceCheckUtils]: 106: Hoare triple {27661#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27661#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:59,687 INFO L273 TraceCheckUtils]: 107: Hoare triple {27661#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27662#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:59,688 INFO L273 TraceCheckUtils]: 108: Hoare triple {27662#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27662#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:59,688 INFO L273 TraceCheckUtils]: 109: Hoare triple {27662#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27662#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:59,689 INFO L273 TraceCheckUtils]: 110: Hoare triple {27662#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27663#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:59,689 INFO L273 TraceCheckUtils]: 111: Hoare triple {27663#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27663#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:59,690 INFO L273 TraceCheckUtils]: 112: Hoare triple {27663#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27663#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:59,690 INFO L273 TraceCheckUtils]: 113: Hoare triple {27663#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27664#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:59,691 INFO L273 TraceCheckUtils]: 114: Hoare triple {27664#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27664#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:59,691 INFO L273 TraceCheckUtils]: 115: Hoare triple {27664#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27664#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:59,692 INFO L273 TraceCheckUtils]: 116: Hoare triple {27664#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27665#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:59,692 INFO L273 TraceCheckUtils]: 117: Hoare triple {27665#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27665#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:59,693 INFO L273 TraceCheckUtils]: 118: Hoare triple {27665#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27665#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:59,693 INFO L273 TraceCheckUtils]: 119: Hoare triple {27665#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27666#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:59,694 INFO L273 TraceCheckUtils]: 120: Hoare triple {27666#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27666#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:59,694 INFO L273 TraceCheckUtils]: 121: Hoare triple {27666#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27666#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:59,695 INFO L273 TraceCheckUtils]: 122: Hoare triple {27666#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27667#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:59,696 INFO L273 TraceCheckUtils]: 123: Hoare triple {27667#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27667#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:59,696 INFO L273 TraceCheckUtils]: 124: Hoare triple {27667#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27667#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:59,697 INFO L273 TraceCheckUtils]: 125: Hoare triple {27667#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27668#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:59,697 INFO L273 TraceCheckUtils]: 126: Hoare triple {27668#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27668#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:59,698 INFO L273 TraceCheckUtils]: 127: Hoare triple {27668#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27668#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:59,698 INFO L273 TraceCheckUtils]: 128: Hoare triple {27668#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27669#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:59,699 INFO L273 TraceCheckUtils]: 129: Hoare triple {27669#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {27669#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:59,699 INFO L273 TraceCheckUtils]: 130: Hoare triple {27669#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {27669#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:59,700 INFO L273 TraceCheckUtils]: 131: Hoare triple {27669#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27670#(<= main_~i~0 43)} is VALID [2018-11-23 11:59:59,700 INFO L273 TraceCheckUtils]: 132: Hoare triple {27670#(<= main_~i~0 43)} assume !(~i~0 < 100000); {27627#false} is VALID [2018-11-23 11:59:59,701 INFO L273 TraceCheckUtils]: 133: Hoare triple {27627#false} havoc ~x~0;~x~0 := 0; {27627#false} is VALID [2018-11-23 11:59:59,701 INFO L273 TraceCheckUtils]: 134: Hoare triple {27627#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {27627#false} is VALID [2018-11-23 11:59:59,701 INFO L256 TraceCheckUtils]: 135: Hoare triple {27627#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {27627#false} is VALID [2018-11-23 11:59:59,701 INFO L273 TraceCheckUtils]: 136: Hoare triple {27627#false} ~cond := #in~cond; {27627#false} is VALID [2018-11-23 11:59:59,701 INFO L273 TraceCheckUtils]: 137: Hoare triple {27627#false} assume 0 == ~cond; {27627#false} is VALID [2018-11-23 11:59:59,702 INFO L273 TraceCheckUtils]: 138: Hoare triple {27627#false} assume !false; {27627#false} is VALID [2018-11-23 11:59:59,714 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:59:59,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:59,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-11-23 11:59:59,733 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 139 [2018-11-23 11:59:59,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:59,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 11:59:59,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:59,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 11:59:59,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 11:59:59,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:59:59,863 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand 45 states. [2018-11-23 12:00:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:00,708 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2018-11-23 12:00:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 12:00:00,708 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 139 [2018-11-23 12:00:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:00:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 206 transitions. [2018-11-23 12:00:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:00:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 206 transitions. [2018-11-23 12:00:00,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 206 transitions. [2018-11-23 12:00:00,953 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 12:00:00,956 INFO L225 Difference]: With dead ends: 160 [2018-11-23 12:00:00,957 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 12:00:00,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:00:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 12:00:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-11-23 12:00:01,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:01,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 147 states. [2018-11-23 12:00:01,023 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 147 states. [2018-11-23 12:00:01,023 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 147 states. [2018-11-23 12:00:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:01,025 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2018-11-23 12:00:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2018-11-23 12:00:01,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:01,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:01,026 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 149 states. [2018-11-23 12:00:01,026 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 149 states. [2018-11-23 12:00:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:01,027 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2018-11-23 12:00:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2018-11-23 12:00:01,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:01,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:01,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:01,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:00:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2018-11-23 12:00:01,030 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 139 [2018-11-23 12:00:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:01,030 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2018-11-23 12:00:01,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:00:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2018-11-23 12:00:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-23 12:00:01,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:01,031 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:01,032 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:01,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:01,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1181981732, now seen corresponding path program 43 times [2018-11-23 12:00:01,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:01,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:01,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:01,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:01,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:03,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {28797#true} call ULTIMATE.init(); {28797#true} is VALID [2018-11-23 12:00:03,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {28797#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28797#true} is VALID [2018-11-23 12:00:03,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2018-11-23 12:00:03,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28797#true} #54#return; {28797#true} is VALID [2018-11-23 12:00:03,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {28797#true} call #t~ret6 := main(); {28797#true} is VALID [2018-11-23 12:00:03,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {28797#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28799#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:03,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {28799#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28799#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:03,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {28799#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28799#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:03,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {28799#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28800#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:03,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {28800#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28800#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:03,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {28800#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28800#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:03,125 INFO L273 TraceCheckUtils]: 11: Hoare triple {28800#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28801#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:03,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {28801#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28801#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:03,126 INFO L273 TraceCheckUtils]: 13: Hoare triple {28801#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28801#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:03,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {28801#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28802#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:03,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {28802#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28802#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:03,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {28802#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28802#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:03,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {28802#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28803#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:03,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {28803#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28803#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:03,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {28803#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28803#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:03,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {28803#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28804#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:03,131 INFO L273 TraceCheckUtils]: 21: Hoare triple {28804#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28804#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:03,132 INFO L273 TraceCheckUtils]: 22: Hoare triple {28804#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28804#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:03,132 INFO L273 TraceCheckUtils]: 23: Hoare triple {28804#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28805#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:03,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {28805#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28805#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:03,133 INFO L273 TraceCheckUtils]: 25: Hoare triple {28805#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28805#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:03,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {28805#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28806#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:03,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {28806#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28806#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:03,135 INFO L273 TraceCheckUtils]: 28: Hoare triple {28806#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28806#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:03,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {28806#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28807#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:03,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {28807#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28807#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:03,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {28807#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28807#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:03,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {28807#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28808#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:03,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {28808#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28808#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:03,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {28808#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28808#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:03,139 INFO L273 TraceCheckUtils]: 35: Hoare triple {28808#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28809#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:03,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {28809#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28809#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:03,140 INFO L273 TraceCheckUtils]: 37: Hoare triple {28809#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28809#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:03,141 INFO L273 TraceCheckUtils]: 38: Hoare triple {28809#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28810#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:03,141 INFO L273 TraceCheckUtils]: 39: Hoare triple {28810#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28810#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:03,142 INFO L273 TraceCheckUtils]: 40: Hoare triple {28810#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28810#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:03,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {28810#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28811#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:03,143 INFO L273 TraceCheckUtils]: 42: Hoare triple {28811#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28811#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:03,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {28811#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28811#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:03,144 INFO L273 TraceCheckUtils]: 44: Hoare triple {28811#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28812#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:03,145 INFO L273 TraceCheckUtils]: 45: Hoare triple {28812#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28812#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:03,145 INFO L273 TraceCheckUtils]: 46: Hoare triple {28812#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28812#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:03,146 INFO L273 TraceCheckUtils]: 47: Hoare triple {28812#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28813#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:03,147 INFO L273 TraceCheckUtils]: 48: Hoare triple {28813#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28813#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:03,147 INFO L273 TraceCheckUtils]: 49: Hoare triple {28813#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28813#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:03,148 INFO L273 TraceCheckUtils]: 50: Hoare triple {28813#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28814#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:03,148 INFO L273 TraceCheckUtils]: 51: Hoare triple {28814#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28814#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:03,149 INFO L273 TraceCheckUtils]: 52: Hoare triple {28814#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28814#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:03,150 INFO L273 TraceCheckUtils]: 53: Hoare triple {28814#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28815#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:03,150 INFO L273 TraceCheckUtils]: 54: Hoare triple {28815#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28815#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:03,151 INFO L273 TraceCheckUtils]: 55: Hoare triple {28815#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28815#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:03,151 INFO L273 TraceCheckUtils]: 56: Hoare triple {28815#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28816#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:03,152 INFO L273 TraceCheckUtils]: 57: Hoare triple {28816#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28816#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:03,152 INFO L273 TraceCheckUtils]: 58: Hoare triple {28816#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28816#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:03,153 INFO L273 TraceCheckUtils]: 59: Hoare triple {28816#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28817#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:03,154 INFO L273 TraceCheckUtils]: 60: Hoare triple {28817#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28817#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:03,154 INFO L273 TraceCheckUtils]: 61: Hoare triple {28817#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28817#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:03,155 INFO L273 TraceCheckUtils]: 62: Hoare triple {28817#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28818#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:03,155 INFO L273 TraceCheckUtils]: 63: Hoare triple {28818#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28818#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:03,156 INFO L273 TraceCheckUtils]: 64: Hoare triple {28818#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28818#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:03,157 INFO L273 TraceCheckUtils]: 65: Hoare triple {28818#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28819#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:03,157 INFO L273 TraceCheckUtils]: 66: Hoare triple {28819#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28819#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:03,158 INFO L273 TraceCheckUtils]: 67: Hoare triple {28819#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28819#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:03,158 INFO L273 TraceCheckUtils]: 68: Hoare triple {28819#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28820#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:03,159 INFO L273 TraceCheckUtils]: 69: Hoare triple {28820#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28820#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:03,159 INFO L273 TraceCheckUtils]: 70: Hoare triple {28820#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28820#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:03,160 INFO L273 TraceCheckUtils]: 71: Hoare triple {28820#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28821#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:03,161 INFO L273 TraceCheckUtils]: 72: Hoare triple {28821#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28821#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:03,161 INFO L273 TraceCheckUtils]: 73: Hoare triple {28821#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28821#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:03,162 INFO L273 TraceCheckUtils]: 74: Hoare triple {28821#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28822#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:03,171 INFO L273 TraceCheckUtils]: 75: Hoare triple {28822#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28822#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:03,171 INFO L273 TraceCheckUtils]: 76: Hoare triple {28822#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28822#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:03,172 INFO L273 TraceCheckUtils]: 77: Hoare triple {28822#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28823#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:03,172 INFO L273 TraceCheckUtils]: 78: Hoare triple {28823#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28823#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:03,173 INFO L273 TraceCheckUtils]: 79: Hoare triple {28823#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28823#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:03,173 INFO L273 TraceCheckUtils]: 80: Hoare triple {28823#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28824#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:03,173 INFO L273 TraceCheckUtils]: 81: Hoare triple {28824#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28824#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:03,174 INFO L273 TraceCheckUtils]: 82: Hoare triple {28824#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28824#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:03,174 INFO L273 TraceCheckUtils]: 83: Hoare triple {28824#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28825#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:03,174 INFO L273 TraceCheckUtils]: 84: Hoare triple {28825#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28825#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:03,175 INFO L273 TraceCheckUtils]: 85: Hoare triple {28825#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28825#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:03,176 INFO L273 TraceCheckUtils]: 86: Hoare triple {28825#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28826#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:03,176 INFO L273 TraceCheckUtils]: 87: Hoare triple {28826#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28826#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:03,177 INFO L273 TraceCheckUtils]: 88: Hoare triple {28826#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28826#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:03,177 INFO L273 TraceCheckUtils]: 89: Hoare triple {28826#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28827#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:03,178 INFO L273 TraceCheckUtils]: 90: Hoare triple {28827#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28827#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:03,178 INFO L273 TraceCheckUtils]: 91: Hoare triple {28827#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28827#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:03,179 INFO L273 TraceCheckUtils]: 92: Hoare triple {28827#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28828#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:03,180 INFO L273 TraceCheckUtils]: 93: Hoare triple {28828#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28828#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:03,180 INFO L273 TraceCheckUtils]: 94: Hoare triple {28828#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28828#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:03,181 INFO L273 TraceCheckUtils]: 95: Hoare triple {28828#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28829#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:03,181 INFO L273 TraceCheckUtils]: 96: Hoare triple {28829#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28829#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:03,182 INFO L273 TraceCheckUtils]: 97: Hoare triple {28829#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28829#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:03,183 INFO L273 TraceCheckUtils]: 98: Hoare triple {28829#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28830#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:03,183 INFO L273 TraceCheckUtils]: 99: Hoare triple {28830#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28830#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:03,184 INFO L273 TraceCheckUtils]: 100: Hoare triple {28830#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28830#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:03,184 INFO L273 TraceCheckUtils]: 101: Hoare triple {28830#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28831#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:03,185 INFO L273 TraceCheckUtils]: 102: Hoare triple {28831#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28831#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:03,185 INFO L273 TraceCheckUtils]: 103: Hoare triple {28831#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28831#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:03,186 INFO L273 TraceCheckUtils]: 104: Hoare triple {28831#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28832#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:03,187 INFO L273 TraceCheckUtils]: 105: Hoare triple {28832#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28832#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:03,187 INFO L273 TraceCheckUtils]: 106: Hoare triple {28832#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28832#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:03,188 INFO L273 TraceCheckUtils]: 107: Hoare triple {28832#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28833#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:03,188 INFO L273 TraceCheckUtils]: 108: Hoare triple {28833#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28833#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:03,189 INFO L273 TraceCheckUtils]: 109: Hoare triple {28833#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28833#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:03,190 INFO L273 TraceCheckUtils]: 110: Hoare triple {28833#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28834#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:03,190 INFO L273 TraceCheckUtils]: 111: Hoare triple {28834#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28834#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:03,191 INFO L273 TraceCheckUtils]: 112: Hoare triple {28834#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28834#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:03,191 INFO L273 TraceCheckUtils]: 113: Hoare triple {28834#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28835#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:03,192 INFO L273 TraceCheckUtils]: 114: Hoare triple {28835#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28835#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:03,192 INFO L273 TraceCheckUtils]: 115: Hoare triple {28835#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28835#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:03,193 INFO L273 TraceCheckUtils]: 116: Hoare triple {28835#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28836#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:03,193 INFO L273 TraceCheckUtils]: 117: Hoare triple {28836#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28836#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:03,194 INFO L273 TraceCheckUtils]: 118: Hoare triple {28836#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28836#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:03,195 INFO L273 TraceCheckUtils]: 119: Hoare triple {28836#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28837#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:03,195 INFO L273 TraceCheckUtils]: 120: Hoare triple {28837#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28837#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:03,196 INFO L273 TraceCheckUtils]: 121: Hoare triple {28837#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28837#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:03,196 INFO L273 TraceCheckUtils]: 122: Hoare triple {28837#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28838#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:03,197 INFO L273 TraceCheckUtils]: 123: Hoare triple {28838#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28838#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:03,197 INFO L273 TraceCheckUtils]: 124: Hoare triple {28838#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28838#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:03,198 INFO L273 TraceCheckUtils]: 125: Hoare triple {28838#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28839#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:03,199 INFO L273 TraceCheckUtils]: 126: Hoare triple {28839#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28839#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:03,199 INFO L273 TraceCheckUtils]: 127: Hoare triple {28839#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28839#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:03,200 INFO L273 TraceCheckUtils]: 128: Hoare triple {28839#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28840#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:03,200 INFO L273 TraceCheckUtils]: 129: Hoare triple {28840#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28840#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:03,201 INFO L273 TraceCheckUtils]: 130: Hoare triple {28840#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28840#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:03,202 INFO L273 TraceCheckUtils]: 131: Hoare triple {28840#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28841#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:03,202 INFO L273 TraceCheckUtils]: 132: Hoare triple {28841#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28841#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:03,203 INFO L273 TraceCheckUtils]: 133: Hoare triple {28841#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28841#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:03,203 INFO L273 TraceCheckUtils]: 134: Hoare triple {28841#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28842#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:03,204 INFO L273 TraceCheckUtils]: 135: Hoare triple {28842#(<= main_~i~0 44)} assume !(~i~0 < 100000); {28798#false} is VALID [2018-11-23 12:00:03,204 INFO L273 TraceCheckUtils]: 136: Hoare triple {28798#false} havoc ~x~0;~x~0 := 0; {28798#false} is VALID [2018-11-23 12:00:03,204 INFO L273 TraceCheckUtils]: 137: Hoare triple {28798#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {28798#false} is VALID [2018-11-23 12:00:03,205 INFO L256 TraceCheckUtils]: 138: Hoare triple {28798#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {28798#false} is VALID [2018-11-23 12:00:03,205 INFO L273 TraceCheckUtils]: 139: Hoare triple {28798#false} ~cond := #in~cond; {28798#false} is VALID [2018-11-23 12:00:03,205 INFO L273 TraceCheckUtils]: 140: Hoare triple {28798#false} assume 0 == ~cond; {28798#false} is VALID [2018-11-23 12:00:03,205 INFO L273 TraceCheckUtils]: 141: Hoare triple {28798#false} assume !false; {28798#false} is VALID [2018-11-23 12:00:03,218 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 12:00:03,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:03,219 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 12:00:03,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:03,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:03,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {28797#true} call ULTIMATE.init(); {28797#true} is VALID [2018-11-23 12:00:03,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {28797#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28797#true} is VALID [2018-11-23 12:00:03,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2018-11-23 12:00:03,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28797#true} #54#return; {28797#true} is VALID [2018-11-23 12:00:03,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {28797#true} call #t~ret6 := main(); {28797#true} is VALID [2018-11-23 12:00:03,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {28797#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28799#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:03,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {28799#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28799#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:03,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {28799#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28799#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:03,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {28799#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28800#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:03,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {28800#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28800#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:03,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {28800#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28800#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:03,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {28800#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28801#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:03,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {28801#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28801#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:03,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {28801#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28801#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:03,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {28801#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28802#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:03,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {28802#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28802#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:03,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {28802#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28802#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:03,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {28802#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28803#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:03,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {28803#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28803#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:03,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {28803#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28803#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:03,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {28803#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28804#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:03,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {28804#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28804#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:03,726 INFO L273 TraceCheckUtils]: 22: Hoare triple {28804#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28804#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:03,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {28804#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28805#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:03,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {28805#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28805#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:03,728 INFO L273 TraceCheckUtils]: 25: Hoare triple {28805#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28805#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:03,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {28805#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28806#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:03,729 INFO L273 TraceCheckUtils]: 27: Hoare triple {28806#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28806#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:03,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {28806#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28806#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:03,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {28806#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28807#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:03,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {28807#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28807#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:03,731 INFO L273 TraceCheckUtils]: 31: Hoare triple {28807#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28807#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:03,732 INFO L273 TraceCheckUtils]: 32: Hoare triple {28807#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28808#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:03,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {28808#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28808#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:03,733 INFO L273 TraceCheckUtils]: 34: Hoare triple {28808#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28808#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:03,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {28808#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28809#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:03,734 INFO L273 TraceCheckUtils]: 36: Hoare triple {28809#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28809#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:03,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {28809#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28809#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:03,735 INFO L273 TraceCheckUtils]: 38: Hoare triple {28809#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28810#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:03,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {28810#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28810#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:03,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {28810#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28810#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:03,737 INFO L273 TraceCheckUtils]: 41: Hoare triple {28810#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28811#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:03,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {28811#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28811#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:03,738 INFO L273 TraceCheckUtils]: 43: Hoare triple {28811#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28811#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:03,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {28811#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28812#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:03,739 INFO L273 TraceCheckUtils]: 45: Hoare triple {28812#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28812#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:03,739 INFO L273 TraceCheckUtils]: 46: Hoare triple {28812#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28812#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:03,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {28812#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28813#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:03,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {28813#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28813#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:03,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {28813#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28813#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:03,741 INFO L273 TraceCheckUtils]: 50: Hoare triple {28813#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28814#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:03,742 INFO L273 TraceCheckUtils]: 51: Hoare triple {28814#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28814#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:03,742 INFO L273 TraceCheckUtils]: 52: Hoare triple {28814#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28814#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:03,743 INFO L273 TraceCheckUtils]: 53: Hoare triple {28814#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28815#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:03,744 INFO L273 TraceCheckUtils]: 54: Hoare triple {28815#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28815#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:03,744 INFO L273 TraceCheckUtils]: 55: Hoare triple {28815#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28815#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:03,745 INFO L273 TraceCheckUtils]: 56: Hoare triple {28815#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28816#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:03,745 INFO L273 TraceCheckUtils]: 57: Hoare triple {28816#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28816#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:03,746 INFO L273 TraceCheckUtils]: 58: Hoare triple {28816#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28816#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:03,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {28816#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28817#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:03,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {28817#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28817#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:03,747 INFO L273 TraceCheckUtils]: 61: Hoare triple {28817#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28817#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:03,748 INFO L273 TraceCheckUtils]: 62: Hoare triple {28817#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28818#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:03,749 INFO L273 TraceCheckUtils]: 63: Hoare triple {28818#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28818#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:03,749 INFO L273 TraceCheckUtils]: 64: Hoare triple {28818#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28818#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:03,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {28818#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28819#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:03,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {28819#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28819#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:03,751 INFO L273 TraceCheckUtils]: 67: Hoare triple {28819#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28819#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:03,751 INFO L273 TraceCheckUtils]: 68: Hoare triple {28819#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28820#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:03,752 INFO L273 TraceCheckUtils]: 69: Hoare triple {28820#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28820#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:03,752 INFO L273 TraceCheckUtils]: 70: Hoare triple {28820#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28820#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:03,753 INFO L273 TraceCheckUtils]: 71: Hoare triple {28820#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28821#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:03,753 INFO L273 TraceCheckUtils]: 72: Hoare triple {28821#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28821#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:03,754 INFO L273 TraceCheckUtils]: 73: Hoare triple {28821#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28821#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:03,755 INFO L273 TraceCheckUtils]: 74: Hoare triple {28821#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28822#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:03,755 INFO L273 TraceCheckUtils]: 75: Hoare triple {28822#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28822#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:03,756 INFO L273 TraceCheckUtils]: 76: Hoare triple {28822#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28822#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:03,756 INFO L273 TraceCheckUtils]: 77: Hoare triple {28822#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28823#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:03,757 INFO L273 TraceCheckUtils]: 78: Hoare triple {28823#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28823#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:03,757 INFO L273 TraceCheckUtils]: 79: Hoare triple {28823#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28823#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:03,758 INFO L273 TraceCheckUtils]: 80: Hoare triple {28823#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28824#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:03,758 INFO L273 TraceCheckUtils]: 81: Hoare triple {28824#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28824#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:03,759 INFO L273 TraceCheckUtils]: 82: Hoare triple {28824#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28824#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:03,760 INFO L273 TraceCheckUtils]: 83: Hoare triple {28824#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28825#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:03,760 INFO L273 TraceCheckUtils]: 84: Hoare triple {28825#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28825#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:03,761 INFO L273 TraceCheckUtils]: 85: Hoare triple {28825#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28825#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:03,761 INFO L273 TraceCheckUtils]: 86: Hoare triple {28825#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28826#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:03,762 INFO L273 TraceCheckUtils]: 87: Hoare triple {28826#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28826#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:03,762 INFO L273 TraceCheckUtils]: 88: Hoare triple {28826#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28826#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:03,763 INFO L273 TraceCheckUtils]: 89: Hoare triple {28826#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28827#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:03,764 INFO L273 TraceCheckUtils]: 90: Hoare triple {28827#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28827#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:03,764 INFO L273 TraceCheckUtils]: 91: Hoare triple {28827#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28827#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:03,765 INFO L273 TraceCheckUtils]: 92: Hoare triple {28827#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28828#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:03,765 INFO L273 TraceCheckUtils]: 93: Hoare triple {28828#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28828#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:03,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {28828#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28828#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:03,766 INFO L273 TraceCheckUtils]: 95: Hoare triple {28828#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28829#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:03,767 INFO L273 TraceCheckUtils]: 96: Hoare triple {28829#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28829#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:03,768 INFO L273 TraceCheckUtils]: 97: Hoare triple {28829#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28829#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:03,768 INFO L273 TraceCheckUtils]: 98: Hoare triple {28829#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28830#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:03,769 INFO L273 TraceCheckUtils]: 99: Hoare triple {28830#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28830#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:03,769 INFO L273 TraceCheckUtils]: 100: Hoare triple {28830#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28830#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:03,770 INFO L273 TraceCheckUtils]: 101: Hoare triple {28830#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28831#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:03,770 INFO L273 TraceCheckUtils]: 102: Hoare triple {28831#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28831#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:03,771 INFO L273 TraceCheckUtils]: 103: Hoare triple {28831#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28831#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:03,772 INFO L273 TraceCheckUtils]: 104: Hoare triple {28831#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28832#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:03,772 INFO L273 TraceCheckUtils]: 105: Hoare triple {28832#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28832#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:03,773 INFO L273 TraceCheckUtils]: 106: Hoare triple {28832#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28832#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:03,773 INFO L273 TraceCheckUtils]: 107: Hoare triple {28832#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28833#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:03,774 INFO L273 TraceCheckUtils]: 108: Hoare triple {28833#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28833#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:03,774 INFO L273 TraceCheckUtils]: 109: Hoare triple {28833#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28833#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:03,775 INFO L273 TraceCheckUtils]: 110: Hoare triple {28833#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28834#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:03,775 INFO L273 TraceCheckUtils]: 111: Hoare triple {28834#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28834#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:03,776 INFO L273 TraceCheckUtils]: 112: Hoare triple {28834#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28834#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:03,776 INFO L273 TraceCheckUtils]: 113: Hoare triple {28834#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28835#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:03,777 INFO L273 TraceCheckUtils]: 114: Hoare triple {28835#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28835#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:03,777 INFO L273 TraceCheckUtils]: 115: Hoare triple {28835#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28835#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:03,778 INFO L273 TraceCheckUtils]: 116: Hoare triple {28835#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28836#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:03,778 INFO L273 TraceCheckUtils]: 117: Hoare triple {28836#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28836#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:03,779 INFO L273 TraceCheckUtils]: 118: Hoare triple {28836#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28836#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:03,780 INFO L273 TraceCheckUtils]: 119: Hoare triple {28836#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28837#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:03,780 INFO L273 TraceCheckUtils]: 120: Hoare triple {28837#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28837#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:03,781 INFO L273 TraceCheckUtils]: 121: Hoare triple {28837#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28837#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:03,781 INFO L273 TraceCheckUtils]: 122: Hoare triple {28837#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28838#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:03,782 INFO L273 TraceCheckUtils]: 123: Hoare triple {28838#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28838#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:03,782 INFO L273 TraceCheckUtils]: 124: Hoare triple {28838#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28838#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:03,783 INFO L273 TraceCheckUtils]: 125: Hoare triple {28838#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28839#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:03,783 INFO L273 TraceCheckUtils]: 126: Hoare triple {28839#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28839#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:03,784 INFO L273 TraceCheckUtils]: 127: Hoare triple {28839#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28839#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:03,785 INFO L273 TraceCheckUtils]: 128: Hoare triple {28839#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28840#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:03,785 INFO L273 TraceCheckUtils]: 129: Hoare triple {28840#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28840#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:03,786 INFO L273 TraceCheckUtils]: 130: Hoare triple {28840#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28840#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:03,786 INFO L273 TraceCheckUtils]: 131: Hoare triple {28840#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28841#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:03,787 INFO L273 TraceCheckUtils]: 132: Hoare triple {28841#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28841#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:03,787 INFO L273 TraceCheckUtils]: 133: Hoare triple {28841#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {28841#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:03,788 INFO L273 TraceCheckUtils]: 134: Hoare triple {28841#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28842#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:03,789 INFO L273 TraceCheckUtils]: 135: Hoare triple {28842#(<= main_~i~0 44)} assume !(~i~0 < 100000); {28798#false} is VALID [2018-11-23 12:00:03,789 INFO L273 TraceCheckUtils]: 136: Hoare triple {28798#false} havoc ~x~0;~x~0 := 0; {28798#false} is VALID [2018-11-23 12:00:03,789 INFO L273 TraceCheckUtils]: 137: Hoare triple {28798#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {28798#false} is VALID [2018-11-23 12:00:03,789 INFO L256 TraceCheckUtils]: 138: Hoare triple {28798#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {28798#false} is VALID [2018-11-23 12:00:03,789 INFO L273 TraceCheckUtils]: 139: Hoare triple {28798#false} ~cond := #in~cond; {28798#false} is VALID [2018-11-23 12:00:03,790 INFO L273 TraceCheckUtils]: 140: Hoare triple {28798#false} assume 0 == ~cond; {28798#false} is VALID [2018-11-23 12:00:03,790 INFO L273 TraceCheckUtils]: 141: Hoare triple {28798#false} assume !false; {28798#false} is VALID [2018-11-23 12:00:03,803 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 12:00:03,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:03,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-11-23 12:00:03,823 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 142 [2018-11-23 12:00:03,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:03,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:00:03,955 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 12:00:03,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:00:03,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:00:03,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:00:03,957 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand 46 states. [2018-11-23 12:00:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:05,030 INFO L93 Difference]: Finished difference Result 163 states and 210 transitions. [2018-11-23 12:00:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:00:05,030 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 142 [2018-11-23 12:00:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:00:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 210 transitions. [2018-11-23 12:00:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:00:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 210 transitions. [2018-11-23 12:00:05,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 210 transitions. [2018-11-23 12:00:05,237 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 12:00:05,240 INFO L225 Difference]: With dead ends: 163 [2018-11-23 12:00:05,240 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 12:00:05,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:00:05,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 12:00:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-11-23 12:00:05,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:05,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 150 states. [2018-11-23 12:00:05,272 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 150 states. [2018-11-23 12:00:05,273 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 150 states. [2018-11-23 12:00:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:05,275 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2018-11-23 12:00:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2018-11-23 12:00:05,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:05,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:05,275 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 152 states. [2018-11-23 12:00:05,275 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 152 states. [2018-11-23 12:00:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:05,277 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2018-11-23 12:00:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2018-11-23 12:00:05,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:05,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:05,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:05,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 12:00:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2018-11-23 12:00:05,279 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 142 [2018-11-23 12:00:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:05,280 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2018-11-23 12:00:05,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:00:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2018-11-23 12:00:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 12:00:05,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:05,280 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:05,281 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:05,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:05,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1321250231, now seen corresponding path program 44 times [2018-11-23 12:00:05,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:05,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:05,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:05,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:05,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:06,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {29992#true} call ULTIMATE.init(); {29992#true} is VALID [2018-11-23 12:00:06,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {29992#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29992#true} is VALID [2018-11-23 12:00:06,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {29992#true} assume true; {29992#true} is VALID [2018-11-23 12:00:06,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29992#true} {29992#true} #54#return; {29992#true} is VALID [2018-11-23 12:00:06,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {29992#true} call #t~ret6 := main(); {29992#true} is VALID [2018-11-23 12:00:06,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {29992#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {29994#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:06,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {29994#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29994#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:06,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {29994#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29994#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:06,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {29994#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29995#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:06,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {29995#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29995#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:06,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {29995#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29995#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:06,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {29995#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29996#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:06,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {29996#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29996#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:06,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {29996#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29996#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:06,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {29996#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29997#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:06,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {29997#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29997#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:06,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {29997#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29997#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:06,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {29997#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29998#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:06,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {29998#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29998#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:06,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {29998#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29998#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:06,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {29998#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29999#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:06,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {29999#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29999#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:06,403 INFO L273 TraceCheckUtils]: 22: Hoare triple {29999#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29999#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:06,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {29999#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30000#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:06,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {30000#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30000#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:06,404 INFO L273 TraceCheckUtils]: 25: Hoare triple {30000#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30000#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:06,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {30000#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30001#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:06,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {30001#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30001#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:06,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {30001#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30001#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:06,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {30001#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30002#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:06,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {30002#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30002#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:06,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {30002#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30002#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:06,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {30002#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30003#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:06,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {30003#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30003#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:06,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {30003#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30003#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:06,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {30003#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30004#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:06,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {30004#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30004#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:06,411 INFO L273 TraceCheckUtils]: 37: Hoare triple {30004#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30004#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:06,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {30004#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30005#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:06,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {30005#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30005#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:06,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {30005#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30005#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:06,414 INFO L273 TraceCheckUtils]: 41: Hoare triple {30005#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30006#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:06,414 INFO L273 TraceCheckUtils]: 42: Hoare triple {30006#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30006#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:06,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {30006#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30006#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:06,415 INFO L273 TraceCheckUtils]: 44: Hoare triple {30006#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30007#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:06,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {30007#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30007#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:06,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {30007#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30007#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:06,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {30007#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30008#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:06,418 INFO L273 TraceCheckUtils]: 48: Hoare triple {30008#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30008#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:06,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {30008#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30008#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:06,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {30008#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30009#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:06,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {30009#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30009#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:06,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {30009#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30009#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:06,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {30009#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30010#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:06,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {30010#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30010#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:06,421 INFO L273 TraceCheckUtils]: 55: Hoare triple {30010#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30010#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:06,422 INFO L273 TraceCheckUtils]: 56: Hoare triple {30010#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30011#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:06,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {30011#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30011#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:06,423 INFO L273 TraceCheckUtils]: 58: Hoare triple {30011#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30011#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:06,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {30011#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30012#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:06,424 INFO L273 TraceCheckUtils]: 60: Hoare triple {30012#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30012#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:06,425 INFO L273 TraceCheckUtils]: 61: Hoare triple {30012#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30012#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:06,426 INFO L273 TraceCheckUtils]: 62: Hoare triple {30012#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30013#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:06,426 INFO L273 TraceCheckUtils]: 63: Hoare triple {30013#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30013#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:06,427 INFO L273 TraceCheckUtils]: 64: Hoare triple {30013#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30013#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:06,427 INFO L273 TraceCheckUtils]: 65: Hoare triple {30013#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30014#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:06,428 INFO L273 TraceCheckUtils]: 66: Hoare triple {30014#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30014#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:06,428 INFO L273 TraceCheckUtils]: 67: Hoare triple {30014#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30014#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:06,429 INFO L273 TraceCheckUtils]: 68: Hoare triple {30014#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30015#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:06,429 INFO L273 TraceCheckUtils]: 69: Hoare triple {30015#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30015#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:06,430 INFO L273 TraceCheckUtils]: 70: Hoare triple {30015#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30015#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:06,431 INFO L273 TraceCheckUtils]: 71: Hoare triple {30015#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30016#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:06,431 INFO L273 TraceCheckUtils]: 72: Hoare triple {30016#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30016#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:06,432 INFO L273 TraceCheckUtils]: 73: Hoare triple {30016#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30016#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:06,432 INFO L273 TraceCheckUtils]: 74: Hoare triple {30016#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30017#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:06,433 INFO L273 TraceCheckUtils]: 75: Hoare triple {30017#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30017#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:06,433 INFO L273 TraceCheckUtils]: 76: Hoare triple {30017#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30017#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:06,434 INFO L273 TraceCheckUtils]: 77: Hoare triple {30017#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30018#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:06,435 INFO L273 TraceCheckUtils]: 78: Hoare triple {30018#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30018#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:06,435 INFO L273 TraceCheckUtils]: 79: Hoare triple {30018#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30018#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:06,436 INFO L273 TraceCheckUtils]: 80: Hoare triple {30018#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30019#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:06,436 INFO L273 TraceCheckUtils]: 81: Hoare triple {30019#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30019#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:06,437 INFO L273 TraceCheckUtils]: 82: Hoare triple {30019#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30019#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:06,438 INFO L273 TraceCheckUtils]: 83: Hoare triple {30019#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30020#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:06,438 INFO L273 TraceCheckUtils]: 84: Hoare triple {30020#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30020#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:06,439 INFO L273 TraceCheckUtils]: 85: Hoare triple {30020#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30020#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:06,439 INFO L273 TraceCheckUtils]: 86: Hoare triple {30020#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30021#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:06,440 INFO L273 TraceCheckUtils]: 87: Hoare triple {30021#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30021#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:06,440 INFO L273 TraceCheckUtils]: 88: Hoare triple {30021#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30021#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:06,441 INFO L273 TraceCheckUtils]: 89: Hoare triple {30021#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30022#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:06,441 INFO L273 TraceCheckUtils]: 90: Hoare triple {30022#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30022#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:06,442 INFO L273 TraceCheckUtils]: 91: Hoare triple {30022#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30022#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:06,443 INFO L273 TraceCheckUtils]: 92: Hoare triple {30022#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30023#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:06,443 INFO L273 TraceCheckUtils]: 93: Hoare triple {30023#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30023#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:06,444 INFO L273 TraceCheckUtils]: 94: Hoare triple {30023#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30023#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:06,444 INFO L273 TraceCheckUtils]: 95: Hoare triple {30023#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30024#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:06,445 INFO L273 TraceCheckUtils]: 96: Hoare triple {30024#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30024#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:06,445 INFO L273 TraceCheckUtils]: 97: Hoare triple {30024#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30024#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:06,446 INFO L273 TraceCheckUtils]: 98: Hoare triple {30024#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30025#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:06,447 INFO L273 TraceCheckUtils]: 99: Hoare triple {30025#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30025#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:06,447 INFO L273 TraceCheckUtils]: 100: Hoare triple {30025#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30025#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:06,448 INFO L273 TraceCheckUtils]: 101: Hoare triple {30025#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30026#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:06,448 INFO L273 TraceCheckUtils]: 102: Hoare triple {30026#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30026#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:06,449 INFO L273 TraceCheckUtils]: 103: Hoare triple {30026#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30026#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:06,449 INFO L273 TraceCheckUtils]: 104: Hoare triple {30026#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30027#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:06,450 INFO L273 TraceCheckUtils]: 105: Hoare triple {30027#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30027#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:06,450 INFO L273 TraceCheckUtils]: 106: Hoare triple {30027#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30027#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:06,451 INFO L273 TraceCheckUtils]: 107: Hoare triple {30027#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30028#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:06,452 INFO L273 TraceCheckUtils]: 108: Hoare triple {30028#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30028#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:06,452 INFO L273 TraceCheckUtils]: 109: Hoare triple {30028#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30028#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:06,453 INFO L273 TraceCheckUtils]: 110: Hoare triple {30028#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30029#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:06,453 INFO L273 TraceCheckUtils]: 111: Hoare triple {30029#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30029#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:06,454 INFO L273 TraceCheckUtils]: 112: Hoare triple {30029#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30029#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:06,455 INFO L273 TraceCheckUtils]: 113: Hoare triple {30029#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30030#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:06,455 INFO L273 TraceCheckUtils]: 114: Hoare triple {30030#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30030#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:06,456 INFO L273 TraceCheckUtils]: 115: Hoare triple {30030#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30030#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:06,456 INFO L273 TraceCheckUtils]: 116: Hoare triple {30030#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30031#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:06,457 INFO L273 TraceCheckUtils]: 117: Hoare triple {30031#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30031#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:06,457 INFO L273 TraceCheckUtils]: 118: Hoare triple {30031#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30031#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:06,458 INFO L273 TraceCheckUtils]: 119: Hoare triple {30031#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30032#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:06,459 INFO L273 TraceCheckUtils]: 120: Hoare triple {30032#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30032#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:06,459 INFO L273 TraceCheckUtils]: 121: Hoare triple {30032#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30032#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:06,460 INFO L273 TraceCheckUtils]: 122: Hoare triple {30032#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30033#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:06,460 INFO L273 TraceCheckUtils]: 123: Hoare triple {30033#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30033#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:06,461 INFO L273 TraceCheckUtils]: 124: Hoare triple {30033#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30033#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:06,461 INFO L273 TraceCheckUtils]: 125: Hoare triple {30033#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30034#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:06,462 INFO L273 TraceCheckUtils]: 126: Hoare triple {30034#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30034#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:06,462 INFO L273 TraceCheckUtils]: 127: Hoare triple {30034#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30034#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:06,463 INFO L273 TraceCheckUtils]: 128: Hoare triple {30034#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30035#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:06,464 INFO L273 TraceCheckUtils]: 129: Hoare triple {30035#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30035#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:06,464 INFO L273 TraceCheckUtils]: 130: Hoare triple {30035#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30035#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:06,465 INFO L273 TraceCheckUtils]: 131: Hoare triple {30035#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30036#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:06,465 INFO L273 TraceCheckUtils]: 132: Hoare triple {30036#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30036#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:06,466 INFO L273 TraceCheckUtils]: 133: Hoare triple {30036#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30036#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:06,467 INFO L273 TraceCheckUtils]: 134: Hoare triple {30036#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30037#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:06,467 INFO L273 TraceCheckUtils]: 135: Hoare triple {30037#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30037#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:06,468 INFO L273 TraceCheckUtils]: 136: Hoare triple {30037#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30037#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:06,468 INFO L273 TraceCheckUtils]: 137: Hoare triple {30037#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30038#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:06,469 INFO L273 TraceCheckUtils]: 138: Hoare triple {30038#(<= main_~i~0 45)} assume !(~i~0 < 100000); {29993#false} is VALID [2018-11-23 12:00:06,469 INFO L273 TraceCheckUtils]: 139: Hoare triple {29993#false} havoc ~x~0;~x~0 := 0; {29993#false} is VALID [2018-11-23 12:00:06,469 INFO L273 TraceCheckUtils]: 140: Hoare triple {29993#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {29993#false} is VALID [2018-11-23 12:00:06,470 INFO L256 TraceCheckUtils]: 141: Hoare triple {29993#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {29993#false} is VALID [2018-11-23 12:00:06,470 INFO L273 TraceCheckUtils]: 142: Hoare triple {29993#false} ~cond := #in~cond; {29993#false} is VALID [2018-11-23 12:00:06,470 INFO L273 TraceCheckUtils]: 143: Hoare triple {29993#false} assume 0 == ~cond; {29993#false} is VALID [2018-11-23 12:00:06,470 INFO L273 TraceCheckUtils]: 144: Hoare triple {29993#false} assume !false; {29993#false} is VALID [2018-11-23 12:00:06,483 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 12:00:06,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:06,483 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 12:00:06,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:06,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:06,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:06,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:07,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {29992#true} call ULTIMATE.init(); {29992#true} is VALID [2018-11-23 12:00:07,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {29992#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29992#true} is VALID [2018-11-23 12:00:07,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {29992#true} assume true; {29992#true} is VALID [2018-11-23 12:00:07,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29992#true} {29992#true} #54#return; {29992#true} is VALID [2018-11-23 12:00:07,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {29992#true} call #t~ret6 := main(); {29992#true} is VALID [2018-11-23 12:00:07,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {29992#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {29994#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:07,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {29994#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29994#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:07,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {29994#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29994#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:07,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {29994#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29995#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:07,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {29995#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29995#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:07,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {29995#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29995#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:07,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {29995#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29996#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:07,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {29996#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29996#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:07,042 INFO L273 TraceCheckUtils]: 13: Hoare triple {29996#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29996#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:07,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {29996#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29997#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:07,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {29997#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29997#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:07,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {29997#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29997#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:07,045 INFO L273 TraceCheckUtils]: 17: Hoare triple {29997#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29998#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:07,045 INFO L273 TraceCheckUtils]: 18: Hoare triple {29998#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29998#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:07,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {29998#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29998#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:07,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {29998#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29999#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:07,047 INFO L273 TraceCheckUtils]: 21: Hoare triple {29999#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29999#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:07,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {29999#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {29999#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:07,048 INFO L273 TraceCheckUtils]: 23: Hoare triple {29999#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30000#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:07,049 INFO L273 TraceCheckUtils]: 24: Hoare triple {30000#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30000#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:07,049 INFO L273 TraceCheckUtils]: 25: Hoare triple {30000#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30000#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:07,050 INFO L273 TraceCheckUtils]: 26: Hoare triple {30000#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30001#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:07,050 INFO L273 TraceCheckUtils]: 27: Hoare triple {30001#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30001#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:07,051 INFO L273 TraceCheckUtils]: 28: Hoare triple {30001#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30001#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:07,052 INFO L273 TraceCheckUtils]: 29: Hoare triple {30001#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30002#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:07,052 INFO L273 TraceCheckUtils]: 30: Hoare triple {30002#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30002#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:07,053 INFO L273 TraceCheckUtils]: 31: Hoare triple {30002#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30002#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:07,053 INFO L273 TraceCheckUtils]: 32: Hoare triple {30002#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30003#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:07,054 INFO L273 TraceCheckUtils]: 33: Hoare triple {30003#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30003#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:07,054 INFO L273 TraceCheckUtils]: 34: Hoare triple {30003#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30003#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:07,055 INFO L273 TraceCheckUtils]: 35: Hoare triple {30003#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30004#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:07,056 INFO L273 TraceCheckUtils]: 36: Hoare triple {30004#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30004#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:07,056 INFO L273 TraceCheckUtils]: 37: Hoare triple {30004#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30004#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:07,057 INFO L273 TraceCheckUtils]: 38: Hoare triple {30004#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30005#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:07,057 INFO L273 TraceCheckUtils]: 39: Hoare triple {30005#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30005#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:07,058 INFO L273 TraceCheckUtils]: 40: Hoare triple {30005#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30005#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:07,058 INFO L273 TraceCheckUtils]: 41: Hoare triple {30005#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30006#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:07,059 INFO L273 TraceCheckUtils]: 42: Hoare triple {30006#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30006#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:07,059 INFO L273 TraceCheckUtils]: 43: Hoare triple {30006#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30006#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:07,060 INFO L273 TraceCheckUtils]: 44: Hoare triple {30006#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30007#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:07,061 INFO L273 TraceCheckUtils]: 45: Hoare triple {30007#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30007#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:07,061 INFO L273 TraceCheckUtils]: 46: Hoare triple {30007#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30007#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:07,062 INFO L273 TraceCheckUtils]: 47: Hoare triple {30007#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30008#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:07,062 INFO L273 TraceCheckUtils]: 48: Hoare triple {30008#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30008#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:07,063 INFO L273 TraceCheckUtils]: 49: Hoare triple {30008#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30008#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:07,064 INFO L273 TraceCheckUtils]: 50: Hoare triple {30008#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30009#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:07,064 INFO L273 TraceCheckUtils]: 51: Hoare triple {30009#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30009#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:07,065 INFO L273 TraceCheckUtils]: 52: Hoare triple {30009#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30009#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:07,065 INFO L273 TraceCheckUtils]: 53: Hoare triple {30009#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30010#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:07,066 INFO L273 TraceCheckUtils]: 54: Hoare triple {30010#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30010#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:07,066 INFO L273 TraceCheckUtils]: 55: Hoare triple {30010#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30010#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:07,067 INFO L273 TraceCheckUtils]: 56: Hoare triple {30010#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30011#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:07,068 INFO L273 TraceCheckUtils]: 57: Hoare triple {30011#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30011#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:07,068 INFO L273 TraceCheckUtils]: 58: Hoare triple {30011#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30011#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:07,069 INFO L273 TraceCheckUtils]: 59: Hoare triple {30011#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30012#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:07,069 INFO L273 TraceCheckUtils]: 60: Hoare triple {30012#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30012#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:07,070 INFO L273 TraceCheckUtils]: 61: Hoare triple {30012#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30012#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:07,071 INFO L273 TraceCheckUtils]: 62: Hoare triple {30012#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30013#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:07,071 INFO L273 TraceCheckUtils]: 63: Hoare triple {30013#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30013#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:07,072 INFO L273 TraceCheckUtils]: 64: Hoare triple {30013#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30013#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:07,072 INFO L273 TraceCheckUtils]: 65: Hoare triple {30013#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30014#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:07,073 INFO L273 TraceCheckUtils]: 66: Hoare triple {30014#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30014#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:07,073 INFO L273 TraceCheckUtils]: 67: Hoare triple {30014#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30014#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:07,074 INFO L273 TraceCheckUtils]: 68: Hoare triple {30014#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30015#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:07,074 INFO L273 TraceCheckUtils]: 69: Hoare triple {30015#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30015#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:07,075 INFO L273 TraceCheckUtils]: 70: Hoare triple {30015#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30015#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:07,076 INFO L273 TraceCheckUtils]: 71: Hoare triple {30015#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30016#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:07,076 INFO L273 TraceCheckUtils]: 72: Hoare triple {30016#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30016#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:07,077 INFO L273 TraceCheckUtils]: 73: Hoare triple {30016#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30016#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:07,077 INFO L273 TraceCheckUtils]: 74: Hoare triple {30016#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30017#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:07,078 INFO L273 TraceCheckUtils]: 75: Hoare triple {30017#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30017#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:07,078 INFO L273 TraceCheckUtils]: 76: Hoare triple {30017#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30017#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:07,079 INFO L273 TraceCheckUtils]: 77: Hoare triple {30017#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30018#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:07,080 INFO L273 TraceCheckUtils]: 78: Hoare triple {30018#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30018#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:07,080 INFO L273 TraceCheckUtils]: 79: Hoare triple {30018#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30018#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:07,081 INFO L273 TraceCheckUtils]: 80: Hoare triple {30018#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30019#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:07,081 INFO L273 TraceCheckUtils]: 81: Hoare triple {30019#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30019#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:07,082 INFO L273 TraceCheckUtils]: 82: Hoare triple {30019#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30019#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:07,083 INFO L273 TraceCheckUtils]: 83: Hoare triple {30019#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30020#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:07,083 INFO L273 TraceCheckUtils]: 84: Hoare triple {30020#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30020#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:07,084 INFO L273 TraceCheckUtils]: 85: Hoare triple {30020#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30020#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:07,084 INFO L273 TraceCheckUtils]: 86: Hoare triple {30020#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30021#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:07,085 INFO L273 TraceCheckUtils]: 87: Hoare triple {30021#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30021#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:07,085 INFO L273 TraceCheckUtils]: 88: Hoare triple {30021#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30021#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:07,086 INFO L273 TraceCheckUtils]: 89: Hoare triple {30021#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30022#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:07,086 INFO L273 TraceCheckUtils]: 90: Hoare triple {30022#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30022#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:07,087 INFO L273 TraceCheckUtils]: 91: Hoare triple {30022#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30022#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:07,088 INFO L273 TraceCheckUtils]: 92: Hoare triple {30022#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30023#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:07,088 INFO L273 TraceCheckUtils]: 93: Hoare triple {30023#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30023#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:07,089 INFO L273 TraceCheckUtils]: 94: Hoare triple {30023#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30023#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:07,089 INFO L273 TraceCheckUtils]: 95: Hoare triple {30023#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30024#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:07,090 INFO L273 TraceCheckUtils]: 96: Hoare triple {30024#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30024#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:07,090 INFO L273 TraceCheckUtils]: 97: Hoare triple {30024#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30024#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:07,091 INFO L273 TraceCheckUtils]: 98: Hoare triple {30024#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30025#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:07,092 INFO L273 TraceCheckUtils]: 99: Hoare triple {30025#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30025#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:07,092 INFO L273 TraceCheckUtils]: 100: Hoare triple {30025#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30025#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:07,093 INFO L273 TraceCheckUtils]: 101: Hoare triple {30025#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30026#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:07,093 INFO L273 TraceCheckUtils]: 102: Hoare triple {30026#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30026#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:07,094 INFO L273 TraceCheckUtils]: 103: Hoare triple {30026#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30026#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:07,095 INFO L273 TraceCheckUtils]: 104: Hoare triple {30026#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30027#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:07,095 INFO L273 TraceCheckUtils]: 105: Hoare triple {30027#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30027#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:07,096 INFO L273 TraceCheckUtils]: 106: Hoare triple {30027#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30027#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:07,096 INFO L273 TraceCheckUtils]: 107: Hoare triple {30027#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30028#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:07,097 INFO L273 TraceCheckUtils]: 108: Hoare triple {30028#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30028#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:07,097 INFO L273 TraceCheckUtils]: 109: Hoare triple {30028#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30028#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:07,098 INFO L273 TraceCheckUtils]: 110: Hoare triple {30028#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30029#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:07,098 INFO L273 TraceCheckUtils]: 111: Hoare triple {30029#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30029#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:07,099 INFO L273 TraceCheckUtils]: 112: Hoare triple {30029#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30029#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:07,100 INFO L273 TraceCheckUtils]: 113: Hoare triple {30029#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30030#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:07,100 INFO L273 TraceCheckUtils]: 114: Hoare triple {30030#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30030#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:07,101 INFO L273 TraceCheckUtils]: 115: Hoare triple {30030#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30030#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:07,101 INFO L273 TraceCheckUtils]: 116: Hoare triple {30030#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30031#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:07,102 INFO L273 TraceCheckUtils]: 117: Hoare triple {30031#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30031#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:07,102 INFO L273 TraceCheckUtils]: 118: Hoare triple {30031#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30031#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:07,103 INFO L273 TraceCheckUtils]: 119: Hoare triple {30031#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30032#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:07,104 INFO L273 TraceCheckUtils]: 120: Hoare triple {30032#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30032#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:07,104 INFO L273 TraceCheckUtils]: 121: Hoare triple {30032#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30032#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:07,105 INFO L273 TraceCheckUtils]: 122: Hoare triple {30032#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30033#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:07,105 INFO L273 TraceCheckUtils]: 123: Hoare triple {30033#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30033#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:07,106 INFO L273 TraceCheckUtils]: 124: Hoare triple {30033#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30033#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:07,107 INFO L273 TraceCheckUtils]: 125: Hoare triple {30033#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30034#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:07,107 INFO L273 TraceCheckUtils]: 126: Hoare triple {30034#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30034#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:07,108 INFO L273 TraceCheckUtils]: 127: Hoare triple {30034#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30034#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:07,108 INFO L273 TraceCheckUtils]: 128: Hoare triple {30034#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30035#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:07,109 INFO L273 TraceCheckUtils]: 129: Hoare triple {30035#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30035#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:07,109 INFO L273 TraceCheckUtils]: 130: Hoare triple {30035#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30035#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:07,110 INFO L273 TraceCheckUtils]: 131: Hoare triple {30035#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30036#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:07,110 INFO L273 TraceCheckUtils]: 132: Hoare triple {30036#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30036#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:07,111 INFO L273 TraceCheckUtils]: 133: Hoare triple {30036#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30036#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:07,112 INFO L273 TraceCheckUtils]: 134: Hoare triple {30036#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30037#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:07,112 INFO L273 TraceCheckUtils]: 135: Hoare triple {30037#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30037#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:07,113 INFO L273 TraceCheckUtils]: 136: Hoare triple {30037#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {30037#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:07,113 INFO L273 TraceCheckUtils]: 137: Hoare triple {30037#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30038#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:07,114 INFO L273 TraceCheckUtils]: 138: Hoare triple {30038#(<= main_~i~0 45)} assume !(~i~0 < 100000); {29993#false} is VALID [2018-11-23 12:00:07,114 INFO L273 TraceCheckUtils]: 139: Hoare triple {29993#false} havoc ~x~0;~x~0 := 0; {29993#false} is VALID [2018-11-23 12:00:07,114 INFO L273 TraceCheckUtils]: 140: Hoare triple {29993#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {29993#false} is VALID [2018-11-23 12:00:07,115 INFO L256 TraceCheckUtils]: 141: Hoare triple {29993#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {29993#false} is VALID [2018-11-23 12:00:07,115 INFO L273 TraceCheckUtils]: 142: Hoare triple {29993#false} ~cond := #in~cond; {29993#false} is VALID [2018-11-23 12:00:07,115 INFO L273 TraceCheckUtils]: 143: Hoare triple {29993#false} assume 0 == ~cond; {29993#false} is VALID [2018-11-23 12:00:07,115 INFO L273 TraceCheckUtils]: 144: Hoare triple {29993#false} assume !false; {29993#false} is VALID [2018-11-23 12:00:07,128 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 12:00:07,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:07,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-11-23 12:00:07,149 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 145 [2018-11-23 12:00:07,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:07,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 12:00:07,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:07,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 12:00:07,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 12:00:07,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:00:07,292 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand 47 states. [2018-11-23 12:00:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:08,015 INFO L93 Difference]: Finished difference Result 166 states and 214 transitions. [2018-11-23 12:00:08,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 12:00:08,015 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 145 [2018-11-23 12:00:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:00:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 214 transitions. [2018-11-23 12:00:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:00:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 214 transitions. [2018-11-23 12:00:08,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 214 transitions. [2018-11-23 12:00:08,218 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 12:00:08,222 INFO L225 Difference]: With dead ends: 166 [2018-11-23 12:00:08,222 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 12:00:08,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:00:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 12:00:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-23 12:00:08,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:08,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 153 states. [2018-11-23 12:00:08,263 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 153 states. [2018-11-23 12:00:08,263 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 153 states. [2018-11-23 12:00:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:08,266 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2018-11-23 12:00:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2018-11-23 12:00:08,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:08,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:08,266 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 155 states. [2018-11-23 12:00:08,267 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 155 states. [2018-11-23 12:00:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:08,268 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2018-11-23 12:00:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2018-11-23 12:00:08,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:08,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:08,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:08,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 12:00:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 199 transitions. [2018-11-23 12:00:08,271 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 199 transitions. Word has length 145 [2018-11-23 12:00:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:08,271 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 199 transitions. [2018-11-23 12:00:08,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 12:00:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 199 transitions. [2018-11-23 12:00:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:00:08,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:08,272 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:08,272 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:08,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1330696004, now seen corresponding path program 45 times [2018-11-23 12:00:08,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:08,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:08,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:09,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {31211#true} call ULTIMATE.init(); {31211#true} is VALID [2018-11-23 12:00:09,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {31211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31211#true} is VALID [2018-11-23 12:00:09,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {31211#true} assume true; {31211#true} is VALID [2018-11-23 12:00:09,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31211#true} {31211#true} #54#return; {31211#true} is VALID [2018-11-23 12:00:09,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {31211#true} call #t~ret6 := main(); {31211#true} is VALID [2018-11-23 12:00:09,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {31211#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31213#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:09,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {31213#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31213#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:09,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {31213#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31213#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:09,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {31213#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31214#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:09,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {31214#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31214#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:09,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {31214#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31214#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:09,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {31214#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31215#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:09,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {31215#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31215#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:09,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {31215#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31215#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:09,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {31215#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31216#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:09,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {31216#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31216#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:09,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {31216#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31216#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:09,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {31216#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31217#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:09,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {31217#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31217#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:09,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {31217#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31217#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:09,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {31217#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31218#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:09,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {31218#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31218#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:09,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {31218#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31218#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:09,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {31218#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31219#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:09,631 INFO L273 TraceCheckUtils]: 24: Hoare triple {31219#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31219#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:09,634 INFO L273 TraceCheckUtils]: 25: Hoare triple {31219#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31219#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:09,634 INFO L273 TraceCheckUtils]: 26: Hoare triple {31219#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31220#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:09,637 INFO L273 TraceCheckUtils]: 27: Hoare triple {31220#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31220#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:09,637 INFO L273 TraceCheckUtils]: 28: Hoare triple {31220#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31220#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:09,639 INFO L273 TraceCheckUtils]: 29: Hoare triple {31220#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31221#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:09,639 INFO L273 TraceCheckUtils]: 30: Hoare triple {31221#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31221#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:09,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {31221#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31221#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:09,641 INFO L273 TraceCheckUtils]: 32: Hoare triple {31221#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31222#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:09,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {31222#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31222#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:09,644 INFO L273 TraceCheckUtils]: 34: Hoare triple {31222#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31222#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:09,646 INFO L273 TraceCheckUtils]: 35: Hoare triple {31222#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31223#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:09,648 INFO L273 TraceCheckUtils]: 36: Hoare triple {31223#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31223#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:09,650 INFO L273 TraceCheckUtils]: 37: Hoare triple {31223#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31223#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:09,650 INFO L273 TraceCheckUtils]: 38: Hoare triple {31223#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31224#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:09,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {31224#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31224#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:09,652 INFO L273 TraceCheckUtils]: 40: Hoare triple {31224#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31224#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:09,652 INFO L273 TraceCheckUtils]: 41: Hoare triple {31224#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31225#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:09,653 INFO L273 TraceCheckUtils]: 42: Hoare triple {31225#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31225#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:09,654 INFO L273 TraceCheckUtils]: 43: Hoare triple {31225#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31225#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:09,654 INFO L273 TraceCheckUtils]: 44: Hoare triple {31225#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31226#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:09,656 INFO L273 TraceCheckUtils]: 45: Hoare triple {31226#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31226#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:09,656 INFO L273 TraceCheckUtils]: 46: Hoare triple {31226#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31226#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:09,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {31226#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31227#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:09,658 INFO L273 TraceCheckUtils]: 48: Hoare triple {31227#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31227#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:09,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {31227#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31227#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:09,661 INFO L273 TraceCheckUtils]: 50: Hoare triple {31227#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31228#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:09,663 INFO L273 TraceCheckUtils]: 51: Hoare triple {31228#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31228#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:09,663 INFO L273 TraceCheckUtils]: 52: Hoare triple {31228#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31228#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:09,665 INFO L273 TraceCheckUtils]: 53: Hoare triple {31228#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31229#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:09,665 INFO L273 TraceCheckUtils]: 54: Hoare triple {31229#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31229#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:09,665 INFO L273 TraceCheckUtils]: 55: Hoare triple {31229#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31229#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:09,666 INFO L273 TraceCheckUtils]: 56: Hoare triple {31229#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31230#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:09,666 INFO L273 TraceCheckUtils]: 57: Hoare triple {31230#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31230#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:09,666 INFO L273 TraceCheckUtils]: 58: Hoare triple {31230#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31230#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:09,667 INFO L273 TraceCheckUtils]: 59: Hoare triple {31230#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31231#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:09,667 INFO L273 TraceCheckUtils]: 60: Hoare triple {31231#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31231#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:09,669 INFO L273 TraceCheckUtils]: 61: Hoare triple {31231#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31231#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:09,672 INFO L273 TraceCheckUtils]: 62: Hoare triple {31231#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31232#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:09,672 INFO L273 TraceCheckUtils]: 63: Hoare triple {31232#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31232#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:09,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {31232#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31232#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:09,674 INFO L273 TraceCheckUtils]: 65: Hoare triple {31232#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31233#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:09,676 INFO L273 TraceCheckUtils]: 66: Hoare triple {31233#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31233#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:09,679 INFO L273 TraceCheckUtils]: 67: Hoare triple {31233#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31233#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:09,679 INFO L273 TraceCheckUtils]: 68: Hoare triple {31233#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31234#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:09,682 INFO L273 TraceCheckUtils]: 69: Hoare triple {31234#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31234#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:09,682 INFO L273 TraceCheckUtils]: 70: Hoare triple {31234#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31234#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:09,685 INFO L273 TraceCheckUtils]: 71: Hoare triple {31234#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31235#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:09,685 INFO L273 TraceCheckUtils]: 72: Hoare triple {31235#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31235#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:09,688 INFO L273 TraceCheckUtils]: 73: Hoare triple {31235#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31235#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:09,688 INFO L273 TraceCheckUtils]: 74: Hoare triple {31235#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31236#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:09,690 INFO L273 TraceCheckUtils]: 75: Hoare triple {31236#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31236#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:09,690 INFO L273 TraceCheckUtils]: 76: Hoare triple {31236#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31236#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:09,693 INFO L273 TraceCheckUtils]: 77: Hoare triple {31236#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31237#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:09,693 INFO L273 TraceCheckUtils]: 78: Hoare triple {31237#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31237#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:09,696 INFO L273 TraceCheckUtils]: 79: Hoare triple {31237#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31237#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:09,696 INFO L273 TraceCheckUtils]: 80: Hoare triple {31237#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31238#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:09,699 INFO L273 TraceCheckUtils]: 81: Hoare triple {31238#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31238#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:09,699 INFO L273 TraceCheckUtils]: 82: Hoare triple {31238#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31238#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:09,702 INFO L273 TraceCheckUtils]: 83: Hoare triple {31238#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31239#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:09,702 INFO L273 TraceCheckUtils]: 84: Hoare triple {31239#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31239#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:09,705 INFO L273 TraceCheckUtils]: 85: Hoare triple {31239#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31239#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:09,705 INFO L273 TraceCheckUtils]: 86: Hoare triple {31239#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31240#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:09,707 INFO L273 TraceCheckUtils]: 87: Hoare triple {31240#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31240#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:09,707 INFO L273 TraceCheckUtils]: 88: Hoare triple {31240#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31240#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:09,709 INFO L273 TraceCheckUtils]: 89: Hoare triple {31240#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31241#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:09,709 INFO L273 TraceCheckUtils]: 90: Hoare triple {31241#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31241#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:09,711 INFO L273 TraceCheckUtils]: 91: Hoare triple {31241#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31241#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:09,711 INFO L273 TraceCheckUtils]: 92: Hoare triple {31241#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31242#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:09,713 INFO L273 TraceCheckUtils]: 93: Hoare triple {31242#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31242#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:09,713 INFO L273 TraceCheckUtils]: 94: Hoare triple {31242#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31242#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:09,713 INFO L273 TraceCheckUtils]: 95: Hoare triple {31242#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31243#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:09,715 INFO L273 TraceCheckUtils]: 96: Hoare triple {31243#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31243#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:09,715 INFO L273 TraceCheckUtils]: 97: Hoare triple {31243#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31243#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:09,715 INFO L273 TraceCheckUtils]: 98: Hoare triple {31243#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31244#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:09,716 INFO L273 TraceCheckUtils]: 99: Hoare triple {31244#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31244#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:09,717 INFO L273 TraceCheckUtils]: 100: Hoare triple {31244#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31244#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:09,717 INFO L273 TraceCheckUtils]: 101: Hoare triple {31244#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31245#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:09,720 INFO L273 TraceCheckUtils]: 102: Hoare triple {31245#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31245#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:09,720 INFO L273 TraceCheckUtils]: 103: Hoare triple {31245#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31245#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:09,723 INFO L273 TraceCheckUtils]: 104: Hoare triple {31245#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31246#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:09,723 INFO L273 TraceCheckUtils]: 105: Hoare triple {31246#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31246#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:09,725 INFO L273 TraceCheckUtils]: 106: Hoare triple {31246#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31246#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:09,725 INFO L273 TraceCheckUtils]: 107: Hoare triple {31246#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31247#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:09,727 INFO L273 TraceCheckUtils]: 108: Hoare triple {31247#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31247#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:09,727 INFO L273 TraceCheckUtils]: 109: Hoare triple {31247#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31247#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:09,729 INFO L273 TraceCheckUtils]: 110: Hoare triple {31247#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31248#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:09,729 INFO L273 TraceCheckUtils]: 111: Hoare triple {31248#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31248#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:09,731 INFO L273 TraceCheckUtils]: 112: Hoare triple {31248#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31248#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:09,733 INFO L273 TraceCheckUtils]: 113: Hoare triple {31248#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31249#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:09,733 INFO L273 TraceCheckUtils]: 114: Hoare triple {31249#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31249#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:09,735 INFO L273 TraceCheckUtils]: 115: Hoare triple {31249#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31249#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:09,735 INFO L273 TraceCheckUtils]: 116: Hoare triple {31249#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31250#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:09,737 INFO L273 TraceCheckUtils]: 117: Hoare triple {31250#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31250#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:09,737 INFO L273 TraceCheckUtils]: 118: Hoare triple {31250#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31250#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:09,737 INFO L273 TraceCheckUtils]: 119: Hoare triple {31250#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31251#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:09,739 INFO L273 TraceCheckUtils]: 120: Hoare triple {31251#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31251#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:09,739 INFO L273 TraceCheckUtils]: 121: Hoare triple {31251#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31251#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:09,743 INFO L273 TraceCheckUtils]: 122: Hoare triple {31251#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31252#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:09,743 INFO L273 TraceCheckUtils]: 123: Hoare triple {31252#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31252#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:09,745 INFO L273 TraceCheckUtils]: 124: Hoare triple {31252#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31252#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:09,745 INFO L273 TraceCheckUtils]: 125: Hoare triple {31252#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31253#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:09,747 INFO L273 TraceCheckUtils]: 126: Hoare triple {31253#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31253#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:09,750 INFO L273 TraceCheckUtils]: 127: Hoare triple {31253#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31253#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:09,750 INFO L273 TraceCheckUtils]: 128: Hoare triple {31253#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31254#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:09,753 INFO L273 TraceCheckUtils]: 129: Hoare triple {31254#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31254#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:09,753 INFO L273 TraceCheckUtils]: 130: Hoare triple {31254#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31254#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:09,753 INFO L273 TraceCheckUtils]: 131: Hoare triple {31254#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31255#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:09,754 INFO L273 TraceCheckUtils]: 132: Hoare triple {31255#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31255#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:09,756 INFO L273 TraceCheckUtils]: 133: Hoare triple {31255#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31255#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:09,756 INFO L273 TraceCheckUtils]: 134: Hoare triple {31255#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31256#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:09,756 INFO L273 TraceCheckUtils]: 135: Hoare triple {31256#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31256#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:09,757 INFO L273 TraceCheckUtils]: 136: Hoare triple {31256#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31256#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:09,758 INFO L273 TraceCheckUtils]: 137: Hoare triple {31256#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31257#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:09,758 INFO L273 TraceCheckUtils]: 138: Hoare triple {31257#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31257#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:09,761 INFO L273 TraceCheckUtils]: 139: Hoare triple {31257#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31257#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:09,761 INFO L273 TraceCheckUtils]: 140: Hoare triple {31257#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31258#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:09,762 INFO L273 TraceCheckUtils]: 141: Hoare triple {31258#(<= main_~i~0 46)} assume !(~i~0 < 100000); {31212#false} is VALID [2018-11-23 12:00:09,762 INFO L273 TraceCheckUtils]: 142: Hoare triple {31212#false} havoc ~x~0;~x~0 := 0; {31212#false} is VALID [2018-11-23 12:00:09,762 INFO L273 TraceCheckUtils]: 143: Hoare triple {31212#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {31212#false} is VALID [2018-11-23 12:00:09,762 INFO L256 TraceCheckUtils]: 144: Hoare triple {31212#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {31212#false} is VALID [2018-11-23 12:00:09,762 INFO L273 TraceCheckUtils]: 145: Hoare triple {31212#false} ~cond := #in~cond; {31212#false} is VALID [2018-11-23 12:00:09,762 INFO L273 TraceCheckUtils]: 146: Hoare triple {31212#false} assume 0 == ~cond; {31212#false} is VALID [2018-11-23 12:00:09,762 INFO L273 TraceCheckUtils]: 147: Hoare triple {31212#false} assume !false; {31212#false} is VALID [2018-11-23 12:00:09,775 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 12:00:09,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:09,776 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 12:00:09,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:09,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-11-23 12:00:09,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:09,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:11,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {31211#true} call ULTIMATE.init(); {31211#true} is VALID [2018-11-23 12:00:11,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {31211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31211#true} is VALID [2018-11-23 12:00:11,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {31211#true} assume true; {31211#true} is VALID [2018-11-23 12:00:11,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31211#true} {31211#true} #54#return; {31211#true} is VALID [2018-11-23 12:00:11,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {31211#true} call #t~ret6 := main(); {31211#true} is VALID [2018-11-23 12:00:11,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {31211#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31213#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:11,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {31213#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31213#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:11,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {31213#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31213#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:11,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {31213#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31214#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:11,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {31214#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31214#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:11,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {31214#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31214#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:11,217 INFO L273 TraceCheckUtils]: 11: Hoare triple {31214#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31215#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:11,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {31215#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31215#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:11,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {31215#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31215#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:11,218 INFO L273 TraceCheckUtils]: 14: Hoare triple {31215#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31216#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:11,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {31216#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31216#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:11,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {31216#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31216#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:11,220 INFO L273 TraceCheckUtils]: 17: Hoare triple {31216#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31217#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:11,220 INFO L273 TraceCheckUtils]: 18: Hoare triple {31217#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31217#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:11,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {31217#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31217#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:11,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {31217#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31218#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:11,222 INFO L273 TraceCheckUtils]: 21: Hoare triple {31218#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31218#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:11,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {31218#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31218#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:11,223 INFO L273 TraceCheckUtils]: 23: Hoare triple {31218#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31219#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:11,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {31219#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31219#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:11,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {31219#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31219#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:11,225 INFO L273 TraceCheckUtils]: 26: Hoare triple {31219#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31220#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:11,225 INFO L273 TraceCheckUtils]: 27: Hoare triple {31220#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31220#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:11,226 INFO L273 TraceCheckUtils]: 28: Hoare triple {31220#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31220#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:11,227 INFO L273 TraceCheckUtils]: 29: Hoare triple {31220#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31221#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:11,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {31221#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31221#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:11,228 INFO L273 TraceCheckUtils]: 31: Hoare triple {31221#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31221#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:11,228 INFO L273 TraceCheckUtils]: 32: Hoare triple {31221#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31222#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:11,229 INFO L273 TraceCheckUtils]: 33: Hoare triple {31222#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31222#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:11,229 INFO L273 TraceCheckUtils]: 34: Hoare triple {31222#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31222#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:11,230 INFO L273 TraceCheckUtils]: 35: Hoare triple {31222#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31223#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:11,231 INFO L273 TraceCheckUtils]: 36: Hoare triple {31223#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31223#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:11,231 INFO L273 TraceCheckUtils]: 37: Hoare triple {31223#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31223#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:11,232 INFO L273 TraceCheckUtils]: 38: Hoare triple {31223#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31224#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:11,232 INFO L273 TraceCheckUtils]: 39: Hoare triple {31224#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31224#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:11,233 INFO L273 TraceCheckUtils]: 40: Hoare triple {31224#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31224#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:11,233 INFO L273 TraceCheckUtils]: 41: Hoare triple {31224#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31225#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:11,234 INFO L273 TraceCheckUtils]: 42: Hoare triple {31225#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31225#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:11,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {31225#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31225#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:11,235 INFO L273 TraceCheckUtils]: 44: Hoare triple {31225#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31226#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:11,236 INFO L273 TraceCheckUtils]: 45: Hoare triple {31226#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31226#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:11,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {31226#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31226#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:11,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {31226#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31227#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:11,237 INFO L273 TraceCheckUtils]: 48: Hoare triple {31227#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31227#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:11,238 INFO L273 TraceCheckUtils]: 49: Hoare triple {31227#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31227#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:11,239 INFO L273 TraceCheckUtils]: 50: Hoare triple {31227#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31228#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:11,239 INFO L273 TraceCheckUtils]: 51: Hoare triple {31228#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31228#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:11,240 INFO L273 TraceCheckUtils]: 52: Hoare triple {31228#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31228#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:11,241 INFO L273 TraceCheckUtils]: 53: Hoare triple {31228#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31229#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:11,241 INFO L273 TraceCheckUtils]: 54: Hoare triple {31229#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31229#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:11,242 INFO L273 TraceCheckUtils]: 55: Hoare triple {31229#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31229#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:11,242 INFO L273 TraceCheckUtils]: 56: Hoare triple {31229#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31230#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:11,243 INFO L273 TraceCheckUtils]: 57: Hoare triple {31230#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31230#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:11,243 INFO L273 TraceCheckUtils]: 58: Hoare triple {31230#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31230#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:11,244 INFO L273 TraceCheckUtils]: 59: Hoare triple {31230#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31231#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:11,245 INFO L273 TraceCheckUtils]: 60: Hoare triple {31231#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31231#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:11,245 INFO L273 TraceCheckUtils]: 61: Hoare triple {31231#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31231#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:11,246 INFO L273 TraceCheckUtils]: 62: Hoare triple {31231#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31232#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:11,246 INFO L273 TraceCheckUtils]: 63: Hoare triple {31232#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31232#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:11,247 INFO L273 TraceCheckUtils]: 64: Hoare triple {31232#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31232#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:11,247 INFO L273 TraceCheckUtils]: 65: Hoare triple {31232#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31233#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:11,248 INFO L273 TraceCheckUtils]: 66: Hoare triple {31233#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31233#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:11,248 INFO L273 TraceCheckUtils]: 67: Hoare triple {31233#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31233#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:11,249 INFO L273 TraceCheckUtils]: 68: Hoare triple {31233#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31234#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:11,250 INFO L273 TraceCheckUtils]: 69: Hoare triple {31234#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31234#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:11,250 INFO L273 TraceCheckUtils]: 70: Hoare triple {31234#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31234#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:11,251 INFO L273 TraceCheckUtils]: 71: Hoare triple {31234#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31235#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:11,252 INFO L273 TraceCheckUtils]: 72: Hoare triple {31235#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31235#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:11,252 INFO L273 TraceCheckUtils]: 73: Hoare triple {31235#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31235#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:11,253 INFO L273 TraceCheckUtils]: 74: Hoare triple {31235#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31236#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:11,253 INFO L273 TraceCheckUtils]: 75: Hoare triple {31236#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31236#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:11,254 INFO L273 TraceCheckUtils]: 76: Hoare triple {31236#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31236#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:11,254 INFO L273 TraceCheckUtils]: 77: Hoare triple {31236#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31237#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:11,255 INFO L273 TraceCheckUtils]: 78: Hoare triple {31237#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31237#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:11,255 INFO L273 TraceCheckUtils]: 79: Hoare triple {31237#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31237#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:11,256 INFO L273 TraceCheckUtils]: 80: Hoare triple {31237#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31238#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:11,257 INFO L273 TraceCheckUtils]: 81: Hoare triple {31238#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31238#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:11,257 INFO L273 TraceCheckUtils]: 82: Hoare triple {31238#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31238#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:11,258 INFO L273 TraceCheckUtils]: 83: Hoare triple {31238#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31239#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:11,258 INFO L273 TraceCheckUtils]: 84: Hoare triple {31239#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31239#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:11,259 INFO L273 TraceCheckUtils]: 85: Hoare triple {31239#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31239#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:11,260 INFO L273 TraceCheckUtils]: 86: Hoare triple {31239#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31240#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:11,260 INFO L273 TraceCheckUtils]: 87: Hoare triple {31240#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31240#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:11,261 INFO L273 TraceCheckUtils]: 88: Hoare triple {31240#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31240#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:11,261 INFO L273 TraceCheckUtils]: 89: Hoare triple {31240#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31241#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:11,262 INFO L273 TraceCheckUtils]: 90: Hoare triple {31241#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31241#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:11,262 INFO L273 TraceCheckUtils]: 91: Hoare triple {31241#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31241#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:11,263 INFO L273 TraceCheckUtils]: 92: Hoare triple {31241#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31242#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:11,264 INFO L273 TraceCheckUtils]: 93: Hoare triple {31242#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31242#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:11,264 INFO L273 TraceCheckUtils]: 94: Hoare triple {31242#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31242#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:11,265 INFO L273 TraceCheckUtils]: 95: Hoare triple {31242#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31243#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:11,265 INFO L273 TraceCheckUtils]: 96: Hoare triple {31243#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31243#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:11,266 INFO L273 TraceCheckUtils]: 97: Hoare triple {31243#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31243#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:11,266 INFO L273 TraceCheckUtils]: 98: Hoare triple {31243#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31244#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:11,267 INFO L273 TraceCheckUtils]: 99: Hoare triple {31244#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31244#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:11,267 INFO L273 TraceCheckUtils]: 100: Hoare triple {31244#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31244#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:11,268 INFO L273 TraceCheckUtils]: 101: Hoare triple {31244#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31245#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:11,269 INFO L273 TraceCheckUtils]: 102: Hoare triple {31245#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31245#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:11,269 INFO L273 TraceCheckUtils]: 103: Hoare triple {31245#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31245#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:11,270 INFO L273 TraceCheckUtils]: 104: Hoare triple {31245#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31246#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:11,270 INFO L273 TraceCheckUtils]: 105: Hoare triple {31246#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31246#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:11,271 INFO L273 TraceCheckUtils]: 106: Hoare triple {31246#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31246#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:11,272 INFO L273 TraceCheckUtils]: 107: Hoare triple {31246#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31247#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:11,272 INFO L273 TraceCheckUtils]: 108: Hoare triple {31247#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31247#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:11,273 INFO L273 TraceCheckUtils]: 109: Hoare triple {31247#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31247#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:11,273 INFO L273 TraceCheckUtils]: 110: Hoare triple {31247#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31248#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:11,274 INFO L273 TraceCheckUtils]: 111: Hoare triple {31248#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31248#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:11,274 INFO L273 TraceCheckUtils]: 112: Hoare triple {31248#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31248#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:11,275 INFO L273 TraceCheckUtils]: 113: Hoare triple {31248#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31249#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:11,276 INFO L273 TraceCheckUtils]: 114: Hoare triple {31249#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31249#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:11,276 INFO L273 TraceCheckUtils]: 115: Hoare triple {31249#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31249#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:11,277 INFO L273 TraceCheckUtils]: 116: Hoare triple {31249#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31250#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:11,277 INFO L273 TraceCheckUtils]: 117: Hoare triple {31250#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31250#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:11,278 INFO L273 TraceCheckUtils]: 118: Hoare triple {31250#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31250#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:11,279 INFO L273 TraceCheckUtils]: 119: Hoare triple {31250#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31251#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:11,279 INFO L273 TraceCheckUtils]: 120: Hoare triple {31251#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31251#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:11,280 INFO L273 TraceCheckUtils]: 121: Hoare triple {31251#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31251#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:11,280 INFO L273 TraceCheckUtils]: 122: Hoare triple {31251#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31252#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:11,281 INFO L273 TraceCheckUtils]: 123: Hoare triple {31252#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31252#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:11,281 INFO L273 TraceCheckUtils]: 124: Hoare triple {31252#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31252#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:11,282 INFO L273 TraceCheckUtils]: 125: Hoare triple {31252#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31253#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:11,283 INFO L273 TraceCheckUtils]: 126: Hoare triple {31253#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31253#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:11,283 INFO L273 TraceCheckUtils]: 127: Hoare triple {31253#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31253#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:11,284 INFO L273 TraceCheckUtils]: 128: Hoare triple {31253#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31254#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:11,284 INFO L273 TraceCheckUtils]: 129: Hoare triple {31254#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31254#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:11,285 INFO L273 TraceCheckUtils]: 130: Hoare triple {31254#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31254#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:11,285 INFO L273 TraceCheckUtils]: 131: Hoare triple {31254#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31255#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:11,286 INFO L273 TraceCheckUtils]: 132: Hoare triple {31255#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31255#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:11,286 INFO L273 TraceCheckUtils]: 133: Hoare triple {31255#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31255#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:11,287 INFO L273 TraceCheckUtils]: 134: Hoare triple {31255#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31256#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:11,288 INFO L273 TraceCheckUtils]: 135: Hoare triple {31256#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31256#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:11,288 INFO L273 TraceCheckUtils]: 136: Hoare triple {31256#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31256#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:11,289 INFO L273 TraceCheckUtils]: 137: Hoare triple {31256#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31257#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:11,289 INFO L273 TraceCheckUtils]: 138: Hoare triple {31257#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {31257#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:11,290 INFO L273 TraceCheckUtils]: 139: Hoare triple {31257#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {31257#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:11,291 INFO L273 TraceCheckUtils]: 140: Hoare triple {31257#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31258#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:11,291 INFO L273 TraceCheckUtils]: 141: Hoare triple {31258#(<= main_~i~0 46)} assume !(~i~0 < 100000); {31212#false} is VALID [2018-11-23 12:00:11,291 INFO L273 TraceCheckUtils]: 142: Hoare triple {31212#false} havoc ~x~0;~x~0 := 0; {31212#false} is VALID [2018-11-23 12:00:11,292 INFO L273 TraceCheckUtils]: 143: Hoare triple {31212#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {31212#false} is VALID [2018-11-23 12:00:11,292 INFO L256 TraceCheckUtils]: 144: Hoare triple {31212#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {31212#false} is VALID [2018-11-23 12:00:11,292 INFO L273 TraceCheckUtils]: 145: Hoare triple {31212#false} ~cond := #in~cond; {31212#false} is VALID [2018-11-23 12:00:11,292 INFO L273 TraceCheckUtils]: 146: Hoare triple {31212#false} assume 0 == ~cond; {31212#false} is VALID [2018-11-23 12:00:11,292 INFO L273 TraceCheckUtils]: 147: Hoare triple {31212#false} assume !false; {31212#false} is VALID [2018-11-23 12:00:11,306 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 12:00:11,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:11,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-11-23 12:00:11,336 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 148 [2018-11-23 12:00:11,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:11,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:00:11,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:11,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:00:11,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:00:11,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:00:11,557 INFO L87 Difference]: Start difference. First operand 153 states and 199 transitions. Second operand 48 states. [2018-11-23 12:00:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:12,358 INFO L93 Difference]: Finished difference Result 169 states and 218 transitions. [2018-11-23 12:00:12,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:00:12,358 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 148 [2018-11-23 12:00:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:00:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2018-11-23 12:00:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:00:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2018-11-23 12:00:12,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 218 transitions. [2018-11-23 12:00:12,566 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 12:00:12,570 INFO L225 Difference]: With dead ends: 169 [2018-11-23 12:00:12,570 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 12:00:12,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:00:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 12:00:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-11-23 12:00:12,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:12,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 156 states. [2018-11-23 12:00:12,611 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 156 states. [2018-11-23 12:00:12,611 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 156 states. [2018-11-23 12:00:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:12,614 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2018-11-23 12:00:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2018-11-23 12:00:12,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:12,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:12,615 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 158 states. [2018-11-23 12:00:12,615 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 158 states. [2018-11-23 12:00:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:12,618 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2018-11-23 12:00:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2018-11-23 12:00:12,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:12,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:12,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:12,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 12:00:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2018-11-23 12:00:12,621 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 148 [2018-11-23 12:00:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:12,622 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2018-11-23 12:00:12,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:00:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 12:00:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 12:00:12,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:12,623 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:12,623 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:12,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:12,623 INFO L82 PathProgramCache]: Analyzing trace with hash -738122089, now seen corresponding path program 46 times [2018-11-23 12:00:12,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:12,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:12,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:12,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:12,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:13,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {32454#true} call ULTIMATE.init(); {32454#true} is VALID [2018-11-23 12:00:13,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {32454#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32454#true} is VALID [2018-11-23 12:00:13,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {32454#true} assume true; {32454#true} is VALID [2018-11-23 12:00:13,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32454#true} {32454#true} #54#return; {32454#true} is VALID [2018-11-23 12:00:13,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {32454#true} call #t~ret6 := main(); {32454#true} is VALID [2018-11-23 12:00:13,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {32454#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {32456#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:13,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {32456#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32456#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:13,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {32456#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32456#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:13,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {32456#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32457#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:13,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {32457#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32457#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:13,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {32457#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32457#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:13,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {32457#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32458#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:13,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {32458#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32458#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:13,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {32458#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32458#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:13,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {32458#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32459#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:13,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {32459#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32459#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:13,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {32459#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32459#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:13,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {32459#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32460#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:13,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {32460#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32460#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:13,804 INFO L273 TraceCheckUtils]: 19: Hoare triple {32460#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32460#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:13,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {32460#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32461#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:13,805 INFO L273 TraceCheckUtils]: 21: Hoare triple {32461#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32461#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:13,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {32461#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32461#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:13,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {32461#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32462#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:13,807 INFO L273 TraceCheckUtils]: 24: Hoare triple {32462#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32462#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:13,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {32462#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32462#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:13,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {32462#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32463#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:13,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {32463#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32463#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:13,809 INFO L273 TraceCheckUtils]: 28: Hoare triple {32463#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32463#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:13,810 INFO L273 TraceCheckUtils]: 29: Hoare triple {32463#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32464#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:13,810 INFO L273 TraceCheckUtils]: 30: Hoare triple {32464#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32464#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:13,811 INFO L273 TraceCheckUtils]: 31: Hoare triple {32464#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32464#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:13,811 INFO L273 TraceCheckUtils]: 32: Hoare triple {32464#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32465#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:13,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {32465#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32465#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:13,812 INFO L273 TraceCheckUtils]: 34: Hoare triple {32465#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32465#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:13,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {32465#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32466#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:13,814 INFO L273 TraceCheckUtils]: 36: Hoare triple {32466#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32466#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:13,814 INFO L273 TraceCheckUtils]: 37: Hoare triple {32466#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32466#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:13,815 INFO L273 TraceCheckUtils]: 38: Hoare triple {32466#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32467#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:13,815 INFO L273 TraceCheckUtils]: 39: Hoare triple {32467#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32467#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:13,816 INFO L273 TraceCheckUtils]: 40: Hoare triple {32467#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32467#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:13,817 INFO L273 TraceCheckUtils]: 41: Hoare triple {32467#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32468#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:13,817 INFO L273 TraceCheckUtils]: 42: Hoare triple {32468#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32468#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:13,818 INFO L273 TraceCheckUtils]: 43: Hoare triple {32468#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32468#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:13,818 INFO L273 TraceCheckUtils]: 44: Hoare triple {32468#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32469#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:13,819 INFO L273 TraceCheckUtils]: 45: Hoare triple {32469#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32469#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:13,819 INFO L273 TraceCheckUtils]: 46: Hoare triple {32469#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32469#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:13,820 INFO L273 TraceCheckUtils]: 47: Hoare triple {32469#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32470#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:13,821 INFO L273 TraceCheckUtils]: 48: Hoare triple {32470#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32470#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:13,821 INFO L273 TraceCheckUtils]: 49: Hoare triple {32470#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32470#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:13,822 INFO L273 TraceCheckUtils]: 50: Hoare triple {32470#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32471#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:13,822 INFO L273 TraceCheckUtils]: 51: Hoare triple {32471#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32471#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:13,823 INFO L273 TraceCheckUtils]: 52: Hoare triple {32471#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32471#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:13,823 INFO L273 TraceCheckUtils]: 53: Hoare triple {32471#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32472#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:13,824 INFO L273 TraceCheckUtils]: 54: Hoare triple {32472#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32472#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:13,824 INFO L273 TraceCheckUtils]: 55: Hoare triple {32472#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32472#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:13,825 INFO L273 TraceCheckUtils]: 56: Hoare triple {32472#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32473#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:13,826 INFO L273 TraceCheckUtils]: 57: Hoare triple {32473#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32473#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:13,826 INFO L273 TraceCheckUtils]: 58: Hoare triple {32473#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32473#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:13,827 INFO L273 TraceCheckUtils]: 59: Hoare triple {32473#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32474#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:13,827 INFO L273 TraceCheckUtils]: 60: Hoare triple {32474#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32474#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:13,828 INFO L273 TraceCheckUtils]: 61: Hoare triple {32474#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32474#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:13,829 INFO L273 TraceCheckUtils]: 62: Hoare triple {32474#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32475#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:13,829 INFO L273 TraceCheckUtils]: 63: Hoare triple {32475#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32475#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:13,830 INFO L273 TraceCheckUtils]: 64: Hoare triple {32475#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32475#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:13,830 INFO L273 TraceCheckUtils]: 65: Hoare triple {32475#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32476#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:13,831 INFO L273 TraceCheckUtils]: 66: Hoare triple {32476#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32476#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:13,831 INFO L273 TraceCheckUtils]: 67: Hoare triple {32476#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32476#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:13,832 INFO L273 TraceCheckUtils]: 68: Hoare triple {32476#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32477#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:13,833 INFO L273 TraceCheckUtils]: 69: Hoare triple {32477#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32477#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:13,833 INFO L273 TraceCheckUtils]: 70: Hoare triple {32477#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32477#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:13,834 INFO L273 TraceCheckUtils]: 71: Hoare triple {32477#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32478#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:13,834 INFO L273 TraceCheckUtils]: 72: Hoare triple {32478#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32478#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:13,835 INFO L273 TraceCheckUtils]: 73: Hoare triple {32478#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32478#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:13,836 INFO L273 TraceCheckUtils]: 74: Hoare triple {32478#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32479#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:13,836 INFO L273 TraceCheckUtils]: 75: Hoare triple {32479#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32479#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:13,837 INFO L273 TraceCheckUtils]: 76: Hoare triple {32479#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32479#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:13,837 INFO L273 TraceCheckUtils]: 77: Hoare triple {32479#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32480#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:13,838 INFO L273 TraceCheckUtils]: 78: Hoare triple {32480#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32480#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:13,838 INFO L273 TraceCheckUtils]: 79: Hoare triple {32480#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32480#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:13,839 INFO L273 TraceCheckUtils]: 80: Hoare triple {32480#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32481#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:13,839 INFO L273 TraceCheckUtils]: 81: Hoare triple {32481#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32481#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:13,840 INFO L273 TraceCheckUtils]: 82: Hoare triple {32481#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32481#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:13,841 INFO L273 TraceCheckUtils]: 83: Hoare triple {32481#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32482#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:13,841 INFO L273 TraceCheckUtils]: 84: Hoare triple {32482#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32482#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:13,842 INFO L273 TraceCheckUtils]: 85: Hoare triple {32482#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32482#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:13,842 INFO L273 TraceCheckUtils]: 86: Hoare triple {32482#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32483#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:13,843 INFO L273 TraceCheckUtils]: 87: Hoare triple {32483#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32483#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:13,843 INFO L273 TraceCheckUtils]: 88: Hoare triple {32483#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32483#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:13,844 INFO L273 TraceCheckUtils]: 89: Hoare triple {32483#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32484#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:13,845 INFO L273 TraceCheckUtils]: 90: Hoare triple {32484#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32484#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:13,845 INFO L273 TraceCheckUtils]: 91: Hoare triple {32484#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32484#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:13,846 INFO L273 TraceCheckUtils]: 92: Hoare triple {32484#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32485#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:13,846 INFO L273 TraceCheckUtils]: 93: Hoare triple {32485#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32485#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:13,847 INFO L273 TraceCheckUtils]: 94: Hoare triple {32485#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32485#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:13,848 INFO L273 TraceCheckUtils]: 95: Hoare triple {32485#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32486#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:13,848 INFO L273 TraceCheckUtils]: 96: Hoare triple {32486#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32486#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:13,849 INFO L273 TraceCheckUtils]: 97: Hoare triple {32486#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32486#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:13,849 INFO L273 TraceCheckUtils]: 98: Hoare triple {32486#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32487#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:13,850 INFO L273 TraceCheckUtils]: 99: Hoare triple {32487#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32487#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:13,850 INFO L273 TraceCheckUtils]: 100: Hoare triple {32487#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32487#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:13,851 INFO L273 TraceCheckUtils]: 101: Hoare triple {32487#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32488#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:13,851 INFO L273 TraceCheckUtils]: 102: Hoare triple {32488#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32488#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:13,852 INFO L273 TraceCheckUtils]: 103: Hoare triple {32488#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32488#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:13,853 INFO L273 TraceCheckUtils]: 104: Hoare triple {32488#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32489#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:13,853 INFO L273 TraceCheckUtils]: 105: Hoare triple {32489#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32489#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:13,854 INFO L273 TraceCheckUtils]: 106: Hoare triple {32489#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32489#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:13,854 INFO L273 TraceCheckUtils]: 107: Hoare triple {32489#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32490#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:13,855 INFO L273 TraceCheckUtils]: 108: Hoare triple {32490#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32490#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:13,855 INFO L273 TraceCheckUtils]: 109: Hoare triple {32490#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32490#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:13,856 INFO L273 TraceCheckUtils]: 110: Hoare triple {32490#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32491#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:13,857 INFO L273 TraceCheckUtils]: 111: Hoare triple {32491#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32491#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:13,857 INFO L273 TraceCheckUtils]: 112: Hoare triple {32491#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32491#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:13,858 INFO L273 TraceCheckUtils]: 113: Hoare triple {32491#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32492#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:13,858 INFO L273 TraceCheckUtils]: 114: Hoare triple {32492#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32492#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:13,859 INFO L273 TraceCheckUtils]: 115: Hoare triple {32492#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32492#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:13,860 INFO L273 TraceCheckUtils]: 116: Hoare triple {32492#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32493#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:13,860 INFO L273 TraceCheckUtils]: 117: Hoare triple {32493#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32493#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:13,861 INFO L273 TraceCheckUtils]: 118: Hoare triple {32493#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32493#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:13,861 INFO L273 TraceCheckUtils]: 119: Hoare triple {32493#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32494#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:13,862 INFO L273 TraceCheckUtils]: 120: Hoare triple {32494#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32494#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:13,862 INFO L273 TraceCheckUtils]: 121: Hoare triple {32494#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32494#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:13,863 INFO L273 TraceCheckUtils]: 122: Hoare triple {32494#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32495#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:13,864 INFO L273 TraceCheckUtils]: 123: Hoare triple {32495#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32495#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:13,864 INFO L273 TraceCheckUtils]: 124: Hoare triple {32495#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32495#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:13,865 INFO L273 TraceCheckUtils]: 125: Hoare triple {32495#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32496#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:13,865 INFO L273 TraceCheckUtils]: 126: Hoare triple {32496#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32496#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:13,866 INFO L273 TraceCheckUtils]: 127: Hoare triple {32496#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32496#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:13,866 INFO L273 TraceCheckUtils]: 128: Hoare triple {32496#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32497#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:13,867 INFO L273 TraceCheckUtils]: 129: Hoare triple {32497#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32497#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:13,867 INFO L273 TraceCheckUtils]: 130: Hoare triple {32497#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32497#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:13,868 INFO L273 TraceCheckUtils]: 131: Hoare triple {32497#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32498#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:13,869 INFO L273 TraceCheckUtils]: 132: Hoare triple {32498#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32498#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:13,869 INFO L273 TraceCheckUtils]: 133: Hoare triple {32498#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32498#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:13,870 INFO L273 TraceCheckUtils]: 134: Hoare triple {32498#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32499#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:13,870 INFO L273 TraceCheckUtils]: 135: Hoare triple {32499#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32499#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:13,871 INFO L273 TraceCheckUtils]: 136: Hoare triple {32499#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32499#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:13,872 INFO L273 TraceCheckUtils]: 137: Hoare triple {32499#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32500#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:13,872 INFO L273 TraceCheckUtils]: 138: Hoare triple {32500#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32500#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:13,873 INFO L273 TraceCheckUtils]: 139: Hoare triple {32500#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32500#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:13,873 INFO L273 TraceCheckUtils]: 140: Hoare triple {32500#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32501#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:13,874 INFO L273 TraceCheckUtils]: 141: Hoare triple {32501#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32501#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:13,874 INFO L273 TraceCheckUtils]: 142: Hoare triple {32501#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32501#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:13,875 INFO L273 TraceCheckUtils]: 143: Hoare triple {32501#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32502#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:13,876 INFO L273 TraceCheckUtils]: 144: Hoare triple {32502#(<= main_~i~0 47)} assume !(~i~0 < 100000); {32455#false} is VALID [2018-11-23 12:00:13,876 INFO L273 TraceCheckUtils]: 145: Hoare triple {32455#false} havoc ~x~0;~x~0 := 0; {32455#false} is VALID [2018-11-23 12:00:13,876 INFO L273 TraceCheckUtils]: 146: Hoare triple {32455#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {32455#false} is VALID [2018-11-23 12:00:13,876 INFO L256 TraceCheckUtils]: 147: Hoare triple {32455#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {32455#false} is VALID [2018-11-23 12:00:13,876 INFO L273 TraceCheckUtils]: 148: Hoare triple {32455#false} ~cond := #in~cond; {32455#false} is VALID [2018-11-23 12:00:13,877 INFO L273 TraceCheckUtils]: 149: Hoare triple {32455#false} assume 0 == ~cond; {32455#false} is VALID [2018-11-23 12:00:13,877 INFO L273 TraceCheckUtils]: 150: Hoare triple {32455#false} assume !false; {32455#false} is VALID [2018-11-23 12:00:13,891 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 12:00:13,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:13,891 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 12:00:13,902 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:13,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:13,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:14,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:14,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {32454#true} call ULTIMATE.init(); {32454#true} is VALID [2018-11-23 12:00:14,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {32454#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32454#true} is VALID [2018-11-23 12:00:14,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {32454#true} assume true; {32454#true} is VALID [2018-11-23 12:00:14,354 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32454#true} {32454#true} #54#return; {32454#true} is VALID [2018-11-23 12:00:14,355 INFO L256 TraceCheckUtils]: 4: Hoare triple {32454#true} call #t~ret6 := main(); {32454#true} is VALID [2018-11-23 12:00:14,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {32454#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {32456#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:14,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {32456#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32456#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:14,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {32456#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32456#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:14,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {32456#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32457#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:14,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {32457#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32457#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:14,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {32457#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32457#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:14,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {32457#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32458#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:14,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {32458#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32458#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:14,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {32458#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32458#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:14,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {32458#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32459#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:14,361 INFO L273 TraceCheckUtils]: 15: Hoare triple {32459#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32459#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:14,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {32459#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32459#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:14,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {32459#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32460#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:14,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {32460#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32460#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:14,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {32460#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32460#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:14,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {32460#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32461#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:14,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {32461#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32461#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:14,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {32461#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32461#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:14,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {32461#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32462#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:14,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {32462#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32462#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:14,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {32462#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32462#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:14,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {32462#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32463#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:14,368 INFO L273 TraceCheckUtils]: 27: Hoare triple {32463#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32463#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:14,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {32463#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32463#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:14,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {32463#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32464#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:14,370 INFO L273 TraceCheckUtils]: 30: Hoare triple {32464#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32464#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:14,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {32464#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32464#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:14,371 INFO L273 TraceCheckUtils]: 32: Hoare triple {32464#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32465#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:14,372 INFO L273 TraceCheckUtils]: 33: Hoare triple {32465#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32465#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:14,372 INFO L273 TraceCheckUtils]: 34: Hoare triple {32465#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32465#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:14,373 INFO L273 TraceCheckUtils]: 35: Hoare triple {32465#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32466#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:14,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {32466#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32466#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:14,374 INFO L273 TraceCheckUtils]: 37: Hoare triple {32466#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32466#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:14,374 INFO L273 TraceCheckUtils]: 38: Hoare triple {32466#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32467#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:14,375 INFO L273 TraceCheckUtils]: 39: Hoare triple {32467#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32467#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:14,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {32467#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32467#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:14,376 INFO L273 TraceCheckUtils]: 41: Hoare triple {32467#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32468#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:14,377 INFO L273 TraceCheckUtils]: 42: Hoare triple {32468#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32468#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:14,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {32468#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32468#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:14,378 INFO L273 TraceCheckUtils]: 44: Hoare triple {32468#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32469#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:14,378 INFO L273 TraceCheckUtils]: 45: Hoare triple {32469#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32469#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:14,379 INFO L273 TraceCheckUtils]: 46: Hoare triple {32469#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32469#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:14,380 INFO L273 TraceCheckUtils]: 47: Hoare triple {32469#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32470#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:14,380 INFO L273 TraceCheckUtils]: 48: Hoare triple {32470#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32470#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:14,381 INFO L273 TraceCheckUtils]: 49: Hoare triple {32470#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32470#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:14,381 INFO L273 TraceCheckUtils]: 50: Hoare triple {32470#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32471#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:14,382 INFO L273 TraceCheckUtils]: 51: Hoare triple {32471#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32471#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:14,382 INFO L273 TraceCheckUtils]: 52: Hoare triple {32471#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32471#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:14,383 INFO L273 TraceCheckUtils]: 53: Hoare triple {32471#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32472#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:14,384 INFO L273 TraceCheckUtils]: 54: Hoare triple {32472#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32472#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:14,384 INFO L273 TraceCheckUtils]: 55: Hoare triple {32472#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32472#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:14,385 INFO L273 TraceCheckUtils]: 56: Hoare triple {32472#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32473#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:14,385 INFO L273 TraceCheckUtils]: 57: Hoare triple {32473#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32473#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:14,386 INFO L273 TraceCheckUtils]: 58: Hoare triple {32473#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32473#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:14,387 INFO L273 TraceCheckUtils]: 59: Hoare triple {32473#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32474#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:14,387 INFO L273 TraceCheckUtils]: 60: Hoare triple {32474#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32474#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:14,388 INFO L273 TraceCheckUtils]: 61: Hoare triple {32474#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32474#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:14,388 INFO L273 TraceCheckUtils]: 62: Hoare triple {32474#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32475#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:14,389 INFO L273 TraceCheckUtils]: 63: Hoare triple {32475#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32475#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:14,389 INFO L273 TraceCheckUtils]: 64: Hoare triple {32475#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32475#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:14,390 INFO L273 TraceCheckUtils]: 65: Hoare triple {32475#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32476#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:14,390 INFO L273 TraceCheckUtils]: 66: Hoare triple {32476#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32476#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:14,391 INFO L273 TraceCheckUtils]: 67: Hoare triple {32476#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32476#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:14,392 INFO L273 TraceCheckUtils]: 68: Hoare triple {32476#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32477#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:14,392 INFO L273 TraceCheckUtils]: 69: Hoare triple {32477#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32477#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:14,393 INFO L273 TraceCheckUtils]: 70: Hoare triple {32477#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32477#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:14,393 INFO L273 TraceCheckUtils]: 71: Hoare triple {32477#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32478#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:14,394 INFO L273 TraceCheckUtils]: 72: Hoare triple {32478#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32478#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:14,394 INFO L273 TraceCheckUtils]: 73: Hoare triple {32478#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32478#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:14,395 INFO L273 TraceCheckUtils]: 74: Hoare triple {32478#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32479#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:14,396 INFO L273 TraceCheckUtils]: 75: Hoare triple {32479#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32479#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:14,396 INFO L273 TraceCheckUtils]: 76: Hoare triple {32479#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32479#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:14,397 INFO L273 TraceCheckUtils]: 77: Hoare triple {32479#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32480#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:14,397 INFO L273 TraceCheckUtils]: 78: Hoare triple {32480#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32480#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:14,398 INFO L273 TraceCheckUtils]: 79: Hoare triple {32480#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32480#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:14,399 INFO L273 TraceCheckUtils]: 80: Hoare triple {32480#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32481#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:14,399 INFO L273 TraceCheckUtils]: 81: Hoare triple {32481#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32481#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:14,400 INFO L273 TraceCheckUtils]: 82: Hoare triple {32481#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32481#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:14,400 INFO L273 TraceCheckUtils]: 83: Hoare triple {32481#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32482#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:14,401 INFO L273 TraceCheckUtils]: 84: Hoare triple {32482#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32482#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:14,401 INFO L273 TraceCheckUtils]: 85: Hoare triple {32482#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32482#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:14,402 INFO L273 TraceCheckUtils]: 86: Hoare triple {32482#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32483#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:14,403 INFO L273 TraceCheckUtils]: 87: Hoare triple {32483#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32483#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:14,403 INFO L273 TraceCheckUtils]: 88: Hoare triple {32483#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32483#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:14,404 INFO L273 TraceCheckUtils]: 89: Hoare triple {32483#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32484#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:14,404 INFO L273 TraceCheckUtils]: 90: Hoare triple {32484#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32484#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:14,405 INFO L273 TraceCheckUtils]: 91: Hoare triple {32484#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32484#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:14,406 INFO L273 TraceCheckUtils]: 92: Hoare triple {32484#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32485#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:14,406 INFO L273 TraceCheckUtils]: 93: Hoare triple {32485#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32485#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:14,407 INFO L273 TraceCheckUtils]: 94: Hoare triple {32485#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32485#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:14,407 INFO L273 TraceCheckUtils]: 95: Hoare triple {32485#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32486#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:14,408 INFO L273 TraceCheckUtils]: 96: Hoare triple {32486#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32486#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:14,408 INFO L273 TraceCheckUtils]: 97: Hoare triple {32486#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32486#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:14,409 INFO L273 TraceCheckUtils]: 98: Hoare triple {32486#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32487#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:14,409 INFO L273 TraceCheckUtils]: 99: Hoare triple {32487#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32487#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:14,410 INFO L273 TraceCheckUtils]: 100: Hoare triple {32487#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32487#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:14,411 INFO L273 TraceCheckUtils]: 101: Hoare triple {32487#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32488#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:14,411 INFO L273 TraceCheckUtils]: 102: Hoare triple {32488#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32488#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:14,412 INFO L273 TraceCheckUtils]: 103: Hoare triple {32488#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32488#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:14,412 INFO L273 TraceCheckUtils]: 104: Hoare triple {32488#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32489#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:14,413 INFO L273 TraceCheckUtils]: 105: Hoare triple {32489#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32489#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:14,413 INFO L273 TraceCheckUtils]: 106: Hoare triple {32489#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32489#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:14,414 INFO L273 TraceCheckUtils]: 107: Hoare triple {32489#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32490#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:14,415 INFO L273 TraceCheckUtils]: 108: Hoare triple {32490#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32490#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:14,415 INFO L273 TraceCheckUtils]: 109: Hoare triple {32490#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32490#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:14,416 INFO L273 TraceCheckUtils]: 110: Hoare triple {32490#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32491#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:14,416 INFO L273 TraceCheckUtils]: 111: Hoare triple {32491#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32491#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:14,417 INFO L273 TraceCheckUtils]: 112: Hoare triple {32491#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32491#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:14,418 INFO L273 TraceCheckUtils]: 113: Hoare triple {32491#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32492#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:14,418 INFO L273 TraceCheckUtils]: 114: Hoare triple {32492#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32492#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:14,419 INFO L273 TraceCheckUtils]: 115: Hoare triple {32492#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32492#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:14,419 INFO L273 TraceCheckUtils]: 116: Hoare triple {32492#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32493#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:14,420 INFO L273 TraceCheckUtils]: 117: Hoare triple {32493#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32493#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:14,420 INFO L273 TraceCheckUtils]: 118: Hoare triple {32493#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32493#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:14,421 INFO L273 TraceCheckUtils]: 119: Hoare triple {32493#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32494#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:14,422 INFO L273 TraceCheckUtils]: 120: Hoare triple {32494#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32494#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:14,422 INFO L273 TraceCheckUtils]: 121: Hoare triple {32494#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32494#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:14,423 INFO L273 TraceCheckUtils]: 122: Hoare triple {32494#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32495#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:14,423 INFO L273 TraceCheckUtils]: 123: Hoare triple {32495#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32495#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:14,424 INFO L273 TraceCheckUtils]: 124: Hoare triple {32495#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32495#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:14,425 INFO L273 TraceCheckUtils]: 125: Hoare triple {32495#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32496#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:14,425 INFO L273 TraceCheckUtils]: 126: Hoare triple {32496#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32496#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:14,426 INFO L273 TraceCheckUtils]: 127: Hoare triple {32496#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32496#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:14,426 INFO L273 TraceCheckUtils]: 128: Hoare triple {32496#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32497#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:14,427 INFO L273 TraceCheckUtils]: 129: Hoare triple {32497#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32497#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:14,427 INFO L273 TraceCheckUtils]: 130: Hoare triple {32497#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32497#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:14,428 INFO L273 TraceCheckUtils]: 131: Hoare triple {32497#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32498#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:14,428 INFO L273 TraceCheckUtils]: 132: Hoare triple {32498#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32498#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:14,429 INFO L273 TraceCheckUtils]: 133: Hoare triple {32498#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32498#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:14,430 INFO L273 TraceCheckUtils]: 134: Hoare triple {32498#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32499#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:14,430 INFO L273 TraceCheckUtils]: 135: Hoare triple {32499#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32499#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:14,431 INFO L273 TraceCheckUtils]: 136: Hoare triple {32499#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32499#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:14,431 INFO L273 TraceCheckUtils]: 137: Hoare triple {32499#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32500#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:14,432 INFO L273 TraceCheckUtils]: 138: Hoare triple {32500#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32500#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:14,432 INFO L273 TraceCheckUtils]: 139: Hoare triple {32500#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32500#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:14,433 INFO L273 TraceCheckUtils]: 140: Hoare triple {32500#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32501#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:14,438 INFO L273 TraceCheckUtils]: 141: Hoare triple {32501#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32501#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:14,438 INFO L273 TraceCheckUtils]: 142: Hoare triple {32501#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {32501#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:14,439 INFO L273 TraceCheckUtils]: 143: Hoare triple {32501#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32502#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:14,439 INFO L273 TraceCheckUtils]: 144: Hoare triple {32502#(<= main_~i~0 47)} assume !(~i~0 < 100000); {32455#false} is VALID [2018-11-23 12:00:14,439 INFO L273 TraceCheckUtils]: 145: Hoare triple {32455#false} havoc ~x~0;~x~0 := 0; {32455#false} is VALID [2018-11-23 12:00:14,439 INFO L273 TraceCheckUtils]: 146: Hoare triple {32455#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {32455#false} is VALID [2018-11-23 12:00:14,439 INFO L256 TraceCheckUtils]: 147: Hoare triple {32455#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {32455#false} is VALID [2018-11-23 12:00:14,439 INFO L273 TraceCheckUtils]: 148: Hoare triple {32455#false} ~cond := #in~cond; {32455#false} is VALID [2018-11-23 12:00:14,440 INFO L273 TraceCheckUtils]: 149: Hoare triple {32455#false} assume 0 == ~cond; {32455#false} is VALID [2018-11-23 12:00:14,440 INFO L273 TraceCheckUtils]: 150: Hoare triple {32455#false} assume !false; {32455#false} is VALID [2018-11-23 12:00:14,454 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 12:00:14,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:14,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-11-23 12:00:14,473 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 151 [2018-11-23 12:00:14,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:14,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:00:14,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:14,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:00:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:00:14,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:00:14,681 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand 49 states. [2018-11-23 12:00:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:15,758 INFO L93 Difference]: Finished difference Result 172 states and 222 transitions. [2018-11-23 12:00:15,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:00:15,758 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 151 [2018-11-23 12:00:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:00:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 222 transitions. [2018-11-23 12:00:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:00:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 222 transitions. [2018-11-23 12:00:15,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 222 transitions. [2018-11-23 12:00:15,956 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 12:00:15,960 INFO L225 Difference]: With dead ends: 172 [2018-11-23 12:00:15,960 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 12:00:15,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:00:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 12:00:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-11-23 12:00:16,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:16,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 159 states. [2018-11-23 12:00:16,032 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 159 states. [2018-11-23 12:00:16,032 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 159 states. [2018-11-23 12:00:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:16,034 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2018-11-23 12:00:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 12:00:16,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:16,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:16,034 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 161 states. [2018-11-23 12:00:16,034 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 161 states. [2018-11-23 12:00:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:16,037 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2018-11-23 12:00:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 12:00:16,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:16,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:16,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:16,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 12:00:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 207 transitions. [2018-11-23 12:00:16,040 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 207 transitions. Word has length 151 [2018-11-23 12:00:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:16,041 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 207 transitions. [2018-11-23 12:00:16,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:00:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 207 transitions. [2018-11-23 12:00:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 12:00:16,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:16,042 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:16,042 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:16,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash -117233052, now seen corresponding path program 47 times [2018-11-23 12:00:16,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:16,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:16,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:16,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:16,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:17,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {33721#true} call ULTIMATE.init(); {33721#true} is VALID [2018-11-23 12:00:17,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {33721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33721#true} is VALID [2018-11-23 12:00:17,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {33721#true} assume true; {33721#true} is VALID [2018-11-23 12:00:17,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33721#true} {33721#true} #54#return; {33721#true} is VALID [2018-11-23 12:00:17,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {33721#true} call #t~ret6 := main(); {33721#true} is VALID [2018-11-23 12:00:17,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {33721#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:17,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {33723#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:17,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {33723#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:17,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {33723#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:17,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {33724#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:17,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {33724#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:17,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {33724#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:17,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {33725#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:17,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {33725#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:17,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {33725#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:17,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {33726#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:17,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {33726#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:17,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {33726#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:17,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {33727#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:17,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {33727#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:17,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {33727#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:17,218 INFO L273 TraceCheckUtils]: 21: Hoare triple {33728#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:17,219 INFO L273 TraceCheckUtils]: 22: Hoare triple {33728#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:17,219 INFO L273 TraceCheckUtils]: 23: Hoare triple {33728#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:17,220 INFO L273 TraceCheckUtils]: 24: Hoare triple {33729#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:17,220 INFO L273 TraceCheckUtils]: 25: Hoare triple {33729#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:17,221 INFO L273 TraceCheckUtils]: 26: Hoare triple {33729#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:17,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {33730#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:17,222 INFO L273 TraceCheckUtils]: 28: Hoare triple {33730#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:17,223 INFO L273 TraceCheckUtils]: 29: Hoare triple {33730#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:17,223 INFO L273 TraceCheckUtils]: 30: Hoare triple {33731#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:17,224 INFO L273 TraceCheckUtils]: 31: Hoare triple {33731#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:17,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {33731#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:17,225 INFO L273 TraceCheckUtils]: 33: Hoare triple {33732#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:17,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {33732#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:17,226 INFO L273 TraceCheckUtils]: 35: Hoare triple {33732#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:17,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {33733#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:17,227 INFO L273 TraceCheckUtils]: 37: Hoare triple {33733#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:17,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {33733#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:17,229 INFO L273 TraceCheckUtils]: 39: Hoare triple {33734#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:17,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {33734#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:17,230 INFO L273 TraceCheckUtils]: 41: Hoare triple {33734#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:17,230 INFO L273 TraceCheckUtils]: 42: Hoare triple {33735#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:17,231 INFO L273 TraceCheckUtils]: 43: Hoare triple {33735#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:17,231 INFO L273 TraceCheckUtils]: 44: Hoare triple {33735#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:17,232 INFO L273 TraceCheckUtils]: 45: Hoare triple {33736#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:17,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {33736#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:17,233 INFO L273 TraceCheckUtils]: 47: Hoare triple {33736#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:17,234 INFO L273 TraceCheckUtils]: 48: Hoare triple {33737#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:17,234 INFO L273 TraceCheckUtils]: 49: Hoare triple {33737#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:17,235 INFO L273 TraceCheckUtils]: 50: Hoare triple {33737#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:17,235 INFO L273 TraceCheckUtils]: 51: Hoare triple {33738#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:17,236 INFO L273 TraceCheckUtils]: 52: Hoare triple {33738#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:17,237 INFO L273 TraceCheckUtils]: 53: Hoare triple {33738#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:17,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {33739#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:17,238 INFO L273 TraceCheckUtils]: 55: Hoare triple {33739#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:17,238 INFO L273 TraceCheckUtils]: 56: Hoare triple {33739#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:17,239 INFO L273 TraceCheckUtils]: 57: Hoare triple {33740#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:17,239 INFO L273 TraceCheckUtils]: 58: Hoare triple {33740#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:17,240 INFO L273 TraceCheckUtils]: 59: Hoare triple {33740#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:17,241 INFO L273 TraceCheckUtils]: 60: Hoare triple {33741#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:17,241 INFO L273 TraceCheckUtils]: 61: Hoare triple {33741#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:17,242 INFO L273 TraceCheckUtils]: 62: Hoare triple {33741#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:17,242 INFO L273 TraceCheckUtils]: 63: Hoare triple {33742#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:17,243 INFO L273 TraceCheckUtils]: 64: Hoare triple {33742#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:17,244 INFO L273 TraceCheckUtils]: 65: Hoare triple {33742#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:17,244 INFO L273 TraceCheckUtils]: 66: Hoare triple {33743#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:17,245 INFO L273 TraceCheckUtils]: 67: Hoare triple {33743#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:17,245 INFO L273 TraceCheckUtils]: 68: Hoare triple {33743#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:17,246 INFO L273 TraceCheckUtils]: 69: Hoare triple {33744#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:17,246 INFO L273 TraceCheckUtils]: 70: Hoare triple {33744#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:17,247 INFO L273 TraceCheckUtils]: 71: Hoare triple {33744#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:17,247 INFO L273 TraceCheckUtils]: 72: Hoare triple {33745#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:17,248 INFO L273 TraceCheckUtils]: 73: Hoare triple {33745#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:17,249 INFO L273 TraceCheckUtils]: 74: Hoare triple {33745#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:17,249 INFO L273 TraceCheckUtils]: 75: Hoare triple {33746#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:17,250 INFO L273 TraceCheckUtils]: 76: Hoare triple {33746#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:17,250 INFO L273 TraceCheckUtils]: 77: Hoare triple {33746#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:17,251 INFO L273 TraceCheckUtils]: 78: Hoare triple {33747#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:17,251 INFO L273 TraceCheckUtils]: 79: Hoare triple {33747#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:17,252 INFO L273 TraceCheckUtils]: 80: Hoare triple {33747#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:17,253 INFO L273 TraceCheckUtils]: 81: Hoare triple {33748#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:17,253 INFO L273 TraceCheckUtils]: 82: Hoare triple {33748#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:17,254 INFO L273 TraceCheckUtils]: 83: Hoare triple {33748#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:17,254 INFO L273 TraceCheckUtils]: 84: Hoare triple {33749#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:17,255 INFO L273 TraceCheckUtils]: 85: Hoare triple {33749#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:17,256 INFO L273 TraceCheckUtils]: 86: Hoare triple {33749#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:17,256 INFO L273 TraceCheckUtils]: 87: Hoare triple {33750#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:17,257 INFO L273 TraceCheckUtils]: 88: Hoare triple {33750#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:17,257 INFO L273 TraceCheckUtils]: 89: Hoare triple {33750#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:17,258 INFO L273 TraceCheckUtils]: 90: Hoare triple {33751#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:17,258 INFO L273 TraceCheckUtils]: 91: Hoare triple {33751#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:17,259 INFO L273 TraceCheckUtils]: 92: Hoare triple {33751#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:17,260 INFO L273 TraceCheckUtils]: 93: Hoare triple {33752#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:17,260 INFO L273 TraceCheckUtils]: 94: Hoare triple {33752#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:17,261 INFO L273 TraceCheckUtils]: 95: Hoare triple {33752#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:17,261 INFO L273 TraceCheckUtils]: 96: Hoare triple {33753#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:17,262 INFO L273 TraceCheckUtils]: 97: Hoare triple {33753#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:17,263 INFO L273 TraceCheckUtils]: 98: Hoare triple {33753#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:17,263 INFO L273 TraceCheckUtils]: 99: Hoare triple {33754#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:17,264 INFO L273 TraceCheckUtils]: 100: Hoare triple {33754#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:17,264 INFO L273 TraceCheckUtils]: 101: Hoare triple {33754#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:17,265 INFO L273 TraceCheckUtils]: 102: Hoare triple {33755#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:17,265 INFO L273 TraceCheckUtils]: 103: Hoare triple {33755#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:17,266 INFO L273 TraceCheckUtils]: 104: Hoare triple {33755#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:17,266 INFO L273 TraceCheckUtils]: 105: Hoare triple {33756#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:17,267 INFO L273 TraceCheckUtils]: 106: Hoare triple {33756#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:17,268 INFO L273 TraceCheckUtils]: 107: Hoare triple {33756#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:17,268 INFO L273 TraceCheckUtils]: 108: Hoare triple {33757#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:17,269 INFO L273 TraceCheckUtils]: 109: Hoare triple {33757#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:17,269 INFO L273 TraceCheckUtils]: 110: Hoare triple {33757#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:17,270 INFO L273 TraceCheckUtils]: 111: Hoare triple {33758#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:17,270 INFO L273 TraceCheckUtils]: 112: Hoare triple {33758#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:17,271 INFO L273 TraceCheckUtils]: 113: Hoare triple {33758#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:17,272 INFO L273 TraceCheckUtils]: 114: Hoare triple {33759#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:17,272 INFO L273 TraceCheckUtils]: 115: Hoare triple {33759#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:17,273 INFO L273 TraceCheckUtils]: 116: Hoare triple {33759#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:17,273 INFO L273 TraceCheckUtils]: 117: Hoare triple {33760#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:17,274 INFO L273 TraceCheckUtils]: 118: Hoare triple {33760#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:17,275 INFO L273 TraceCheckUtils]: 119: Hoare triple {33760#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:17,275 INFO L273 TraceCheckUtils]: 120: Hoare triple {33761#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:17,276 INFO L273 TraceCheckUtils]: 121: Hoare triple {33761#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:17,276 INFO L273 TraceCheckUtils]: 122: Hoare triple {33761#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:17,277 INFO L273 TraceCheckUtils]: 123: Hoare triple {33762#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:17,277 INFO L273 TraceCheckUtils]: 124: Hoare triple {33762#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:17,278 INFO L273 TraceCheckUtils]: 125: Hoare triple {33762#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:17,279 INFO L273 TraceCheckUtils]: 126: Hoare triple {33763#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:17,279 INFO L273 TraceCheckUtils]: 127: Hoare triple {33763#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:17,280 INFO L273 TraceCheckUtils]: 128: Hoare triple {33763#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:17,280 INFO L273 TraceCheckUtils]: 129: Hoare triple {33764#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:17,281 INFO L273 TraceCheckUtils]: 130: Hoare triple {33764#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:17,281 INFO L273 TraceCheckUtils]: 131: Hoare triple {33764#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:17,282 INFO L273 TraceCheckUtils]: 132: Hoare triple {33765#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:17,282 INFO L273 TraceCheckUtils]: 133: Hoare triple {33765#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:17,283 INFO L273 TraceCheckUtils]: 134: Hoare triple {33765#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:17,284 INFO L273 TraceCheckUtils]: 135: Hoare triple {33766#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:17,284 INFO L273 TraceCheckUtils]: 136: Hoare triple {33766#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:17,285 INFO L273 TraceCheckUtils]: 137: Hoare triple {33766#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:17,285 INFO L273 TraceCheckUtils]: 138: Hoare triple {33767#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:17,286 INFO L273 TraceCheckUtils]: 139: Hoare triple {33767#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:17,287 INFO L273 TraceCheckUtils]: 140: Hoare triple {33767#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:17,287 INFO L273 TraceCheckUtils]: 141: Hoare triple {33768#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:17,288 INFO L273 TraceCheckUtils]: 142: Hoare triple {33768#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:17,288 INFO L273 TraceCheckUtils]: 143: Hoare triple {33768#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:17,289 INFO L273 TraceCheckUtils]: 144: Hoare triple {33769#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:17,289 INFO L273 TraceCheckUtils]: 145: Hoare triple {33769#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:17,290 INFO L273 TraceCheckUtils]: 146: Hoare triple {33769#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33770#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:17,291 INFO L273 TraceCheckUtils]: 147: Hoare triple {33770#(<= main_~i~0 48)} assume !(~i~0 < 100000); {33722#false} is VALID [2018-11-23 12:00:17,291 INFO L273 TraceCheckUtils]: 148: Hoare triple {33722#false} havoc ~x~0;~x~0 := 0; {33722#false} is VALID [2018-11-23 12:00:17,291 INFO L273 TraceCheckUtils]: 149: Hoare triple {33722#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {33722#false} is VALID [2018-11-23 12:00:17,291 INFO L256 TraceCheckUtils]: 150: Hoare triple {33722#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {33722#false} is VALID [2018-11-23 12:00:17,291 INFO L273 TraceCheckUtils]: 151: Hoare triple {33722#false} ~cond := #in~cond; {33722#false} is VALID [2018-11-23 12:00:17,292 INFO L273 TraceCheckUtils]: 152: Hoare triple {33722#false} assume 0 == ~cond; {33722#false} is VALID [2018-11-23 12:00:17,292 INFO L273 TraceCheckUtils]: 153: Hoare triple {33722#false} assume !false; {33722#false} is VALID [2018-11-23 12:00:17,307 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 12:00:17,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:17,308 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 12:00:17,324 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:00:17,521 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-11-23 12:00:17,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:17,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:17,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {33721#true} call ULTIMATE.init(); {33721#true} is VALID [2018-11-23 12:00:17,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {33721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33721#true} is VALID [2018-11-23 12:00:17,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {33721#true} assume true; {33721#true} is VALID [2018-11-23 12:00:17,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33721#true} {33721#true} #54#return; {33721#true} is VALID [2018-11-23 12:00:17,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {33721#true} call #t~ret6 := main(); {33721#true} is VALID [2018-11-23 12:00:17,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {33721#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:17,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {33723#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:17,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {33723#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:17,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {33723#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:17,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {33724#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:17,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {33724#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:17,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {33724#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:17,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {33725#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:17,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {33725#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:17,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {33725#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:17,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {33726#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:17,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {33726#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:17,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {33726#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:17,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {33727#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:17,863 INFO L273 TraceCheckUtils]: 19: Hoare triple {33727#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:17,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {33727#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:17,864 INFO L273 TraceCheckUtils]: 21: Hoare triple {33728#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:17,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {33728#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:17,865 INFO L273 TraceCheckUtils]: 23: Hoare triple {33728#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:17,866 INFO L273 TraceCheckUtils]: 24: Hoare triple {33729#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:17,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {33729#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:17,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {33729#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:17,867 INFO L273 TraceCheckUtils]: 27: Hoare triple {33730#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:17,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {33730#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:17,869 INFO L273 TraceCheckUtils]: 29: Hoare triple {33730#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:17,869 INFO L273 TraceCheckUtils]: 30: Hoare triple {33731#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:17,870 INFO L273 TraceCheckUtils]: 31: Hoare triple {33731#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:17,870 INFO L273 TraceCheckUtils]: 32: Hoare triple {33731#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:17,871 INFO L273 TraceCheckUtils]: 33: Hoare triple {33732#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:17,871 INFO L273 TraceCheckUtils]: 34: Hoare triple {33732#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:17,872 INFO L273 TraceCheckUtils]: 35: Hoare triple {33732#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:17,873 INFO L273 TraceCheckUtils]: 36: Hoare triple {33733#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:17,873 INFO L273 TraceCheckUtils]: 37: Hoare triple {33733#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:17,874 INFO L273 TraceCheckUtils]: 38: Hoare triple {33733#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:17,874 INFO L273 TraceCheckUtils]: 39: Hoare triple {33734#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:17,875 INFO L273 TraceCheckUtils]: 40: Hoare triple {33734#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:17,875 INFO L273 TraceCheckUtils]: 41: Hoare triple {33734#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:17,876 INFO L273 TraceCheckUtils]: 42: Hoare triple {33735#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:17,876 INFO L273 TraceCheckUtils]: 43: Hoare triple {33735#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:17,877 INFO L273 TraceCheckUtils]: 44: Hoare triple {33735#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:17,877 INFO L273 TraceCheckUtils]: 45: Hoare triple {33736#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:17,878 INFO L273 TraceCheckUtils]: 46: Hoare triple {33736#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:17,879 INFO L273 TraceCheckUtils]: 47: Hoare triple {33736#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:17,879 INFO L273 TraceCheckUtils]: 48: Hoare triple {33737#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:17,880 INFO L273 TraceCheckUtils]: 49: Hoare triple {33737#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:17,880 INFO L273 TraceCheckUtils]: 50: Hoare triple {33737#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:17,881 INFO L273 TraceCheckUtils]: 51: Hoare triple {33738#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:17,881 INFO L273 TraceCheckUtils]: 52: Hoare triple {33738#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:17,882 INFO L273 TraceCheckUtils]: 53: Hoare triple {33738#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:17,882 INFO L273 TraceCheckUtils]: 54: Hoare triple {33739#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:17,883 INFO L273 TraceCheckUtils]: 55: Hoare triple {33739#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:17,884 INFO L273 TraceCheckUtils]: 56: Hoare triple {33739#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:17,884 INFO L273 TraceCheckUtils]: 57: Hoare triple {33740#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:17,885 INFO L273 TraceCheckUtils]: 58: Hoare triple {33740#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:17,885 INFO L273 TraceCheckUtils]: 59: Hoare triple {33740#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:17,886 INFO L273 TraceCheckUtils]: 60: Hoare triple {33741#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:17,886 INFO L273 TraceCheckUtils]: 61: Hoare triple {33741#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:17,887 INFO L273 TraceCheckUtils]: 62: Hoare triple {33741#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:17,887 INFO L273 TraceCheckUtils]: 63: Hoare triple {33742#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:17,888 INFO L273 TraceCheckUtils]: 64: Hoare triple {33742#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:17,889 INFO L273 TraceCheckUtils]: 65: Hoare triple {33742#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:17,889 INFO L273 TraceCheckUtils]: 66: Hoare triple {33743#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:17,890 INFO L273 TraceCheckUtils]: 67: Hoare triple {33743#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:17,890 INFO L273 TraceCheckUtils]: 68: Hoare triple {33743#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:17,891 INFO L273 TraceCheckUtils]: 69: Hoare triple {33744#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:17,891 INFO L273 TraceCheckUtils]: 70: Hoare triple {33744#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:17,892 INFO L273 TraceCheckUtils]: 71: Hoare triple {33744#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:17,892 INFO L273 TraceCheckUtils]: 72: Hoare triple {33745#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:17,893 INFO L273 TraceCheckUtils]: 73: Hoare triple {33745#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:17,894 INFO L273 TraceCheckUtils]: 74: Hoare triple {33745#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:17,894 INFO L273 TraceCheckUtils]: 75: Hoare triple {33746#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:17,895 INFO L273 TraceCheckUtils]: 76: Hoare triple {33746#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:17,895 INFO L273 TraceCheckUtils]: 77: Hoare triple {33746#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:17,896 INFO L273 TraceCheckUtils]: 78: Hoare triple {33747#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:17,896 INFO L273 TraceCheckUtils]: 79: Hoare triple {33747#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:17,897 INFO L273 TraceCheckUtils]: 80: Hoare triple {33747#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:17,897 INFO L273 TraceCheckUtils]: 81: Hoare triple {33748#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:17,898 INFO L273 TraceCheckUtils]: 82: Hoare triple {33748#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:17,898 INFO L273 TraceCheckUtils]: 83: Hoare triple {33748#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:17,899 INFO L273 TraceCheckUtils]: 84: Hoare triple {33749#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:17,899 INFO L273 TraceCheckUtils]: 85: Hoare triple {33749#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:17,900 INFO L273 TraceCheckUtils]: 86: Hoare triple {33749#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:17,901 INFO L273 TraceCheckUtils]: 87: Hoare triple {33750#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:17,901 INFO L273 TraceCheckUtils]: 88: Hoare triple {33750#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:17,902 INFO L273 TraceCheckUtils]: 89: Hoare triple {33750#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:17,902 INFO L273 TraceCheckUtils]: 90: Hoare triple {33751#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:17,903 INFO L273 TraceCheckUtils]: 91: Hoare triple {33751#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:17,903 INFO L273 TraceCheckUtils]: 92: Hoare triple {33751#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:17,904 INFO L273 TraceCheckUtils]: 93: Hoare triple {33752#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:17,904 INFO L273 TraceCheckUtils]: 94: Hoare triple {33752#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:17,905 INFO L273 TraceCheckUtils]: 95: Hoare triple {33752#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:17,905 INFO L273 TraceCheckUtils]: 96: Hoare triple {33753#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:17,906 INFO L273 TraceCheckUtils]: 97: Hoare triple {33753#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:17,907 INFO L273 TraceCheckUtils]: 98: Hoare triple {33753#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:17,907 INFO L273 TraceCheckUtils]: 99: Hoare triple {33754#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:17,908 INFO L273 TraceCheckUtils]: 100: Hoare triple {33754#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:17,908 INFO L273 TraceCheckUtils]: 101: Hoare triple {33754#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:17,909 INFO L273 TraceCheckUtils]: 102: Hoare triple {33755#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:17,909 INFO L273 TraceCheckUtils]: 103: Hoare triple {33755#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:17,910 INFO L273 TraceCheckUtils]: 104: Hoare triple {33755#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:17,910 INFO L273 TraceCheckUtils]: 105: Hoare triple {33756#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:17,911 INFO L273 TraceCheckUtils]: 106: Hoare triple {33756#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:17,911 INFO L273 TraceCheckUtils]: 107: Hoare triple {33756#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:17,912 INFO L273 TraceCheckUtils]: 108: Hoare triple {33757#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:17,912 INFO L273 TraceCheckUtils]: 109: Hoare triple {33757#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:17,913 INFO L273 TraceCheckUtils]: 110: Hoare triple {33757#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:17,913 INFO L273 TraceCheckUtils]: 111: Hoare triple {33758#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:17,914 INFO L273 TraceCheckUtils]: 112: Hoare triple {33758#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:17,915 INFO L273 TraceCheckUtils]: 113: Hoare triple {33758#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:17,915 INFO L273 TraceCheckUtils]: 114: Hoare triple {33759#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:17,916 INFO L273 TraceCheckUtils]: 115: Hoare triple {33759#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:17,916 INFO L273 TraceCheckUtils]: 116: Hoare triple {33759#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:17,917 INFO L273 TraceCheckUtils]: 117: Hoare triple {33760#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:17,917 INFO L273 TraceCheckUtils]: 118: Hoare triple {33760#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:17,918 INFO L273 TraceCheckUtils]: 119: Hoare triple {33760#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:17,918 INFO L273 TraceCheckUtils]: 120: Hoare triple {33761#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:17,919 INFO L273 TraceCheckUtils]: 121: Hoare triple {33761#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:17,919 INFO L273 TraceCheckUtils]: 122: Hoare triple {33761#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:17,920 INFO L273 TraceCheckUtils]: 123: Hoare triple {33762#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:17,920 INFO L273 TraceCheckUtils]: 124: Hoare triple {33762#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:17,921 INFO L273 TraceCheckUtils]: 125: Hoare triple {33762#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:17,921 INFO L273 TraceCheckUtils]: 126: Hoare triple {33763#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:17,922 INFO L273 TraceCheckUtils]: 127: Hoare triple {33763#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:17,923 INFO L273 TraceCheckUtils]: 128: Hoare triple {33763#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:17,923 INFO L273 TraceCheckUtils]: 129: Hoare triple {33764#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:17,924 INFO L273 TraceCheckUtils]: 130: Hoare triple {33764#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:17,924 INFO L273 TraceCheckUtils]: 131: Hoare triple {33764#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:17,925 INFO L273 TraceCheckUtils]: 132: Hoare triple {33765#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:17,925 INFO L273 TraceCheckUtils]: 133: Hoare triple {33765#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:17,926 INFO L273 TraceCheckUtils]: 134: Hoare triple {33765#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:17,926 INFO L273 TraceCheckUtils]: 135: Hoare triple {33766#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:17,927 INFO L273 TraceCheckUtils]: 136: Hoare triple {33766#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:17,927 INFO L273 TraceCheckUtils]: 137: Hoare triple {33766#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:17,928 INFO L273 TraceCheckUtils]: 138: Hoare triple {33767#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:17,928 INFO L273 TraceCheckUtils]: 139: Hoare triple {33767#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:17,929 INFO L273 TraceCheckUtils]: 140: Hoare triple {33767#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:17,930 INFO L273 TraceCheckUtils]: 141: Hoare triple {33768#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:17,930 INFO L273 TraceCheckUtils]: 142: Hoare triple {33768#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:17,931 INFO L273 TraceCheckUtils]: 143: Hoare triple {33768#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:17,931 INFO L273 TraceCheckUtils]: 144: Hoare triple {33769#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:17,932 INFO L273 TraceCheckUtils]: 145: Hoare triple {33769#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {33769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:17,932 INFO L273 TraceCheckUtils]: 146: Hoare triple {33769#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33770#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:17,933 INFO L273 TraceCheckUtils]: 147: Hoare triple {33770#(<= main_~i~0 48)} assume !(~i~0 < 100000); {33722#false} is VALID [2018-11-23 12:00:17,933 INFO L273 TraceCheckUtils]: 148: Hoare triple {33722#false} havoc ~x~0;~x~0 := 0; {33722#false} is VALID [2018-11-23 12:00:17,933 INFO L273 TraceCheckUtils]: 149: Hoare triple {33722#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {33722#false} is VALID [2018-11-23 12:00:17,933 INFO L256 TraceCheckUtils]: 150: Hoare triple {33722#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {33722#false} is VALID [2018-11-23 12:00:17,934 INFO L273 TraceCheckUtils]: 151: Hoare triple {33722#false} ~cond := #in~cond; {33722#false} is VALID [2018-11-23 12:00:17,934 INFO L273 TraceCheckUtils]: 152: Hoare triple {33722#false} assume 0 == ~cond; {33722#false} is VALID [2018-11-23 12:00:17,934 INFO L273 TraceCheckUtils]: 153: Hoare triple {33722#false} assume !false; {33722#false} is VALID [2018-11-23 12:00:17,949 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 12:00:17,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:17,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-11-23 12:00:17,968 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 154 [2018-11-23 12:00:17,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:17,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:00:18,119 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 12:00:18,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:00:18,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:00:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:00:18,120 INFO L87 Difference]: Start difference. First operand 159 states and 207 transitions. Second operand 50 states. [2018-11-23 12:00:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:19,046 INFO L93 Difference]: Finished difference Result 175 states and 226 transitions. [2018-11-23 12:00:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 12:00:19,046 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 154 [2018-11-23 12:00:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:00:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 226 transitions. [2018-11-23 12:00:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:00:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 226 transitions. [2018-11-23 12:00:19,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 226 transitions. [2018-11-23 12:00:19,249 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 12:00:19,252 INFO L225 Difference]: With dead ends: 175 [2018-11-23 12:00:19,252 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 12:00:19,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:00:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 12:00:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-11-23 12:00:19,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:19,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 162 states. [2018-11-23 12:00:19,329 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 162 states. [2018-11-23 12:00:19,330 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 162 states. [2018-11-23 12:00:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:19,332 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2018-11-23 12:00:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2018-11-23 12:00:19,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:19,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:19,333 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 164 states. [2018-11-23 12:00:19,333 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 164 states. [2018-11-23 12:00:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:19,335 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2018-11-23 12:00:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2018-11-23 12:00:19,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:19,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:19,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:19,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 12:00:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2018-11-23 12:00:19,339 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 154 [2018-11-23 12:00:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:19,339 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2018-11-23 12:00:19,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:00:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2018-11-23 12:00:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 12:00:19,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:19,340 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:19,340 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:19,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:19,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1636075657, now seen corresponding path program 48 times [2018-11-23 12:00:19,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:19,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:19,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:20,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {35012#true} call ULTIMATE.init(); {35012#true} is VALID [2018-11-23 12:00:20,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {35012#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35012#true} is VALID [2018-11-23 12:00:20,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {35012#true} assume true; {35012#true} is VALID [2018-11-23 12:00:20,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35012#true} {35012#true} #54#return; {35012#true} is VALID [2018-11-23 12:00:20,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {35012#true} call #t~ret6 := main(); {35012#true} is VALID [2018-11-23 12:00:20,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {35012#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {35014#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:20,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {35014#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35014#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:20,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {35014#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35014#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:20,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {35014#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35015#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:20,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {35015#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35015#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:20,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {35015#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35015#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:20,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {35015#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35016#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:20,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {35016#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35016#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:20,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {35016#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35016#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:20,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {35016#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35017#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:20,770 INFO L273 TraceCheckUtils]: 15: Hoare triple {35017#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35017#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:20,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {35017#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35017#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:20,771 INFO L273 TraceCheckUtils]: 17: Hoare triple {35017#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35018#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:20,772 INFO L273 TraceCheckUtils]: 18: Hoare triple {35018#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35018#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:20,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {35018#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35018#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:20,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {35018#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35019#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:20,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {35019#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35019#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:20,774 INFO L273 TraceCheckUtils]: 22: Hoare triple {35019#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35019#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:20,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {35019#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35020#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:20,775 INFO L273 TraceCheckUtils]: 24: Hoare triple {35020#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35020#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:20,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {35020#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35020#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:20,776 INFO L273 TraceCheckUtils]: 26: Hoare triple {35020#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35021#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:20,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {35021#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35021#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:20,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {35021#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35021#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:20,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {35021#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35022#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:20,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {35022#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35022#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:20,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {35022#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35022#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:20,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {35022#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35023#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:20,780 INFO L273 TraceCheckUtils]: 33: Hoare triple {35023#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35023#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:20,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {35023#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35023#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:20,781 INFO L273 TraceCheckUtils]: 35: Hoare triple {35023#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35024#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:20,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {35024#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35024#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:20,782 INFO L273 TraceCheckUtils]: 37: Hoare triple {35024#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35024#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:20,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {35024#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35025#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:20,783 INFO L273 TraceCheckUtils]: 39: Hoare triple {35025#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35025#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:20,784 INFO L273 TraceCheckUtils]: 40: Hoare triple {35025#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35025#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:20,785 INFO L273 TraceCheckUtils]: 41: Hoare triple {35025#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35026#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:20,785 INFO L273 TraceCheckUtils]: 42: Hoare triple {35026#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35026#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:20,786 INFO L273 TraceCheckUtils]: 43: Hoare triple {35026#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35026#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:20,786 INFO L273 TraceCheckUtils]: 44: Hoare triple {35026#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35027#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:20,787 INFO L273 TraceCheckUtils]: 45: Hoare triple {35027#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35027#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:20,787 INFO L273 TraceCheckUtils]: 46: Hoare triple {35027#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35027#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:20,788 INFO L273 TraceCheckUtils]: 47: Hoare triple {35027#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35028#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:20,789 INFO L273 TraceCheckUtils]: 48: Hoare triple {35028#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35028#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:20,789 INFO L273 TraceCheckUtils]: 49: Hoare triple {35028#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35028#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:20,790 INFO L273 TraceCheckUtils]: 50: Hoare triple {35028#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35029#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:20,790 INFO L273 TraceCheckUtils]: 51: Hoare triple {35029#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35029#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:20,791 INFO L273 TraceCheckUtils]: 52: Hoare triple {35029#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35029#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:20,791 INFO L273 TraceCheckUtils]: 53: Hoare triple {35029#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35030#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:20,792 INFO L273 TraceCheckUtils]: 54: Hoare triple {35030#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35030#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:20,792 INFO L273 TraceCheckUtils]: 55: Hoare triple {35030#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35030#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:20,793 INFO L273 TraceCheckUtils]: 56: Hoare triple {35030#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35031#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:20,793 INFO L273 TraceCheckUtils]: 57: Hoare triple {35031#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35031#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:20,794 INFO L273 TraceCheckUtils]: 58: Hoare triple {35031#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35031#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:20,795 INFO L273 TraceCheckUtils]: 59: Hoare triple {35031#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35032#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:20,795 INFO L273 TraceCheckUtils]: 60: Hoare triple {35032#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35032#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:20,796 INFO L273 TraceCheckUtils]: 61: Hoare triple {35032#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35032#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:20,796 INFO L273 TraceCheckUtils]: 62: Hoare triple {35032#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35033#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:20,797 INFO L273 TraceCheckUtils]: 63: Hoare triple {35033#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35033#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:20,797 INFO L273 TraceCheckUtils]: 64: Hoare triple {35033#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35033#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:20,798 INFO L273 TraceCheckUtils]: 65: Hoare triple {35033#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35034#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:20,798 INFO L273 TraceCheckUtils]: 66: Hoare triple {35034#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35034#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:20,799 INFO L273 TraceCheckUtils]: 67: Hoare triple {35034#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35034#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:20,800 INFO L273 TraceCheckUtils]: 68: Hoare triple {35034#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35035#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:20,800 INFO L273 TraceCheckUtils]: 69: Hoare triple {35035#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35035#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:20,801 INFO L273 TraceCheckUtils]: 70: Hoare triple {35035#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35035#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:20,801 INFO L273 TraceCheckUtils]: 71: Hoare triple {35035#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35036#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:20,802 INFO L273 TraceCheckUtils]: 72: Hoare triple {35036#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35036#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:20,802 INFO L273 TraceCheckUtils]: 73: Hoare triple {35036#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35036#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:20,803 INFO L273 TraceCheckUtils]: 74: Hoare triple {35036#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35037#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:20,804 INFO L273 TraceCheckUtils]: 75: Hoare triple {35037#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35037#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:20,804 INFO L273 TraceCheckUtils]: 76: Hoare triple {35037#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35037#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:20,805 INFO L273 TraceCheckUtils]: 77: Hoare triple {35037#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35038#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:20,805 INFO L273 TraceCheckUtils]: 78: Hoare triple {35038#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35038#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:20,806 INFO L273 TraceCheckUtils]: 79: Hoare triple {35038#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35038#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:20,806 INFO L273 TraceCheckUtils]: 80: Hoare triple {35038#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35039#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:20,807 INFO L273 TraceCheckUtils]: 81: Hoare triple {35039#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35039#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:20,807 INFO L273 TraceCheckUtils]: 82: Hoare triple {35039#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35039#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:20,808 INFO L273 TraceCheckUtils]: 83: Hoare triple {35039#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35040#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:20,809 INFO L273 TraceCheckUtils]: 84: Hoare triple {35040#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35040#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:20,809 INFO L273 TraceCheckUtils]: 85: Hoare triple {35040#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35040#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:20,810 INFO L273 TraceCheckUtils]: 86: Hoare triple {35040#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35041#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:20,810 INFO L273 TraceCheckUtils]: 87: Hoare triple {35041#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35041#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:20,811 INFO L273 TraceCheckUtils]: 88: Hoare triple {35041#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35041#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:20,811 INFO L273 TraceCheckUtils]: 89: Hoare triple {35041#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35042#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:20,812 INFO L273 TraceCheckUtils]: 90: Hoare triple {35042#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35042#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:20,812 INFO L273 TraceCheckUtils]: 91: Hoare triple {35042#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35042#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:20,813 INFO L273 TraceCheckUtils]: 92: Hoare triple {35042#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35043#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:20,814 INFO L273 TraceCheckUtils]: 93: Hoare triple {35043#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35043#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:20,814 INFO L273 TraceCheckUtils]: 94: Hoare triple {35043#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35043#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:20,815 INFO L273 TraceCheckUtils]: 95: Hoare triple {35043#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35044#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:20,815 INFO L273 TraceCheckUtils]: 96: Hoare triple {35044#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35044#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:20,816 INFO L273 TraceCheckUtils]: 97: Hoare triple {35044#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35044#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:20,816 INFO L273 TraceCheckUtils]: 98: Hoare triple {35044#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35045#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:20,817 INFO L273 TraceCheckUtils]: 99: Hoare triple {35045#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35045#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:20,817 INFO L273 TraceCheckUtils]: 100: Hoare triple {35045#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35045#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:20,818 INFO L273 TraceCheckUtils]: 101: Hoare triple {35045#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35046#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:20,819 INFO L273 TraceCheckUtils]: 102: Hoare triple {35046#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35046#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:20,819 INFO L273 TraceCheckUtils]: 103: Hoare triple {35046#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35046#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:20,820 INFO L273 TraceCheckUtils]: 104: Hoare triple {35046#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35047#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:20,820 INFO L273 TraceCheckUtils]: 105: Hoare triple {35047#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35047#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:20,821 INFO L273 TraceCheckUtils]: 106: Hoare triple {35047#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35047#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:20,822 INFO L273 TraceCheckUtils]: 107: Hoare triple {35047#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35048#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:20,822 INFO L273 TraceCheckUtils]: 108: Hoare triple {35048#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35048#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:20,823 INFO L273 TraceCheckUtils]: 109: Hoare triple {35048#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35048#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:20,823 INFO L273 TraceCheckUtils]: 110: Hoare triple {35048#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35049#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:20,824 INFO L273 TraceCheckUtils]: 111: Hoare triple {35049#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35049#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:20,824 INFO L273 TraceCheckUtils]: 112: Hoare triple {35049#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35049#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:20,825 INFO L273 TraceCheckUtils]: 113: Hoare triple {35049#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35050#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:20,825 INFO L273 TraceCheckUtils]: 114: Hoare triple {35050#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35050#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:20,826 INFO L273 TraceCheckUtils]: 115: Hoare triple {35050#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35050#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:20,827 INFO L273 TraceCheckUtils]: 116: Hoare triple {35050#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35051#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:20,827 INFO L273 TraceCheckUtils]: 117: Hoare triple {35051#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35051#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:20,828 INFO L273 TraceCheckUtils]: 118: Hoare triple {35051#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35051#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:20,828 INFO L273 TraceCheckUtils]: 119: Hoare triple {35051#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35052#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:20,829 INFO L273 TraceCheckUtils]: 120: Hoare triple {35052#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35052#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:20,829 INFO L273 TraceCheckUtils]: 121: Hoare triple {35052#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35052#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:20,830 INFO L273 TraceCheckUtils]: 122: Hoare triple {35052#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35053#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:20,831 INFO L273 TraceCheckUtils]: 123: Hoare triple {35053#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35053#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:20,831 INFO L273 TraceCheckUtils]: 124: Hoare triple {35053#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35053#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:20,832 INFO L273 TraceCheckUtils]: 125: Hoare triple {35053#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35054#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:20,832 INFO L273 TraceCheckUtils]: 126: Hoare triple {35054#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35054#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:20,833 INFO L273 TraceCheckUtils]: 127: Hoare triple {35054#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35054#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:20,833 INFO L273 TraceCheckUtils]: 128: Hoare triple {35054#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35055#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:20,834 INFO L273 TraceCheckUtils]: 129: Hoare triple {35055#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35055#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:20,834 INFO L273 TraceCheckUtils]: 130: Hoare triple {35055#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35055#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:20,835 INFO L273 TraceCheckUtils]: 131: Hoare triple {35055#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35056#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:20,836 INFO L273 TraceCheckUtils]: 132: Hoare triple {35056#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35056#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:20,836 INFO L273 TraceCheckUtils]: 133: Hoare triple {35056#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35056#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:20,837 INFO L273 TraceCheckUtils]: 134: Hoare triple {35056#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35057#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:20,837 INFO L273 TraceCheckUtils]: 135: Hoare triple {35057#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35057#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:20,838 INFO L273 TraceCheckUtils]: 136: Hoare triple {35057#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35057#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:20,838 INFO L273 TraceCheckUtils]: 137: Hoare triple {35057#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35058#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:20,839 INFO L273 TraceCheckUtils]: 138: Hoare triple {35058#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35058#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:20,839 INFO L273 TraceCheckUtils]: 139: Hoare triple {35058#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35058#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:20,840 INFO L273 TraceCheckUtils]: 140: Hoare triple {35058#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35059#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:20,840 INFO L273 TraceCheckUtils]: 141: Hoare triple {35059#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35059#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:20,841 INFO L273 TraceCheckUtils]: 142: Hoare triple {35059#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35059#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:20,842 INFO L273 TraceCheckUtils]: 143: Hoare triple {35059#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35060#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:20,842 INFO L273 TraceCheckUtils]: 144: Hoare triple {35060#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35060#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:20,843 INFO L273 TraceCheckUtils]: 145: Hoare triple {35060#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35060#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:20,843 INFO L273 TraceCheckUtils]: 146: Hoare triple {35060#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35061#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:20,844 INFO L273 TraceCheckUtils]: 147: Hoare triple {35061#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35061#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:20,844 INFO L273 TraceCheckUtils]: 148: Hoare triple {35061#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35061#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:20,845 INFO L273 TraceCheckUtils]: 149: Hoare triple {35061#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35062#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:20,846 INFO L273 TraceCheckUtils]: 150: Hoare triple {35062#(<= main_~i~0 49)} assume !(~i~0 < 100000); {35013#false} is VALID [2018-11-23 12:00:20,846 INFO L273 TraceCheckUtils]: 151: Hoare triple {35013#false} havoc ~x~0;~x~0 := 0; {35013#false} is VALID [2018-11-23 12:00:20,846 INFO L273 TraceCheckUtils]: 152: Hoare triple {35013#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {35013#false} is VALID [2018-11-23 12:00:20,846 INFO L256 TraceCheckUtils]: 153: Hoare triple {35013#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {35013#false} is VALID [2018-11-23 12:00:20,846 INFO L273 TraceCheckUtils]: 154: Hoare triple {35013#false} ~cond := #in~cond; {35013#false} is VALID [2018-11-23 12:00:20,846 INFO L273 TraceCheckUtils]: 155: Hoare triple {35013#false} assume 0 == ~cond; {35013#false} is VALID [2018-11-23 12:00:20,847 INFO L273 TraceCheckUtils]: 156: Hoare triple {35013#false} assume !false; {35013#false} is VALID [2018-11-23 12:00:20,862 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 12:00:20,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:20,862 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 12:00:20,870 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:21,414 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-11-23 12:00:21,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:21,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:22,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {35012#true} call ULTIMATE.init(); {35012#true} is VALID [2018-11-23 12:00:22,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {35012#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35012#true} is VALID [2018-11-23 12:00:22,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {35012#true} assume true; {35012#true} is VALID [2018-11-23 12:00:22,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35012#true} {35012#true} #54#return; {35012#true} is VALID [2018-11-23 12:00:22,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {35012#true} call #t~ret6 := main(); {35012#true} is VALID [2018-11-23 12:00:22,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {35012#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {35014#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:22,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {35014#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35014#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:22,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {35014#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35014#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:22,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {35014#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35015#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:22,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {35015#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35015#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:22,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {35015#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35015#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:22,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {35015#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35016#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:22,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {35016#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35016#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:22,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {35016#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35016#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:22,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {35016#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35017#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:22,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {35017#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35017#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:22,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {35017#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35017#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:22,337 INFO L273 TraceCheckUtils]: 17: Hoare triple {35017#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35018#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:22,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {35018#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35018#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:22,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {35018#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35018#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:22,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {35018#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35019#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:22,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {35019#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35019#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:22,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {35019#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35019#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:22,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {35019#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35020#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:22,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {35020#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35020#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:22,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {35020#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35020#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:22,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {35020#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35021#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:22,342 INFO L273 TraceCheckUtils]: 27: Hoare triple {35021#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35021#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:22,343 INFO L273 TraceCheckUtils]: 28: Hoare triple {35021#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35021#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:22,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {35021#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35022#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:22,344 INFO L273 TraceCheckUtils]: 30: Hoare triple {35022#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35022#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:22,344 INFO L273 TraceCheckUtils]: 31: Hoare triple {35022#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35022#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:22,345 INFO L273 TraceCheckUtils]: 32: Hoare triple {35022#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35023#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:22,346 INFO L273 TraceCheckUtils]: 33: Hoare triple {35023#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35023#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:22,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {35023#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35023#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:22,347 INFO L273 TraceCheckUtils]: 35: Hoare triple {35023#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35024#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:22,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {35024#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35024#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:22,348 INFO L273 TraceCheckUtils]: 37: Hoare triple {35024#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35024#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:22,349 INFO L273 TraceCheckUtils]: 38: Hoare triple {35024#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35025#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:22,349 INFO L273 TraceCheckUtils]: 39: Hoare triple {35025#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35025#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:22,350 INFO L273 TraceCheckUtils]: 40: Hoare triple {35025#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35025#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:22,350 INFO L273 TraceCheckUtils]: 41: Hoare triple {35025#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35026#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:22,351 INFO L273 TraceCheckUtils]: 42: Hoare triple {35026#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35026#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:22,351 INFO L273 TraceCheckUtils]: 43: Hoare triple {35026#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35026#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:22,352 INFO L273 TraceCheckUtils]: 44: Hoare triple {35026#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35027#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:22,353 INFO L273 TraceCheckUtils]: 45: Hoare triple {35027#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35027#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:22,353 INFO L273 TraceCheckUtils]: 46: Hoare triple {35027#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35027#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:22,354 INFO L273 TraceCheckUtils]: 47: Hoare triple {35027#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35028#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:22,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {35028#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35028#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:22,355 INFO L273 TraceCheckUtils]: 49: Hoare triple {35028#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35028#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:22,356 INFO L273 TraceCheckUtils]: 50: Hoare triple {35028#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35029#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:22,356 INFO L273 TraceCheckUtils]: 51: Hoare triple {35029#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35029#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:22,357 INFO L273 TraceCheckUtils]: 52: Hoare triple {35029#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35029#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:22,357 INFO L273 TraceCheckUtils]: 53: Hoare triple {35029#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35030#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:22,358 INFO L273 TraceCheckUtils]: 54: Hoare triple {35030#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35030#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:22,358 INFO L273 TraceCheckUtils]: 55: Hoare triple {35030#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35030#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:22,359 INFO L273 TraceCheckUtils]: 56: Hoare triple {35030#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35031#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:22,360 INFO L273 TraceCheckUtils]: 57: Hoare triple {35031#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35031#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:22,360 INFO L273 TraceCheckUtils]: 58: Hoare triple {35031#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35031#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:22,361 INFO L273 TraceCheckUtils]: 59: Hoare triple {35031#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35032#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:22,361 INFO L273 TraceCheckUtils]: 60: Hoare triple {35032#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35032#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:22,362 INFO L273 TraceCheckUtils]: 61: Hoare triple {35032#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35032#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:22,362 INFO L273 TraceCheckUtils]: 62: Hoare triple {35032#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35033#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:22,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {35033#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35033#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:22,363 INFO L273 TraceCheckUtils]: 64: Hoare triple {35033#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35033#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:22,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {35033#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35034#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:22,365 INFO L273 TraceCheckUtils]: 66: Hoare triple {35034#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35034#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:22,365 INFO L273 TraceCheckUtils]: 67: Hoare triple {35034#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35034#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:22,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {35034#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35035#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:22,366 INFO L273 TraceCheckUtils]: 69: Hoare triple {35035#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35035#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:22,367 INFO L273 TraceCheckUtils]: 70: Hoare triple {35035#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35035#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:22,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {35035#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35036#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:22,368 INFO L273 TraceCheckUtils]: 72: Hoare triple {35036#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35036#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:22,369 INFO L273 TraceCheckUtils]: 73: Hoare triple {35036#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35036#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:22,369 INFO L273 TraceCheckUtils]: 74: Hoare triple {35036#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35037#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:22,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {35037#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35037#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:22,370 INFO L273 TraceCheckUtils]: 76: Hoare triple {35037#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35037#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:22,371 INFO L273 TraceCheckUtils]: 77: Hoare triple {35037#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35038#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:22,372 INFO L273 TraceCheckUtils]: 78: Hoare triple {35038#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35038#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:22,372 INFO L273 TraceCheckUtils]: 79: Hoare triple {35038#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35038#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:22,373 INFO L273 TraceCheckUtils]: 80: Hoare triple {35038#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35039#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:22,373 INFO L273 TraceCheckUtils]: 81: Hoare triple {35039#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35039#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:22,374 INFO L273 TraceCheckUtils]: 82: Hoare triple {35039#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35039#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:22,375 INFO L273 TraceCheckUtils]: 83: Hoare triple {35039#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35040#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:22,375 INFO L273 TraceCheckUtils]: 84: Hoare triple {35040#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35040#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:22,376 INFO L273 TraceCheckUtils]: 85: Hoare triple {35040#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35040#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:22,376 INFO L273 TraceCheckUtils]: 86: Hoare triple {35040#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35041#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:22,377 INFO L273 TraceCheckUtils]: 87: Hoare triple {35041#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35041#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:22,377 INFO L273 TraceCheckUtils]: 88: Hoare triple {35041#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35041#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:22,378 INFO L273 TraceCheckUtils]: 89: Hoare triple {35041#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35042#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:22,379 INFO L273 TraceCheckUtils]: 90: Hoare triple {35042#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35042#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:22,379 INFO L273 TraceCheckUtils]: 91: Hoare triple {35042#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35042#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:22,380 INFO L273 TraceCheckUtils]: 92: Hoare triple {35042#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35043#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:22,380 INFO L273 TraceCheckUtils]: 93: Hoare triple {35043#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35043#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:22,381 INFO L273 TraceCheckUtils]: 94: Hoare triple {35043#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35043#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:22,381 INFO L273 TraceCheckUtils]: 95: Hoare triple {35043#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35044#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:22,382 INFO L273 TraceCheckUtils]: 96: Hoare triple {35044#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35044#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:22,382 INFO L273 TraceCheckUtils]: 97: Hoare triple {35044#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35044#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:22,383 INFO L273 TraceCheckUtils]: 98: Hoare triple {35044#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35045#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:22,384 INFO L273 TraceCheckUtils]: 99: Hoare triple {35045#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35045#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:22,384 INFO L273 TraceCheckUtils]: 100: Hoare triple {35045#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35045#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:22,385 INFO L273 TraceCheckUtils]: 101: Hoare triple {35045#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35046#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:22,385 INFO L273 TraceCheckUtils]: 102: Hoare triple {35046#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35046#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:22,386 INFO L273 TraceCheckUtils]: 103: Hoare triple {35046#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35046#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:22,387 INFO L273 TraceCheckUtils]: 104: Hoare triple {35046#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35047#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:22,387 INFO L273 TraceCheckUtils]: 105: Hoare triple {35047#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35047#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:22,388 INFO L273 TraceCheckUtils]: 106: Hoare triple {35047#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35047#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:22,388 INFO L273 TraceCheckUtils]: 107: Hoare triple {35047#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35048#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:22,389 INFO L273 TraceCheckUtils]: 108: Hoare triple {35048#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35048#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:22,389 INFO L273 TraceCheckUtils]: 109: Hoare triple {35048#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35048#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:22,390 INFO L273 TraceCheckUtils]: 110: Hoare triple {35048#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35049#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:22,391 INFO L273 TraceCheckUtils]: 111: Hoare triple {35049#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35049#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:22,391 INFO L273 TraceCheckUtils]: 112: Hoare triple {35049#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35049#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:22,392 INFO L273 TraceCheckUtils]: 113: Hoare triple {35049#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35050#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:22,392 INFO L273 TraceCheckUtils]: 114: Hoare triple {35050#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35050#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:22,393 INFO L273 TraceCheckUtils]: 115: Hoare triple {35050#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35050#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:22,393 INFO L273 TraceCheckUtils]: 116: Hoare triple {35050#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35051#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:22,394 INFO L273 TraceCheckUtils]: 117: Hoare triple {35051#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35051#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:22,394 INFO L273 TraceCheckUtils]: 118: Hoare triple {35051#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35051#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:22,395 INFO L273 TraceCheckUtils]: 119: Hoare triple {35051#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35052#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:22,396 INFO L273 TraceCheckUtils]: 120: Hoare triple {35052#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35052#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:22,396 INFO L273 TraceCheckUtils]: 121: Hoare triple {35052#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35052#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:22,397 INFO L273 TraceCheckUtils]: 122: Hoare triple {35052#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35053#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:22,397 INFO L273 TraceCheckUtils]: 123: Hoare triple {35053#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35053#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:22,398 INFO L273 TraceCheckUtils]: 124: Hoare triple {35053#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35053#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:22,399 INFO L273 TraceCheckUtils]: 125: Hoare triple {35053#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35054#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:22,399 INFO L273 TraceCheckUtils]: 126: Hoare triple {35054#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35054#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:22,400 INFO L273 TraceCheckUtils]: 127: Hoare triple {35054#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35054#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:22,400 INFO L273 TraceCheckUtils]: 128: Hoare triple {35054#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35055#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:22,401 INFO L273 TraceCheckUtils]: 129: Hoare triple {35055#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35055#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:22,401 INFO L273 TraceCheckUtils]: 130: Hoare triple {35055#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35055#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:22,402 INFO L273 TraceCheckUtils]: 131: Hoare triple {35055#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35056#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:22,403 INFO L273 TraceCheckUtils]: 132: Hoare triple {35056#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35056#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:22,403 INFO L273 TraceCheckUtils]: 133: Hoare triple {35056#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35056#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:22,404 INFO L273 TraceCheckUtils]: 134: Hoare triple {35056#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35057#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:22,404 INFO L273 TraceCheckUtils]: 135: Hoare triple {35057#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35057#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:22,405 INFO L273 TraceCheckUtils]: 136: Hoare triple {35057#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35057#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:22,406 INFO L273 TraceCheckUtils]: 137: Hoare triple {35057#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35058#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:22,406 INFO L273 TraceCheckUtils]: 138: Hoare triple {35058#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35058#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:22,407 INFO L273 TraceCheckUtils]: 139: Hoare triple {35058#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35058#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:22,407 INFO L273 TraceCheckUtils]: 140: Hoare triple {35058#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35059#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:22,408 INFO L273 TraceCheckUtils]: 141: Hoare triple {35059#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35059#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:22,408 INFO L273 TraceCheckUtils]: 142: Hoare triple {35059#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35059#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:22,409 INFO L273 TraceCheckUtils]: 143: Hoare triple {35059#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35060#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:22,410 INFO L273 TraceCheckUtils]: 144: Hoare triple {35060#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35060#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:22,410 INFO L273 TraceCheckUtils]: 145: Hoare triple {35060#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35060#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:22,411 INFO L273 TraceCheckUtils]: 146: Hoare triple {35060#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35061#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:22,411 INFO L273 TraceCheckUtils]: 147: Hoare triple {35061#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {35061#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:22,412 INFO L273 TraceCheckUtils]: 148: Hoare triple {35061#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {35061#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:22,412 INFO L273 TraceCheckUtils]: 149: Hoare triple {35061#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35062#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:22,413 INFO L273 TraceCheckUtils]: 150: Hoare triple {35062#(<= main_~i~0 49)} assume !(~i~0 < 100000); {35013#false} is VALID [2018-11-23 12:00:22,413 INFO L273 TraceCheckUtils]: 151: Hoare triple {35013#false} havoc ~x~0;~x~0 := 0; {35013#false} is VALID [2018-11-23 12:00:22,413 INFO L273 TraceCheckUtils]: 152: Hoare triple {35013#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {35013#false} is VALID [2018-11-23 12:00:22,414 INFO L256 TraceCheckUtils]: 153: Hoare triple {35013#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {35013#false} is VALID [2018-11-23 12:00:22,414 INFO L273 TraceCheckUtils]: 154: Hoare triple {35013#false} ~cond := #in~cond; {35013#false} is VALID [2018-11-23 12:00:22,414 INFO L273 TraceCheckUtils]: 155: Hoare triple {35013#false} assume 0 == ~cond; {35013#false} is VALID [2018-11-23 12:00:22,414 INFO L273 TraceCheckUtils]: 156: Hoare triple {35013#false} assume !false; {35013#false} is VALID [2018-11-23 12:00:22,446 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 12:00:22,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:22,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-11-23 12:00:22,466 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 157 [2018-11-23 12:00:22,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:22,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:00:22,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:22,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:00:22,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:00:22,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:00:22,624 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand 51 states. [2018-11-23 12:00:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:23,682 INFO L93 Difference]: Finished difference Result 178 states and 230 transitions. [2018-11-23 12:00:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:00:23,683 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 157 [2018-11-23 12:00:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:00:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 230 transitions. [2018-11-23 12:00:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:00:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 230 transitions. [2018-11-23 12:00:23,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 230 transitions. [2018-11-23 12:00:23,903 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 12:00:23,906 INFO L225 Difference]: With dead ends: 178 [2018-11-23 12:00:23,906 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 12:00:23,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:00:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 12:00:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-23 12:00:23,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:23,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 165 states. [2018-11-23 12:00:23,948 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 165 states. [2018-11-23 12:00:23,948 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 165 states. [2018-11-23 12:00:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:23,951 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2018-11-23 12:00:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2018-11-23 12:00:23,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:23,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:23,952 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 167 states. [2018-11-23 12:00:23,952 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 167 states. [2018-11-23 12:00:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:23,954 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2018-11-23 12:00:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2018-11-23 12:00:23,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:23,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:23,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:23,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 12:00:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 215 transitions. [2018-11-23 12:00:23,957 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 215 transitions. Word has length 157 [2018-11-23 12:00:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:23,957 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 215 transitions. [2018-11-23 12:00:23,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:00:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 215 transitions. [2018-11-23 12:00:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:00:23,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:23,958 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:23,958 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:23,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:23,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1995657852, now seen corresponding path program 49 times [2018-11-23 12:00:23,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:23,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:23,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:23,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:23,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:25,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {36327#true} call ULTIMATE.init(); {36327#true} is VALID [2018-11-23 12:00:25,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {36327#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36327#true} is VALID [2018-11-23 12:00:25,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {36327#true} assume true; {36327#true} is VALID [2018-11-23 12:00:25,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36327#true} {36327#true} #54#return; {36327#true} is VALID [2018-11-23 12:00:25,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {36327#true} call #t~ret6 := main(); {36327#true} is VALID [2018-11-23 12:00:25,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {36327#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36329#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:25,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {36329#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36329#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:25,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {36329#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36329#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:25,656 INFO L273 TraceCheckUtils]: 8: Hoare triple {36329#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36330#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:25,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {36330#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36330#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:25,657 INFO L273 TraceCheckUtils]: 10: Hoare triple {36330#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36330#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:25,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {36330#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36331#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:25,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {36331#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36331#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:25,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {36331#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36331#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:25,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {36331#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36332#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:25,660 INFO L273 TraceCheckUtils]: 15: Hoare triple {36332#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36332#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:25,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {36332#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36332#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:25,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {36332#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36333#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:25,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {36333#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36333#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:25,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {36333#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36333#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:25,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {36333#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36334#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:25,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {36334#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36334#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:25,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {36334#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36334#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:25,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {36334#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36335#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:25,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {36335#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36335#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:25,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {36335#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36335#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:25,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {36335#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36336#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:25,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {36336#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36336#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:25,667 INFO L273 TraceCheckUtils]: 28: Hoare triple {36336#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36336#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:25,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {36336#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36337#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:25,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {36337#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36337#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:25,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {36337#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36337#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:25,669 INFO L273 TraceCheckUtils]: 32: Hoare triple {36337#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36338#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:25,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {36338#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36338#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:25,670 INFO L273 TraceCheckUtils]: 34: Hoare triple {36338#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36338#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:25,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {36338#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36339#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:25,672 INFO L273 TraceCheckUtils]: 36: Hoare triple {36339#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36339#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:25,672 INFO L273 TraceCheckUtils]: 37: Hoare triple {36339#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36339#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:25,673 INFO L273 TraceCheckUtils]: 38: Hoare triple {36339#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36340#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:25,673 INFO L273 TraceCheckUtils]: 39: Hoare triple {36340#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36340#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:25,674 INFO L273 TraceCheckUtils]: 40: Hoare triple {36340#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36340#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:25,675 INFO L273 TraceCheckUtils]: 41: Hoare triple {36340#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36341#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:25,675 INFO L273 TraceCheckUtils]: 42: Hoare triple {36341#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36341#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:25,676 INFO L273 TraceCheckUtils]: 43: Hoare triple {36341#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36341#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:25,676 INFO L273 TraceCheckUtils]: 44: Hoare triple {36341#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36342#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:25,677 INFO L273 TraceCheckUtils]: 45: Hoare triple {36342#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36342#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:25,677 INFO L273 TraceCheckUtils]: 46: Hoare triple {36342#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36342#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:25,678 INFO L273 TraceCheckUtils]: 47: Hoare triple {36342#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36343#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:25,679 INFO L273 TraceCheckUtils]: 48: Hoare triple {36343#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36343#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:25,679 INFO L273 TraceCheckUtils]: 49: Hoare triple {36343#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36343#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:25,680 INFO L273 TraceCheckUtils]: 50: Hoare triple {36343#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36344#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:25,680 INFO L273 TraceCheckUtils]: 51: Hoare triple {36344#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36344#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:25,681 INFO L273 TraceCheckUtils]: 52: Hoare triple {36344#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36344#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:25,682 INFO L273 TraceCheckUtils]: 53: Hoare triple {36344#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36345#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:25,682 INFO L273 TraceCheckUtils]: 54: Hoare triple {36345#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36345#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:25,683 INFO L273 TraceCheckUtils]: 55: Hoare triple {36345#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36345#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:25,683 INFO L273 TraceCheckUtils]: 56: Hoare triple {36345#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36346#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:25,684 INFO L273 TraceCheckUtils]: 57: Hoare triple {36346#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36346#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:25,684 INFO L273 TraceCheckUtils]: 58: Hoare triple {36346#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36346#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:25,685 INFO L273 TraceCheckUtils]: 59: Hoare triple {36346#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36347#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:25,686 INFO L273 TraceCheckUtils]: 60: Hoare triple {36347#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36347#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:25,686 INFO L273 TraceCheckUtils]: 61: Hoare triple {36347#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36347#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:25,687 INFO L273 TraceCheckUtils]: 62: Hoare triple {36347#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36348#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:25,687 INFO L273 TraceCheckUtils]: 63: Hoare triple {36348#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36348#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:25,688 INFO L273 TraceCheckUtils]: 64: Hoare triple {36348#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36348#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:25,688 INFO L273 TraceCheckUtils]: 65: Hoare triple {36348#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36349#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:25,689 INFO L273 TraceCheckUtils]: 66: Hoare triple {36349#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36349#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:25,689 INFO L273 TraceCheckUtils]: 67: Hoare triple {36349#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36349#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:25,690 INFO L273 TraceCheckUtils]: 68: Hoare triple {36349#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36350#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:25,691 INFO L273 TraceCheckUtils]: 69: Hoare triple {36350#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36350#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:25,691 INFO L273 TraceCheckUtils]: 70: Hoare triple {36350#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36350#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:25,692 INFO L273 TraceCheckUtils]: 71: Hoare triple {36350#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36351#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:25,692 INFO L273 TraceCheckUtils]: 72: Hoare triple {36351#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36351#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:25,693 INFO L273 TraceCheckUtils]: 73: Hoare triple {36351#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36351#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:25,694 INFO L273 TraceCheckUtils]: 74: Hoare triple {36351#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36352#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:25,694 INFO L273 TraceCheckUtils]: 75: Hoare triple {36352#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36352#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:25,695 INFO L273 TraceCheckUtils]: 76: Hoare triple {36352#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36352#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:25,695 INFO L273 TraceCheckUtils]: 77: Hoare triple {36352#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36353#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:25,696 INFO L273 TraceCheckUtils]: 78: Hoare triple {36353#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36353#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:25,696 INFO L273 TraceCheckUtils]: 79: Hoare triple {36353#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36353#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:25,697 INFO L273 TraceCheckUtils]: 80: Hoare triple {36353#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36354#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:25,698 INFO L273 TraceCheckUtils]: 81: Hoare triple {36354#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36354#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:25,698 INFO L273 TraceCheckUtils]: 82: Hoare triple {36354#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36354#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:25,699 INFO L273 TraceCheckUtils]: 83: Hoare triple {36354#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36355#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:25,699 INFO L273 TraceCheckUtils]: 84: Hoare triple {36355#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36355#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:25,700 INFO L273 TraceCheckUtils]: 85: Hoare triple {36355#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36355#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:25,701 INFO L273 TraceCheckUtils]: 86: Hoare triple {36355#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36356#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:25,701 INFO L273 TraceCheckUtils]: 87: Hoare triple {36356#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36356#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:25,702 INFO L273 TraceCheckUtils]: 88: Hoare triple {36356#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36356#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:25,702 INFO L273 TraceCheckUtils]: 89: Hoare triple {36356#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36357#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:25,703 INFO L273 TraceCheckUtils]: 90: Hoare triple {36357#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36357#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:25,703 INFO L273 TraceCheckUtils]: 91: Hoare triple {36357#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36357#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:25,704 INFO L273 TraceCheckUtils]: 92: Hoare triple {36357#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36358#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:25,705 INFO L273 TraceCheckUtils]: 93: Hoare triple {36358#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36358#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:25,705 INFO L273 TraceCheckUtils]: 94: Hoare triple {36358#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36358#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:25,706 INFO L273 TraceCheckUtils]: 95: Hoare triple {36358#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36359#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:25,706 INFO L273 TraceCheckUtils]: 96: Hoare triple {36359#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36359#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:25,707 INFO L273 TraceCheckUtils]: 97: Hoare triple {36359#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36359#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:25,708 INFO L273 TraceCheckUtils]: 98: Hoare triple {36359#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36360#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:25,708 INFO L273 TraceCheckUtils]: 99: Hoare triple {36360#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36360#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:25,709 INFO L273 TraceCheckUtils]: 100: Hoare triple {36360#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36360#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:25,709 INFO L273 TraceCheckUtils]: 101: Hoare triple {36360#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36361#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:25,710 INFO L273 TraceCheckUtils]: 102: Hoare triple {36361#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36361#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:25,710 INFO L273 TraceCheckUtils]: 103: Hoare triple {36361#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36361#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:25,711 INFO L273 TraceCheckUtils]: 104: Hoare triple {36361#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36362#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:25,711 INFO L273 TraceCheckUtils]: 105: Hoare triple {36362#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36362#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:25,712 INFO L273 TraceCheckUtils]: 106: Hoare triple {36362#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36362#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:25,713 INFO L273 TraceCheckUtils]: 107: Hoare triple {36362#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36363#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:25,713 INFO L273 TraceCheckUtils]: 108: Hoare triple {36363#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36363#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:25,714 INFO L273 TraceCheckUtils]: 109: Hoare triple {36363#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36363#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:25,714 INFO L273 TraceCheckUtils]: 110: Hoare triple {36363#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36364#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:25,715 INFO L273 TraceCheckUtils]: 111: Hoare triple {36364#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36364#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:25,715 INFO L273 TraceCheckUtils]: 112: Hoare triple {36364#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36364#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:25,716 INFO L273 TraceCheckUtils]: 113: Hoare triple {36364#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36365#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:25,717 INFO L273 TraceCheckUtils]: 114: Hoare triple {36365#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36365#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:25,717 INFO L273 TraceCheckUtils]: 115: Hoare triple {36365#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36365#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:25,718 INFO L273 TraceCheckUtils]: 116: Hoare triple {36365#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36366#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:25,718 INFO L273 TraceCheckUtils]: 117: Hoare triple {36366#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36366#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:25,719 INFO L273 TraceCheckUtils]: 118: Hoare triple {36366#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36366#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:25,720 INFO L273 TraceCheckUtils]: 119: Hoare triple {36366#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36367#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:25,720 INFO L273 TraceCheckUtils]: 120: Hoare triple {36367#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36367#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 121: Hoare triple {36367#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36367#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 122: Hoare triple {36367#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36368#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 123: Hoare triple {36368#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36368#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 124: Hoare triple {36368#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36368#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:25,723 INFO L273 TraceCheckUtils]: 125: Hoare triple {36368#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36369#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 126: Hoare triple {36369#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36369#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 127: Hoare triple {36369#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36369#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 128: Hoare triple {36369#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36370#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 129: Hoare triple {36370#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36370#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:25,726 INFO L273 TraceCheckUtils]: 130: Hoare triple {36370#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36370#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:25,726 INFO L273 TraceCheckUtils]: 131: Hoare triple {36370#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36371#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:25,727 INFO L273 TraceCheckUtils]: 132: Hoare triple {36371#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36371#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:25,727 INFO L273 TraceCheckUtils]: 133: Hoare triple {36371#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36371#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:25,728 INFO L273 TraceCheckUtils]: 134: Hoare triple {36371#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36372#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:25,729 INFO L273 TraceCheckUtils]: 135: Hoare triple {36372#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36372#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:25,729 INFO L273 TraceCheckUtils]: 136: Hoare triple {36372#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36372#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:25,730 INFO L273 TraceCheckUtils]: 137: Hoare triple {36372#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36373#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:25,730 INFO L273 TraceCheckUtils]: 138: Hoare triple {36373#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36373#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:25,731 INFO L273 TraceCheckUtils]: 139: Hoare triple {36373#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36373#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:25,732 INFO L273 TraceCheckUtils]: 140: Hoare triple {36373#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36374#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:25,732 INFO L273 TraceCheckUtils]: 141: Hoare triple {36374#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36374#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:25,733 INFO L273 TraceCheckUtils]: 142: Hoare triple {36374#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36374#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:25,733 INFO L273 TraceCheckUtils]: 143: Hoare triple {36374#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36375#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:25,734 INFO L273 TraceCheckUtils]: 144: Hoare triple {36375#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36375#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:25,734 INFO L273 TraceCheckUtils]: 145: Hoare triple {36375#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36375#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:25,735 INFO L273 TraceCheckUtils]: 146: Hoare triple {36375#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36376#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:25,736 INFO L273 TraceCheckUtils]: 147: Hoare triple {36376#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36376#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:25,736 INFO L273 TraceCheckUtils]: 148: Hoare triple {36376#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36376#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:25,737 INFO L273 TraceCheckUtils]: 149: Hoare triple {36376#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36377#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:25,737 INFO L273 TraceCheckUtils]: 150: Hoare triple {36377#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36377#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:25,738 INFO L273 TraceCheckUtils]: 151: Hoare triple {36377#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36377#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:25,738 INFO L273 TraceCheckUtils]: 152: Hoare triple {36377#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36378#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:25,739 INFO L273 TraceCheckUtils]: 153: Hoare triple {36378#(<= main_~i~0 50)} assume !(~i~0 < 100000); {36328#false} is VALID [2018-11-23 12:00:25,739 INFO L273 TraceCheckUtils]: 154: Hoare triple {36328#false} havoc ~x~0;~x~0 := 0; {36328#false} is VALID [2018-11-23 12:00:25,740 INFO L273 TraceCheckUtils]: 155: Hoare triple {36328#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {36328#false} is VALID [2018-11-23 12:00:25,740 INFO L256 TraceCheckUtils]: 156: Hoare triple {36328#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {36328#false} is VALID [2018-11-23 12:00:25,740 INFO L273 TraceCheckUtils]: 157: Hoare triple {36328#false} ~cond := #in~cond; {36328#false} is VALID [2018-11-23 12:00:25,740 INFO L273 TraceCheckUtils]: 158: Hoare triple {36328#false} assume 0 == ~cond; {36328#false} is VALID [2018-11-23 12:00:25,740 INFO L273 TraceCheckUtils]: 159: Hoare triple {36328#false} assume !false; {36328#false} is VALID [2018-11-23 12:00:25,756 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 12:00:25,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:25,756 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 12:00:25,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:25,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:26,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {36327#true} call ULTIMATE.init(); {36327#true} is VALID [2018-11-23 12:00:26,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {36327#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36327#true} is VALID [2018-11-23 12:00:26,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {36327#true} assume true; {36327#true} is VALID [2018-11-23 12:00:26,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36327#true} {36327#true} #54#return; {36327#true} is VALID [2018-11-23 12:00:26,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {36327#true} call #t~ret6 := main(); {36327#true} is VALID [2018-11-23 12:00:26,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {36327#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36329#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:26,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {36329#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36329#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:26,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {36329#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36329#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:26,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {36329#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36330#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:26,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {36330#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36330#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:26,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {36330#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36330#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:26,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {36330#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36331#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:26,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {36331#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36331#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:26,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {36331#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36331#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:26,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {36331#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36332#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:26,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {36332#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36332#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:26,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {36332#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36332#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:26,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {36332#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36333#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:26,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {36333#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36333#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:26,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {36333#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36333#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:26,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {36333#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36334#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:26,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {36334#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36334#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:26,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {36334#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36334#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:26,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {36334#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36335#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:26,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {36335#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36335#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:26,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {36335#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36335#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:26,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {36335#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36336#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:26,300 INFO L273 TraceCheckUtils]: 27: Hoare triple {36336#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36336#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:26,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {36336#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36336#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:26,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {36336#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36337#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:26,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {36337#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36337#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:26,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {36337#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36337#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:26,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {36337#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36338#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:26,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {36338#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36338#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:26,304 INFO L273 TraceCheckUtils]: 34: Hoare triple {36338#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36338#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:26,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {36338#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36339#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:26,305 INFO L273 TraceCheckUtils]: 36: Hoare triple {36339#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36339#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:26,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {36339#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36339#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:26,306 INFO L273 TraceCheckUtils]: 38: Hoare triple {36339#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36340#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:26,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {36340#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36340#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:26,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {36340#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36340#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:26,308 INFO L273 TraceCheckUtils]: 41: Hoare triple {36340#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36341#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:26,308 INFO L273 TraceCheckUtils]: 42: Hoare triple {36341#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36341#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:26,309 INFO L273 TraceCheckUtils]: 43: Hoare triple {36341#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36341#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:26,310 INFO L273 TraceCheckUtils]: 44: Hoare triple {36341#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36342#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:26,310 INFO L273 TraceCheckUtils]: 45: Hoare triple {36342#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36342#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:26,311 INFO L273 TraceCheckUtils]: 46: Hoare triple {36342#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36342#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:26,311 INFO L273 TraceCheckUtils]: 47: Hoare triple {36342#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36343#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:26,312 INFO L273 TraceCheckUtils]: 48: Hoare triple {36343#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36343#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:26,312 INFO L273 TraceCheckUtils]: 49: Hoare triple {36343#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36343#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:26,313 INFO L273 TraceCheckUtils]: 50: Hoare triple {36343#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36344#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:26,313 INFO L273 TraceCheckUtils]: 51: Hoare triple {36344#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36344#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:26,314 INFO L273 TraceCheckUtils]: 52: Hoare triple {36344#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36344#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:26,315 INFO L273 TraceCheckUtils]: 53: Hoare triple {36344#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36345#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:26,315 INFO L273 TraceCheckUtils]: 54: Hoare triple {36345#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36345#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:26,316 INFO L273 TraceCheckUtils]: 55: Hoare triple {36345#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36345#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:26,316 INFO L273 TraceCheckUtils]: 56: Hoare triple {36345#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36346#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:26,317 INFO L273 TraceCheckUtils]: 57: Hoare triple {36346#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36346#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:26,317 INFO L273 TraceCheckUtils]: 58: Hoare triple {36346#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36346#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:26,318 INFO L273 TraceCheckUtils]: 59: Hoare triple {36346#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36347#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:26,319 INFO L273 TraceCheckUtils]: 60: Hoare triple {36347#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36347#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:26,319 INFO L273 TraceCheckUtils]: 61: Hoare triple {36347#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36347#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:26,320 INFO L273 TraceCheckUtils]: 62: Hoare triple {36347#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36348#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:26,320 INFO L273 TraceCheckUtils]: 63: Hoare triple {36348#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36348#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:26,321 INFO L273 TraceCheckUtils]: 64: Hoare triple {36348#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36348#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:26,322 INFO L273 TraceCheckUtils]: 65: Hoare triple {36348#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36349#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:26,322 INFO L273 TraceCheckUtils]: 66: Hoare triple {36349#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36349#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:26,323 INFO L273 TraceCheckUtils]: 67: Hoare triple {36349#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36349#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:26,323 INFO L273 TraceCheckUtils]: 68: Hoare triple {36349#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36350#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:26,324 INFO L273 TraceCheckUtils]: 69: Hoare triple {36350#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36350#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:26,324 INFO L273 TraceCheckUtils]: 70: Hoare triple {36350#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36350#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:26,325 INFO L273 TraceCheckUtils]: 71: Hoare triple {36350#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36351#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:26,326 INFO L273 TraceCheckUtils]: 72: Hoare triple {36351#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36351#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:26,326 INFO L273 TraceCheckUtils]: 73: Hoare triple {36351#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36351#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:26,327 INFO L273 TraceCheckUtils]: 74: Hoare triple {36351#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36352#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:26,327 INFO L273 TraceCheckUtils]: 75: Hoare triple {36352#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36352#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:26,328 INFO L273 TraceCheckUtils]: 76: Hoare triple {36352#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36352#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:26,329 INFO L273 TraceCheckUtils]: 77: Hoare triple {36352#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36353#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:26,329 INFO L273 TraceCheckUtils]: 78: Hoare triple {36353#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36353#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:26,330 INFO L273 TraceCheckUtils]: 79: Hoare triple {36353#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36353#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:26,330 INFO L273 TraceCheckUtils]: 80: Hoare triple {36353#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36354#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:26,331 INFO L273 TraceCheckUtils]: 81: Hoare triple {36354#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36354#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:26,331 INFO L273 TraceCheckUtils]: 82: Hoare triple {36354#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36354#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:26,332 INFO L273 TraceCheckUtils]: 83: Hoare triple {36354#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36355#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:26,332 INFO L273 TraceCheckUtils]: 84: Hoare triple {36355#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36355#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:26,333 INFO L273 TraceCheckUtils]: 85: Hoare triple {36355#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36355#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:26,334 INFO L273 TraceCheckUtils]: 86: Hoare triple {36355#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36356#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:26,334 INFO L273 TraceCheckUtils]: 87: Hoare triple {36356#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36356#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:26,335 INFO L273 TraceCheckUtils]: 88: Hoare triple {36356#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36356#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:26,335 INFO L273 TraceCheckUtils]: 89: Hoare triple {36356#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36357#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:26,336 INFO L273 TraceCheckUtils]: 90: Hoare triple {36357#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36357#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:26,336 INFO L273 TraceCheckUtils]: 91: Hoare triple {36357#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36357#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:26,337 INFO L273 TraceCheckUtils]: 92: Hoare triple {36357#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36358#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:26,338 INFO L273 TraceCheckUtils]: 93: Hoare triple {36358#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36358#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:26,338 INFO L273 TraceCheckUtils]: 94: Hoare triple {36358#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36358#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:26,339 INFO L273 TraceCheckUtils]: 95: Hoare triple {36358#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36359#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:26,339 INFO L273 TraceCheckUtils]: 96: Hoare triple {36359#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36359#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:26,340 INFO L273 TraceCheckUtils]: 97: Hoare triple {36359#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36359#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:26,341 INFO L273 TraceCheckUtils]: 98: Hoare triple {36359#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36360#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:26,341 INFO L273 TraceCheckUtils]: 99: Hoare triple {36360#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36360#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:26,342 INFO L273 TraceCheckUtils]: 100: Hoare triple {36360#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36360#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:26,342 INFO L273 TraceCheckUtils]: 101: Hoare triple {36360#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36361#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:26,343 INFO L273 TraceCheckUtils]: 102: Hoare triple {36361#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36361#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:26,343 INFO L273 TraceCheckUtils]: 103: Hoare triple {36361#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36361#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:26,344 INFO L273 TraceCheckUtils]: 104: Hoare triple {36361#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36362#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:26,345 INFO L273 TraceCheckUtils]: 105: Hoare triple {36362#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36362#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:26,345 INFO L273 TraceCheckUtils]: 106: Hoare triple {36362#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36362#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:26,346 INFO L273 TraceCheckUtils]: 107: Hoare triple {36362#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36363#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:26,346 INFO L273 TraceCheckUtils]: 108: Hoare triple {36363#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36363#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:26,347 INFO L273 TraceCheckUtils]: 109: Hoare triple {36363#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36363#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:26,347 INFO L273 TraceCheckUtils]: 110: Hoare triple {36363#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36364#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:26,348 INFO L273 TraceCheckUtils]: 111: Hoare triple {36364#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36364#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:26,348 INFO L273 TraceCheckUtils]: 112: Hoare triple {36364#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36364#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:26,349 INFO L273 TraceCheckUtils]: 113: Hoare triple {36364#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36365#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:26,350 INFO L273 TraceCheckUtils]: 114: Hoare triple {36365#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36365#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:26,350 INFO L273 TraceCheckUtils]: 115: Hoare triple {36365#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36365#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:26,351 INFO L273 TraceCheckUtils]: 116: Hoare triple {36365#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36366#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:26,351 INFO L273 TraceCheckUtils]: 117: Hoare triple {36366#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36366#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:26,352 INFO L273 TraceCheckUtils]: 118: Hoare triple {36366#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36366#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:26,353 INFO L273 TraceCheckUtils]: 119: Hoare triple {36366#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36367#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:26,353 INFO L273 TraceCheckUtils]: 120: Hoare triple {36367#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36367#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:26,354 INFO L273 TraceCheckUtils]: 121: Hoare triple {36367#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36367#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:26,354 INFO L273 TraceCheckUtils]: 122: Hoare triple {36367#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36368#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:26,355 INFO L273 TraceCheckUtils]: 123: Hoare triple {36368#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36368#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:26,355 INFO L273 TraceCheckUtils]: 124: Hoare triple {36368#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36368#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:26,356 INFO L273 TraceCheckUtils]: 125: Hoare triple {36368#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36369#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:26,357 INFO L273 TraceCheckUtils]: 126: Hoare triple {36369#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36369#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:26,357 INFO L273 TraceCheckUtils]: 127: Hoare triple {36369#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36369#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:26,358 INFO L273 TraceCheckUtils]: 128: Hoare triple {36369#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36370#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:26,358 INFO L273 TraceCheckUtils]: 129: Hoare triple {36370#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36370#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:26,359 INFO L273 TraceCheckUtils]: 130: Hoare triple {36370#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36370#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:26,359 INFO L273 TraceCheckUtils]: 131: Hoare triple {36370#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36371#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:26,360 INFO L273 TraceCheckUtils]: 132: Hoare triple {36371#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36371#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:26,360 INFO L273 TraceCheckUtils]: 133: Hoare triple {36371#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36371#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:26,361 INFO L273 TraceCheckUtils]: 134: Hoare triple {36371#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36372#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:26,362 INFO L273 TraceCheckUtils]: 135: Hoare triple {36372#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36372#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:26,362 INFO L273 TraceCheckUtils]: 136: Hoare triple {36372#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36372#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:26,363 INFO L273 TraceCheckUtils]: 137: Hoare triple {36372#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36373#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:26,363 INFO L273 TraceCheckUtils]: 138: Hoare triple {36373#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36373#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:26,364 INFO L273 TraceCheckUtils]: 139: Hoare triple {36373#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36373#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:26,365 INFO L273 TraceCheckUtils]: 140: Hoare triple {36373#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36374#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:26,365 INFO L273 TraceCheckUtils]: 141: Hoare triple {36374#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36374#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:26,366 INFO L273 TraceCheckUtils]: 142: Hoare triple {36374#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36374#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:26,366 INFO L273 TraceCheckUtils]: 143: Hoare triple {36374#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36375#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:26,367 INFO L273 TraceCheckUtils]: 144: Hoare triple {36375#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36375#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:26,367 INFO L273 TraceCheckUtils]: 145: Hoare triple {36375#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36375#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:26,368 INFO L273 TraceCheckUtils]: 146: Hoare triple {36375#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36376#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:26,369 INFO L273 TraceCheckUtils]: 147: Hoare triple {36376#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36376#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:26,369 INFO L273 TraceCheckUtils]: 148: Hoare triple {36376#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36376#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:26,370 INFO L273 TraceCheckUtils]: 149: Hoare triple {36376#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36377#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:26,370 INFO L273 TraceCheckUtils]: 150: Hoare triple {36377#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36377#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:26,371 INFO L273 TraceCheckUtils]: 151: Hoare triple {36377#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {36377#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:26,372 INFO L273 TraceCheckUtils]: 152: Hoare triple {36377#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36378#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:26,372 INFO L273 TraceCheckUtils]: 153: Hoare triple {36378#(<= main_~i~0 50)} assume !(~i~0 < 100000); {36328#false} is VALID [2018-11-23 12:00:26,372 INFO L273 TraceCheckUtils]: 154: Hoare triple {36328#false} havoc ~x~0;~x~0 := 0; {36328#false} is VALID [2018-11-23 12:00:26,373 INFO L273 TraceCheckUtils]: 155: Hoare triple {36328#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {36328#false} is VALID [2018-11-23 12:00:26,373 INFO L256 TraceCheckUtils]: 156: Hoare triple {36328#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {36328#false} is VALID [2018-11-23 12:00:26,373 INFO L273 TraceCheckUtils]: 157: Hoare triple {36328#false} ~cond := #in~cond; {36328#false} is VALID [2018-11-23 12:00:26,373 INFO L273 TraceCheckUtils]: 158: Hoare triple {36328#false} assume 0 == ~cond; {36328#false} is VALID [2018-11-23 12:00:26,373 INFO L273 TraceCheckUtils]: 159: Hoare triple {36328#false} assume !false; {36328#false} is VALID [2018-11-23 12:00:26,390 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 12:00:26,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:26,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-11-23 12:00:26,410 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 160 [2018-11-23 12:00:26,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:26,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 12:00:26,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:26,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 12:00:26,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 12:00:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:00:26,569 INFO L87 Difference]: Start difference. First operand 165 states and 215 transitions. Second operand 52 states. [2018-11-23 12:00:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:27,426 INFO L93 Difference]: Finished difference Result 181 states and 234 transitions. [2018-11-23 12:00:27,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 12:00:27,426 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 160 [2018-11-23 12:00:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:00:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 234 transitions. [2018-11-23 12:00:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:00:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 234 transitions. [2018-11-23 12:00:27,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 234 transitions. [2018-11-23 12:00:27,649 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 12:00:27,652 INFO L225 Difference]: With dead ends: 181 [2018-11-23 12:00:27,652 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 12:00:27,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:00:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 12:00:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-11-23 12:00:27,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:27,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 168 states. [2018-11-23 12:00:27,692 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 168 states. [2018-11-23 12:00:27,692 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 168 states. [2018-11-23 12:00:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:27,695 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2018-11-23 12:00:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2018-11-23 12:00:27,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:27,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:27,695 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 170 states. [2018-11-23 12:00:27,695 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 170 states. [2018-11-23 12:00:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:27,698 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2018-11-23 12:00:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2018-11-23 12:00:27,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:27,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:27,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:27,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 12:00:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 219 transitions. [2018-11-23 12:00:27,701 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 219 transitions. Word has length 160 [2018-11-23 12:00:27,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:27,701 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 219 transitions. [2018-11-23 12:00:27,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 12:00:27,701 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2018-11-23 12:00:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 12:00:27,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:27,702 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:27,702 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:27,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:27,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1634574423, now seen corresponding path program 50 times [2018-11-23 12:00:27,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:27,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:27,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:27,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:27,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:28,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {37666#true} call ULTIMATE.init(); {37666#true} is VALID [2018-11-23 12:00:28,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {37666#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37666#true} is VALID [2018-11-23 12:00:28,959 INFO L273 TraceCheckUtils]: 2: Hoare triple {37666#true} assume true; {37666#true} is VALID [2018-11-23 12:00:28,959 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37666#true} {37666#true} #54#return; {37666#true} is VALID [2018-11-23 12:00:28,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {37666#true} call #t~ret6 := main(); {37666#true} is VALID [2018-11-23 12:00:28,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {37666#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37668#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:28,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {37668#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37668#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:28,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {37668#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37668#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:28,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {37668#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37669#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:28,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {37669#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37669#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:28,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {37669#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37669#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:28,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {37669#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37670#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:28,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {37670#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37670#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:28,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {37670#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37670#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:28,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {37670#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37671#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:28,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {37671#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37671#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:28,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {37671#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37671#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:28,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {37671#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37672#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:28,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {37672#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37672#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:28,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {37672#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37672#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:28,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {37672#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37673#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:28,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {37673#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37673#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:28,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {37673#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37673#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:28,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {37673#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37674#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:28,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {37674#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37674#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:28,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {37674#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37674#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:28,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {37674#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37675#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:28,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {37675#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37675#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:28,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {37675#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37675#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:28,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {37675#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37676#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:28,971 INFO L273 TraceCheckUtils]: 30: Hoare triple {37676#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37676#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:28,972 INFO L273 TraceCheckUtils]: 31: Hoare triple {37676#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37676#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:28,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {37676#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37677#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:28,973 INFO L273 TraceCheckUtils]: 33: Hoare triple {37677#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37677#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:28,974 INFO L273 TraceCheckUtils]: 34: Hoare triple {37677#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37677#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:28,974 INFO L273 TraceCheckUtils]: 35: Hoare triple {37677#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37678#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:28,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {37678#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37678#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:28,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {37678#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37678#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:28,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {37678#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37679#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:28,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {37679#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37679#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:28,977 INFO L273 TraceCheckUtils]: 40: Hoare triple {37679#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37679#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:28,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {37679#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37680#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:28,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {37680#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37680#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:28,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {37680#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37680#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:28,980 INFO L273 TraceCheckUtils]: 44: Hoare triple {37680#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37681#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:28,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {37681#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37681#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:28,981 INFO L273 TraceCheckUtils]: 46: Hoare triple {37681#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37681#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:28,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {37681#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37682#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:28,982 INFO L273 TraceCheckUtils]: 48: Hoare triple {37682#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37682#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:28,982 INFO L273 TraceCheckUtils]: 49: Hoare triple {37682#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37682#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:28,983 INFO L273 TraceCheckUtils]: 50: Hoare triple {37682#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37683#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:28,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {37683#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37683#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:28,984 INFO L273 TraceCheckUtils]: 52: Hoare triple {37683#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37683#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:28,985 INFO L273 TraceCheckUtils]: 53: Hoare triple {37683#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37684#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:28,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {37684#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37684#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:28,986 INFO L273 TraceCheckUtils]: 55: Hoare triple {37684#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37684#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:28,986 INFO L273 TraceCheckUtils]: 56: Hoare triple {37684#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37685#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:28,987 INFO L273 TraceCheckUtils]: 57: Hoare triple {37685#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37685#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:28,987 INFO L273 TraceCheckUtils]: 58: Hoare triple {37685#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37685#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:28,988 INFO L273 TraceCheckUtils]: 59: Hoare triple {37685#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37686#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:28,989 INFO L273 TraceCheckUtils]: 60: Hoare triple {37686#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37686#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:28,989 INFO L273 TraceCheckUtils]: 61: Hoare triple {37686#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37686#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:28,990 INFO L273 TraceCheckUtils]: 62: Hoare triple {37686#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:28,990 INFO L273 TraceCheckUtils]: 63: Hoare triple {37687#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37687#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:28,991 INFO L273 TraceCheckUtils]: 64: Hoare triple {37687#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37687#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:28,992 INFO L273 TraceCheckUtils]: 65: Hoare triple {37687#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37688#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:28,992 INFO L273 TraceCheckUtils]: 66: Hoare triple {37688#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37688#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:28,993 INFO L273 TraceCheckUtils]: 67: Hoare triple {37688#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37688#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:28,993 INFO L273 TraceCheckUtils]: 68: Hoare triple {37688#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37689#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:28,994 INFO L273 TraceCheckUtils]: 69: Hoare triple {37689#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37689#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:28,994 INFO L273 TraceCheckUtils]: 70: Hoare triple {37689#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37689#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:28,995 INFO L273 TraceCheckUtils]: 71: Hoare triple {37689#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37690#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:28,996 INFO L273 TraceCheckUtils]: 72: Hoare triple {37690#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37690#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:28,996 INFO L273 TraceCheckUtils]: 73: Hoare triple {37690#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37690#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:28,997 INFO L273 TraceCheckUtils]: 74: Hoare triple {37690#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37691#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:28,997 INFO L273 TraceCheckUtils]: 75: Hoare triple {37691#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37691#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:28,998 INFO L273 TraceCheckUtils]: 76: Hoare triple {37691#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37691#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:28,998 INFO L273 TraceCheckUtils]: 77: Hoare triple {37691#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37692#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:28,999 INFO L273 TraceCheckUtils]: 78: Hoare triple {37692#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37692#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:28,999 INFO L273 TraceCheckUtils]: 79: Hoare triple {37692#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37692#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:29,000 INFO L273 TraceCheckUtils]: 80: Hoare triple {37692#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37693#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:29,001 INFO L273 TraceCheckUtils]: 81: Hoare triple {37693#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37693#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:29,001 INFO L273 TraceCheckUtils]: 82: Hoare triple {37693#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37693#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:29,002 INFO L273 TraceCheckUtils]: 83: Hoare triple {37693#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37694#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:29,002 INFO L273 TraceCheckUtils]: 84: Hoare triple {37694#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37694#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:29,003 INFO L273 TraceCheckUtils]: 85: Hoare triple {37694#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37694#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:29,004 INFO L273 TraceCheckUtils]: 86: Hoare triple {37694#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37695#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:29,004 INFO L273 TraceCheckUtils]: 87: Hoare triple {37695#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37695#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:29,005 INFO L273 TraceCheckUtils]: 88: Hoare triple {37695#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37695#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:29,005 INFO L273 TraceCheckUtils]: 89: Hoare triple {37695#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37696#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:29,006 INFO L273 TraceCheckUtils]: 90: Hoare triple {37696#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37696#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:29,006 INFO L273 TraceCheckUtils]: 91: Hoare triple {37696#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37696#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:29,007 INFO L273 TraceCheckUtils]: 92: Hoare triple {37696#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37697#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:29,008 INFO L273 TraceCheckUtils]: 93: Hoare triple {37697#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37697#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:29,008 INFO L273 TraceCheckUtils]: 94: Hoare triple {37697#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37697#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:29,009 INFO L273 TraceCheckUtils]: 95: Hoare triple {37697#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37698#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:29,009 INFO L273 TraceCheckUtils]: 96: Hoare triple {37698#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37698#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:29,010 INFO L273 TraceCheckUtils]: 97: Hoare triple {37698#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37698#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:29,011 INFO L273 TraceCheckUtils]: 98: Hoare triple {37698#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37699#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:29,011 INFO L273 TraceCheckUtils]: 99: Hoare triple {37699#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37699#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:29,012 INFO L273 TraceCheckUtils]: 100: Hoare triple {37699#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37699#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:29,012 INFO L273 TraceCheckUtils]: 101: Hoare triple {37699#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37700#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:29,013 INFO L273 TraceCheckUtils]: 102: Hoare triple {37700#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37700#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:29,013 INFO L273 TraceCheckUtils]: 103: Hoare triple {37700#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37700#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:29,014 INFO L273 TraceCheckUtils]: 104: Hoare triple {37700#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37701#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:29,014 INFO L273 TraceCheckUtils]: 105: Hoare triple {37701#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37701#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:29,015 INFO L273 TraceCheckUtils]: 106: Hoare triple {37701#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37701#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:29,016 INFO L273 TraceCheckUtils]: 107: Hoare triple {37701#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37702#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:29,016 INFO L273 TraceCheckUtils]: 108: Hoare triple {37702#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37702#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:29,017 INFO L273 TraceCheckUtils]: 109: Hoare triple {37702#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37702#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:29,017 INFO L273 TraceCheckUtils]: 110: Hoare triple {37702#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37703#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:29,018 INFO L273 TraceCheckUtils]: 111: Hoare triple {37703#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37703#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:29,018 INFO L273 TraceCheckUtils]: 112: Hoare triple {37703#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37703#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:29,019 INFO L273 TraceCheckUtils]: 113: Hoare triple {37703#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37704#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:29,020 INFO L273 TraceCheckUtils]: 114: Hoare triple {37704#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37704#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:29,020 INFO L273 TraceCheckUtils]: 115: Hoare triple {37704#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37704#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:29,021 INFO L273 TraceCheckUtils]: 116: Hoare triple {37704#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37705#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:29,021 INFO L273 TraceCheckUtils]: 117: Hoare triple {37705#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37705#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:29,022 INFO L273 TraceCheckUtils]: 118: Hoare triple {37705#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37705#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:29,023 INFO L273 TraceCheckUtils]: 119: Hoare triple {37705#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37706#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:29,023 INFO L273 TraceCheckUtils]: 120: Hoare triple {37706#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37706#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:29,024 INFO L273 TraceCheckUtils]: 121: Hoare triple {37706#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37706#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:29,024 INFO L273 TraceCheckUtils]: 122: Hoare triple {37706#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37707#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:29,025 INFO L273 TraceCheckUtils]: 123: Hoare triple {37707#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37707#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:29,025 INFO L273 TraceCheckUtils]: 124: Hoare triple {37707#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37707#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:29,026 INFO L273 TraceCheckUtils]: 125: Hoare triple {37707#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37708#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:29,026 INFO L273 TraceCheckUtils]: 126: Hoare triple {37708#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37708#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:29,027 INFO L273 TraceCheckUtils]: 127: Hoare triple {37708#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37708#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:29,028 INFO L273 TraceCheckUtils]: 128: Hoare triple {37708#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37709#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:29,028 INFO L273 TraceCheckUtils]: 129: Hoare triple {37709#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37709#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:29,029 INFO L273 TraceCheckUtils]: 130: Hoare triple {37709#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37709#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:29,029 INFO L273 TraceCheckUtils]: 131: Hoare triple {37709#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37710#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:29,030 INFO L273 TraceCheckUtils]: 132: Hoare triple {37710#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37710#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:29,030 INFO L273 TraceCheckUtils]: 133: Hoare triple {37710#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37710#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:29,031 INFO L273 TraceCheckUtils]: 134: Hoare triple {37710#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:29,032 INFO L273 TraceCheckUtils]: 135: Hoare triple {37711#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37711#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:29,032 INFO L273 TraceCheckUtils]: 136: Hoare triple {37711#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37711#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:29,033 INFO L273 TraceCheckUtils]: 137: Hoare triple {37711#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37712#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:29,033 INFO L273 TraceCheckUtils]: 138: Hoare triple {37712#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37712#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:29,034 INFO L273 TraceCheckUtils]: 139: Hoare triple {37712#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37712#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:29,035 INFO L273 TraceCheckUtils]: 140: Hoare triple {37712#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37713#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:29,035 INFO L273 TraceCheckUtils]: 141: Hoare triple {37713#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37713#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:29,036 INFO L273 TraceCheckUtils]: 142: Hoare triple {37713#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37713#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:29,036 INFO L273 TraceCheckUtils]: 143: Hoare triple {37713#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37714#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:29,037 INFO L273 TraceCheckUtils]: 144: Hoare triple {37714#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37714#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:29,037 INFO L273 TraceCheckUtils]: 145: Hoare triple {37714#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37714#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:29,038 INFO L273 TraceCheckUtils]: 146: Hoare triple {37714#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37715#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:29,039 INFO L273 TraceCheckUtils]: 147: Hoare triple {37715#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37715#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:29,039 INFO L273 TraceCheckUtils]: 148: Hoare triple {37715#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37715#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:29,040 INFO L273 TraceCheckUtils]: 149: Hoare triple {37715#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37716#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:29,040 INFO L273 TraceCheckUtils]: 150: Hoare triple {37716#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37716#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:29,041 INFO L273 TraceCheckUtils]: 151: Hoare triple {37716#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37716#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:29,041 INFO L273 TraceCheckUtils]: 152: Hoare triple {37716#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37717#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:29,042 INFO L273 TraceCheckUtils]: 153: Hoare triple {37717#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37717#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:29,042 INFO L273 TraceCheckUtils]: 154: Hoare triple {37717#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37717#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:29,043 INFO L273 TraceCheckUtils]: 155: Hoare triple {37717#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37718#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:29,044 INFO L273 TraceCheckUtils]: 156: Hoare triple {37718#(<= main_~i~0 51)} assume !(~i~0 < 100000); {37667#false} is VALID [2018-11-23 12:00:29,044 INFO L273 TraceCheckUtils]: 157: Hoare triple {37667#false} havoc ~x~0;~x~0 := 0; {37667#false} is VALID [2018-11-23 12:00:29,044 INFO L273 TraceCheckUtils]: 158: Hoare triple {37667#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {37667#false} is VALID [2018-11-23 12:00:29,044 INFO L256 TraceCheckUtils]: 159: Hoare triple {37667#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {37667#false} is VALID [2018-11-23 12:00:29,045 INFO L273 TraceCheckUtils]: 160: Hoare triple {37667#false} ~cond := #in~cond; {37667#false} is VALID [2018-11-23 12:00:29,045 INFO L273 TraceCheckUtils]: 161: Hoare triple {37667#false} assume 0 == ~cond; {37667#false} is VALID [2018-11-23 12:00:29,045 INFO L273 TraceCheckUtils]: 162: Hoare triple {37667#false} assume !false; {37667#false} is VALID [2018-11-23 12:00:29,061 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 12:00:29,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:29,062 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 12:00:29,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:29,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:29,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:29,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:29,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {37666#true} call ULTIMATE.init(); {37666#true} is VALID [2018-11-23 12:00:29,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {37666#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37666#true} is VALID [2018-11-23 12:00:29,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {37666#true} assume true; {37666#true} is VALID [2018-11-23 12:00:29,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37666#true} {37666#true} #54#return; {37666#true} is VALID [2018-11-23 12:00:29,679 INFO L256 TraceCheckUtils]: 4: Hoare triple {37666#true} call #t~ret6 := main(); {37666#true} is VALID [2018-11-23 12:00:29,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {37666#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37668#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:29,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {37668#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37668#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:29,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {37668#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37668#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:29,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {37668#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37669#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:29,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {37669#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37669#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:29,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {37669#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37669#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:29,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {37669#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37670#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:29,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {37670#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37670#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:29,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {37670#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37670#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:29,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {37670#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37671#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:29,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {37671#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37671#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:29,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {37671#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37671#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:29,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {37671#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37672#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:29,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {37672#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37672#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:29,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {37672#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37672#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:29,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {37672#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37673#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:29,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {37673#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37673#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:29,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {37673#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37673#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:29,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {37673#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37674#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:29,688 INFO L273 TraceCheckUtils]: 24: Hoare triple {37674#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37674#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:29,689 INFO L273 TraceCheckUtils]: 25: Hoare triple {37674#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37674#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:29,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {37674#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37675#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:29,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {37675#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37675#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:29,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {37675#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37675#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:29,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {37675#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37676#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:29,692 INFO L273 TraceCheckUtils]: 30: Hoare triple {37676#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37676#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:29,692 INFO L273 TraceCheckUtils]: 31: Hoare triple {37676#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37676#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:29,693 INFO L273 TraceCheckUtils]: 32: Hoare triple {37676#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37677#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:29,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {37677#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37677#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:29,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {37677#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37677#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:29,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {37677#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37678#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:29,695 INFO L273 TraceCheckUtils]: 36: Hoare triple {37678#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37678#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:29,696 INFO L273 TraceCheckUtils]: 37: Hoare triple {37678#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37678#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:29,696 INFO L273 TraceCheckUtils]: 38: Hoare triple {37678#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37679#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:29,697 INFO L273 TraceCheckUtils]: 39: Hoare triple {37679#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37679#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:29,697 INFO L273 TraceCheckUtils]: 40: Hoare triple {37679#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37679#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:29,698 INFO L273 TraceCheckUtils]: 41: Hoare triple {37679#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37680#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:29,699 INFO L273 TraceCheckUtils]: 42: Hoare triple {37680#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37680#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:29,699 INFO L273 TraceCheckUtils]: 43: Hoare triple {37680#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37680#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:29,700 INFO L273 TraceCheckUtils]: 44: Hoare triple {37680#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37681#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:29,700 INFO L273 TraceCheckUtils]: 45: Hoare triple {37681#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37681#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:29,701 INFO L273 TraceCheckUtils]: 46: Hoare triple {37681#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37681#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:29,701 INFO L273 TraceCheckUtils]: 47: Hoare triple {37681#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37682#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:29,702 INFO L273 TraceCheckUtils]: 48: Hoare triple {37682#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37682#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:29,702 INFO L273 TraceCheckUtils]: 49: Hoare triple {37682#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37682#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:29,703 INFO L273 TraceCheckUtils]: 50: Hoare triple {37682#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37683#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:29,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {37683#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37683#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:29,704 INFO L273 TraceCheckUtils]: 52: Hoare triple {37683#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37683#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:29,705 INFO L273 TraceCheckUtils]: 53: Hoare triple {37683#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37684#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:29,705 INFO L273 TraceCheckUtils]: 54: Hoare triple {37684#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37684#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:29,706 INFO L273 TraceCheckUtils]: 55: Hoare triple {37684#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37684#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:29,707 INFO L273 TraceCheckUtils]: 56: Hoare triple {37684#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37685#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:29,707 INFO L273 TraceCheckUtils]: 57: Hoare triple {37685#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37685#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:29,708 INFO L273 TraceCheckUtils]: 58: Hoare triple {37685#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37685#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:29,708 INFO L273 TraceCheckUtils]: 59: Hoare triple {37685#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37686#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:29,709 INFO L273 TraceCheckUtils]: 60: Hoare triple {37686#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37686#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:29,709 INFO L273 TraceCheckUtils]: 61: Hoare triple {37686#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37686#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:29,710 INFO L273 TraceCheckUtils]: 62: Hoare triple {37686#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:29,711 INFO L273 TraceCheckUtils]: 63: Hoare triple {37687#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37687#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:29,711 INFO L273 TraceCheckUtils]: 64: Hoare triple {37687#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37687#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:29,712 INFO L273 TraceCheckUtils]: 65: Hoare triple {37687#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37688#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:29,712 INFO L273 TraceCheckUtils]: 66: Hoare triple {37688#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37688#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:29,713 INFO L273 TraceCheckUtils]: 67: Hoare triple {37688#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37688#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:29,714 INFO L273 TraceCheckUtils]: 68: Hoare triple {37688#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37689#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:29,714 INFO L273 TraceCheckUtils]: 69: Hoare triple {37689#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37689#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:29,715 INFO L273 TraceCheckUtils]: 70: Hoare triple {37689#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37689#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:29,715 INFO L273 TraceCheckUtils]: 71: Hoare triple {37689#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37690#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:29,716 INFO L273 TraceCheckUtils]: 72: Hoare triple {37690#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37690#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:29,716 INFO L273 TraceCheckUtils]: 73: Hoare triple {37690#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37690#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:29,717 INFO L273 TraceCheckUtils]: 74: Hoare triple {37690#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37691#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:29,718 INFO L273 TraceCheckUtils]: 75: Hoare triple {37691#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37691#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:29,718 INFO L273 TraceCheckUtils]: 76: Hoare triple {37691#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37691#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:29,719 INFO L273 TraceCheckUtils]: 77: Hoare triple {37691#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37692#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:29,719 INFO L273 TraceCheckUtils]: 78: Hoare triple {37692#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37692#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:29,720 INFO L273 TraceCheckUtils]: 79: Hoare triple {37692#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37692#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:29,720 INFO L273 TraceCheckUtils]: 80: Hoare triple {37692#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37693#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:29,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {37693#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37693#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:29,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {37693#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37693#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:29,722 INFO L273 TraceCheckUtils]: 83: Hoare triple {37693#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37694#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:29,723 INFO L273 TraceCheckUtils]: 84: Hoare triple {37694#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37694#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:29,723 INFO L273 TraceCheckUtils]: 85: Hoare triple {37694#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37694#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:29,724 INFO L273 TraceCheckUtils]: 86: Hoare triple {37694#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37695#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:29,724 INFO L273 TraceCheckUtils]: 87: Hoare triple {37695#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37695#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:29,725 INFO L273 TraceCheckUtils]: 88: Hoare triple {37695#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37695#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:29,726 INFO L273 TraceCheckUtils]: 89: Hoare triple {37695#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37696#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:29,726 INFO L273 TraceCheckUtils]: 90: Hoare triple {37696#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37696#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:29,727 INFO L273 TraceCheckUtils]: 91: Hoare triple {37696#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37696#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:29,727 INFO L273 TraceCheckUtils]: 92: Hoare triple {37696#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37697#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:29,728 INFO L273 TraceCheckUtils]: 93: Hoare triple {37697#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37697#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:29,728 INFO L273 TraceCheckUtils]: 94: Hoare triple {37697#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37697#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:29,729 INFO L273 TraceCheckUtils]: 95: Hoare triple {37697#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37698#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:29,730 INFO L273 TraceCheckUtils]: 96: Hoare triple {37698#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37698#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:29,730 INFO L273 TraceCheckUtils]: 97: Hoare triple {37698#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37698#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:29,731 INFO L273 TraceCheckUtils]: 98: Hoare triple {37698#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37699#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:29,731 INFO L273 TraceCheckUtils]: 99: Hoare triple {37699#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37699#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:29,732 INFO L273 TraceCheckUtils]: 100: Hoare triple {37699#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37699#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:29,733 INFO L273 TraceCheckUtils]: 101: Hoare triple {37699#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37700#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:29,733 INFO L273 TraceCheckUtils]: 102: Hoare triple {37700#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37700#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:29,734 INFO L273 TraceCheckUtils]: 103: Hoare triple {37700#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37700#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:29,734 INFO L273 TraceCheckUtils]: 104: Hoare triple {37700#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37701#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:29,735 INFO L273 TraceCheckUtils]: 105: Hoare triple {37701#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37701#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:29,735 INFO L273 TraceCheckUtils]: 106: Hoare triple {37701#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37701#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:29,736 INFO L273 TraceCheckUtils]: 107: Hoare triple {37701#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37702#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:29,737 INFO L273 TraceCheckUtils]: 108: Hoare triple {37702#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37702#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:29,737 INFO L273 TraceCheckUtils]: 109: Hoare triple {37702#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37702#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:29,738 INFO L273 TraceCheckUtils]: 110: Hoare triple {37702#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37703#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:29,738 INFO L273 TraceCheckUtils]: 111: Hoare triple {37703#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37703#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:29,739 INFO L273 TraceCheckUtils]: 112: Hoare triple {37703#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37703#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:29,739 INFO L273 TraceCheckUtils]: 113: Hoare triple {37703#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37704#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:29,740 INFO L273 TraceCheckUtils]: 114: Hoare triple {37704#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37704#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:29,740 INFO L273 TraceCheckUtils]: 115: Hoare triple {37704#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37704#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:29,741 INFO L273 TraceCheckUtils]: 116: Hoare triple {37704#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37705#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:29,742 INFO L273 TraceCheckUtils]: 117: Hoare triple {37705#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37705#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:29,742 INFO L273 TraceCheckUtils]: 118: Hoare triple {37705#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37705#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:29,743 INFO L273 TraceCheckUtils]: 119: Hoare triple {37705#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37706#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:29,743 INFO L273 TraceCheckUtils]: 120: Hoare triple {37706#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37706#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:29,744 INFO L273 TraceCheckUtils]: 121: Hoare triple {37706#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37706#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:29,745 INFO L273 TraceCheckUtils]: 122: Hoare triple {37706#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37707#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:29,745 INFO L273 TraceCheckUtils]: 123: Hoare triple {37707#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37707#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:29,746 INFO L273 TraceCheckUtils]: 124: Hoare triple {37707#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37707#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:29,746 INFO L273 TraceCheckUtils]: 125: Hoare triple {37707#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37708#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:29,747 INFO L273 TraceCheckUtils]: 126: Hoare triple {37708#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37708#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:29,747 INFO L273 TraceCheckUtils]: 127: Hoare triple {37708#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37708#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:29,748 INFO L273 TraceCheckUtils]: 128: Hoare triple {37708#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37709#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:29,749 INFO L273 TraceCheckUtils]: 129: Hoare triple {37709#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37709#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:29,749 INFO L273 TraceCheckUtils]: 130: Hoare triple {37709#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37709#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:29,750 INFO L273 TraceCheckUtils]: 131: Hoare triple {37709#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37710#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:29,750 INFO L273 TraceCheckUtils]: 132: Hoare triple {37710#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37710#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:29,751 INFO L273 TraceCheckUtils]: 133: Hoare triple {37710#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37710#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:29,752 INFO L273 TraceCheckUtils]: 134: Hoare triple {37710#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:29,752 INFO L273 TraceCheckUtils]: 135: Hoare triple {37711#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37711#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:29,753 INFO L273 TraceCheckUtils]: 136: Hoare triple {37711#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37711#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:29,753 INFO L273 TraceCheckUtils]: 137: Hoare triple {37711#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37712#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:29,754 INFO L273 TraceCheckUtils]: 138: Hoare triple {37712#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37712#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:29,754 INFO L273 TraceCheckUtils]: 139: Hoare triple {37712#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37712#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:29,755 INFO L273 TraceCheckUtils]: 140: Hoare triple {37712#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37713#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:29,755 INFO L273 TraceCheckUtils]: 141: Hoare triple {37713#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37713#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:29,756 INFO L273 TraceCheckUtils]: 142: Hoare triple {37713#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37713#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:29,757 INFO L273 TraceCheckUtils]: 143: Hoare triple {37713#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37714#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:29,757 INFO L273 TraceCheckUtils]: 144: Hoare triple {37714#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37714#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:29,758 INFO L273 TraceCheckUtils]: 145: Hoare triple {37714#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37714#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:29,758 INFO L273 TraceCheckUtils]: 146: Hoare triple {37714#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37715#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:29,759 INFO L273 TraceCheckUtils]: 147: Hoare triple {37715#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37715#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:29,759 INFO L273 TraceCheckUtils]: 148: Hoare triple {37715#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37715#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:29,760 INFO L273 TraceCheckUtils]: 149: Hoare triple {37715#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37716#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:29,761 INFO L273 TraceCheckUtils]: 150: Hoare triple {37716#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37716#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:29,761 INFO L273 TraceCheckUtils]: 151: Hoare triple {37716#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37716#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:29,762 INFO L273 TraceCheckUtils]: 152: Hoare triple {37716#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37717#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:29,762 INFO L273 TraceCheckUtils]: 153: Hoare triple {37717#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37717#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:29,763 INFO L273 TraceCheckUtils]: 154: Hoare triple {37717#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {37717#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:29,764 INFO L273 TraceCheckUtils]: 155: Hoare triple {37717#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37718#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:29,764 INFO L273 TraceCheckUtils]: 156: Hoare triple {37718#(<= main_~i~0 51)} assume !(~i~0 < 100000); {37667#false} is VALID [2018-11-23 12:00:29,764 INFO L273 TraceCheckUtils]: 157: Hoare triple {37667#false} havoc ~x~0;~x~0 := 0; {37667#false} is VALID [2018-11-23 12:00:29,765 INFO L273 TraceCheckUtils]: 158: Hoare triple {37667#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {37667#false} is VALID [2018-11-23 12:00:29,765 INFO L256 TraceCheckUtils]: 159: Hoare triple {37667#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {37667#false} is VALID [2018-11-23 12:00:29,765 INFO L273 TraceCheckUtils]: 160: Hoare triple {37667#false} ~cond := #in~cond; {37667#false} is VALID [2018-11-23 12:00:29,765 INFO L273 TraceCheckUtils]: 161: Hoare triple {37667#false} assume 0 == ~cond; {37667#false} is VALID [2018-11-23 12:00:29,765 INFO L273 TraceCheckUtils]: 162: Hoare triple {37667#false} assume !false; {37667#false} is VALID [2018-11-23 12:00:29,782 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 12:00:29,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:29,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-11-23 12:00:29,803 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 163 [2018-11-23 12:00:29,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:29,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-23 12:00:30,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:30,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 12:00:30,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 12:00:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:00:30,039 INFO L87 Difference]: Start difference. First operand 168 states and 219 transitions. Second operand 53 states. [2018-11-23 12:00:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:31,186 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2018-11-23 12:00:31,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 12:00:31,187 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 163 [2018-11-23 12:00:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:00:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 238 transitions. [2018-11-23 12:00:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:00:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 238 transitions. [2018-11-23 12:00:31,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 238 transitions. [2018-11-23 12:00:31,416 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 12:00:31,420 INFO L225 Difference]: With dead ends: 184 [2018-11-23 12:00:31,420 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 12:00:31,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:00:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 12:00:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-11-23 12:00:31,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:31,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 171 states. [2018-11-23 12:00:31,468 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 171 states. [2018-11-23 12:00:31,468 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 171 states. [2018-11-23 12:00:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:31,471 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2018-11-23 12:00:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2018-11-23 12:00:31,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:31,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:31,472 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 173 states. [2018-11-23 12:00:31,472 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 173 states. [2018-11-23 12:00:31,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:31,474 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2018-11-23 12:00:31,475 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2018-11-23 12:00:31,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:31,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:31,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:31,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 12:00:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-11-23 12:00:31,477 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 163 [2018-11-23 12:00:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:31,477 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-11-23 12:00:31,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-23 12:00:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-11-23 12:00:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-23 12:00:31,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:31,478 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:31,478 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:31,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1687201628, now seen corresponding path program 51 times [2018-11-23 12:00:31,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:31,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:31,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:32,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {39029#true} call ULTIMATE.init(); {39029#true} is VALID [2018-11-23 12:00:32,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {39029#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39029#true} is VALID [2018-11-23 12:00:32,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {39029#true} assume true; {39029#true} is VALID [2018-11-23 12:00:32,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39029#true} {39029#true} #54#return; {39029#true} is VALID [2018-11-23 12:00:32,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {39029#true} call #t~ret6 := main(); {39029#true} is VALID [2018-11-23 12:00:32,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {39029#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {39031#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:32,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {39031#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39031#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:32,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {39031#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39031#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:32,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {39031#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39032#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {39032#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39032#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {39032#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39032#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {39032#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39033#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {39033#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39033#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {39033#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39033#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {39033#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39034#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {39034#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39034#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {39034#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39034#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {39034#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39035#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {39035#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39035#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {39035#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39035#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,756 INFO L273 TraceCheckUtils]: 20: Hoare triple {39035#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39036#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,756 INFO L273 TraceCheckUtils]: 21: Hoare triple {39036#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39036#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {39036#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39036#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,757 INFO L273 TraceCheckUtils]: 23: Hoare triple {39036#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39037#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,758 INFO L273 TraceCheckUtils]: 24: Hoare triple {39037#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39037#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {39037#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39037#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {39037#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39038#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {39038#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39038#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,760 INFO L273 TraceCheckUtils]: 28: Hoare triple {39038#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39038#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,760 INFO L273 TraceCheckUtils]: 29: Hoare triple {39038#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39039#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,761 INFO L273 TraceCheckUtils]: 30: Hoare triple {39039#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39039#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,761 INFO L273 TraceCheckUtils]: 31: Hoare triple {39039#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39039#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,762 INFO L273 TraceCheckUtils]: 32: Hoare triple {39039#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39040#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,762 INFO L273 TraceCheckUtils]: 33: Hoare triple {39040#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39040#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,763 INFO L273 TraceCheckUtils]: 34: Hoare triple {39040#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39040#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,764 INFO L273 TraceCheckUtils]: 35: Hoare triple {39040#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39041#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,764 INFO L273 TraceCheckUtils]: 36: Hoare triple {39041#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39041#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,764 INFO L273 TraceCheckUtils]: 37: Hoare triple {39041#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39041#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {39041#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39042#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,766 INFO L273 TraceCheckUtils]: 39: Hoare triple {39042#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39042#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,766 INFO L273 TraceCheckUtils]: 40: Hoare triple {39042#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39042#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,767 INFO L273 TraceCheckUtils]: 41: Hoare triple {39042#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39043#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,767 INFO L273 TraceCheckUtils]: 42: Hoare triple {39043#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39043#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,768 INFO L273 TraceCheckUtils]: 43: Hoare triple {39043#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39043#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,768 INFO L273 TraceCheckUtils]: 44: Hoare triple {39043#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39044#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,769 INFO L273 TraceCheckUtils]: 45: Hoare triple {39044#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39044#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,769 INFO L273 TraceCheckUtils]: 46: Hoare triple {39044#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39044#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,770 INFO L273 TraceCheckUtils]: 47: Hoare triple {39044#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39045#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,770 INFO L273 TraceCheckUtils]: 48: Hoare triple {39045#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39045#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,771 INFO L273 TraceCheckUtils]: 49: Hoare triple {39045#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39045#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,772 INFO L273 TraceCheckUtils]: 50: Hoare triple {39045#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39046#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,772 INFO L273 TraceCheckUtils]: 51: Hoare triple {39046#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39046#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,772 INFO L273 TraceCheckUtils]: 52: Hoare triple {39046#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39046#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {39046#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39047#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,774 INFO L273 TraceCheckUtils]: 54: Hoare triple {39047#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39047#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,774 INFO L273 TraceCheckUtils]: 55: Hoare triple {39047#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39047#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,775 INFO L273 TraceCheckUtils]: 56: Hoare triple {39047#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39048#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,775 INFO L273 TraceCheckUtils]: 57: Hoare triple {39048#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39048#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,776 INFO L273 TraceCheckUtils]: 58: Hoare triple {39048#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39048#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,776 INFO L273 TraceCheckUtils]: 59: Hoare triple {39048#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39049#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,777 INFO L273 TraceCheckUtils]: 60: Hoare triple {39049#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39049#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,777 INFO L273 TraceCheckUtils]: 61: Hoare triple {39049#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39049#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,778 INFO L273 TraceCheckUtils]: 62: Hoare triple {39049#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39050#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,778 INFO L273 TraceCheckUtils]: 63: Hoare triple {39050#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39050#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,779 INFO L273 TraceCheckUtils]: 64: Hoare triple {39050#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39050#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,780 INFO L273 TraceCheckUtils]: 65: Hoare triple {39050#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39051#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,780 INFO L273 TraceCheckUtils]: 66: Hoare triple {39051#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39051#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,780 INFO L273 TraceCheckUtils]: 67: Hoare triple {39051#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39051#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,781 INFO L273 TraceCheckUtils]: 68: Hoare triple {39051#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39052#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,782 INFO L273 TraceCheckUtils]: 69: Hoare triple {39052#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39052#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,782 INFO L273 TraceCheckUtils]: 70: Hoare triple {39052#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39052#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,783 INFO L273 TraceCheckUtils]: 71: Hoare triple {39052#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39053#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,783 INFO L273 TraceCheckUtils]: 72: Hoare triple {39053#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39053#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,784 INFO L273 TraceCheckUtils]: 73: Hoare triple {39053#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39053#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,784 INFO L273 TraceCheckUtils]: 74: Hoare triple {39053#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39054#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,785 INFO L273 TraceCheckUtils]: 75: Hoare triple {39054#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39054#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,785 INFO L273 TraceCheckUtils]: 76: Hoare triple {39054#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39054#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,786 INFO L273 TraceCheckUtils]: 77: Hoare triple {39054#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39055#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,786 INFO L273 TraceCheckUtils]: 78: Hoare triple {39055#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39055#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,787 INFO L273 TraceCheckUtils]: 79: Hoare triple {39055#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39055#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,788 INFO L273 TraceCheckUtils]: 80: Hoare triple {39055#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39056#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,788 INFO L273 TraceCheckUtils]: 81: Hoare triple {39056#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39056#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,789 INFO L273 TraceCheckUtils]: 82: Hoare triple {39056#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39056#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,789 INFO L273 TraceCheckUtils]: 83: Hoare triple {39056#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39057#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,790 INFO L273 TraceCheckUtils]: 84: Hoare triple {39057#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39057#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,790 INFO L273 TraceCheckUtils]: 85: Hoare triple {39057#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39057#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,791 INFO L273 TraceCheckUtils]: 86: Hoare triple {39057#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39058#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,791 INFO L273 TraceCheckUtils]: 87: Hoare triple {39058#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39058#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,792 INFO L273 TraceCheckUtils]: 88: Hoare triple {39058#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39058#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,792 INFO L273 TraceCheckUtils]: 89: Hoare triple {39058#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39059#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,793 INFO L273 TraceCheckUtils]: 90: Hoare triple {39059#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39059#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,793 INFO L273 TraceCheckUtils]: 91: Hoare triple {39059#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39059#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,794 INFO L273 TraceCheckUtils]: 92: Hoare triple {39059#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39060#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,795 INFO L273 TraceCheckUtils]: 93: Hoare triple {39060#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39060#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,795 INFO L273 TraceCheckUtils]: 94: Hoare triple {39060#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39060#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,796 INFO L273 TraceCheckUtils]: 95: Hoare triple {39060#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39061#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,796 INFO L273 TraceCheckUtils]: 96: Hoare triple {39061#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39061#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,797 INFO L273 TraceCheckUtils]: 97: Hoare triple {39061#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39061#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,797 INFO L273 TraceCheckUtils]: 98: Hoare triple {39061#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39062#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,798 INFO L273 TraceCheckUtils]: 99: Hoare triple {39062#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39062#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,798 INFO L273 TraceCheckUtils]: 100: Hoare triple {39062#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39062#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,799 INFO L273 TraceCheckUtils]: 101: Hoare triple {39062#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39063#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,799 INFO L273 TraceCheckUtils]: 102: Hoare triple {39063#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39063#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,800 INFO L273 TraceCheckUtils]: 103: Hoare triple {39063#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39063#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,800 INFO L273 TraceCheckUtils]: 104: Hoare triple {39063#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39064#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,801 INFO L273 TraceCheckUtils]: 105: Hoare triple {39064#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39064#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,801 INFO L273 TraceCheckUtils]: 106: Hoare triple {39064#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39064#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,802 INFO L273 TraceCheckUtils]: 107: Hoare triple {39064#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39065#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:32,802 INFO L273 TraceCheckUtils]: 108: Hoare triple {39065#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39065#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:32,803 INFO L273 TraceCheckUtils]: 109: Hoare triple {39065#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39065#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:32,804 INFO L273 TraceCheckUtils]: 110: Hoare triple {39065#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39066#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:32,804 INFO L273 TraceCheckUtils]: 111: Hoare triple {39066#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39066#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:32,805 INFO L273 TraceCheckUtils]: 112: Hoare triple {39066#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39066#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:32,805 INFO L273 TraceCheckUtils]: 113: Hoare triple {39066#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39067#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:32,806 INFO L273 TraceCheckUtils]: 114: Hoare triple {39067#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39067#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:32,806 INFO L273 TraceCheckUtils]: 115: Hoare triple {39067#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39067#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:32,807 INFO L273 TraceCheckUtils]: 116: Hoare triple {39067#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39068#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:32,807 INFO L273 TraceCheckUtils]: 117: Hoare triple {39068#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39068#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:32,808 INFO L273 TraceCheckUtils]: 118: Hoare triple {39068#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39068#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:32,808 INFO L273 TraceCheckUtils]: 119: Hoare triple {39068#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39069#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:32,809 INFO L273 TraceCheckUtils]: 120: Hoare triple {39069#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39069#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:32,809 INFO L273 TraceCheckUtils]: 121: Hoare triple {39069#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39069#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:32,810 INFO L273 TraceCheckUtils]: 122: Hoare triple {39069#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39070#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:32,810 INFO L273 TraceCheckUtils]: 123: Hoare triple {39070#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39070#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:32,811 INFO L273 TraceCheckUtils]: 124: Hoare triple {39070#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39070#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:32,812 INFO L273 TraceCheckUtils]: 125: Hoare triple {39070#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39071#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:32,812 INFO L273 TraceCheckUtils]: 126: Hoare triple {39071#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39071#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:32,813 INFO L273 TraceCheckUtils]: 127: Hoare triple {39071#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39071#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:32,813 INFO L273 TraceCheckUtils]: 128: Hoare triple {39071#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39072#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:32,814 INFO L273 TraceCheckUtils]: 129: Hoare triple {39072#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39072#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:32,814 INFO L273 TraceCheckUtils]: 130: Hoare triple {39072#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39072#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:32,815 INFO L273 TraceCheckUtils]: 131: Hoare triple {39072#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39073#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:32,815 INFO L273 TraceCheckUtils]: 132: Hoare triple {39073#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39073#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:32,816 INFO L273 TraceCheckUtils]: 133: Hoare triple {39073#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39073#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:32,817 INFO L273 TraceCheckUtils]: 134: Hoare triple {39073#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39074#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:32,817 INFO L273 TraceCheckUtils]: 135: Hoare triple {39074#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39074#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:32,817 INFO L273 TraceCheckUtils]: 136: Hoare triple {39074#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39074#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:32,818 INFO L273 TraceCheckUtils]: 137: Hoare triple {39074#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39075#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:32,819 INFO L273 TraceCheckUtils]: 138: Hoare triple {39075#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39075#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:32,819 INFO L273 TraceCheckUtils]: 139: Hoare triple {39075#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39075#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:32,820 INFO L273 TraceCheckUtils]: 140: Hoare triple {39075#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39076#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:32,820 INFO L273 TraceCheckUtils]: 141: Hoare triple {39076#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39076#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:32,821 INFO L273 TraceCheckUtils]: 142: Hoare triple {39076#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39076#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:32,821 INFO L273 TraceCheckUtils]: 143: Hoare triple {39076#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39077#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:32,822 INFO L273 TraceCheckUtils]: 144: Hoare triple {39077#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39077#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:32,822 INFO L273 TraceCheckUtils]: 145: Hoare triple {39077#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39077#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:32,823 INFO L273 TraceCheckUtils]: 146: Hoare triple {39077#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39078#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:32,823 INFO L273 TraceCheckUtils]: 147: Hoare triple {39078#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39078#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:32,824 INFO L273 TraceCheckUtils]: 148: Hoare triple {39078#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39078#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:32,825 INFO L273 TraceCheckUtils]: 149: Hoare triple {39078#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39079#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:32,825 INFO L273 TraceCheckUtils]: 150: Hoare triple {39079#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39079#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:32,825 INFO L273 TraceCheckUtils]: 151: Hoare triple {39079#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39079#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:32,826 INFO L273 TraceCheckUtils]: 152: Hoare triple {39079#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39080#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:32,827 INFO L273 TraceCheckUtils]: 153: Hoare triple {39080#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39080#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:32,827 INFO L273 TraceCheckUtils]: 154: Hoare triple {39080#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39080#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:32,828 INFO L273 TraceCheckUtils]: 155: Hoare triple {39080#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39081#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:32,828 INFO L273 TraceCheckUtils]: 156: Hoare triple {39081#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39081#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:32,829 INFO L273 TraceCheckUtils]: 157: Hoare triple {39081#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39081#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:32,829 INFO L273 TraceCheckUtils]: 158: Hoare triple {39081#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39082#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:32,830 INFO L273 TraceCheckUtils]: 159: Hoare triple {39082#(<= main_~i~0 52)} assume !(~i~0 < 100000); {39030#false} is VALID [2018-11-23 12:00:32,830 INFO L273 TraceCheckUtils]: 160: Hoare triple {39030#false} havoc ~x~0;~x~0 := 0; {39030#false} is VALID [2018-11-23 12:00:32,830 INFO L273 TraceCheckUtils]: 161: Hoare triple {39030#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {39030#false} is VALID [2018-11-23 12:00:32,830 INFO L256 TraceCheckUtils]: 162: Hoare triple {39030#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {39030#false} is VALID [2018-11-23 12:00:32,831 INFO L273 TraceCheckUtils]: 163: Hoare triple {39030#false} ~cond := #in~cond; {39030#false} is VALID [2018-11-23 12:00:32,831 INFO L273 TraceCheckUtils]: 164: Hoare triple {39030#false} assume 0 == ~cond; {39030#false} is VALID [2018-11-23 12:00:32,831 INFO L273 TraceCheckUtils]: 165: Hoare triple {39030#false} assume !false; {39030#false} is VALID [2018-11-23 12:00:32,848 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 12:00:32,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:32,848 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 12:00:32,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:32,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-11-23 12:00:32,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:33,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:33,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {39029#true} call ULTIMATE.init(); {39029#true} is VALID [2018-11-23 12:00:33,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {39029#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39029#true} is VALID [2018-11-23 12:00:33,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {39029#true} assume true; {39029#true} is VALID [2018-11-23 12:00:33,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39029#true} {39029#true} #54#return; {39029#true} is VALID [2018-11-23 12:00:33,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {39029#true} call #t~ret6 := main(); {39029#true} is VALID [2018-11-23 12:00:33,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {39029#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {39031#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:33,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {39031#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39031#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:33,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {39031#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39031#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:33,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {39031#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39032#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:33,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {39032#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39032#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:33,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {39032#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39032#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:33,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {39032#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39033#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:33,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {39033#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39033#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:33,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {39033#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39033#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:33,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {39033#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39034#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:33,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {39034#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39034#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:33,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {39034#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39034#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:33,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {39034#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39035#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:33,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {39035#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39035#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:33,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {39035#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39035#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:33,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {39035#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39036#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:33,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {39036#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39036#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:33,988 INFO L273 TraceCheckUtils]: 22: Hoare triple {39036#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39036#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:33,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {39036#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39037#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:33,989 INFO L273 TraceCheckUtils]: 24: Hoare triple {39037#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39037#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:33,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {39037#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39037#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:33,990 INFO L273 TraceCheckUtils]: 26: Hoare triple {39037#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39038#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:33,991 INFO L273 TraceCheckUtils]: 27: Hoare triple {39038#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39038#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:33,991 INFO L273 TraceCheckUtils]: 28: Hoare triple {39038#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39038#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:33,992 INFO L273 TraceCheckUtils]: 29: Hoare triple {39038#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39039#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:33,992 INFO L273 TraceCheckUtils]: 30: Hoare triple {39039#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39039#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:33,993 INFO L273 TraceCheckUtils]: 31: Hoare triple {39039#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39039#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:33,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {39039#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39040#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:33,994 INFO L273 TraceCheckUtils]: 33: Hoare triple {39040#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39040#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:33,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {39040#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39040#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:33,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {39040#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39041#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:33,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {39041#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39041#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:33,996 INFO L273 TraceCheckUtils]: 37: Hoare triple {39041#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39041#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:33,997 INFO L273 TraceCheckUtils]: 38: Hoare triple {39041#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39042#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:33,997 INFO L273 TraceCheckUtils]: 39: Hoare triple {39042#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39042#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:33,998 INFO L273 TraceCheckUtils]: 40: Hoare triple {39042#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39042#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:33,999 INFO L273 TraceCheckUtils]: 41: Hoare triple {39042#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39043#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:33,999 INFO L273 TraceCheckUtils]: 42: Hoare triple {39043#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39043#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:34,000 INFO L273 TraceCheckUtils]: 43: Hoare triple {39043#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39043#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:34,000 INFO L273 TraceCheckUtils]: 44: Hoare triple {39043#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39044#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:34,001 INFO L273 TraceCheckUtils]: 45: Hoare triple {39044#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39044#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:34,001 INFO L273 TraceCheckUtils]: 46: Hoare triple {39044#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39044#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:34,002 INFO L273 TraceCheckUtils]: 47: Hoare triple {39044#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39045#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:34,002 INFO L273 TraceCheckUtils]: 48: Hoare triple {39045#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39045#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:34,003 INFO L273 TraceCheckUtils]: 49: Hoare triple {39045#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39045#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:34,004 INFO L273 TraceCheckUtils]: 50: Hoare triple {39045#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39046#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:34,004 INFO L273 TraceCheckUtils]: 51: Hoare triple {39046#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39046#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:34,005 INFO L273 TraceCheckUtils]: 52: Hoare triple {39046#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39046#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:34,005 INFO L273 TraceCheckUtils]: 53: Hoare triple {39046#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39047#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:34,006 INFO L273 TraceCheckUtils]: 54: Hoare triple {39047#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39047#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:34,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {39047#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39047#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:34,007 INFO L273 TraceCheckUtils]: 56: Hoare triple {39047#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39048#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:34,007 INFO L273 TraceCheckUtils]: 57: Hoare triple {39048#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39048#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:34,008 INFO L273 TraceCheckUtils]: 58: Hoare triple {39048#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39048#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:34,009 INFO L273 TraceCheckUtils]: 59: Hoare triple {39048#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39049#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:34,009 INFO L273 TraceCheckUtils]: 60: Hoare triple {39049#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39049#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:34,010 INFO L273 TraceCheckUtils]: 61: Hoare triple {39049#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39049#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:34,010 INFO L273 TraceCheckUtils]: 62: Hoare triple {39049#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39050#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:34,011 INFO L273 TraceCheckUtils]: 63: Hoare triple {39050#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39050#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:34,011 INFO L273 TraceCheckUtils]: 64: Hoare triple {39050#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39050#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:34,012 INFO L273 TraceCheckUtils]: 65: Hoare triple {39050#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39051#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:34,013 INFO L273 TraceCheckUtils]: 66: Hoare triple {39051#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39051#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:34,013 INFO L273 TraceCheckUtils]: 67: Hoare triple {39051#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39051#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:34,014 INFO L273 TraceCheckUtils]: 68: Hoare triple {39051#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39052#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:34,014 INFO L273 TraceCheckUtils]: 69: Hoare triple {39052#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39052#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:34,015 INFO L273 TraceCheckUtils]: 70: Hoare triple {39052#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39052#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:34,015 INFO L273 TraceCheckUtils]: 71: Hoare triple {39052#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39053#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:34,016 INFO L273 TraceCheckUtils]: 72: Hoare triple {39053#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39053#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:34,018 INFO L273 TraceCheckUtils]: 73: Hoare triple {39053#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39053#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:34,019 INFO L273 TraceCheckUtils]: 74: Hoare triple {39053#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39054#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:34,019 INFO L273 TraceCheckUtils]: 75: Hoare triple {39054#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39054#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:34,019 INFO L273 TraceCheckUtils]: 76: Hoare triple {39054#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39054#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:34,020 INFO L273 TraceCheckUtils]: 77: Hoare triple {39054#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39055#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:34,020 INFO L273 TraceCheckUtils]: 78: Hoare triple {39055#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39055#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:34,020 INFO L273 TraceCheckUtils]: 79: Hoare triple {39055#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39055#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:34,021 INFO L273 TraceCheckUtils]: 80: Hoare triple {39055#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39056#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:34,021 INFO L273 TraceCheckUtils]: 81: Hoare triple {39056#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39056#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:34,021 INFO L273 TraceCheckUtils]: 82: Hoare triple {39056#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39056#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:34,022 INFO L273 TraceCheckUtils]: 83: Hoare triple {39056#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39057#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:34,022 INFO L273 TraceCheckUtils]: 84: Hoare triple {39057#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39057#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:34,023 INFO L273 TraceCheckUtils]: 85: Hoare triple {39057#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39057#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:34,023 INFO L273 TraceCheckUtils]: 86: Hoare triple {39057#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39058#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:34,024 INFO L273 TraceCheckUtils]: 87: Hoare triple {39058#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39058#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:34,024 INFO L273 TraceCheckUtils]: 88: Hoare triple {39058#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39058#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:34,025 INFO L273 TraceCheckUtils]: 89: Hoare triple {39058#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39059#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:34,025 INFO L273 TraceCheckUtils]: 90: Hoare triple {39059#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39059#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:34,026 INFO L273 TraceCheckUtils]: 91: Hoare triple {39059#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39059#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:34,027 INFO L273 TraceCheckUtils]: 92: Hoare triple {39059#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39060#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:34,027 INFO L273 TraceCheckUtils]: 93: Hoare triple {39060#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39060#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:34,028 INFO L273 TraceCheckUtils]: 94: Hoare triple {39060#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39060#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:34,028 INFO L273 TraceCheckUtils]: 95: Hoare triple {39060#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39061#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:34,029 INFO L273 TraceCheckUtils]: 96: Hoare triple {39061#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39061#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:34,029 INFO L273 TraceCheckUtils]: 97: Hoare triple {39061#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39061#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:34,030 INFO L273 TraceCheckUtils]: 98: Hoare triple {39061#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39062#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:34,030 INFO L273 TraceCheckUtils]: 99: Hoare triple {39062#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39062#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:34,031 INFO L273 TraceCheckUtils]: 100: Hoare triple {39062#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39062#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:34,032 INFO L273 TraceCheckUtils]: 101: Hoare triple {39062#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39063#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:34,032 INFO L273 TraceCheckUtils]: 102: Hoare triple {39063#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39063#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:34,033 INFO L273 TraceCheckUtils]: 103: Hoare triple {39063#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39063#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:34,033 INFO L273 TraceCheckUtils]: 104: Hoare triple {39063#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39064#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:34,034 INFO L273 TraceCheckUtils]: 105: Hoare triple {39064#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39064#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:34,034 INFO L273 TraceCheckUtils]: 106: Hoare triple {39064#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39064#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:34,035 INFO L273 TraceCheckUtils]: 107: Hoare triple {39064#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39065#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:34,035 INFO L273 TraceCheckUtils]: 108: Hoare triple {39065#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39065#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:34,036 INFO L273 TraceCheckUtils]: 109: Hoare triple {39065#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39065#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:34,037 INFO L273 TraceCheckUtils]: 110: Hoare triple {39065#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39066#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:34,037 INFO L273 TraceCheckUtils]: 111: Hoare triple {39066#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39066#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:34,038 INFO L273 TraceCheckUtils]: 112: Hoare triple {39066#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39066#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:34,038 INFO L273 TraceCheckUtils]: 113: Hoare triple {39066#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39067#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:34,039 INFO L273 TraceCheckUtils]: 114: Hoare triple {39067#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39067#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:34,039 INFO L273 TraceCheckUtils]: 115: Hoare triple {39067#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39067#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:34,040 INFO L273 TraceCheckUtils]: 116: Hoare triple {39067#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39068#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:34,040 INFO L273 TraceCheckUtils]: 117: Hoare triple {39068#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39068#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:34,041 INFO L273 TraceCheckUtils]: 118: Hoare triple {39068#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39068#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:34,042 INFO L273 TraceCheckUtils]: 119: Hoare triple {39068#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39069#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:34,042 INFO L273 TraceCheckUtils]: 120: Hoare triple {39069#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39069#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:34,043 INFO L273 TraceCheckUtils]: 121: Hoare triple {39069#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39069#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:34,043 INFO L273 TraceCheckUtils]: 122: Hoare triple {39069#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39070#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:34,044 INFO L273 TraceCheckUtils]: 123: Hoare triple {39070#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39070#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:34,044 INFO L273 TraceCheckUtils]: 124: Hoare triple {39070#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39070#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:34,045 INFO L273 TraceCheckUtils]: 125: Hoare triple {39070#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39071#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:34,046 INFO L273 TraceCheckUtils]: 126: Hoare triple {39071#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39071#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:34,046 INFO L273 TraceCheckUtils]: 127: Hoare triple {39071#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39071#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:34,047 INFO L273 TraceCheckUtils]: 128: Hoare triple {39071#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39072#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:34,047 INFO L273 TraceCheckUtils]: 129: Hoare triple {39072#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39072#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:34,048 INFO L273 TraceCheckUtils]: 130: Hoare triple {39072#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39072#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:34,048 INFO L273 TraceCheckUtils]: 131: Hoare triple {39072#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39073#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:34,049 INFO L273 TraceCheckUtils]: 132: Hoare triple {39073#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39073#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:34,049 INFO L273 TraceCheckUtils]: 133: Hoare triple {39073#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39073#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:34,050 INFO L273 TraceCheckUtils]: 134: Hoare triple {39073#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39074#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:34,050 INFO L273 TraceCheckUtils]: 135: Hoare triple {39074#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39074#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:34,051 INFO L273 TraceCheckUtils]: 136: Hoare triple {39074#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39074#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:34,051 INFO L273 TraceCheckUtils]: 137: Hoare triple {39074#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39075#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:34,052 INFO L273 TraceCheckUtils]: 138: Hoare triple {39075#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39075#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:34,052 INFO L273 TraceCheckUtils]: 139: Hoare triple {39075#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39075#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:34,053 INFO L273 TraceCheckUtils]: 140: Hoare triple {39075#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39076#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:34,054 INFO L273 TraceCheckUtils]: 141: Hoare triple {39076#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39076#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:34,054 INFO L273 TraceCheckUtils]: 142: Hoare triple {39076#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39076#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:34,055 INFO L273 TraceCheckUtils]: 143: Hoare triple {39076#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39077#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:34,055 INFO L273 TraceCheckUtils]: 144: Hoare triple {39077#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39077#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:34,056 INFO L273 TraceCheckUtils]: 145: Hoare triple {39077#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39077#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:34,056 INFO L273 TraceCheckUtils]: 146: Hoare triple {39077#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39078#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:34,057 INFO L273 TraceCheckUtils]: 147: Hoare triple {39078#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39078#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:34,057 INFO L273 TraceCheckUtils]: 148: Hoare triple {39078#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39078#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:34,058 INFO L273 TraceCheckUtils]: 149: Hoare triple {39078#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39079#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:34,059 INFO L273 TraceCheckUtils]: 150: Hoare triple {39079#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39079#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:34,059 INFO L273 TraceCheckUtils]: 151: Hoare triple {39079#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39079#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:34,060 INFO L273 TraceCheckUtils]: 152: Hoare triple {39079#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39080#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:34,060 INFO L273 TraceCheckUtils]: 153: Hoare triple {39080#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39080#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:34,061 INFO L273 TraceCheckUtils]: 154: Hoare triple {39080#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39080#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:34,061 INFO L273 TraceCheckUtils]: 155: Hoare triple {39080#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39081#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:34,062 INFO L273 TraceCheckUtils]: 156: Hoare triple {39081#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39081#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:34,062 INFO L273 TraceCheckUtils]: 157: Hoare triple {39081#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {39081#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:34,063 INFO L273 TraceCheckUtils]: 158: Hoare triple {39081#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39082#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:34,064 INFO L273 TraceCheckUtils]: 159: Hoare triple {39082#(<= main_~i~0 52)} assume !(~i~0 < 100000); {39030#false} is VALID [2018-11-23 12:00:34,064 INFO L273 TraceCheckUtils]: 160: Hoare triple {39030#false} havoc ~x~0;~x~0 := 0; {39030#false} is VALID [2018-11-23 12:00:34,064 INFO L273 TraceCheckUtils]: 161: Hoare triple {39030#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {39030#false} is VALID [2018-11-23 12:00:34,064 INFO L256 TraceCheckUtils]: 162: Hoare triple {39030#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {39030#false} is VALID [2018-11-23 12:00:34,064 INFO L273 TraceCheckUtils]: 163: Hoare triple {39030#false} ~cond := #in~cond; {39030#false} is VALID [2018-11-23 12:00:34,065 INFO L273 TraceCheckUtils]: 164: Hoare triple {39030#false} assume 0 == ~cond; {39030#false} is VALID [2018-11-23 12:00:34,065 INFO L273 TraceCheckUtils]: 165: Hoare triple {39030#false} assume !false; {39030#false} is VALID [2018-11-23 12:00:34,082 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 12:00:34,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:34,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-11-23 12:00:34,102 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 166 [2018-11-23 12:00:34,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:34,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 12:00:34,262 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 12:00:34,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 12:00:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 12:00:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:00:34,263 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 54 states. [2018-11-23 12:00:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:35,463 INFO L93 Difference]: Finished difference Result 187 states and 242 transitions. [2018-11-23 12:00:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 12:00:35,463 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 166 [2018-11-23 12:00:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:00:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 242 transitions. [2018-11-23 12:00:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:00:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 242 transitions. [2018-11-23 12:00:35,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 242 transitions. [2018-11-23 12:00:35,693 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 12:00:35,696 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:00:35,696 INFO L226 Difference]: Without dead ends: 176 [2018-11-23 12:00:35,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:00:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-23 12:00:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-11-23 12:00:35,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:35,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand 174 states. [2018-11-23 12:00:35,742 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 174 states. [2018-11-23 12:00:35,742 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 174 states. [2018-11-23 12:00:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:35,744 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2018-11-23 12:00:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2018-11-23 12:00:35,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:35,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:35,745 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 176 states. [2018-11-23 12:00:35,745 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 176 states. [2018-11-23 12:00:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:35,747 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2018-11-23 12:00:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2018-11-23 12:00:35,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:35,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:35,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:35,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 12:00:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 227 transitions. [2018-11-23 12:00:35,750 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 227 transitions. Word has length 166 [2018-11-23 12:00:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:35,750 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 227 transitions. [2018-11-23 12:00:35,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 12:00:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2018-11-23 12:00:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-23 12:00:35,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:35,751 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:35,752 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:35,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash -376069833, now seen corresponding path program 52 times [2018-11-23 12:00:35,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:35,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:35,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:37,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {40416#true} call ULTIMATE.init(); {40416#true} is VALID [2018-11-23 12:00:37,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {40416#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40416#true} is VALID [2018-11-23 12:00:37,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {40416#true} assume true; {40416#true} is VALID [2018-11-23 12:00:37,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40416#true} {40416#true} #54#return; {40416#true} is VALID [2018-11-23 12:00:37,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {40416#true} call #t~ret6 := main(); {40416#true} is VALID [2018-11-23 12:00:37,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {40416#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {40418#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:37,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {40418#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40418#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:37,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {40418#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40418#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:37,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {40418#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40419#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:37,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {40419#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40419#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:37,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {40419#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40419#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:37,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {40419#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40420#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:37,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {40420#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40420#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:37,633 INFO L273 TraceCheckUtils]: 13: Hoare triple {40420#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40420#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:37,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {40420#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40421#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:37,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {40421#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40421#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:37,635 INFO L273 TraceCheckUtils]: 16: Hoare triple {40421#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40421#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:37,635 INFO L273 TraceCheckUtils]: 17: Hoare triple {40421#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40422#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:37,636 INFO L273 TraceCheckUtils]: 18: Hoare triple {40422#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40422#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:37,636 INFO L273 TraceCheckUtils]: 19: Hoare triple {40422#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40422#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:37,637 INFO L273 TraceCheckUtils]: 20: Hoare triple {40422#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40423#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:37,638 INFO L273 TraceCheckUtils]: 21: Hoare triple {40423#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40423#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:37,638 INFO L273 TraceCheckUtils]: 22: Hoare triple {40423#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40423#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:37,639 INFO L273 TraceCheckUtils]: 23: Hoare triple {40423#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40424#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:37,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {40424#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40424#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:37,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {40424#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40424#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:37,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {40424#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40425#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:37,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {40425#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40425#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:37,641 INFO L273 TraceCheckUtils]: 28: Hoare triple {40425#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40425#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:37,642 INFO L273 TraceCheckUtils]: 29: Hoare triple {40425#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40426#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:37,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {40426#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40426#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:37,643 INFO L273 TraceCheckUtils]: 31: Hoare triple {40426#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40426#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:37,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {40426#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40427#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:37,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {40427#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40427#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:37,645 INFO L273 TraceCheckUtils]: 34: Hoare triple {40427#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40427#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:37,646 INFO L273 TraceCheckUtils]: 35: Hoare triple {40427#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40428#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:37,646 INFO L273 TraceCheckUtils]: 36: Hoare triple {40428#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40428#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:37,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {40428#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40428#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:37,647 INFO L273 TraceCheckUtils]: 38: Hoare triple {40428#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40429#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:37,648 INFO L273 TraceCheckUtils]: 39: Hoare triple {40429#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40429#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:37,648 INFO L273 TraceCheckUtils]: 40: Hoare triple {40429#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40429#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:37,649 INFO L273 TraceCheckUtils]: 41: Hoare triple {40429#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40430#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:37,650 INFO L273 TraceCheckUtils]: 42: Hoare triple {40430#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40430#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:37,650 INFO L273 TraceCheckUtils]: 43: Hoare triple {40430#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40430#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:37,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {40430#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40431#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:37,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {40431#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40431#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:37,652 INFO L273 TraceCheckUtils]: 46: Hoare triple {40431#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40431#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:37,652 INFO L273 TraceCheckUtils]: 47: Hoare triple {40431#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40432#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:37,653 INFO L273 TraceCheckUtils]: 48: Hoare triple {40432#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40432#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:37,653 INFO L273 TraceCheckUtils]: 49: Hoare triple {40432#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40432#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:37,654 INFO L273 TraceCheckUtils]: 50: Hoare triple {40432#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40433#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 51: Hoare triple {40433#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40433#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 52: Hoare triple {40433#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40433#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 53: Hoare triple {40433#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40434#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 54: Hoare triple {40434#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40434#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 55: Hoare triple {40434#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40434#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {40434#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40435#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 57: Hoare triple {40435#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40435#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {40435#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40435#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 59: Hoare triple {40435#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40436#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:37,660 INFO L273 TraceCheckUtils]: 60: Hoare triple {40436#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40436#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:37,660 INFO L273 TraceCheckUtils]: 61: Hoare triple {40436#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40436#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:37,661 INFO L273 TraceCheckUtils]: 62: Hoare triple {40436#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40437#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:37,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {40437#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40437#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:37,662 INFO L273 TraceCheckUtils]: 64: Hoare triple {40437#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40437#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:37,663 INFO L273 TraceCheckUtils]: 65: Hoare triple {40437#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40438#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:37,663 INFO L273 TraceCheckUtils]: 66: Hoare triple {40438#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40438#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:37,664 INFO L273 TraceCheckUtils]: 67: Hoare triple {40438#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40438#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:37,664 INFO L273 TraceCheckUtils]: 68: Hoare triple {40438#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40439#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:37,665 INFO L273 TraceCheckUtils]: 69: Hoare triple {40439#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40439#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:37,665 INFO L273 TraceCheckUtils]: 70: Hoare triple {40439#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40439#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:37,666 INFO L273 TraceCheckUtils]: 71: Hoare triple {40439#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40440#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:37,667 INFO L273 TraceCheckUtils]: 72: Hoare triple {40440#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40440#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:37,667 INFO L273 TraceCheckUtils]: 73: Hoare triple {40440#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40440#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:37,668 INFO L273 TraceCheckUtils]: 74: Hoare triple {40440#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40441#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:37,668 INFO L273 TraceCheckUtils]: 75: Hoare triple {40441#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40441#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:37,669 INFO L273 TraceCheckUtils]: 76: Hoare triple {40441#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40441#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:37,670 INFO L273 TraceCheckUtils]: 77: Hoare triple {40441#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40442#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:37,670 INFO L273 TraceCheckUtils]: 78: Hoare triple {40442#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40442#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:37,671 INFO L273 TraceCheckUtils]: 79: Hoare triple {40442#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40442#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:37,671 INFO L273 TraceCheckUtils]: 80: Hoare triple {40442#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40443#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:37,672 INFO L273 TraceCheckUtils]: 81: Hoare triple {40443#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40443#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:37,672 INFO L273 TraceCheckUtils]: 82: Hoare triple {40443#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40443#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:37,673 INFO L273 TraceCheckUtils]: 83: Hoare triple {40443#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40444#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:37,674 INFO L273 TraceCheckUtils]: 84: Hoare triple {40444#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40444#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:37,674 INFO L273 TraceCheckUtils]: 85: Hoare triple {40444#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40444#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:37,675 INFO L273 TraceCheckUtils]: 86: Hoare triple {40444#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40445#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:37,675 INFO L273 TraceCheckUtils]: 87: Hoare triple {40445#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40445#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:37,676 INFO L273 TraceCheckUtils]: 88: Hoare triple {40445#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40445#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:37,676 INFO L273 TraceCheckUtils]: 89: Hoare triple {40445#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40446#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:37,677 INFO L273 TraceCheckUtils]: 90: Hoare triple {40446#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40446#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:37,677 INFO L273 TraceCheckUtils]: 91: Hoare triple {40446#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40446#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:37,678 INFO L273 TraceCheckUtils]: 92: Hoare triple {40446#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40447#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:37,679 INFO L273 TraceCheckUtils]: 93: Hoare triple {40447#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40447#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:37,679 INFO L273 TraceCheckUtils]: 94: Hoare triple {40447#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40447#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:37,680 INFO L273 TraceCheckUtils]: 95: Hoare triple {40447#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40448#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:37,680 INFO L273 TraceCheckUtils]: 96: Hoare triple {40448#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40448#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:37,681 INFO L273 TraceCheckUtils]: 97: Hoare triple {40448#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40448#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:37,682 INFO L273 TraceCheckUtils]: 98: Hoare triple {40448#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40449#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:37,682 INFO L273 TraceCheckUtils]: 99: Hoare triple {40449#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40449#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:37,683 INFO L273 TraceCheckUtils]: 100: Hoare triple {40449#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40449#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:37,683 INFO L273 TraceCheckUtils]: 101: Hoare triple {40449#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40450#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:37,684 INFO L273 TraceCheckUtils]: 102: Hoare triple {40450#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40450#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:37,684 INFO L273 TraceCheckUtils]: 103: Hoare triple {40450#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40450#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:37,685 INFO L273 TraceCheckUtils]: 104: Hoare triple {40450#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40451#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:37,685 INFO L273 TraceCheckUtils]: 105: Hoare triple {40451#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40451#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:37,686 INFO L273 TraceCheckUtils]: 106: Hoare triple {40451#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40451#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:37,687 INFO L273 TraceCheckUtils]: 107: Hoare triple {40451#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40452#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:37,701 INFO L273 TraceCheckUtils]: 108: Hoare triple {40452#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40452#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:37,703 INFO L273 TraceCheckUtils]: 109: Hoare triple {40452#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40452#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:37,704 INFO L273 TraceCheckUtils]: 110: Hoare triple {40452#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40453#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:37,704 INFO L273 TraceCheckUtils]: 111: Hoare triple {40453#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40453#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:37,704 INFO L273 TraceCheckUtils]: 112: Hoare triple {40453#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40453#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:37,705 INFO L273 TraceCheckUtils]: 113: Hoare triple {40453#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40454#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:37,705 INFO L273 TraceCheckUtils]: 114: Hoare triple {40454#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40454#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:37,705 INFO L273 TraceCheckUtils]: 115: Hoare triple {40454#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40454#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:37,706 INFO L273 TraceCheckUtils]: 116: Hoare triple {40454#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40455#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:37,706 INFO L273 TraceCheckUtils]: 117: Hoare triple {40455#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40455#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:37,707 INFO L273 TraceCheckUtils]: 118: Hoare triple {40455#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40455#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:37,708 INFO L273 TraceCheckUtils]: 119: Hoare triple {40455#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40456#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:37,708 INFO L273 TraceCheckUtils]: 120: Hoare triple {40456#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40456#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:37,709 INFO L273 TraceCheckUtils]: 121: Hoare triple {40456#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40456#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:37,709 INFO L273 TraceCheckUtils]: 122: Hoare triple {40456#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40457#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:37,710 INFO L273 TraceCheckUtils]: 123: Hoare triple {40457#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40457#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:37,710 INFO L273 TraceCheckUtils]: 124: Hoare triple {40457#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40457#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:37,711 INFO L273 TraceCheckUtils]: 125: Hoare triple {40457#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40458#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:37,712 INFO L273 TraceCheckUtils]: 126: Hoare triple {40458#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40458#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:37,712 INFO L273 TraceCheckUtils]: 127: Hoare triple {40458#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40458#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:37,713 INFO L273 TraceCheckUtils]: 128: Hoare triple {40458#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40459#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:37,713 INFO L273 TraceCheckUtils]: 129: Hoare triple {40459#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40459#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:37,714 INFO L273 TraceCheckUtils]: 130: Hoare triple {40459#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40459#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:37,714 INFO L273 TraceCheckUtils]: 131: Hoare triple {40459#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40460#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:37,715 INFO L273 TraceCheckUtils]: 132: Hoare triple {40460#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40460#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:37,715 INFO L273 TraceCheckUtils]: 133: Hoare triple {40460#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40460#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:37,716 INFO L273 TraceCheckUtils]: 134: Hoare triple {40460#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40461#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:37,717 INFO L273 TraceCheckUtils]: 135: Hoare triple {40461#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40461#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:37,717 INFO L273 TraceCheckUtils]: 136: Hoare triple {40461#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40461#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:37,718 INFO L273 TraceCheckUtils]: 137: Hoare triple {40461#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40462#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:37,718 INFO L273 TraceCheckUtils]: 138: Hoare triple {40462#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40462#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:37,719 INFO L273 TraceCheckUtils]: 139: Hoare triple {40462#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40462#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:37,720 INFO L273 TraceCheckUtils]: 140: Hoare triple {40462#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40463#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:37,720 INFO L273 TraceCheckUtils]: 141: Hoare triple {40463#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40463#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:37,721 INFO L273 TraceCheckUtils]: 142: Hoare triple {40463#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40463#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:37,721 INFO L273 TraceCheckUtils]: 143: Hoare triple {40463#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40464#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:37,722 INFO L273 TraceCheckUtils]: 144: Hoare triple {40464#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40464#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:37,722 INFO L273 TraceCheckUtils]: 145: Hoare triple {40464#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40464#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:37,723 INFO L273 TraceCheckUtils]: 146: Hoare triple {40464#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40465#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:37,723 INFO L273 TraceCheckUtils]: 147: Hoare triple {40465#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40465#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:37,724 INFO L273 TraceCheckUtils]: 148: Hoare triple {40465#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40465#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:37,725 INFO L273 TraceCheckUtils]: 149: Hoare triple {40465#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40466#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:37,725 INFO L273 TraceCheckUtils]: 150: Hoare triple {40466#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40466#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:37,726 INFO L273 TraceCheckUtils]: 151: Hoare triple {40466#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40466#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:37,726 INFO L273 TraceCheckUtils]: 152: Hoare triple {40466#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40467#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:37,727 INFO L273 TraceCheckUtils]: 153: Hoare triple {40467#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40467#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:37,727 INFO L273 TraceCheckUtils]: 154: Hoare triple {40467#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40467#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:37,728 INFO L273 TraceCheckUtils]: 155: Hoare triple {40467#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40468#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:37,729 INFO L273 TraceCheckUtils]: 156: Hoare triple {40468#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40468#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:37,729 INFO L273 TraceCheckUtils]: 157: Hoare triple {40468#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40468#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:37,730 INFO L273 TraceCheckUtils]: 158: Hoare triple {40468#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40469#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:37,730 INFO L273 TraceCheckUtils]: 159: Hoare triple {40469#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40469#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:37,731 INFO L273 TraceCheckUtils]: 160: Hoare triple {40469#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40469#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:37,731 INFO L273 TraceCheckUtils]: 161: Hoare triple {40469#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40470#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:37,732 INFO L273 TraceCheckUtils]: 162: Hoare triple {40470#(<= main_~i~0 53)} assume !(~i~0 < 100000); {40417#false} is VALID [2018-11-23 12:00:37,732 INFO L273 TraceCheckUtils]: 163: Hoare triple {40417#false} havoc ~x~0;~x~0 := 0; {40417#false} is VALID [2018-11-23 12:00:37,733 INFO L273 TraceCheckUtils]: 164: Hoare triple {40417#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {40417#false} is VALID [2018-11-23 12:00:37,733 INFO L256 TraceCheckUtils]: 165: Hoare triple {40417#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {40417#false} is VALID [2018-11-23 12:00:37,733 INFO L273 TraceCheckUtils]: 166: Hoare triple {40417#false} ~cond := #in~cond; {40417#false} is VALID [2018-11-23 12:00:37,733 INFO L273 TraceCheckUtils]: 167: Hoare triple {40417#false} assume 0 == ~cond; {40417#false} is VALID [2018-11-23 12:00:37,733 INFO L273 TraceCheckUtils]: 168: Hoare triple {40417#false} assume !false; {40417#false} is VALID [2018-11-23 12:00:37,751 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 12:00:37,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:37,751 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 12:00:37,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:37,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:37,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:37,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:38,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {40416#true} call ULTIMATE.init(); {40416#true} is VALID [2018-11-23 12:00:38,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {40416#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40416#true} is VALID [2018-11-23 12:00:38,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {40416#true} assume true; {40416#true} is VALID [2018-11-23 12:00:38,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40416#true} {40416#true} #54#return; {40416#true} is VALID [2018-11-23 12:00:38,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {40416#true} call #t~ret6 := main(); {40416#true} is VALID [2018-11-23 12:00:38,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {40416#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {40418#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:38,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {40418#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40418#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:38,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {40418#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40418#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:38,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {40418#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40419#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:38,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {40419#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40419#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:38,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {40419#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40419#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:38,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {40419#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40420#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:38,216 INFO L273 TraceCheckUtils]: 12: Hoare triple {40420#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40420#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:38,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {40420#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40420#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:38,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {40420#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40421#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:38,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {40421#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40421#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:38,218 INFO L273 TraceCheckUtils]: 16: Hoare triple {40421#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40421#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:38,219 INFO L273 TraceCheckUtils]: 17: Hoare triple {40421#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40422#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:38,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {40422#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40422#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:38,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {40422#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40422#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:38,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {40422#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40423#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:38,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {40423#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40423#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:38,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {40423#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40423#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:38,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {40423#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40424#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:38,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {40424#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40424#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:38,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {40424#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40424#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:38,224 INFO L273 TraceCheckUtils]: 26: Hoare triple {40424#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40425#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:38,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {40425#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40425#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:38,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {40425#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40425#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:38,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {40425#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40426#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:38,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {40426#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40426#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:38,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {40426#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40426#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:38,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {40426#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40427#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:38,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {40427#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40427#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:38,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {40427#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40427#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:38,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {40427#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40428#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:38,230 INFO L273 TraceCheckUtils]: 36: Hoare triple {40428#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40428#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:38,230 INFO L273 TraceCheckUtils]: 37: Hoare triple {40428#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40428#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:38,231 INFO L273 TraceCheckUtils]: 38: Hoare triple {40428#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40429#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:38,231 INFO L273 TraceCheckUtils]: 39: Hoare triple {40429#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40429#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:38,232 INFO L273 TraceCheckUtils]: 40: Hoare triple {40429#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40429#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:38,232 INFO L273 TraceCheckUtils]: 41: Hoare triple {40429#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40430#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:38,233 INFO L273 TraceCheckUtils]: 42: Hoare triple {40430#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40430#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:38,233 INFO L273 TraceCheckUtils]: 43: Hoare triple {40430#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40430#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:38,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {40430#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40431#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:38,235 INFO L273 TraceCheckUtils]: 45: Hoare triple {40431#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40431#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:38,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {40431#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40431#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:38,236 INFO L273 TraceCheckUtils]: 47: Hoare triple {40431#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40432#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:38,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {40432#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40432#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:38,237 INFO L273 TraceCheckUtils]: 49: Hoare triple {40432#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40432#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:38,238 INFO L273 TraceCheckUtils]: 50: Hoare triple {40432#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40433#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:38,238 INFO L273 TraceCheckUtils]: 51: Hoare triple {40433#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40433#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:38,239 INFO L273 TraceCheckUtils]: 52: Hoare triple {40433#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40433#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:38,239 INFO L273 TraceCheckUtils]: 53: Hoare triple {40433#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40434#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:38,240 INFO L273 TraceCheckUtils]: 54: Hoare triple {40434#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40434#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:38,240 INFO L273 TraceCheckUtils]: 55: Hoare triple {40434#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40434#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:38,241 INFO L273 TraceCheckUtils]: 56: Hoare triple {40434#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40435#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:38,241 INFO L273 TraceCheckUtils]: 57: Hoare triple {40435#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40435#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:38,242 INFO L273 TraceCheckUtils]: 58: Hoare triple {40435#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40435#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:38,243 INFO L273 TraceCheckUtils]: 59: Hoare triple {40435#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40436#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:38,243 INFO L273 TraceCheckUtils]: 60: Hoare triple {40436#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40436#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:38,244 INFO L273 TraceCheckUtils]: 61: Hoare triple {40436#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40436#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:38,244 INFO L273 TraceCheckUtils]: 62: Hoare triple {40436#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40437#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:38,245 INFO L273 TraceCheckUtils]: 63: Hoare triple {40437#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40437#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:38,245 INFO L273 TraceCheckUtils]: 64: Hoare triple {40437#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40437#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:38,246 INFO L273 TraceCheckUtils]: 65: Hoare triple {40437#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40438#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:38,247 INFO L273 TraceCheckUtils]: 66: Hoare triple {40438#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40438#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:38,247 INFO L273 TraceCheckUtils]: 67: Hoare triple {40438#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40438#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:38,248 INFO L273 TraceCheckUtils]: 68: Hoare triple {40438#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40439#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:38,248 INFO L273 TraceCheckUtils]: 69: Hoare triple {40439#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40439#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:38,249 INFO L273 TraceCheckUtils]: 70: Hoare triple {40439#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40439#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:38,250 INFO L273 TraceCheckUtils]: 71: Hoare triple {40439#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40440#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:38,250 INFO L273 TraceCheckUtils]: 72: Hoare triple {40440#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40440#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:38,251 INFO L273 TraceCheckUtils]: 73: Hoare triple {40440#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40440#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:38,251 INFO L273 TraceCheckUtils]: 74: Hoare triple {40440#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40441#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:38,252 INFO L273 TraceCheckUtils]: 75: Hoare triple {40441#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40441#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:38,252 INFO L273 TraceCheckUtils]: 76: Hoare triple {40441#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40441#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:38,253 INFO L273 TraceCheckUtils]: 77: Hoare triple {40441#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40442#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:38,253 INFO L273 TraceCheckUtils]: 78: Hoare triple {40442#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40442#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:38,254 INFO L273 TraceCheckUtils]: 79: Hoare triple {40442#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40442#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:38,255 INFO L273 TraceCheckUtils]: 80: Hoare triple {40442#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40443#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:38,255 INFO L273 TraceCheckUtils]: 81: Hoare triple {40443#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40443#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:38,256 INFO L273 TraceCheckUtils]: 82: Hoare triple {40443#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40443#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:38,256 INFO L273 TraceCheckUtils]: 83: Hoare triple {40443#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40444#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:38,257 INFO L273 TraceCheckUtils]: 84: Hoare triple {40444#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40444#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:38,257 INFO L273 TraceCheckUtils]: 85: Hoare triple {40444#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40444#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:38,258 INFO L273 TraceCheckUtils]: 86: Hoare triple {40444#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40445#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:38,259 INFO L273 TraceCheckUtils]: 87: Hoare triple {40445#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40445#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:38,259 INFO L273 TraceCheckUtils]: 88: Hoare triple {40445#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40445#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:38,260 INFO L273 TraceCheckUtils]: 89: Hoare triple {40445#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40446#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:38,260 INFO L273 TraceCheckUtils]: 90: Hoare triple {40446#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40446#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:38,261 INFO L273 TraceCheckUtils]: 91: Hoare triple {40446#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40446#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:38,262 INFO L273 TraceCheckUtils]: 92: Hoare triple {40446#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40447#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:38,262 INFO L273 TraceCheckUtils]: 93: Hoare triple {40447#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40447#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:38,263 INFO L273 TraceCheckUtils]: 94: Hoare triple {40447#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40447#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:38,263 INFO L273 TraceCheckUtils]: 95: Hoare triple {40447#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40448#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:38,264 INFO L273 TraceCheckUtils]: 96: Hoare triple {40448#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40448#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:38,264 INFO L273 TraceCheckUtils]: 97: Hoare triple {40448#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40448#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:38,265 INFO L273 TraceCheckUtils]: 98: Hoare triple {40448#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40449#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:38,265 INFO L273 TraceCheckUtils]: 99: Hoare triple {40449#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40449#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:38,266 INFO L273 TraceCheckUtils]: 100: Hoare triple {40449#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40449#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:38,267 INFO L273 TraceCheckUtils]: 101: Hoare triple {40449#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40450#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:38,267 INFO L273 TraceCheckUtils]: 102: Hoare triple {40450#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40450#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:38,268 INFO L273 TraceCheckUtils]: 103: Hoare triple {40450#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40450#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:38,268 INFO L273 TraceCheckUtils]: 104: Hoare triple {40450#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40451#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:38,269 INFO L273 TraceCheckUtils]: 105: Hoare triple {40451#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40451#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:38,269 INFO L273 TraceCheckUtils]: 106: Hoare triple {40451#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40451#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:38,270 INFO L273 TraceCheckUtils]: 107: Hoare triple {40451#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40452#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:38,271 INFO L273 TraceCheckUtils]: 108: Hoare triple {40452#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40452#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:38,271 INFO L273 TraceCheckUtils]: 109: Hoare triple {40452#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40452#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:38,272 INFO L273 TraceCheckUtils]: 110: Hoare triple {40452#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40453#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:38,272 INFO L273 TraceCheckUtils]: 111: Hoare triple {40453#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40453#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:38,273 INFO L273 TraceCheckUtils]: 112: Hoare triple {40453#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40453#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:38,274 INFO L273 TraceCheckUtils]: 113: Hoare triple {40453#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40454#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:38,274 INFO L273 TraceCheckUtils]: 114: Hoare triple {40454#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40454#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:38,275 INFO L273 TraceCheckUtils]: 115: Hoare triple {40454#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40454#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:38,275 INFO L273 TraceCheckUtils]: 116: Hoare triple {40454#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40455#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:38,276 INFO L273 TraceCheckUtils]: 117: Hoare triple {40455#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40455#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:38,276 INFO L273 TraceCheckUtils]: 118: Hoare triple {40455#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40455#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:38,277 INFO L273 TraceCheckUtils]: 119: Hoare triple {40455#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40456#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:38,277 INFO L273 TraceCheckUtils]: 120: Hoare triple {40456#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40456#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:38,278 INFO L273 TraceCheckUtils]: 121: Hoare triple {40456#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40456#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:38,279 INFO L273 TraceCheckUtils]: 122: Hoare triple {40456#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40457#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:38,279 INFO L273 TraceCheckUtils]: 123: Hoare triple {40457#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40457#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:38,280 INFO L273 TraceCheckUtils]: 124: Hoare triple {40457#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40457#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:38,280 INFO L273 TraceCheckUtils]: 125: Hoare triple {40457#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40458#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:38,281 INFO L273 TraceCheckUtils]: 126: Hoare triple {40458#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40458#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:38,281 INFO L273 TraceCheckUtils]: 127: Hoare triple {40458#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40458#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:38,282 INFO L273 TraceCheckUtils]: 128: Hoare triple {40458#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40459#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:38,283 INFO L273 TraceCheckUtils]: 129: Hoare triple {40459#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40459#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:38,283 INFO L273 TraceCheckUtils]: 130: Hoare triple {40459#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40459#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:38,284 INFO L273 TraceCheckUtils]: 131: Hoare triple {40459#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40460#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:38,284 INFO L273 TraceCheckUtils]: 132: Hoare triple {40460#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40460#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:38,285 INFO L273 TraceCheckUtils]: 133: Hoare triple {40460#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40460#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:38,285 INFO L273 TraceCheckUtils]: 134: Hoare triple {40460#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40461#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:38,286 INFO L273 TraceCheckUtils]: 135: Hoare triple {40461#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40461#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:38,286 INFO L273 TraceCheckUtils]: 136: Hoare triple {40461#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40461#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:38,287 INFO L273 TraceCheckUtils]: 137: Hoare triple {40461#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40462#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:38,288 INFO L273 TraceCheckUtils]: 138: Hoare triple {40462#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40462#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:38,288 INFO L273 TraceCheckUtils]: 139: Hoare triple {40462#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40462#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:38,289 INFO L273 TraceCheckUtils]: 140: Hoare triple {40462#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40463#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:38,289 INFO L273 TraceCheckUtils]: 141: Hoare triple {40463#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40463#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:38,290 INFO L273 TraceCheckUtils]: 142: Hoare triple {40463#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40463#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:38,291 INFO L273 TraceCheckUtils]: 143: Hoare triple {40463#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40464#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:38,291 INFO L273 TraceCheckUtils]: 144: Hoare triple {40464#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40464#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:38,292 INFO L273 TraceCheckUtils]: 145: Hoare triple {40464#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40464#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:38,292 INFO L273 TraceCheckUtils]: 146: Hoare triple {40464#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40465#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:38,293 INFO L273 TraceCheckUtils]: 147: Hoare triple {40465#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40465#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:38,293 INFO L273 TraceCheckUtils]: 148: Hoare triple {40465#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40465#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:38,294 INFO L273 TraceCheckUtils]: 149: Hoare triple {40465#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40466#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:38,295 INFO L273 TraceCheckUtils]: 150: Hoare triple {40466#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40466#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:38,295 INFO L273 TraceCheckUtils]: 151: Hoare triple {40466#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40466#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:38,296 INFO L273 TraceCheckUtils]: 152: Hoare triple {40466#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40467#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:38,296 INFO L273 TraceCheckUtils]: 153: Hoare triple {40467#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40467#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:38,297 INFO L273 TraceCheckUtils]: 154: Hoare triple {40467#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40467#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:38,297 INFO L273 TraceCheckUtils]: 155: Hoare triple {40467#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40468#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:38,298 INFO L273 TraceCheckUtils]: 156: Hoare triple {40468#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40468#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:38,298 INFO L273 TraceCheckUtils]: 157: Hoare triple {40468#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40468#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:38,299 INFO L273 TraceCheckUtils]: 158: Hoare triple {40468#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40469#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:38,300 INFO L273 TraceCheckUtils]: 159: Hoare triple {40469#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40469#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:38,300 INFO L273 TraceCheckUtils]: 160: Hoare triple {40469#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {40469#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:38,301 INFO L273 TraceCheckUtils]: 161: Hoare triple {40469#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40470#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:38,301 INFO L273 TraceCheckUtils]: 162: Hoare triple {40470#(<= main_~i~0 53)} assume !(~i~0 < 100000); {40417#false} is VALID [2018-11-23 12:00:38,302 INFO L273 TraceCheckUtils]: 163: Hoare triple {40417#false} havoc ~x~0;~x~0 := 0; {40417#false} is VALID [2018-11-23 12:00:38,302 INFO L273 TraceCheckUtils]: 164: Hoare triple {40417#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {40417#false} is VALID [2018-11-23 12:00:38,302 INFO L256 TraceCheckUtils]: 165: Hoare triple {40417#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {40417#false} is VALID [2018-11-23 12:00:38,302 INFO L273 TraceCheckUtils]: 166: Hoare triple {40417#false} ~cond := #in~cond; {40417#false} is VALID [2018-11-23 12:00:38,302 INFO L273 TraceCheckUtils]: 167: Hoare triple {40417#false} assume 0 == ~cond; {40417#false} is VALID [2018-11-23 12:00:38,303 INFO L273 TraceCheckUtils]: 168: Hoare triple {40417#false} assume !false; {40417#false} is VALID [2018-11-23 12:00:38,322 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 12:00:38,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:38,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-11-23 12:00:38,341 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 169 [2018-11-23 12:00:38,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:38,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:00:38,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:38,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:00:38,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:00:38,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:00:38,515 INFO L87 Difference]: Start difference. First operand 174 states and 227 transitions. Second operand 55 states. [2018-11-23 12:00:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:39,337 INFO L93 Difference]: Finished difference Result 190 states and 246 transitions. [2018-11-23 12:00:39,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:00:39,337 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 169 [2018-11-23 12:00:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:00:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 246 transitions. [2018-11-23 12:00:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:00:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 246 transitions. [2018-11-23 12:00:39,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 246 transitions. [2018-11-23 12:00:39,578 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 12:00:39,581 INFO L225 Difference]: With dead ends: 190 [2018-11-23 12:00:39,582 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 12:00:39,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:00:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 12:00:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-23 12:00:39,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:39,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 177 states. [2018-11-23 12:00:39,644 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 177 states. [2018-11-23 12:00:39,645 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 177 states. [2018-11-23 12:00:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:39,648 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2018-11-23 12:00:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2018-11-23 12:00:39,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:39,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:39,649 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 179 states. [2018-11-23 12:00:39,649 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 179 states. [2018-11-23 12:00:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:39,651 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2018-11-23 12:00:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2018-11-23 12:00:39,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:39,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:39,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:39,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-23 12:00:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 231 transitions. [2018-11-23 12:00:39,654 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 231 transitions. Word has length 169 [2018-11-23 12:00:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:39,654 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 231 transitions. [2018-11-23 12:00:39,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:00:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 231 transitions. [2018-11-23 12:00:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:00:39,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:39,655 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:39,655 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:39,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1118645188, now seen corresponding path program 53 times [2018-11-23 12:00:39,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:39,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:39,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:39,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:39,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:41,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {41827#true} call ULTIMATE.init(); {41827#true} is VALID [2018-11-23 12:00:41,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {41827#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41827#true} is VALID [2018-11-23 12:00:41,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {41827#true} assume true; {41827#true} is VALID [2018-11-23 12:00:41,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41827#true} {41827#true} #54#return; {41827#true} is VALID [2018-11-23 12:00:41,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {41827#true} call #t~ret6 := main(); {41827#true} is VALID [2018-11-23 12:00:41,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {41827#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {41829#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:41,445 INFO L273 TraceCheckUtils]: 6: Hoare triple {41829#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41829#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:41,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {41829#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41829#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:41,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {41829#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41830#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:41,446 INFO L273 TraceCheckUtils]: 9: Hoare triple {41830#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41830#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:41,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {41830#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41830#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:41,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {41830#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41831#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:41,447 INFO L273 TraceCheckUtils]: 12: Hoare triple {41831#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41831#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:41,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {41831#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41831#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:41,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {41831#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41832#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:41,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {41832#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41832#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:41,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {41832#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41832#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:41,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {41832#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41833#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:41,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {41833#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41833#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:41,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {41833#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41833#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:41,451 INFO L273 TraceCheckUtils]: 20: Hoare triple {41833#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41834#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:41,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {41834#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41834#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:41,452 INFO L273 TraceCheckUtils]: 22: Hoare triple {41834#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41834#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:41,453 INFO L273 TraceCheckUtils]: 23: Hoare triple {41834#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41835#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:41,454 INFO L273 TraceCheckUtils]: 24: Hoare triple {41835#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41835#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:41,454 INFO L273 TraceCheckUtils]: 25: Hoare triple {41835#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41835#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:41,455 INFO L273 TraceCheckUtils]: 26: Hoare triple {41835#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41836#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:41,455 INFO L273 TraceCheckUtils]: 27: Hoare triple {41836#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41836#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:41,456 INFO L273 TraceCheckUtils]: 28: Hoare triple {41836#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41836#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:41,456 INFO L273 TraceCheckUtils]: 29: Hoare triple {41836#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41837#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:41,457 INFO L273 TraceCheckUtils]: 30: Hoare triple {41837#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41837#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:41,457 INFO L273 TraceCheckUtils]: 31: Hoare triple {41837#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41837#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:41,458 INFO L273 TraceCheckUtils]: 32: Hoare triple {41837#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41838#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:41,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {41838#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41838#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:41,459 INFO L273 TraceCheckUtils]: 34: Hoare triple {41838#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41838#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:41,460 INFO L273 TraceCheckUtils]: 35: Hoare triple {41838#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41839#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:41,460 INFO L273 TraceCheckUtils]: 36: Hoare triple {41839#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41839#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:41,461 INFO L273 TraceCheckUtils]: 37: Hoare triple {41839#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41839#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:41,462 INFO L273 TraceCheckUtils]: 38: Hoare triple {41839#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41840#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:41,462 INFO L273 TraceCheckUtils]: 39: Hoare triple {41840#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41840#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:41,463 INFO L273 TraceCheckUtils]: 40: Hoare triple {41840#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41840#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:41,463 INFO L273 TraceCheckUtils]: 41: Hoare triple {41840#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41841#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:41,464 INFO L273 TraceCheckUtils]: 42: Hoare triple {41841#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41841#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:41,464 INFO L273 TraceCheckUtils]: 43: Hoare triple {41841#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41841#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:41,465 INFO L273 TraceCheckUtils]: 44: Hoare triple {41841#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41842#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:41,466 INFO L273 TraceCheckUtils]: 45: Hoare triple {41842#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41842#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:41,466 INFO L273 TraceCheckUtils]: 46: Hoare triple {41842#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41842#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:41,467 INFO L273 TraceCheckUtils]: 47: Hoare triple {41842#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41843#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:41,467 INFO L273 TraceCheckUtils]: 48: Hoare triple {41843#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41843#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:41,468 INFO L273 TraceCheckUtils]: 49: Hoare triple {41843#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41843#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:41,468 INFO L273 TraceCheckUtils]: 50: Hoare triple {41843#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41844#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:41,469 INFO L273 TraceCheckUtils]: 51: Hoare triple {41844#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41844#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:41,469 INFO L273 TraceCheckUtils]: 52: Hoare triple {41844#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41844#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:41,470 INFO L273 TraceCheckUtils]: 53: Hoare triple {41844#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41845#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:41,471 INFO L273 TraceCheckUtils]: 54: Hoare triple {41845#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41845#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:41,471 INFO L273 TraceCheckUtils]: 55: Hoare triple {41845#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41845#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:41,472 INFO L273 TraceCheckUtils]: 56: Hoare triple {41845#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41846#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:41,472 INFO L273 TraceCheckUtils]: 57: Hoare triple {41846#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41846#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:41,473 INFO L273 TraceCheckUtils]: 58: Hoare triple {41846#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41846#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:41,474 INFO L273 TraceCheckUtils]: 59: Hoare triple {41846#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41847#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:41,474 INFO L273 TraceCheckUtils]: 60: Hoare triple {41847#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41847#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:41,475 INFO L273 TraceCheckUtils]: 61: Hoare triple {41847#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41847#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:41,475 INFO L273 TraceCheckUtils]: 62: Hoare triple {41847#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41848#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:41,476 INFO L273 TraceCheckUtils]: 63: Hoare triple {41848#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41848#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:41,476 INFO L273 TraceCheckUtils]: 64: Hoare triple {41848#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41848#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:41,477 INFO L273 TraceCheckUtils]: 65: Hoare triple {41848#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41849#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:41,478 INFO L273 TraceCheckUtils]: 66: Hoare triple {41849#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41849#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:41,478 INFO L273 TraceCheckUtils]: 67: Hoare triple {41849#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41849#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:41,479 INFO L273 TraceCheckUtils]: 68: Hoare triple {41849#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41850#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:41,479 INFO L273 TraceCheckUtils]: 69: Hoare triple {41850#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41850#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:41,480 INFO L273 TraceCheckUtils]: 70: Hoare triple {41850#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41850#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:41,481 INFO L273 TraceCheckUtils]: 71: Hoare triple {41850#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41851#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:41,481 INFO L273 TraceCheckUtils]: 72: Hoare triple {41851#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41851#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:41,482 INFO L273 TraceCheckUtils]: 73: Hoare triple {41851#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41851#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:41,482 INFO L273 TraceCheckUtils]: 74: Hoare triple {41851#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41852#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:41,483 INFO L273 TraceCheckUtils]: 75: Hoare triple {41852#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41852#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:41,483 INFO L273 TraceCheckUtils]: 76: Hoare triple {41852#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41852#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:41,484 INFO L273 TraceCheckUtils]: 77: Hoare triple {41852#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41853#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:41,484 INFO L273 TraceCheckUtils]: 78: Hoare triple {41853#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41853#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:41,485 INFO L273 TraceCheckUtils]: 79: Hoare triple {41853#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41853#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:41,486 INFO L273 TraceCheckUtils]: 80: Hoare triple {41853#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41854#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:41,486 INFO L273 TraceCheckUtils]: 81: Hoare triple {41854#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41854#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:41,487 INFO L273 TraceCheckUtils]: 82: Hoare triple {41854#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41854#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:41,487 INFO L273 TraceCheckUtils]: 83: Hoare triple {41854#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41855#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:41,488 INFO L273 TraceCheckUtils]: 84: Hoare triple {41855#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41855#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:41,488 INFO L273 TraceCheckUtils]: 85: Hoare triple {41855#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41855#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:41,489 INFO L273 TraceCheckUtils]: 86: Hoare triple {41855#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41856#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:41,490 INFO L273 TraceCheckUtils]: 87: Hoare triple {41856#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41856#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:41,490 INFO L273 TraceCheckUtils]: 88: Hoare triple {41856#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41856#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:41,491 INFO L273 TraceCheckUtils]: 89: Hoare triple {41856#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41857#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:41,491 INFO L273 TraceCheckUtils]: 90: Hoare triple {41857#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41857#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:41,492 INFO L273 TraceCheckUtils]: 91: Hoare triple {41857#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41857#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:41,492 INFO L273 TraceCheckUtils]: 92: Hoare triple {41857#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41858#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:41,493 INFO L273 TraceCheckUtils]: 93: Hoare triple {41858#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41858#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:41,493 INFO L273 TraceCheckUtils]: 94: Hoare triple {41858#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41858#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:41,494 INFO L273 TraceCheckUtils]: 95: Hoare triple {41858#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41859#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:41,495 INFO L273 TraceCheckUtils]: 96: Hoare triple {41859#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41859#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:41,495 INFO L273 TraceCheckUtils]: 97: Hoare triple {41859#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41859#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:41,496 INFO L273 TraceCheckUtils]: 98: Hoare triple {41859#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41860#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:41,496 INFO L273 TraceCheckUtils]: 99: Hoare triple {41860#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41860#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:41,497 INFO L273 TraceCheckUtils]: 100: Hoare triple {41860#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41860#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:41,498 INFO L273 TraceCheckUtils]: 101: Hoare triple {41860#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41861#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:41,498 INFO L273 TraceCheckUtils]: 102: Hoare triple {41861#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41861#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:41,499 INFO L273 TraceCheckUtils]: 103: Hoare triple {41861#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41861#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:41,499 INFO L273 TraceCheckUtils]: 104: Hoare triple {41861#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41862#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:41,500 INFO L273 TraceCheckUtils]: 105: Hoare triple {41862#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41862#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:41,500 INFO L273 TraceCheckUtils]: 106: Hoare triple {41862#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41862#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:41,501 INFO L273 TraceCheckUtils]: 107: Hoare triple {41862#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41863#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:41,502 INFO L273 TraceCheckUtils]: 108: Hoare triple {41863#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41863#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:41,502 INFO L273 TraceCheckUtils]: 109: Hoare triple {41863#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41863#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:41,503 INFO L273 TraceCheckUtils]: 110: Hoare triple {41863#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41864#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:41,503 INFO L273 TraceCheckUtils]: 111: Hoare triple {41864#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41864#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:41,504 INFO L273 TraceCheckUtils]: 112: Hoare triple {41864#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41864#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:41,504 INFO L273 TraceCheckUtils]: 113: Hoare triple {41864#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41865#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:41,505 INFO L273 TraceCheckUtils]: 114: Hoare triple {41865#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41865#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:41,505 INFO L273 TraceCheckUtils]: 115: Hoare triple {41865#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41865#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:41,506 INFO L273 TraceCheckUtils]: 116: Hoare triple {41865#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41866#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:41,507 INFO L273 TraceCheckUtils]: 117: Hoare triple {41866#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41866#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:41,507 INFO L273 TraceCheckUtils]: 118: Hoare triple {41866#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41866#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:41,508 INFO L273 TraceCheckUtils]: 119: Hoare triple {41866#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41867#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:41,508 INFO L273 TraceCheckUtils]: 120: Hoare triple {41867#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41867#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:41,509 INFO L273 TraceCheckUtils]: 121: Hoare triple {41867#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41867#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:41,510 INFO L273 TraceCheckUtils]: 122: Hoare triple {41867#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41868#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:41,510 INFO L273 TraceCheckUtils]: 123: Hoare triple {41868#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41868#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:41,511 INFO L273 TraceCheckUtils]: 124: Hoare triple {41868#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41868#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:41,511 INFO L273 TraceCheckUtils]: 125: Hoare triple {41868#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41869#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:41,512 INFO L273 TraceCheckUtils]: 126: Hoare triple {41869#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41869#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:41,512 INFO L273 TraceCheckUtils]: 127: Hoare triple {41869#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41869#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:41,513 INFO L273 TraceCheckUtils]: 128: Hoare triple {41869#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41870#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:41,514 INFO L273 TraceCheckUtils]: 129: Hoare triple {41870#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41870#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:41,514 INFO L273 TraceCheckUtils]: 130: Hoare triple {41870#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41870#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:41,515 INFO L273 TraceCheckUtils]: 131: Hoare triple {41870#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41871#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:41,515 INFO L273 TraceCheckUtils]: 132: Hoare triple {41871#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41871#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:41,516 INFO L273 TraceCheckUtils]: 133: Hoare triple {41871#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41871#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:41,516 INFO L273 TraceCheckUtils]: 134: Hoare triple {41871#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41872#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:41,517 INFO L273 TraceCheckUtils]: 135: Hoare triple {41872#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41872#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:41,517 INFO L273 TraceCheckUtils]: 136: Hoare triple {41872#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41872#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:41,518 INFO L273 TraceCheckUtils]: 137: Hoare triple {41872#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41873#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:41,519 INFO L273 TraceCheckUtils]: 138: Hoare triple {41873#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41873#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:41,519 INFO L273 TraceCheckUtils]: 139: Hoare triple {41873#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41873#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:41,520 INFO L273 TraceCheckUtils]: 140: Hoare triple {41873#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41874#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:41,520 INFO L273 TraceCheckUtils]: 141: Hoare triple {41874#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41874#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:41,521 INFO L273 TraceCheckUtils]: 142: Hoare triple {41874#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41874#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:41,522 INFO L273 TraceCheckUtils]: 143: Hoare triple {41874#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41875#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:41,522 INFO L273 TraceCheckUtils]: 144: Hoare triple {41875#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41875#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:41,523 INFO L273 TraceCheckUtils]: 145: Hoare triple {41875#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41875#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:41,523 INFO L273 TraceCheckUtils]: 146: Hoare triple {41875#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41876#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:41,524 INFO L273 TraceCheckUtils]: 147: Hoare triple {41876#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41876#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:41,524 INFO L273 TraceCheckUtils]: 148: Hoare triple {41876#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41876#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:41,525 INFO L273 TraceCheckUtils]: 149: Hoare triple {41876#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41877#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:41,526 INFO L273 TraceCheckUtils]: 150: Hoare triple {41877#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41877#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:41,526 INFO L273 TraceCheckUtils]: 151: Hoare triple {41877#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41877#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:41,527 INFO L273 TraceCheckUtils]: 152: Hoare triple {41877#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41878#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:41,527 INFO L273 TraceCheckUtils]: 153: Hoare triple {41878#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41878#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:41,528 INFO L273 TraceCheckUtils]: 154: Hoare triple {41878#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41878#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:41,529 INFO L273 TraceCheckUtils]: 155: Hoare triple {41878#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41879#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:41,529 INFO L273 TraceCheckUtils]: 156: Hoare triple {41879#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41879#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:41,530 INFO L273 TraceCheckUtils]: 157: Hoare triple {41879#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41879#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:41,530 INFO L273 TraceCheckUtils]: 158: Hoare triple {41879#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41880#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:41,531 INFO L273 TraceCheckUtils]: 159: Hoare triple {41880#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41880#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:41,531 INFO L273 TraceCheckUtils]: 160: Hoare triple {41880#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41880#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:41,532 INFO L273 TraceCheckUtils]: 161: Hoare triple {41880#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41881#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:41,532 INFO L273 TraceCheckUtils]: 162: Hoare triple {41881#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41881#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:41,533 INFO L273 TraceCheckUtils]: 163: Hoare triple {41881#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41881#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:41,534 INFO L273 TraceCheckUtils]: 164: Hoare triple {41881#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41882#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:41,534 INFO L273 TraceCheckUtils]: 165: Hoare triple {41882#(<= main_~i~0 54)} assume !(~i~0 < 100000); {41828#false} is VALID [2018-11-23 12:00:41,535 INFO L273 TraceCheckUtils]: 166: Hoare triple {41828#false} havoc ~x~0;~x~0 := 0; {41828#false} is VALID [2018-11-23 12:00:41,535 INFO L273 TraceCheckUtils]: 167: Hoare triple {41828#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {41828#false} is VALID [2018-11-23 12:00:41,535 INFO L256 TraceCheckUtils]: 168: Hoare triple {41828#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {41828#false} is VALID [2018-11-23 12:00:41,535 INFO L273 TraceCheckUtils]: 169: Hoare triple {41828#false} ~cond := #in~cond; {41828#false} is VALID [2018-11-23 12:00:41,535 INFO L273 TraceCheckUtils]: 170: Hoare triple {41828#false} assume 0 == ~cond; {41828#false} is VALID [2018-11-23 12:00:41,535 INFO L273 TraceCheckUtils]: 171: Hoare triple {41828#false} assume !false; {41828#false} is VALID [2018-11-23 12:00:41,554 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 12:00:41,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:41,555 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 12:00:41,563 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:00:41,700 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-11-23 12:00:41,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:41,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:42,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {41827#true} call ULTIMATE.init(); {41827#true} is VALID [2018-11-23 12:00:42,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {41827#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41827#true} is VALID [2018-11-23 12:00:42,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {41827#true} assume true; {41827#true} is VALID [2018-11-23 12:00:42,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41827#true} {41827#true} #54#return; {41827#true} is VALID [2018-11-23 12:00:42,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {41827#true} call #t~ret6 := main(); {41827#true} is VALID [2018-11-23 12:00:42,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {41827#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {41829#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:42,188 INFO L273 TraceCheckUtils]: 6: Hoare triple {41829#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41829#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:42,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {41829#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41829#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:42,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {41829#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41830#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:42,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {41830#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41830#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:42,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {41830#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41830#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:42,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {41830#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41831#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:42,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {41831#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41831#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:42,190 INFO L273 TraceCheckUtils]: 13: Hoare triple {41831#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41831#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:42,191 INFO L273 TraceCheckUtils]: 14: Hoare triple {41831#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41832#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:42,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {41832#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41832#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:42,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {41832#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41832#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:42,193 INFO L273 TraceCheckUtils]: 17: Hoare triple {41832#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41833#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:42,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {41833#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41833#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:42,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {41833#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41833#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:42,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {41833#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41834#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:42,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {41834#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41834#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:42,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {41834#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41834#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:42,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {41834#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41835#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:42,197 INFO L273 TraceCheckUtils]: 24: Hoare triple {41835#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41835#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:42,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {41835#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41835#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:42,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {41835#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41836#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:42,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {41836#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41836#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:42,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {41836#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41836#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:42,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {41836#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41837#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:42,200 INFO L273 TraceCheckUtils]: 30: Hoare triple {41837#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41837#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:42,201 INFO L273 TraceCheckUtils]: 31: Hoare triple {41837#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41837#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:42,201 INFO L273 TraceCheckUtils]: 32: Hoare triple {41837#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41838#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:42,202 INFO L273 TraceCheckUtils]: 33: Hoare triple {41838#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41838#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:42,202 INFO L273 TraceCheckUtils]: 34: Hoare triple {41838#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41838#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:42,203 INFO L273 TraceCheckUtils]: 35: Hoare triple {41838#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41839#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:42,204 INFO L273 TraceCheckUtils]: 36: Hoare triple {41839#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41839#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:42,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {41839#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41839#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:42,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {41839#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41840#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:42,205 INFO L273 TraceCheckUtils]: 39: Hoare triple {41840#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41840#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:42,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {41840#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41840#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:42,207 INFO L273 TraceCheckUtils]: 41: Hoare triple {41840#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41841#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:42,207 INFO L273 TraceCheckUtils]: 42: Hoare triple {41841#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41841#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:42,208 INFO L273 TraceCheckUtils]: 43: Hoare triple {41841#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41841#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:42,208 INFO L273 TraceCheckUtils]: 44: Hoare triple {41841#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41842#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:42,209 INFO L273 TraceCheckUtils]: 45: Hoare triple {41842#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41842#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:42,209 INFO L273 TraceCheckUtils]: 46: Hoare triple {41842#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41842#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:42,210 INFO L273 TraceCheckUtils]: 47: Hoare triple {41842#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41843#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:42,210 INFO L273 TraceCheckUtils]: 48: Hoare triple {41843#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41843#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:42,211 INFO L273 TraceCheckUtils]: 49: Hoare triple {41843#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41843#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:42,212 INFO L273 TraceCheckUtils]: 50: Hoare triple {41843#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41844#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:42,212 INFO L273 TraceCheckUtils]: 51: Hoare triple {41844#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41844#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:42,213 INFO L273 TraceCheckUtils]: 52: Hoare triple {41844#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41844#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:42,213 INFO L273 TraceCheckUtils]: 53: Hoare triple {41844#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41845#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:42,214 INFO L273 TraceCheckUtils]: 54: Hoare triple {41845#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41845#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:42,214 INFO L273 TraceCheckUtils]: 55: Hoare triple {41845#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41845#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:42,215 INFO L273 TraceCheckUtils]: 56: Hoare triple {41845#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41846#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:42,216 INFO L273 TraceCheckUtils]: 57: Hoare triple {41846#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41846#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:42,216 INFO L273 TraceCheckUtils]: 58: Hoare triple {41846#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41846#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:42,217 INFO L273 TraceCheckUtils]: 59: Hoare triple {41846#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41847#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:42,217 INFO L273 TraceCheckUtils]: 60: Hoare triple {41847#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41847#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:42,218 INFO L273 TraceCheckUtils]: 61: Hoare triple {41847#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41847#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:42,218 INFO L273 TraceCheckUtils]: 62: Hoare triple {41847#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41848#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:42,219 INFO L273 TraceCheckUtils]: 63: Hoare triple {41848#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41848#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:42,220 INFO L273 TraceCheckUtils]: 64: Hoare triple {41848#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41848#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:42,220 INFO L273 TraceCheckUtils]: 65: Hoare triple {41848#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41849#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:42,221 INFO L273 TraceCheckUtils]: 66: Hoare triple {41849#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41849#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:42,221 INFO L273 TraceCheckUtils]: 67: Hoare triple {41849#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41849#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:42,222 INFO L273 TraceCheckUtils]: 68: Hoare triple {41849#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41850#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:42,222 INFO L273 TraceCheckUtils]: 69: Hoare triple {41850#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41850#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:42,223 INFO L273 TraceCheckUtils]: 70: Hoare triple {41850#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41850#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:42,224 INFO L273 TraceCheckUtils]: 71: Hoare triple {41850#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41851#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:42,224 INFO L273 TraceCheckUtils]: 72: Hoare triple {41851#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41851#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:42,225 INFO L273 TraceCheckUtils]: 73: Hoare triple {41851#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41851#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:42,225 INFO L273 TraceCheckUtils]: 74: Hoare triple {41851#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41852#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:42,226 INFO L273 TraceCheckUtils]: 75: Hoare triple {41852#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41852#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:42,226 INFO L273 TraceCheckUtils]: 76: Hoare triple {41852#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41852#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:42,227 INFO L273 TraceCheckUtils]: 77: Hoare triple {41852#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41853#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:42,228 INFO L273 TraceCheckUtils]: 78: Hoare triple {41853#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41853#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:42,228 INFO L273 TraceCheckUtils]: 79: Hoare triple {41853#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41853#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:42,229 INFO L273 TraceCheckUtils]: 80: Hoare triple {41853#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41854#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:42,229 INFO L273 TraceCheckUtils]: 81: Hoare triple {41854#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41854#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:42,230 INFO L273 TraceCheckUtils]: 82: Hoare triple {41854#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41854#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:42,231 INFO L273 TraceCheckUtils]: 83: Hoare triple {41854#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41855#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:42,231 INFO L273 TraceCheckUtils]: 84: Hoare triple {41855#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41855#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:42,232 INFO L273 TraceCheckUtils]: 85: Hoare triple {41855#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41855#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:42,232 INFO L273 TraceCheckUtils]: 86: Hoare triple {41855#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41856#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:42,233 INFO L273 TraceCheckUtils]: 87: Hoare triple {41856#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41856#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:42,233 INFO L273 TraceCheckUtils]: 88: Hoare triple {41856#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41856#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:42,234 INFO L273 TraceCheckUtils]: 89: Hoare triple {41856#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41857#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:42,234 INFO L273 TraceCheckUtils]: 90: Hoare triple {41857#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41857#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:42,235 INFO L273 TraceCheckUtils]: 91: Hoare triple {41857#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41857#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:42,236 INFO L273 TraceCheckUtils]: 92: Hoare triple {41857#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41858#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:42,236 INFO L273 TraceCheckUtils]: 93: Hoare triple {41858#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41858#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:42,237 INFO L273 TraceCheckUtils]: 94: Hoare triple {41858#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41858#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:42,237 INFO L273 TraceCheckUtils]: 95: Hoare triple {41858#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41859#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:42,238 INFO L273 TraceCheckUtils]: 96: Hoare triple {41859#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41859#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:42,238 INFO L273 TraceCheckUtils]: 97: Hoare triple {41859#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41859#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:42,239 INFO L273 TraceCheckUtils]: 98: Hoare triple {41859#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41860#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:42,240 INFO L273 TraceCheckUtils]: 99: Hoare triple {41860#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41860#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:42,240 INFO L273 TraceCheckUtils]: 100: Hoare triple {41860#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41860#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:42,241 INFO L273 TraceCheckUtils]: 101: Hoare triple {41860#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41861#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:42,241 INFO L273 TraceCheckUtils]: 102: Hoare triple {41861#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41861#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:42,242 INFO L273 TraceCheckUtils]: 103: Hoare triple {41861#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41861#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:42,243 INFO L273 TraceCheckUtils]: 104: Hoare triple {41861#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41862#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:42,243 INFO L273 TraceCheckUtils]: 105: Hoare triple {41862#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41862#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:42,244 INFO L273 TraceCheckUtils]: 106: Hoare triple {41862#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41862#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:42,244 INFO L273 TraceCheckUtils]: 107: Hoare triple {41862#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41863#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:42,245 INFO L273 TraceCheckUtils]: 108: Hoare triple {41863#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41863#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:42,245 INFO L273 TraceCheckUtils]: 109: Hoare triple {41863#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41863#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:42,246 INFO L273 TraceCheckUtils]: 110: Hoare triple {41863#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41864#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:42,246 INFO L273 TraceCheckUtils]: 111: Hoare triple {41864#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41864#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:42,247 INFO L273 TraceCheckUtils]: 112: Hoare triple {41864#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41864#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:42,248 INFO L273 TraceCheckUtils]: 113: Hoare triple {41864#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41865#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:42,248 INFO L273 TraceCheckUtils]: 114: Hoare triple {41865#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41865#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:42,249 INFO L273 TraceCheckUtils]: 115: Hoare triple {41865#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41865#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:42,249 INFO L273 TraceCheckUtils]: 116: Hoare triple {41865#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41866#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:42,250 INFO L273 TraceCheckUtils]: 117: Hoare triple {41866#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41866#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:42,250 INFO L273 TraceCheckUtils]: 118: Hoare triple {41866#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41866#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:42,251 INFO L273 TraceCheckUtils]: 119: Hoare triple {41866#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41867#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:42,252 INFO L273 TraceCheckUtils]: 120: Hoare triple {41867#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41867#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:42,252 INFO L273 TraceCheckUtils]: 121: Hoare triple {41867#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41867#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:42,253 INFO L273 TraceCheckUtils]: 122: Hoare triple {41867#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41868#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:42,253 INFO L273 TraceCheckUtils]: 123: Hoare triple {41868#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41868#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:42,254 INFO L273 TraceCheckUtils]: 124: Hoare triple {41868#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41868#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:42,254 INFO L273 TraceCheckUtils]: 125: Hoare triple {41868#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41869#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:42,255 INFO L273 TraceCheckUtils]: 126: Hoare triple {41869#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41869#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:42,255 INFO L273 TraceCheckUtils]: 127: Hoare triple {41869#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41869#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:42,256 INFO L273 TraceCheckUtils]: 128: Hoare triple {41869#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41870#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:42,257 INFO L273 TraceCheckUtils]: 129: Hoare triple {41870#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41870#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:42,257 INFO L273 TraceCheckUtils]: 130: Hoare triple {41870#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41870#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:42,258 INFO L273 TraceCheckUtils]: 131: Hoare triple {41870#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41871#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:42,258 INFO L273 TraceCheckUtils]: 132: Hoare triple {41871#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41871#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:42,259 INFO L273 TraceCheckUtils]: 133: Hoare triple {41871#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41871#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:42,260 INFO L273 TraceCheckUtils]: 134: Hoare triple {41871#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41872#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:42,260 INFO L273 TraceCheckUtils]: 135: Hoare triple {41872#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41872#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:42,261 INFO L273 TraceCheckUtils]: 136: Hoare triple {41872#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41872#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:42,261 INFO L273 TraceCheckUtils]: 137: Hoare triple {41872#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41873#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:42,262 INFO L273 TraceCheckUtils]: 138: Hoare triple {41873#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41873#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:42,262 INFO L273 TraceCheckUtils]: 139: Hoare triple {41873#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41873#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:42,263 INFO L273 TraceCheckUtils]: 140: Hoare triple {41873#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41874#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:42,264 INFO L273 TraceCheckUtils]: 141: Hoare triple {41874#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41874#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:42,264 INFO L273 TraceCheckUtils]: 142: Hoare triple {41874#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41874#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:42,265 INFO L273 TraceCheckUtils]: 143: Hoare triple {41874#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41875#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:42,265 INFO L273 TraceCheckUtils]: 144: Hoare triple {41875#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41875#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:42,266 INFO L273 TraceCheckUtils]: 145: Hoare triple {41875#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41875#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:42,267 INFO L273 TraceCheckUtils]: 146: Hoare triple {41875#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41876#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:42,267 INFO L273 TraceCheckUtils]: 147: Hoare triple {41876#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41876#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:42,268 INFO L273 TraceCheckUtils]: 148: Hoare triple {41876#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41876#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:42,268 INFO L273 TraceCheckUtils]: 149: Hoare triple {41876#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41877#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:42,269 INFO L273 TraceCheckUtils]: 150: Hoare triple {41877#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41877#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:42,269 INFO L273 TraceCheckUtils]: 151: Hoare triple {41877#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41877#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:42,270 INFO L273 TraceCheckUtils]: 152: Hoare triple {41877#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41878#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:42,270 INFO L273 TraceCheckUtils]: 153: Hoare triple {41878#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41878#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:42,271 INFO L273 TraceCheckUtils]: 154: Hoare triple {41878#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41878#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:42,272 INFO L273 TraceCheckUtils]: 155: Hoare triple {41878#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41879#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:42,272 INFO L273 TraceCheckUtils]: 156: Hoare triple {41879#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41879#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:42,273 INFO L273 TraceCheckUtils]: 157: Hoare triple {41879#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41879#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:42,273 INFO L273 TraceCheckUtils]: 158: Hoare triple {41879#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41880#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:42,274 INFO L273 TraceCheckUtils]: 159: Hoare triple {41880#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41880#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:42,274 INFO L273 TraceCheckUtils]: 160: Hoare triple {41880#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41880#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:42,275 INFO L273 TraceCheckUtils]: 161: Hoare triple {41880#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41881#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:42,276 INFO L273 TraceCheckUtils]: 162: Hoare triple {41881#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41881#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:42,276 INFO L273 TraceCheckUtils]: 163: Hoare triple {41881#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {41881#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:42,277 INFO L273 TraceCheckUtils]: 164: Hoare triple {41881#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41882#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:42,278 INFO L273 TraceCheckUtils]: 165: Hoare triple {41882#(<= main_~i~0 54)} assume !(~i~0 < 100000); {41828#false} is VALID [2018-11-23 12:00:42,278 INFO L273 TraceCheckUtils]: 166: Hoare triple {41828#false} havoc ~x~0;~x~0 := 0; {41828#false} is VALID [2018-11-23 12:00:42,278 INFO L273 TraceCheckUtils]: 167: Hoare triple {41828#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {41828#false} is VALID [2018-11-23 12:00:42,278 INFO L256 TraceCheckUtils]: 168: Hoare triple {41828#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {41828#false} is VALID [2018-11-23 12:00:42,278 INFO L273 TraceCheckUtils]: 169: Hoare triple {41828#false} ~cond := #in~cond; {41828#false} is VALID [2018-11-23 12:00:42,278 INFO L273 TraceCheckUtils]: 170: Hoare triple {41828#false} assume 0 == ~cond; {41828#false} is VALID [2018-11-23 12:00:42,279 INFO L273 TraceCheckUtils]: 171: Hoare triple {41828#false} assume !false; {41828#false} is VALID [2018-11-23 12:00:42,297 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 12:00:42,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:42,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-11-23 12:00:42,318 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 172 [2018-11-23 12:00:42,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:42,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 12:00:42,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:42,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 12:00:42,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 12:00:42,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 12:00:42,489 INFO L87 Difference]: Start difference. First operand 177 states and 231 transitions. Second operand 56 states. [2018-11-23 12:00:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:43,371 INFO L93 Difference]: Finished difference Result 193 states and 250 transitions. [2018-11-23 12:00:43,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-23 12:00:43,371 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 172 [2018-11-23 12:00:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:00:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 250 transitions. [2018-11-23 12:00:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:00:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 250 transitions. [2018-11-23 12:00:43,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 250 transitions. [2018-11-23 12:00:43,611 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 12:00:43,615 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:00:43,615 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 12:00:43,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 12:00:43,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 12:00:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-11-23 12:00:43,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:43,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 180 states. [2018-11-23 12:00:43,733 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 180 states. [2018-11-23 12:00:43,733 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 180 states. [2018-11-23 12:00:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:43,736 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2018-11-23 12:00:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-11-23 12:00:43,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:43,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:43,737 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 182 states. [2018-11-23 12:00:43,737 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 182 states. [2018-11-23 12:00:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:43,739 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2018-11-23 12:00:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-11-23 12:00:43,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:43,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:43,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:43,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 12:00:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2018-11-23 12:00:43,742 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 172 [2018-11-23 12:00:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:43,742 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2018-11-23 12:00:43,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 12:00:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2018-11-23 12:00:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 12:00:43,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:43,743 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:43,743 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:43,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash -47089129, now seen corresponding path program 54 times [2018-11-23 12:00:43,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:43,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:43,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:45,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {43262#true} call ULTIMATE.init(); {43262#true} is VALID [2018-11-23 12:00:45,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {43262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43262#true} is VALID [2018-11-23 12:00:45,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {43262#true} assume true; {43262#true} is VALID [2018-11-23 12:00:45,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43262#true} {43262#true} #54#return; {43262#true} is VALID [2018-11-23 12:00:45,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {43262#true} call #t~ret6 := main(); {43262#true} is VALID [2018-11-23 12:00:45,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {43262#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {43264#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:45,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {43264#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43264#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:45,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {43264#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43264#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:45,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {43264#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43265#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:45,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {43265#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43265#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:45,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {43265#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43265#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:45,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {43265#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43266#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:45,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {43266#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43266#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:45,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {43266#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43266#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:45,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {43266#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43267#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:45,305 INFO L273 TraceCheckUtils]: 15: Hoare triple {43267#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43267#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:45,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {43267#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43267#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:45,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {43267#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43268#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:45,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {43268#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43268#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:45,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {43268#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43268#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:45,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {43268#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43269#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:45,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {43269#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43269#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:45,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {43269#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43269#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:45,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {43269#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43270#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:45,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {43270#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43270#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:45,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {43270#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43270#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:45,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {43270#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43271#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:45,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {43271#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43271#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:45,316 INFO L273 TraceCheckUtils]: 28: Hoare triple {43271#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43271#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:45,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {43271#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43272#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:45,318 INFO L273 TraceCheckUtils]: 30: Hoare triple {43272#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43272#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:45,318 INFO L273 TraceCheckUtils]: 31: Hoare triple {43272#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43272#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:45,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {43272#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43273#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:45,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {43273#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43273#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:45,323 INFO L273 TraceCheckUtils]: 34: Hoare triple {43273#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43273#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:45,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {43273#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43274#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:45,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {43274#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43274#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:45,326 INFO L273 TraceCheckUtils]: 37: Hoare triple {43274#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43274#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:45,329 INFO L273 TraceCheckUtils]: 38: Hoare triple {43274#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43275#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:45,329 INFO L273 TraceCheckUtils]: 39: Hoare triple {43275#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43275#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:45,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {43275#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43275#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:45,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {43275#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43276#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:45,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {43276#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43276#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:45,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {43276#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43276#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:45,335 INFO L273 TraceCheckUtils]: 44: Hoare triple {43276#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43277#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:45,335 INFO L273 TraceCheckUtils]: 45: Hoare triple {43277#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43277#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:45,337 INFO L273 TraceCheckUtils]: 46: Hoare triple {43277#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43277#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:45,337 INFO L273 TraceCheckUtils]: 47: Hoare triple {43277#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43278#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:45,340 INFO L273 TraceCheckUtils]: 48: Hoare triple {43278#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43278#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:45,340 INFO L273 TraceCheckUtils]: 49: Hoare triple {43278#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43278#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:45,342 INFO L273 TraceCheckUtils]: 50: Hoare triple {43278#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43279#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:45,342 INFO L273 TraceCheckUtils]: 51: Hoare triple {43279#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43279#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:45,344 INFO L273 TraceCheckUtils]: 52: Hoare triple {43279#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43279#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:45,344 INFO L273 TraceCheckUtils]: 53: Hoare triple {43279#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43280#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:45,346 INFO L273 TraceCheckUtils]: 54: Hoare triple {43280#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43280#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:45,346 INFO L273 TraceCheckUtils]: 55: Hoare triple {43280#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43280#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:45,348 INFO L273 TraceCheckUtils]: 56: Hoare triple {43280#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43281#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:45,348 INFO L273 TraceCheckUtils]: 57: Hoare triple {43281#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43281#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:45,350 INFO L273 TraceCheckUtils]: 58: Hoare triple {43281#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43281#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:45,350 INFO L273 TraceCheckUtils]: 59: Hoare triple {43281#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43282#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:45,352 INFO L273 TraceCheckUtils]: 60: Hoare triple {43282#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43282#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:45,352 INFO L273 TraceCheckUtils]: 61: Hoare triple {43282#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43282#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:45,355 INFO L273 TraceCheckUtils]: 62: Hoare triple {43282#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43283#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:45,355 INFO L273 TraceCheckUtils]: 63: Hoare triple {43283#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43283#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:45,358 INFO L273 TraceCheckUtils]: 64: Hoare triple {43283#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43283#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:45,358 INFO L273 TraceCheckUtils]: 65: Hoare triple {43283#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43284#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:45,360 INFO L273 TraceCheckUtils]: 66: Hoare triple {43284#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43284#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:45,360 INFO L273 TraceCheckUtils]: 67: Hoare triple {43284#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43284#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:45,363 INFO L273 TraceCheckUtils]: 68: Hoare triple {43284#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43285#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:45,363 INFO L273 TraceCheckUtils]: 69: Hoare triple {43285#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43285#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:45,365 INFO L273 TraceCheckUtils]: 70: Hoare triple {43285#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43285#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:45,365 INFO L273 TraceCheckUtils]: 71: Hoare triple {43285#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43286#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:45,368 INFO L273 TraceCheckUtils]: 72: Hoare triple {43286#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43286#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:45,368 INFO L273 TraceCheckUtils]: 73: Hoare triple {43286#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43286#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:45,370 INFO L273 TraceCheckUtils]: 74: Hoare triple {43286#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43287#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:45,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {43287#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43287#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:45,372 INFO L273 TraceCheckUtils]: 76: Hoare triple {43287#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43287#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:45,372 INFO L273 TraceCheckUtils]: 77: Hoare triple {43287#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43288#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:45,374 INFO L273 TraceCheckUtils]: 78: Hoare triple {43288#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43288#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:45,374 INFO L273 TraceCheckUtils]: 79: Hoare triple {43288#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43288#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:45,374 INFO L273 TraceCheckUtils]: 80: Hoare triple {43288#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43289#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:45,377 INFO L273 TraceCheckUtils]: 81: Hoare triple {43289#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43289#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:45,377 INFO L273 TraceCheckUtils]: 82: Hoare triple {43289#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43289#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:45,379 INFO L273 TraceCheckUtils]: 83: Hoare triple {43289#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43290#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:45,379 INFO L273 TraceCheckUtils]: 84: Hoare triple {43290#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43290#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:45,382 INFO L273 TraceCheckUtils]: 85: Hoare triple {43290#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43290#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:45,382 INFO L273 TraceCheckUtils]: 86: Hoare triple {43290#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43291#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:45,384 INFO L273 TraceCheckUtils]: 87: Hoare triple {43291#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43291#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:45,384 INFO L273 TraceCheckUtils]: 88: Hoare triple {43291#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43291#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:45,387 INFO L273 TraceCheckUtils]: 89: Hoare triple {43291#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43292#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:45,387 INFO L273 TraceCheckUtils]: 90: Hoare triple {43292#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43292#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:45,390 INFO L273 TraceCheckUtils]: 91: Hoare triple {43292#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43292#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:45,390 INFO L273 TraceCheckUtils]: 92: Hoare triple {43292#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43293#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:45,392 INFO L273 TraceCheckUtils]: 93: Hoare triple {43293#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43293#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:45,392 INFO L273 TraceCheckUtils]: 94: Hoare triple {43293#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43293#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:45,394 INFO L273 TraceCheckUtils]: 95: Hoare triple {43293#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43294#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:45,394 INFO L273 TraceCheckUtils]: 96: Hoare triple {43294#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43294#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:45,397 INFO L273 TraceCheckUtils]: 97: Hoare triple {43294#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43294#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:45,397 INFO L273 TraceCheckUtils]: 98: Hoare triple {43294#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43295#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:45,399 INFO L273 TraceCheckUtils]: 99: Hoare triple {43295#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43295#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:45,399 INFO L273 TraceCheckUtils]: 100: Hoare triple {43295#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43295#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:45,401 INFO L273 TraceCheckUtils]: 101: Hoare triple {43295#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43296#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:45,401 INFO L273 TraceCheckUtils]: 102: Hoare triple {43296#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43296#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:45,403 INFO L273 TraceCheckUtils]: 103: Hoare triple {43296#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43296#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:45,403 INFO L273 TraceCheckUtils]: 104: Hoare triple {43296#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43297#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:45,406 INFO L273 TraceCheckUtils]: 105: Hoare triple {43297#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43297#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:45,406 INFO L273 TraceCheckUtils]: 106: Hoare triple {43297#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43297#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:45,408 INFO L273 TraceCheckUtils]: 107: Hoare triple {43297#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43298#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:45,408 INFO L273 TraceCheckUtils]: 108: Hoare triple {43298#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43298#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:45,410 INFO L273 TraceCheckUtils]: 109: Hoare triple {43298#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43298#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:45,410 INFO L273 TraceCheckUtils]: 110: Hoare triple {43298#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43299#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:45,413 INFO L273 TraceCheckUtils]: 111: Hoare triple {43299#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43299#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:45,413 INFO L273 TraceCheckUtils]: 112: Hoare triple {43299#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43299#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:45,415 INFO L273 TraceCheckUtils]: 113: Hoare triple {43299#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43300#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:45,415 INFO L273 TraceCheckUtils]: 114: Hoare triple {43300#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43300#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:45,417 INFO L273 TraceCheckUtils]: 115: Hoare triple {43300#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43300#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:45,417 INFO L273 TraceCheckUtils]: 116: Hoare triple {43300#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43301#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:45,419 INFO L273 TraceCheckUtils]: 117: Hoare triple {43301#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43301#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:45,419 INFO L273 TraceCheckUtils]: 118: Hoare triple {43301#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43301#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:45,421 INFO L273 TraceCheckUtils]: 119: Hoare triple {43301#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43302#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:45,421 INFO L273 TraceCheckUtils]: 120: Hoare triple {43302#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43302#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:45,423 INFO L273 TraceCheckUtils]: 121: Hoare triple {43302#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43302#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:45,423 INFO L273 TraceCheckUtils]: 122: Hoare triple {43302#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43303#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:45,426 INFO L273 TraceCheckUtils]: 123: Hoare triple {43303#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43303#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:45,426 INFO L273 TraceCheckUtils]: 124: Hoare triple {43303#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43303#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:45,428 INFO L273 TraceCheckUtils]: 125: Hoare triple {43303#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43304#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:45,428 INFO L273 TraceCheckUtils]: 126: Hoare triple {43304#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43304#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:45,431 INFO L273 TraceCheckUtils]: 127: Hoare triple {43304#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43304#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:45,431 INFO L273 TraceCheckUtils]: 128: Hoare triple {43304#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43305#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:45,433 INFO L273 TraceCheckUtils]: 129: Hoare triple {43305#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43305#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:45,433 INFO L273 TraceCheckUtils]: 130: Hoare triple {43305#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43305#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:45,436 INFO L273 TraceCheckUtils]: 131: Hoare triple {43305#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43306#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:45,436 INFO L273 TraceCheckUtils]: 132: Hoare triple {43306#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43306#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:45,438 INFO L273 TraceCheckUtils]: 133: Hoare triple {43306#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43306#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:45,438 INFO L273 TraceCheckUtils]: 134: Hoare triple {43306#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43307#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:45,440 INFO L273 TraceCheckUtils]: 135: Hoare triple {43307#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43307#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:45,440 INFO L273 TraceCheckUtils]: 136: Hoare triple {43307#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43307#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:45,443 INFO L273 TraceCheckUtils]: 137: Hoare triple {43307#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43308#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:45,443 INFO L273 TraceCheckUtils]: 138: Hoare triple {43308#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43308#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:45,446 INFO L273 TraceCheckUtils]: 139: Hoare triple {43308#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43308#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:45,446 INFO L273 TraceCheckUtils]: 140: Hoare triple {43308#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43309#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:45,449 INFO L273 TraceCheckUtils]: 141: Hoare triple {43309#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43309#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:45,449 INFO L273 TraceCheckUtils]: 142: Hoare triple {43309#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43309#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:45,452 INFO L273 TraceCheckUtils]: 143: Hoare triple {43309#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43310#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:45,452 INFO L273 TraceCheckUtils]: 144: Hoare triple {43310#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43310#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:45,454 INFO L273 TraceCheckUtils]: 145: Hoare triple {43310#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43310#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:45,454 INFO L273 TraceCheckUtils]: 146: Hoare triple {43310#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43311#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:45,457 INFO L273 TraceCheckUtils]: 147: Hoare triple {43311#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43311#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:45,457 INFO L273 TraceCheckUtils]: 148: Hoare triple {43311#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43311#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:45,460 INFO L273 TraceCheckUtils]: 149: Hoare triple {43311#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43312#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:45,460 INFO L273 TraceCheckUtils]: 150: Hoare triple {43312#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43312#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:45,462 INFO L273 TraceCheckUtils]: 151: Hoare triple {43312#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43312#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:45,462 INFO L273 TraceCheckUtils]: 152: Hoare triple {43312#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43313#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:45,464 INFO L273 TraceCheckUtils]: 153: Hoare triple {43313#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43313#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:45,464 INFO L273 TraceCheckUtils]: 154: Hoare triple {43313#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43313#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:45,467 INFO L273 TraceCheckUtils]: 155: Hoare triple {43313#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43314#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:45,467 INFO L273 TraceCheckUtils]: 156: Hoare triple {43314#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43314#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:45,469 INFO L273 TraceCheckUtils]: 157: Hoare triple {43314#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43314#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:45,469 INFO L273 TraceCheckUtils]: 158: Hoare triple {43314#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43315#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:45,471 INFO L273 TraceCheckUtils]: 159: Hoare triple {43315#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43315#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:45,471 INFO L273 TraceCheckUtils]: 160: Hoare triple {43315#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43315#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:45,473 INFO L273 TraceCheckUtils]: 161: Hoare triple {43315#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43316#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:45,473 INFO L273 TraceCheckUtils]: 162: Hoare triple {43316#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43316#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:45,475 INFO L273 TraceCheckUtils]: 163: Hoare triple {43316#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43316#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:45,475 INFO L273 TraceCheckUtils]: 164: Hoare triple {43316#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43317#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:45,477 INFO L273 TraceCheckUtils]: 165: Hoare triple {43317#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43317#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:45,477 INFO L273 TraceCheckUtils]: 166: Hoare triple {43317#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43317#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:45,479 INFO L273 TraceCheckUtils]: 167: Hoare triple {43317#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43318#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:45,479 INFO L273 TraceCheckUtils]: 168: Hoare triple {43318#(<= main_~i~0 55)} assume !(~i~0 < 100000); {43263#false} is VALID [2018-11-23 12:00:45,479 INFO L273 TraceCheckUtils]: 169: Hoare triple {43263#false} havoc ~x~0;~x~0 := 0; {43263#false} is VALID [2018-11-23 12:00:45,479 INFO L273 TraceCheckUtils]: 170: Hoare triple {43263#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {43263#false} is VALID [2018-11-23 12:00:45,479 INFO L256 TraceCheckUtils]: 171: Hoare triple {43263#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {43263#false} is VALID [2018-11-23 12:00:45,479 INFO L273 TraceCheckUtils]: 172: Hoare triple {43263#false} ~cond := #in~cond; {43263#false} is VALID [2018-11-23 12:00:45,480 INFO L273 TraceCheckUtils]: 173: Hoare triple {43263#false} assume 0 == ~cond; {43263#false} is VALID [2018-11-23 12:00:45,480 INFO L273 TraceCheckUtils]: 174: Hoare triple {43263#false} assume !false; {43263#false} is VALID [2018-11-23 12:00:45,498 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 12:00:45,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:45,498 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 12:00:45,510 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:45,663 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-11-23 12:00:45,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:45,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:47,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {43262#true} call ULTIMATE.init(); {43262#true} is VALID [2018-11-23 12:00:47,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {43262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43262#true} is VALID [2018-11-23 12:00:47,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {43262#true} assume true; {43262#true} is VALID [2018-11-23 12:00:47,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43262#true} {43262#true} #54#return; {43262#true} is VALID [2018-11-23 12:00:47,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {43262#true} call #t~ret6 := main(); {43262#true} is VALID [2018-11-23 12:00:47,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {43262#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {43264#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:47,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {43264#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43264#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:47,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {43264#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43264#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:47,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {43264#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43265#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:47,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {43265#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43265#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:47,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {43265#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43265#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:47,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {43265#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43266#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:47,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {43266#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43266#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:47,146 INFO L273 TraceCheckUtils]: 13: Hoare triple {43266#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43266#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:47,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {43266#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43267#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:47,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {43267#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43267#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:47,147 INFO L273 TraceCheckUtils]: 16: Hoare triple {43267#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43267#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:47,148 INFO L273 TraceCheckUtils]: 17: Hoare triple {43267#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43268#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:47,148 INFO L273 TraceCheckUtils]: 18: Hoare triple {43268#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43268#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:47,149 INFO L273 TraceCheckUtils]: 19: Hoare triple {43268#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43268#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:47,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {43268#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43269#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:47,150 INFO L273 TraceCheckUtils]: 21: Hoare triple {43269#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43269#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:47,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {43269#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43269#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:47,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {43269#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43270#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:47,152 INFO L273 TraceCheckUtils]: 24: Hoare triple {43270#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43270#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:47,152 INFO L273 TraceCheckUtils]: 25: Hoare triple {43270#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43270#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:47,153 INFO L273 TraceCheckUtils]: 26: Hoare triple {43270#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43271#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:47,154 INFO L273 TraceCheckUtils]: 27: Hoare triple {43271#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43271#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:47,154 INFO L273 TraceCheckUtils]: 28: Hoare triple {43271#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43271#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:47,155 INFO L273 TraceCheckUtils]: 29: Hoare triple {43271#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43272#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:47,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {43272#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43272#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:47,156 INFO L273 TraceCheckUtils]: 31: Hoare triple {43272#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43272#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:47,157 INFO L273 TraceCheckUtils]: 32: Hoare triple {43272#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43273#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:47,157 INFO L273 TraceCheckUtils]: 33: Hoare triple {43273#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43273#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:47,158 INFO L273 TraceCheckUtils]: 34: Hoare triple {43273#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43273#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:47,158 INFO L273 TraceCheckUtils]: 35: Hoare triple {43273#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43274#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:47,159 INFO L273 TraceCheckUtils]: 36: Hoare triple {43274#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43274#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:47,159 INFO L273 TraceCheckUtils]: 37: Hoare triple {43274#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43274#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:47,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {43274#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43275#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:47,161 INFO L273 TraceCheckUtils]: 39: Hoare triple {43275#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43275#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:47,161 INFO L273 TraceCheckUtils]: 40: Hoare triple {43275#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43275#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:47,162 INFO L273 TraceCheckUtils]: 41: Hoare triple {43275#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43276#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:47,162 INFO L273 TraceCheckUtils]: 42: Hoare triple {43276#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43276#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 43: Hoare triple {43276#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43276#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 44: Hoare triple {43276#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43277#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:47,164 INFO L273 TraceCheckUtils]: 45: Hoare triple {43277#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43277#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:47,164 INFO L273 TraceCheckUtils]: 46: Hoare triple {43277#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43277#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:47,165 INFO L273 TraceCheckUtils]: 47: Hoare triple {43277#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43278#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:47,166 INFO L273 TraceCheckUtils]: 48: Hoare triple {43278#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43278#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:47,166 INFO L273 TraceCheckUtils]: 49: Hoare triple {43278#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43278#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:47,167 INFO L273 TraceCheckUtils]: 50: Hoare triple {43278#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43279#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:47,167 INFO L273 TraceCheckUtils]: 51: Hoare triple {43279#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43279#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:47,168 INFO L273 TraceCheckUtils]: 52: Hoare triple {43279#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43279#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:47,169 INFO L273 TraceCheckUtils]: 53: Hoare triple {43279#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43280#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:47,169 INFO L273 TraceCheckUtils]: 54: Hoare triple {43280#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43280#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:47,170 INFO L273 TraceCheckUtils]: 55: Hoare triple {43280#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43280#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:47,170 INFO L273 TraceCheckUtils]: 56: Hoare triple {43280#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43281#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:47,171 INFO L273 TraceCheckUtils]: 57: Hoare triple {43281#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43281#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:47,171 INFO L273 TraceCheckUtils]: 58: Hoare triple {43281#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43281#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:47,172 INFO L273 TraceCheckUtils]: 59: Hoare triple {43281#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43282#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:47,173 INFO L273 TraceCheckUtils]: 60: Hoare triple {43282#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43282#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:47,173 INFO L273 TraceCheckUtils]: 61: Hoare triple {43282#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43282#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:47,174 INFO L273 TraceCheckUtils]: 62: Hoare triple {43282#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43283#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:47,174 INFO L273 TraceCheckUtils]: 63: Hoare triple {43283#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43283#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:47,175 INFO L273 TraceCheckUtils]: 64: Hoare triple {43283#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43283#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:47,176 INFO L273 TraceCheckUtils]: 65: Hoare triple {43283#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43284#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:47,176 INFO L273 TraceCheckUtils]: 66: Hoare triple {43284#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43284#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:47,177 INFO L273 TraceCheckUtils]: 67: Hoare triple {43284#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43284#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:47,177 INFO L273 TraceCheckUtils]: 68: Hoare triple {43284#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43285#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:47,178 INFO L273 TraceCheckUtils]: 69: Hoare triple {43285#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43285#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:47,178 INFO L273 TraceCheckUtils]: 70: Hoare triple {43285#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43285#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:47,179 INFO L273 TraceCheckUtils]: 71: Hoare triple {43285#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43286#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:47,179 INFO L273 TraceCheckUtils]: 72: Hoare triple {43286#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43286#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:47,180 INFO L273 TraceCheckUtils]: 73: Hoare triple {43286#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43286#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:47,181 INFO L273 TraceCheckUtils]: 74: Hoare triple {43286#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43287#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:47,181 INFO L273 TraceCheckUtils]: 75: Hoare triple {43287#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43287#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:47,182 INFO L273 TraceCheckUtils]: 76: Hoare triple {43287#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43287#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:47,182 INFO L273 TraceCheckUtils]: 77: Hoare triple {43287#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43288#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:47,183 INFO L273 TraceCheckUtils]: 78: Hoare triple {43288#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43288#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:47,183 INFO L273 TraceCheckUtils]: 79: Hoare triple {43288#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43288#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:47,184 INFO L273 TraceCheckUtils]: 80: Hoare triple {43288#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43289#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:47,185 INFO L273 TraceCheckUtils]: 81: Hoare triple {43289#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43289#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:47,185 INFO L273 TraceCheckUtils]: 82: Hoare triple {43289#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43289#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:47,186 INFO L273 TraceCheckUtils]: 83: Hoare triple {43289#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43290#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:47,186 INFO L273 TraceCheckUtils]: 84: Hoare triple {43290#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43290#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:47,187 INFO L273 TraceCheckUtils]: 85: Hoare triple {43290#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43290#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:47,188 INFO L273 TraceCheckUtils]: 86: Hoare triple {43290#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43291#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:47,188 INFO L273 TraceCheckUtils]: 87: Hoare triple {43291#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43291#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:47,189 INFO L273 TraceCheckUtils]: 88: Hoare triple {43291#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43291#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:47,189 INFO L273 TraceCheckUtils]: 89: Hoare triple {43291#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43292#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:47,190 INFO L273 TraceCheckUtils]: 90: Hoare triple {43292#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43292#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:47,190 INFO L273 TraceCheckUtils]: 91: Hoare triple {43292#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43292#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:47,191 INFO L273 TraceCheckUtils]: 92: Hoare triple {43292#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43293#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:47,192 INFO L273 TraceCheckUtils]: 93: Hoare triple {43293#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43293#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:47,192 INFO L273 TraceCheckUtils]: 94: Hoare triple {43293#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43293#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:47,193 INFO L273 TraceCheckUtils]: 95: Hoare triple {43293#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43294#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:47,193 INFO L273 TraceCheckUtils]: 96: Hoare triple {43294#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43294#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:47,194 INFO L273 TraceCheckUtils]: 97: Hoare triple {43294#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43294#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:47,194 INFO L273 TraceCheckUtils]: 98: Hoare triple {43294#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43295#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:47,195 INFO L273 TraceCheckUtils]: 99: Hoare triple {43295#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43295#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:47,195 INFO L273 TraceCheckUtils]: 100: Hoare triple {43295#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43295#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:47,196 INFO L273 TraceCheckUtils]: 101: Hoare triple {43295#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43296#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:47,197 INFO L273 TraceCheckUtils]: 102: Hoare triple {43296#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43296#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:47,197 INFO L273 TraceCheckUtils]: 103: Hoare triple {43296#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43296#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:47,198 INFO L273 TraceCheckUtils]: 104: Hoare triple {43296#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43297#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:47,198 INFO L273 TraceCheckUtils]: 105: Hoare triple {43297#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43297#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:47,199 INFO L273 TraceCheckUtils]: 106: Hoare triple {43297#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43297#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:47,200 INFO L273 TraceCheckUtils]: 107: Hoare triple {43297#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43298#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:47,200 INFO L273 TraceCheckUtils]: 108: Hoare triple {43298#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43298#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:47,201 INFO L273 TraceCheckUtils]: 109: Hoare triple {43298#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43298#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:47,201 INFO L273 TraceCheckUtils]: 110: Hoare triple {43298#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43299#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:47,202 INFO L273 TraceCheckUtils]: 111: Hoare triple {43299#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43299#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:47,202 INFO L273 TraceCheckUtils]: 112: Hoare triple {43299#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43299#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:47,203 INFO L273 TraceCheckUtils]: 113: Hoare triple {43299#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43300#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:47,204 INFO L273 TraceCheckUtils]: 114: Hoare triple {43300#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43300#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:47,204 INFO L273 TraceCheckUtils]: 115: Hoare triple {43300#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43300#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:47,205 INFO L273 TraceCheckUtils]: 116: Hoare triple {43300#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43301#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:47,205 INFO L273 TraceCheckUtils]: 117: Hoare triple {43301#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43301#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:47,206 INFO L273 TraceCheckUtils]: 118: Hoare triple {43301#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43301#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:47,207 INFO L273 TraceCheckUtils]: 119: Hoare triple {43301#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43302#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:47,207 INFO L273 TraceCheckUtils]: 120: Hoare triple {43302#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43302#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:47,208 INFO L273 TraceCheckUtils]: 121: Hoare triple {43302#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43302#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:47,208 INFO L273 TraceCheckUtils]: 122: Hoare triple {43302#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43303#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:47,209 INFO L273 TraceCheckUtils]: 123: Hoare triple {43303#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43303#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:47,209 INFO L273 TraceCheckUtils]: 124: Hoare triple {43303#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43303#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:47,210 INFO L273 TraceCheckUtils]: 125: Hoare triple {43303#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43304#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:47,211 INFO L273 TraceCheckUtils]: 126: Hoare triple {43304#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43304#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:47,211 INFO L273 TraceCheckUtils]: 127: Hoare triple {43304#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43304#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:47,212 INFO L273 TraceCheckUtils]: 128: Hoare triple {43304#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43305#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:47,212 INFO L273 TraceCheckUtils]: 129: Hoare triple {43305#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43305#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:47,213 INFO L273 TraceCheckUtils]: 130: Hoare triple {43305#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43305#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:47,213 INFO L273 TraceCheckUtils]: 131: Hoare triple {43305#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43306#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:47,214 INFO L273 TraceCheckUtils]: 132: Hoare triple {43306#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43306#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:47,214 INFO L273 TraceCheckUtils]: 133: Hoare triple {43306#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43306#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:47,215 INFO L273 TraceCheckUtils]: 134: Hoare triple {43306#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43307#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:47,216 INFO L273 TraceCheckUtils]: 135: Hoare triple {43307#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43307#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:47,216 INFO L273 TraceCheckUtils]: 136: Hoare triple {43307#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43307#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:47,217 INFO L273 TraceCheckUtils]: 137: Hoare triple {43307#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43308#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:47,217 INFO L273 TraceCheckUtils]: 138: Hoare triple {43308#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43308#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:47,218 INFO L273 TraceCheckUtils]: 139: Hoare triple {43308#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43308#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:47,219 INFO L273 TraceCheckUtils]: 140: Hoare triple {43308#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43309#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:47,219 INFO L273 TraceCheckUtils]: 141: Hoare triple {43309#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43309#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:47,220 INFO L273 TraceCheckUtils]: 142: Hoare triple {43309#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43309#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:47,220 INFO L273 TraceCheckUtils]: 143: Hoare triple {43309#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43310#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:47,221 INFO L273 TraceCheckUtils]: 144: Hoare triple {43310#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43310#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:47,221 INFO L273 TraceCheckUtils]: 145: Hoare triple {43310#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43310#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:47,222 INFO L273 TraceCheckUtils]: 146: Hoare triple {43310#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43311#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:47,223 INFO L273 TraceCheckUtils]: 147: Hoare triple {43311#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43311#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:47,223 INFO L273 TraceCheckUtils]: 148: Hoare triple {43311#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43311#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:47,224 INFO L273 TraceCheckUtils]: 149: Hoare triple {43311#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43312#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:47,224 INFO L273 TraceCheckUtils]: 150: Hoare triple {43312#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43312#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:47,225 INFO L273 TraceCheckUtils]: 151: Hoare triple {43312#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43312#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:47,226 INFO L273 TraceCheckUtils]: 152: Hoare triple {43312#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43313#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:47,226 INFO L273 TraceCheckUtils]: 153: Hoare triple {43313#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43313#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:47,227 INFO L273 TraceCheckUtils]: 154: Hoare triple {43313#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43313#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:47,227 INFO L273 TraceCheckUtils]: 155: Hoare triple {43313#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43314#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:47,228 INFO L273 TraceCheckUtils]: 156: Hoare triple {43314#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43314#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:47,228 INFO L273 TraceCheckUtils]: 157: Hoare triple {43314#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43314#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:47,229 INFO L273 TraceCheckUtils]: 158: Hoare triple {43314#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43315#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:47,229 INFO L273 TraceCheckUtils]: 159: Hoare triple {43315#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43315#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:47,230 INFO L273 TraceCheckUtils]: 160: Hoare triple {43315#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43315#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:47,231 INFO L273 TraceCheckUtils]: 161: Hoare triple {43315#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43316#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:47,231 INFO L273 TraceCheckUtils]: 162: Hoare triple {43316#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43316#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:47,232 INFO L273 TraceCheckUtils]: 163: Hoare triple {43316#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43316#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:47,232 INFO L273 TraceCheckUtils]: 164: Hoare triple {43316#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43317#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:47,233 INFO L273 TraceCheckUtils]: 165: Hoare triple {43317#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43317#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:47,233 INFO L273 TraceCheckUtils]: 166: Hoare triple {43317#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {43317#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:47,234 INFO L273 TraceCheckUtils]: 167: Hoare triple {43317#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43318#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:47,235 INFO L273 TraceCheckUtils]: 168: Hoare triple {43318#(<= main_~i~0 55)} assume !(~i~0 < 100000); {43263#false} is VALID [2018-11-23 12:00:47,235 INFO L273 TraceCheckUtils]: 169: Hoare triple {43263#false} havoc ~x~0;~x~0 := 0; {43263#false} is VALID [2018-11-23 12:00:47,235 INFO L273 TraceCheckUtils]: 170: Hoare triple {43263#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {43263#false} is VALID [2018-11-23 12:00:47,235 INFO L256 TraceCheckUtils]: 171: Hoare triple {43263#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {43263#false} is VALID [2018-11-23 12:00:47,236 INFO L273 TraceCheckUtils]: 172: Hoare triple {43263#false} ~cond := #in~cond; {43263#false} is VALID [2018-11-23 12:00:47,236 INFO L273 TraceCheckUtils]: 173: Hoare triple {43263#false} assume 0 == ~cond; {43263#false} is VALID [2018-11-23 12:00:47,236 INFO L273 TraceCheckUtils]: 174: Hoare triple {43263#false} assume !false; {43263#false} is VALID [2018-11-23 12:00:47,270 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 12:00:47,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:47,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-11-23 12:00:47,290 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 175 [2018-11-23 12:00:47,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:47,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-23 12:00:47,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:47,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 12:00:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 12:00:47,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:00:47,470 INFO L87 Difference]: Start difference. First operand 180 states and 235 transitions. Second operand 57 states. [2018-11-23 12:00:48,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:48,690 INFO L93 Difference]: Finished difference Result 196 states and 254 transitions. [2018-11-23 12:00:48,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-23 12:00:48,690 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 175 [2018-11-23 12:00:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:00:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 254 transitions. [2018-11-23 12:00:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:00:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 254 transitions. [2018-11-23 12:00:48,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 254 transitions. [2018-11-23 12:00:48,933 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 12:00:48,936 INFO L225 Difference]: With dead ends: 196 [2018-11-23 12:00:48,937 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 12:00:48,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:00:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 12:00:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-11-23 12:00:49,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:49,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 183 states. [2018-11-23 12:00:49,369 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 183 states. [2018-11-23 12:00:49,369 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 183 states. [2018-11-23 12:00:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:49,373 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-11-23 12:00:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2018-11-23 12:00:49,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:49,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:49,374 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 185 states. [2018-11-23 12:00:49,374 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 185 states. [2018-11-23 12:00:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:49,377 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-11-23 12:00:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2018-11-23 12:00:49,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:49,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:49,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:49,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-23 12:00:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2018-11-23 12:00:49,381 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 175 [2018-11-23 12:00:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:49,381 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2018-11-23 12:00:49,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 12:00:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2018-11-23 12:00:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 12:00:49,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:49,382 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:49,383 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:49,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash 667428580, now seen corresponding path program 55 times [2018-11-23 12:00:49,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:49,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:49,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:51,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {44721#true} call ULTIMATE.init(); {44721#true} is VALID [2018-11-23 12:00:51,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {44721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44721#true} is VALID [2018-11-23 12:00:51,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {44721#true} assume true; {44721#true} is VALID [2018-11-23 12:00:51,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44721#true} {44721#true} #54#return; {44721#true} is VALID [2018-11-23 12:00:51,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {44721#true} call #t~ret6 := main(); {44721#true} is VALID [2018-11-23 12:00:51,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {44721#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {44723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:51,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {44723#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:51,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {44723#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:51,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {44723#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:51,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {44724#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:51,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {44724#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:51,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {44724#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:51,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {44725#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:51,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {44725#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:51,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {44725#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:51,042 INFO L273 TraceCheckUtils]: 15: Hoare triple {44726#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:51,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {44726#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:51,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {44726#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:51,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {44727#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:51,044 INFO L273 TraceCheckUtils]: 19: Hoare triple {44727#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:51,045 INFO L273 TraceCheckUtils]: 20: Hoare triple {44727#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:51,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {44728#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:51,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {44728#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:51,046 INFO L273 TraceCheckUtils]: 23: Hoare triple {44728#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:51,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {44729#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:51,047 INFO L273 TraceCheckUtils]: 25: Hoare triple {44729#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:51,048 INFO L273 TraceCheckUtils]: 26: Hoare triple {44729#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:51,049 INFO L273 TraceCheckUtils]: 27: Hoare triple {44730#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:51,049 INFO L273 TraceCheckUtils]: 28: Hoare triple {44730#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:51,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {44730#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:51,050 INFO L273 TraceCheckUtils]: 30: Hoare triple {44731#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:51,051 INFO L273 TraceCheckUtils]: 31: Hoare triple {44731#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:51,052 INFO L273 TraceCheckUtils]: 32: Hoare triple {44731#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:51,052 INFO L273 TraceCheckUtils]: 33: Hoare triple {44732#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:51,053 INFO L273 TraceCheckUtils]: 34: Hoare triple {44732#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:51,053 INFO L273 TraceCheckUtils]: 35: Hoare triple {44732#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:51,054 INFO L273 TraceCheckUtils]: 36: Hoare triple {44733#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:51,054 INFO L273 TraceCheckUtils]: 37: Hoare triple {44733#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:51,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {44733#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:51,056 INFO L273 TraceCheckUtils]: 39: Hoare triple {44734#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:51,056 INFO L273 TraceCheckUtils]: 40: Hoare triple {44734#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:51,057 INFO L273 TraceCheckUtils]: 41: Hoare triple {44734#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:51,057 INFO L273 TraceCheckUtils]: 42: Hoare triple {44735#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:51,058 INFO L273 TraceCheckUtils]: 43: Hoare triple {44735#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:51,058 INFO L273 TraceCheckUtils]: 44: Hoare triple {44735#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:51,059 INFO L273 TraceCheckUtils]: 45: Hoare triple {44736#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:51,059 INFO L273 TraceCheckUtils]: 46: Hoare triple {44736#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:51,060 INFO L273 TraceCheckUtils]: 47: Hoare triple {44736#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:51,061 INFO L273 TraceCheckUtils]: 48: Hoare triple {44737#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:51,061 INFO L273 TraceCheckUtils]: 49: Hoare triple {44737#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:51,062 INFO L273 TraceCheckUtils]: 50: Hoare triple {44737#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:51,062 INFO L273 TraceCheckUtils]: 51: Hoare triple {44738#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:51,063 INFO L273 TraceCheckUtils]: 52: Hoare triple {44738#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:51,064 INFO L273 TraceCheckUtils]: 53: Hoare triple {44738#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:51,064 INFO L273 TraceCheckUtils]: 54: Hoare triple {44739#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:51,065 INFO L273 TraceCheckUtils]: 55: Hoare triple {44739#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:51,065 INFO L273 TraceCheckUtils]: 56: Hoare triple {44739#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:51,066 INFO L273 TraceCheckUtils]: 57: Hoare triple {44740#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:51,066 INFO L273 TraceCheckUtils]: 58: Hoare triple {44740#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:51,067 INFO L273 TraceCheckUtils]: 59: Hoare triple {44740#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:51,068 INFO L273 TraceCheckUtils]: 60: Hoare triple {44741#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:51,068 INFO L273 TraceCheckUtils]: 61: Hoare triple {44741#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:51,069 INFO L273 TraceCheckUtils]: 62: Hoare triple {44741#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:51,069 INFO L273 TraceCheckUtils]: 63: Hoare triple {44742#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:51,070 INFO L273 TraceCheckUtils]: 64: Hoare triple {44742#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:51,071 INFO L273 TraceCheckUtils]: 65: Hoare triple {44742#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:51,071 INFO L273 TraceCheckUtils]: 66: Hoare triple {44743#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:51,072 INFO L273 TraceCheckUtils]: 67: Hoare triple {44743#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:51,072 INFO L273 TraceCheckUtils]: 68: Hoare triple {44743#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:51,073 INFO L273 TraceCheckUtils]: 69: Hoare triple {44744#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:51,073 INFO L273 TraceCheckUtils]: 70: Hoare triple {44744#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 71: Hoare triple {44744#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 72: Hoare triple {44745#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:51,075 INFO L273 TraceCheckUtils]: 73: Hoare triple {44745#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:51,076 INFO L273 TraceCheckUtils]: 74: Hoare triple {44745#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:51,076 INFO L273 TraceCheckUtils]: 75: Hoare triple {44746#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:51,077 INFO L273 TraceCheckUtils]: 76: Hoare triple {44746#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:51,077 INFO L273 TraceCheckUtils]: 77: Hoare triple {44746#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:51,078 INFO L273 TraceCheckUtils]: 78: Hoare triple {44747#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:51,078 INFO L273 TraceCheckUtils]: 79: Hoare triple {44747#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:51,079 INFO L273 TraceCheckUtils]: 80: Hoare triple {44747#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:51,080 INFO L273 TraceCheckUtils]: 81: Hoare triple {44748#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:51,080 INFO L273 TraceCheckUtils]: 82: Hoare triple {44748#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:51,081 INFO L273 TraceCheckUtils]: 83: Hoare triple {44748#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:51,081 INFO L273 TraceCheckUtils]: 84: Hoare triple {44749#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:51,082 INFO L273 TraceCheckUtils]: 85: Hoare triple {44749#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:51,083 INFO L273 TraceCheckUtils]: 86: Hoare triple {44749#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:51,083 INFO L273 TraceCheckUtils]: 87: Hoare triple {44750#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:51,084 INFO L273 TraceCheckUtils]: 88: Hoare triple {44750#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:51,084 INFO L273 TraceCheckUtils]: 89: Hoare triple {44750#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:51,085 INFO L273 TraceCheckUtils]: 90: Hoare triple {44751#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:51,085 INFO L273 TraceCheckUtils]: 91: Hoare triple {44751#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:51,086 INFO L273 TraceCheckUtils]: 92: Hoare triple {44751#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:51,086 INFO L273 TraceCheckUtils]: 93: Hoare triple {44752#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:51,087 INFO L273 TraceCheckUtils]: 94: Hoare triple {44752#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:51,088 INFO L273 TraceCheckUtils]: 95: Hoare triple {44752#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:51,088 INFO L273 TraceCheckUtils]: 96: Hoare triple {44753#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:51,089 INFO L273 TraceCheckUtils]: 97: Hoare triple {44753#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:51,089 INFO L273 TraceCheckUtils]: 98: Hoare triple {44753#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:51,090 INFO L273 TraceCheckUtils]: 99: Hoare triple {44754#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:51,090 INFO L273 TraceCheckUtils]: 100: Hoare triple {44754#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:51,091 INFO L273 TraceCheckUtils]: 101: Hoare triple {44754#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:51,092 INFO L273 TraceCheckUtils]: 102: Hoare triple {44755#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:51,092 INFO L273 TraceCheckUtils]: 103: Hoare triple {44755#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:51,093 INFO L273 TraceCheckUtils]: 104: Hoare triple {44755#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:51,093 INFO L273 TraceCheckUtils]: 105: Hoare triple {44756#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:51,094 INFO L273 TraceCheckUtils]: 106: Hoare triple {44756#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:51,095 INFO L273 TraceCheckUtils]: 107: Hoare triple {44756#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:51,095 INFO L273 TraceCheckUtils]: 108: Hoare triple {44757#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:51,096 INFO L273 TraceCheckUtils]: 109: Hoare triple {44757#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:51,096 INFO L273 TraceCheckUtils]: 110: Hoare triple {44757#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:51,097 INFO L273 TraceCheckUtils]: 111: Hoare triple {44758#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:51,097 INFO L273 TraceCheckUtils]: 112: Hoare triple {44758#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:51,098 INFO L273 TraceCheckUtils]: 113: Hoare triple {44758#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:51,098 INFO L273 TraceCheckUtils]: 114: Hoare triple {44759#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:51,099 INFO L273 TraceCheckUtils]: 115: Hoare triple {44759#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:51,100 INFO L273 TraceCheckUtils]: 116: Hoare triple {44759#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:51,100 INFO L273 TraceCheckUtils]: 117: Hoare triple {44760#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:51,101 INFO L273 TraceCheckUtils]: 118: Hoare triple {44760#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:51,101 INFO L273 TraceCheckUtils]: 119: Hoare triple {44760#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:51,102 INFO L273 TraceCheckUtils]: 120: Hoare triple {44761#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:51,102 INFO L273 TraceCheckUtils]: 121: Hoare triple {44761#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:51,103 INFO L273 TraceCheckUtils]: 122: Hoare triple {44761#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:51,104 INFO L273 TraceCheckUtils]: 123: Hoare triple {44762#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:51,104 INFO L273 TraceCheckUtils]: 124: Hoare triple {44762#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:51,105 INFO L273 TraceCheckUtils]: 125: Hoare triple {44762#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:51,105 INFO L273 TraceCheckUtils]: 126: Hoare triple {44763#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:51,106 INFO L273 TraceCheckUtils]: 127: Hoare triple {44763#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:51,107 INFO L273 TraceCheckUtils]: 128: Hoare triple {44763#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:51,107 INFO L273 TraceCheckUtils]: 129: Hoare triple {44764#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:51,107 INFO L273 TraceCheckUtils]: 130: Hoare triple {44764#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:51,108 INFO L273 TraceCheckUtils]: 131: Hoare triple {44764#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:51,109 INFO L273 TraceCheckUtils]: 132: Hoare triple {44765#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:51,109 INFO L273 TraceCheckUtils]: 133: Hoare triple {44765#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:51,110 INFO L273 TraceCheckUtils]: 134: Hoare triple {44765#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:51,110 INFO L273 TraceCheckUtils]: 135: Hoare triple {44766#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:51,111 INFO L273 TraceCheckUtils]: 136: Hoare triple {44766#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:51,112 INFO L273 TraceCheckUtils]: 137: Hoare triple {44766#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:51,112 INFO L273 TraceCheckUtils]: 138: Hoare triple {44767#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:51,113 INFO L273 TraceCheckUtils]: 139: Hoare triple {44767#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:51,113 INFO L273 TraceCheckUtils]: 140: Hoare triple {44767#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:51,114 INFO L273 TraceCheckUtils]: 141: Hoare triple {44768#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:51,114 INFO L273 TraceCheckUtils]: 142: Hoare triple {44768#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:51,115 INFO L273 TraceCheckUtils]: 143: Hoare triple {44768#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:51,116 INFO L273 TraceCheckUtils]: 144: Hoare triple {44769#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:51,116 INFO L273 TraceCheckUtils]: 145: Hoare triple {44769#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:51,117 INFO L273 TraceCheckUtils]: 146: Hoare triple {44769#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44770#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:51,117 INFO L273 TraceCheckUtils]: 147: Hoare triple {44770#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44770#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:51,118 INFO L273 TraceCheckUtils]: 148: Hoare triple {44770#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44770#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:51,118 INFO L273 TraceCheckUtils]: 149: Hoare triple {44770#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44771#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:51,119 INFO L273 TraceCheckUtils]: 150: Hoare triple {44771#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44771#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:51,119 INFO L273 TraceCheckUtils]: 151: Hoare triple {44771#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44771#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:51,120 INFO L273 TraceCheckUtils]: 152: Hoare triple {44771#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44772#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:51,121 INFO L273 TraceCheckUtils]: 153: Hoare triple {44772#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44772#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:51,121 INFO L273 TraceCheckUtils]: 154: Hoare triple {44772#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44772#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:51,122 INFO L273 TraceCheckUtils]: 155: Hoare triple {44772#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44773#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:51,122 INFO L273 TraceCheckUtils]: 156: Hoare triple {44773#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44773#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:51,123 INFO L273 TraceCheckUtils]: 157: Hoare triple {44773#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44773#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:51,124 INFO L273 TraceCheckUtils]: 158: Hoare triple {44773#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44774#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:51,124 INFO L273 TraceCheckUtils]: 159: Hoare triple {44774#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44774#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:51,125 INFO L273 TraceCheckUtils]: 160: Hoare triple {44774#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44774#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:51,125 INFO L273 TraceCheckUtils]: 161: Hoare triple {44774#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44775#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:51,126 INFO L273 TraceCheckUtils]: 162: Hoare triple {44775#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44775#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:51,126 INFO L273 TraceCheckUtils]: 163: Hoare triple {44775#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44775#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:51,127 INFO L273 TraceCheckUtils]: 164: Hoare triple {44775#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44776#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:51,128 INFO L273 TraceCheckUtils]: 165: Hoare triple {44776#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44776#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:51,128 INFO L273 TraceCheckUtils]: 166: Hoare triple {44776#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44776#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:51,129 INFO L273 TraceCheckUtils]: 167: Hoare triple {44776#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44777#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:51,129 INFO L273 TraceCheckUtils]: 168: Hoare triple {44777#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44777#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:51,130 INFO L273 TraceCheckUtils]: 169: Hoare triple {44777#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44777#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:51,131 INFO L273 TraceCheckUtils]: 170: Hoare triple {44777#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44778#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:51,131 INFO L273 TraceCheckUtils]: 171: Hoare triple {44778#(<= main_~i~0 56)} assume !(~i~0 < 100000); {44722#false} is VALID [2018-11-23 12:00:51,131 INFO L273 TraceCheckUtils]: 172: Hoare triple {44722#false} havoc ~x~0;~x~0 := 0; {44722#false} is VALID [2018-11-23 12:00:51,132 INFO L273 TraceCheckUtils]: 173: Hoare triple {44722#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {44722#false} is VALID [2018-11-23 12:00:51,132 INFO L256 TraceCheckUtils]: 174: Hoare triple {44722#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {44722#false} is VALID [2018-11-23 12:00:51,132 INFO L273 TraceCheckUtils]: 175: Hoare triple {44722#false} ~cond := #in~cond; {44722#false} is VALID [2018-11-23 12:00:51,132 INFO L273 TraceCheckUtils]: 176: Hoare triple {44722#false} assume 0 == ~cond; {44722#false} is VALID [2018-11-23 12:00:51,132 INFO L273 TraceCheckUtils]: 177: Hoare triple {44722#false} assume !false; {44722#false} is VALID [2018-11-23 12:00:51,153 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 12:00:51,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:51,153 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 12:00:51,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:51,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:51,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {44721#true} call ULTIMATE.init(); {44721#true} is VALID [2018-11-23 12:00:51,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {44721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44721#true} is VALID [2018-11-23 12:00:51,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {44721#true} assume true; {44721#true} is VALID [2018-11-23 12:00:51,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44721#true} {44721#true} #54#return; {44721#true} is VALID [2018-11-23 12:00:51,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {44721#true} call #t~ret6 := main(); {44721#true} is VALID [2018-11-23 12:00:51,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {44721#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {44723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:51,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {44723#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:51,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {44723#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44723#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:51,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {44723#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:51,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {44724#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:51,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {44724#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44724#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:51,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {44724#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:51,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {44725#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:51,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {44725#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44725#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:51,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {44725#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:51,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {44726#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:51,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {44726#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44726#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:51,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {44726#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:51,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {44727#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:51,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {44727#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44727#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:51,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {44727#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:51,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {44728#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:51,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {44728#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44728#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:51,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {44728#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:51,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {44729#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:51,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {44729#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44729#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:51,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {44729#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:51,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {44730#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:51,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {44730#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44730#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:51,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {44730#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:51,690 INFO L273 TraceCheckUtils]: 30: Hoare triple {44731#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:51,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {44731#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44731#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:51,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {44731#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:51,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {44732#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:51,693 INFO L273 TraceCheckUtils]: 34: Hoare triple {44732#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44732#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:51,693 INFO L273 TraceCheckUtils]: 35: Hoare triple {44732#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:51,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {44733#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:51,694 INFO L273 TraceCheckUtils]: 37: Hoare triple {44733#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44733#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:51,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {44733#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:51,696 INFO L273 TraceCheckUtils]: 39: Hoare triple {44734#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:51,696 INFO L273 TraceCheckUtils]: 40: Hoare triple {44734#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44734#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:51,697 INFO L273 TraceCheckUtils]: 41: Hoare triple {44734#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:51,697 INFO L273 TraceCheckUtils]: 42: Hoare triple {44735#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:51,698 INFO L273 TraceCheckUtils]: 43: Hoare triple {44735#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44735#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:51,698 INFO L273 TraceCheckUtils]: 44: Hoare triple {44735#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:51,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {44736#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:51,699 INFO L273 TraceCheckUtils]: 46: Hoare triple {44736#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44736#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:51,700 INFO L273 TraceCheckUtils]: 47: Hoare triple {44736#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:51,701 INFO L273 TraceCheckUtils]: 48: Hoare triple {44737#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:51,701 INFO L273 TraceCheckUtils]: 49: Hoare triple {44737#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44737#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:51,702 INFO L273 TraceCheckUtils]: 50: Hoare triple {44737#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:51,702 INFO L273 TraceCheckUtils]: 51: Hoare triple {44738#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:51,703 INFO L273 TraceCheckUtils]: 52: Hoare triple {44738#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44738#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:51,704 INFO L273 TraceCheckUtils]: 53: Hoare triple {44738#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:51,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {44739#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:51,705 INFO L273 TraceCheckUtils]: 55: Hoare triple {44739#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44739#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:51,705 INFO L273 TraceCheckUtils]: 56: Hoare triple {44739#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:51,706 INFO L273 TraceCheckUtils]: 57: Hoare triple {44740#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:51,706 INFO L273 TraceCheckUtils]: 58: Hoare triple {44740#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44740#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:51,707 INFO L273 TraceCheckUtils]: 59: Hoare triple {44740#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:51,708 INFO L273 TraceCheckUtils]: 60: Hoare triple {44741#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:51,708 INFO L273 TraceCheckUtils]: 61: Hoare triple {44741#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44741#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:51,709 INFO L273 TraceCheckUtils]: 62: Hoare triple {44741#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:51,709 INFO L273 TraceCheckUtils]: 63: Hoare triple {44742#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:51,710 INFO L273 TraceCheckUtils]: 64: Hoare triple {44742#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44742#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:51,711 INFO L273 TraceCheckUtils]: 65: Hoare triple {44742#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:51,711 INFO L273 TraceCheckUtils]: 66: Hoare triple {44743#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:51,712 INFO L273 TraceCheckUtils]: 67: Hoare triple {44743#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44743#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:51,712 INFO L273 TraceCheckUtils]: 68: Hoare triple {44743#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:51,713 INFO L273 TraceCheckUtils]: 69: Hoare triple {44744#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:51,713 INFO L273 TraceCheckUtils]: 70: Hoare triple {44744#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44744#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:51,714 INFO L273 TraceCheckUtils]: 71: Hoare triple {44744#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:51,715 INFO L273 TraceCheckUtils]: 72: Hoare triple {44745#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:51,715 INFO L273 TraceCheckUtils]: 73: Hoare triple {44745#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44745#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:51,716 INFO L273 TraceCheckUtils]: 74: Hoare triple {44745#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:51,716 INFO L273 TraceCheckUtils]: 75: Hoare triple {44746#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:51,717 INFO L273 TraceCheckUtils]: 76: Hoare triple {44746#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44746#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:51,717 INFO L273 TraceCheckUtils]: 77: Hoare triple {44746#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:51,718 INFO L273 TraceCheckUtils]: 78: Hoare triple {44747#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:51,718 INFO L273 TraceCheckUtils]: 79: Hoare triple {44747#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44747#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:51,719 INFO L273 TraceCheckUtils]: 80: Hoare triple {44747#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:51,720 INFO L273 TraceCheckUtils]: 81: Hoare triple {44748#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:51,720 INFO L273 TraceCheckUtils]: 82: Hoare triple {44748#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44748#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:51,721 INFO L273 TraceCheckUtils]: 83: Hoare triple {44748#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:51,721 INFO L273 TraceCheckUtils]: 84: Hoare triple {44749#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:51,722 INFO L273 TraceCheckUtils]: 85: Hoare triple {44749#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44749#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:51,723 INFO L273 TraceCheckUtils]: 86: Hoare triple {44749#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:51,723 INFO L273 TraceCheckUtils]: 87: Hoare triple {44750#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:51,724 INFO L273 TraceCheckUtils]: 88: Hoare triple {44750#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44750#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:51,724 INFO L273 TraceCheckUtils]: 89: Hoare triple {44750#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:51,725 INFO L273 TraceCheckUtils]: 90: Hoare triple {44751#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:51,725 INFO L273 TraceCheckUtils]: 91: Hoare triple {44751#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44751#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:51,726 INFO L273 TraceCheckUtils]: 92: Hoare triple {44751#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:51,727 INFO L273 TraceCheckUtils]: 93: Hoare triple {44752#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:51,727 INFO L273 TraceCheckUtils]: 94: Hoare triple {44752#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44752#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:51,728 INFO L273 TraceCheckUtils]: 95: Hoare triple {44752#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:51,728 INFO L273 TraceCheckUtils]: 96: Hoare triple {44753#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:51,729 INFO L273 TraceCheckUtils]: 97: Hoare triple {44753#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44753#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:51,730 INFO L273 TraceCheckUtils]: 98: Hoare triple {44753#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:51,730 INFO L273 TraceCheckUtils]: 99: Hoare triple {44754#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:51,731 INFO L273 TraceCheckUtils]: 100: Hoare triple {44754#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44754#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:51,731 INFO L273 TraceCheckUtils]: 101: Hoare triple {44754#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:51,732 INFO L273 TraceCheckUtils]: 102: Hoare triple {44755#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:51,732 INFO L273 TraceCheckUtils]: 103: Hoare triple {44755#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44755#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:51,733 INFO L273 TraceCheckUtils]: 104: Hoare triple {44755#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:51,734 INFO L273 TraceCheckUtils]: 105: Hoare triple {44756#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:51,734 INFO L273 TraceCheckUtils]: 106: Hoare triple {44756#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44756#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:51,735 INFO L273 TraceCheckUtils]: 107: Hoare triple {44756#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:51,735 INFO L273 TraceCheckUtils]: 108: Hoare triple {44757#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:51,736 INFO L273 TraceCheckUtils]: 109: Hoare triple {44757#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44757#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:51,736 INFO L273 TraceCheckUtils]: 110: Hoare triple {44757#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:51,737 INFO L273 TraceCheckUtils]: 111: Hoare triple {44758#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:51,737 INFO L273 TraceCheckUtils]: 112: Hoare triple {44758#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44758#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:51,738 INFO L273 TraceCheckUtils]: 113: Hoare triple {44758#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:51,739 INFO L273 TraceCheckUtils]: 114: Hoare triple {44759#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:51,739 INFO L273 TraceCheckUtils]: 115: Hoare triple {44759#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44759#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:51,740 INFO L273 TraceCheckUtils]: 116: Hoare triple {44759#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:51,740 INFO L273 TraceCheckUtils]: 117: Hoare triple {44760#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:51,741 INFO L273 TraceCheckUtils]: 118: Hoare triple {44760#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44760#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:51,742 INFO L273 TraceCheckUtils]: 119: Hoare triple {44760#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:51,742 INFO L273 TraceCheckUtils]: 120: Hoare triple {44761#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:51,743 INFO L273 TraceCheckUtils]: 121: Hoare triple {44761#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44761#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:51,743 INFO L273 TraceCheckUtils]: 122: Hoare triple {44761#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:51,744 INFO L273 TraceCheckUtils]: 123: Hoare triple {44762#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:51,744 INFO L273 TraceCheckUtils]: 124: Hoare triple {44762#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44762#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:51,745 INFO L273 TraceCheckUtils]: 125: Hoare triple {44762#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:51,745 INFO L273 TraceCheckUtils]: 126: Hoare triple {44763#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:51,746 INFO L273 TraceCheckUtils]: 127: Hoare triple {44763#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44763#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:51,747 INFO L273 TraceCheckUtils]: 128: Hoare triple {44763#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:51,747 INFO L273 TraceCheckUtils]: 129: Hoare triple {44764#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:51,748 INFO L273 TraceCheckUtils]: 130: Hoare triple {44764#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44764#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:51,748 INFO L273 TraceCheckUtils]: 131: Hoare triple {44764#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:51,749 INFO L273 TraceCheckUtils]: 132: Hoare triple {44765#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:51,749 INFO L273 TraceCheckUtils]: 133: Hoare triple {44765#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44765#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:51,750 INFO L273 TraceCheckUtils]: 134: Hoare triple {44765#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:51,751 INFO L273 TraceCheckUtils]: 135: Hoare triple {44766#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:51,751 INFO L273 TraceCheckUtils]: 136: Hoare triple {44766#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44766#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:51,752 INFO L273 TraceCheckUtils]: 137: Hoare triple {44766#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:51,752 INFO L273 TraceCheckUtils]: 138: Hoare triple {44767#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:51,753 INFO L273 TraceCheckUtils]: 139: Hoare triple {44767#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44767#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:51,754 INFO L273 TraceCheckUtils]: 140: Hoare triple {44767#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:51,754 INFO L273 TraceCheckUtils]: 141: Hoare triple {44768#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:51,755 INFO L273 TraceCheckUtils]: 142: Hoare triple {44768#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44768#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:51,755 INFO L273 TraceCheckUtils]: 143: Hoare triple {44768#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:51,756 INFO L273 TraceCheckUtils]: 144: Hoare triple {44769#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:51,756 INFO L273 TraceCheckUtils]: 145: Hoare triple {44769#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44769#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:51,757 INFO L273 TraceCheckUtils]: 146: Hoare triple {44769#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44770#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:51,757 INFO L273 TraceCheckUtils]: 147: Hoare triple {44770#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44770#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:51,758 INFO L273 TraceCheckUtils]: 148: Hoare triple {44770#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44770#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:51,759 INFO L273 TraceCheckUtils]: 149: Hoare triple {44770#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44771#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:51,759 INFO L273 TraceCheckUtils]: 150: Hoare triple {44771#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44771#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:51,760 INFO L273 TraceCheckUtils]: 151: Hoare triple {44771#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44771#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:51,760 INFO L273 TraceCheckUtils]: 152: Hoare triple {44771#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44772#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:51,761 INFO L273 TraceCheckUtils]: 153: Hoare triple {44772#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44772#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:51,761 INFO L273 TraceCheckUtils]: 154: Hoare triple {44772#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44772#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:51,762 INFO L273 TraceCheckUtils]: 155: Hoare triple {44772#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44773#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:51,763 INFO L273 TraceCheckUtils]: 156: Hoare triple {44773#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44773#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:51,763 INFO L273 TraceCheckUtils]: 157: Hoare triple {44773#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44773#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:51,764 INFO L273 TraceCheckUtils]: 158: Hoare triple {44773#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44774#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:51,764 INFO L273 TraceCheckUtils]: 159: Hoare triple {44774#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44774#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:51,765 INFO L273 TraceCheckUtils]: 160: Hoare triple {44774#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44774#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:51,765 INFO L273 TraceCheckUtils]: 161: Hoare triple {44774#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44775#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:51,766 INFO L273 TraceCheckUtils]: 162: Hoare triple {44775#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44775#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:51,766 INFO L273 TraceCheckUtils]: 163: Hoare triple {44775#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44775#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:51,767 INFO L273 TraceCheckUtils]: 164: Hoare triple {44775#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44776#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:51,768 INFO L273 TraceCheckUtils]: 165: Hoare triple {44776#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44776#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:51,768 INFO L273 TraceCheckUtils]: 166: Hoare triple {44776#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44776#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:51,769 INFO L273 TraceCheckUtils]: 167: Hoare triple {44776#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44777#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:51,769 INFO L273 TraceCheckUtils]: 168: Hoare triple {44777#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {44777#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:51,770 INFO L273 TraceCheckUtils]: 169: Hoare triple {44777#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {44777#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:51,771 INFO L273 TraceCheckUtils]: 170: Hoare triple {44777#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44778#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:51,771 INFO L273 TraceCheckUtils]: 171: Hoare triple {44778#(<= main_~i~0 56)} assume !(~i~0 < 100000); {44722#false} is VALID [2018-11-23 12:00:51,772 INFO L273 TraceCheckUtils]: 172: Hoare triple {44722#false} havoc ~x~0;~x~0 := 0; {44722#false} is VALID [2018-11-23 12:00:51,772 INFO L273 TraceCheckUtils]: 173: Hoare triple {44722#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {44722#false} is VALID [2018-11-23 12:00:51,772 INFO L256 TraceCheckUtils]: 174: Hoare triple {44722#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {44722#false} is VALID [2018-11-23 12:00:51,772 INFO L273 TraceCheckUtils]: 175: Hoare triple {44722#false} ~cond := #in~cond; {44722#false} is VALID [2018-11-23 12:00:51,772 INFO L273 TraceCheckUtils]: 176: Hoare triple {44722#false} assume 0 == ~cond; {44722#false} is VALID [2018-11-23 12:00:51,772 INFO L273 TraceCheckUtils]: 177: Hoare triple {44722#false} assume !false; {44722#false} is VALID [2018-11-23 12:00:51,792 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 12:00:51,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:51,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-11-23 12:00:51,812 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 178 [2018-11-23 12:00:51,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:51,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2018-11-23 12:00:52,006 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 12:00:52,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 12:00:52,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 12:00:52,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 12:00:52,007 INFO L87 Difference]: Start difference. First operand 183 states and 239 transitions. Second operand 58 states. [2018-11-23 12:00:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:53,219 INFO L93 Difference]: Finished difference Result 199 states and 258 transitions. [2018-11-23 12:00:53,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-23 12:00:53,219 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 178 [2018-11-23 12:00:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:00:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 258 transitions. [2018-11-23 12:00:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:00:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 258 transitions. [2018-11-23 12:00:53,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 258 transitions. [2018-11-23 12:00:53,467 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 12:00:53,471 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:00:53,471 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 12:00:53,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 12:00:53,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 12:00:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-11-23 12:00:53,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:53,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states. [2018-11-23 12:00:53,518 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states. [2018-11-23 12:00:53,518 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 186 states. [2018-11-23 12:00:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:53,521 INFO L93 Difference]: Finished difference Result 188 states and 246 transitions. [2018-11-23 12:00:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2018-11-23 12:00:53,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:53,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:53,521 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states. [2018-11-23 12:00:53,521 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 188 states. [2018-11-23 12:00:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:53,525 INFO L93 Difference]: Finished difference Result 188 states and 246 transitions. [2018-11-23 12:00:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2018-11-23 12:00:53,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:53,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:53,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:53,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-23 12:00:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-11-23 12:00:53,529 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 178 [2018-11-23 12:00:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:53,529 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-11-23 12:00:53,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 12:00:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-11-23 12:00:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-23 12:00:53,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:53,530 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:53,531 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:53,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:53,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1006578423, now seen corresponding path program 56 times [2018-11-23 12:00:53,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:53,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:53,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:53,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:53,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:54,964 INFO L256 TraceCheckUtils]: 0: Hoare triple {46204#true} call ULTIMATE.init(); {46204#true} is VALID [2018-11-23 12:00:54,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {46204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46204#true} is VALID [2018-11-23 12:00:54,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {46204#true} assume true; {46204#true} is VALID [2018-11-23 12:00:54,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46204#true} {46204#true} #54#return; {46204#true} is VALID [2018-11-23 12:00:54,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {46204#true} call #t~ret6 := main(); {46204#true} is VALID [2018-11-23 12:00:54,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {46204#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {46206#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:54,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {46206#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46206#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:54,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {46206#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46206#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:54,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {46206#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46207#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:54,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {46207#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46207#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:54,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {46207#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46207#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:54,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {46207#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46208#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:54,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {46208#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46208#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:54,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {46208#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46208#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:54,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {46208#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46209#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:54,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {46209#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46209#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:54,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {46209#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46209#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:54,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {46209#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46210#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:54,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {46210#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46210#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:54,972 INFO L273 TraceCheckUtils]: 19: Hoare triple {46210#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46210#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:54,973 INFO L273 TraceCheckUtils]: 20: Hoare triple {46210#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46211#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:54,974 INFO L273 TraceCheckUtils]: 21: Hoare triple {46211#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46211#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:54,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {46211#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46211#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:54,975 INFO L273 TraceCheckUtils]: 23: Hoare triple {46211#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46212#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:54,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {46212#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46212#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:54,976 INFO L273 TraceCheckUtils]: 25: Hoare triple {46212#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46212#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:54,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {46212#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46213#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:54,977 INFO L273 TraceCheckUtils]: 27: Hoare triple {46213#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46213#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:54,977 INFO L273 TraceCheckUtils]: 28: Hoare triple {46213#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46213#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:54,978 INFO L273 TraceCheckUtils]: 29: Hoare triple {46213#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46214#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:54,979 INFO L273 TraceCheckUtils]: 30: Hoare triple {46214#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46214#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:54,979 INFO L273 TraceCheckUtils]: 31: Hoare triple {46214#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46214#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:54,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {46214#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46215#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:54,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {46215#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46215#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:54,981 INFO L273 TraceCheckUtils]: 34: Hoare triple {46215#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46215#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:54,982 INFO L273 TraceCheckUtils]: 35: Hoare triple {46215#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46216#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:54,982 INFO L273 TraceCheckUtils]: 36: Hoare triple {46216#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46216#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:54,983 INFO L273 TraceCheckUtils]: 37: Hoare triple {46216#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46216#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:54,983 INFO L273 TraceCheckUtils]: 38: Hoare triple {46216#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46217#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:54,984 INFO L273 TraceCheckUtils]: 39: Hoare triple {46217#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46217#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:54,984 INFO L273 TraceCheckUtils]: 40: Hoare triple {46217#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46217#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:54,985 INFO L273 TraceCheckUtils]: 41: Hoare triple {46217#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46218#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:54,986 INFO L273 TraceCheckUtils]: 42: Hoare triple {46218#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46218#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:54,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {46218#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46218#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:54,987 INFO L273 TraceCheckUtils]: 44: Hoare triple {46218#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46219#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:54,987 INFO L273 TraceCheckUtils]: 45: Hoare triple {46219#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46219#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:54,988 INFO L273 TraceCheckUtils]: 46: Hoare triple {46219#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46219#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:54,988 INFO L273 TraceCheckUtils]: 47: Hoare triple {46219#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46220#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:54,989 INFO L273 TraceCheckUtils]: 48: Hoare triple {46220#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46220#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:54,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {46220#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46220#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:54,990 INFO L273 TraceCheckUtils]: 50: Hoare triple {46220#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46221#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:54,991 INFO L273 TraceCheckUtils]: 51: Hoare triple {46221#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46221#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:54,991 INFO L273 TraceCheckUtils]: 52: Hoare triple {46221#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46221#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:54,992 INFO L273 TraceCheckUtils]: 53: Hoare triple {46221#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46222#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:54,992 INFO L273 TraceCheckUtils]: 54: Hoare triple {46222#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46222#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:54,993 INFO L273 TraceCheckUtils]: 55: Hoare triple {46222#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46222#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:54,994 INFO L273 TraceCheckUtils]: 56: Hoare triple {46222#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46223#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:54,994 INFO L273 TraceCheckUtils]: 57: Hoare triple {46223#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46223#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:54,995 INFO L273 TraceCheckUtils]: 58: Hoare triple {46223#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46223#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:54,995 INFO L273 TraceCheckUtils]: 59: Hoare triple {46223#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46224#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:54,996 INFO L273 TraceCheckUtils]: 60: Hoare triple {46224#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46224#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:54,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {46224#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46224#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:54,997 INFO L273 TraceCheckUtils]: 62: Hoare triple {46224#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46225#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:54,998 INFO L273 TraceCheckUtils]: 63: Hoare triple {46225#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46225#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:54,998 INFO L273 TraceCheckUtils]: 64: Hoare triple {46225#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46225#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:54,999 INFO L273 TraceCheckUtils]: 65: Hoare triple {46225#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46226#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:54,999 INFO L273 TraceCheckUtils]: 66: Hoare triple {46226#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46226#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:55,000 INFO L273 TraceCheckUtils]: 67: Hoare triple {46226#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46226#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:55,001 INFO L273 TraceCheckUtils]: 68: Hoare triple {46226#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46227#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:55,001 INFO L273 TraceCheckUtils]: 69: Hoare triple {46227#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46227#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:55,002 INFO L273 TraceCheckUtils]: 70: Hoare triple {46227#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46227#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:55,002 INFO L273 TraceCheckUtils]: 71: Hoare triple {46227#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46228#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:55,003 INFO L273 TraceCheckUtils]: 72: Hoare triple {46228#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46228#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:55,003 INFO L273 TraceCheckUtils]: 73: Hoare triple {46228#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46228#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:55,004 INFO L273 TraceCheckUtils]: 74: Hoare triple {46228#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46229#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:55,005 INFO L273 TraceCheckUtils]: 75: Hoare triple {46229#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46229#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:55,005 INFO L273 TraceCheckUtils]: 76: Hoare triple {46229#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46229#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:55,006 INFO L273 TraceCheckUtils]: 77: Hoare triple {46229#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46230#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:55,006 INFO L273 TraceCheckUtils]: 78: Hoare triple {46230#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46230#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:55,007 INFO L273 TraceCheckUtils]: 79: Hoare triple {46230#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46230#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:55,007 INFO L273 TraceCheckUtils]: 80: Hoare triple {46230#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46231#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:55,008 INFO L273 TraceCheckUtils]: 81: Hoare triple {46231#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46231#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:55,008 INFO L273 TraceCheckUtils]: 82: Hoare triple {46231#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46231#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:55,009 INFO L273 TraceCheckUtils]: 83: Hoare triple {46231#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46232#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:55,010 INFO L273 TraceCheckUtils]: 84: Hoare triple {46232#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46232#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:55,010 INFO L273 TraceCheckUtils]: 85: Hoare triple {46232#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46232#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:55,011 INFO L273 TraceCheckUtils]: 86: Hoare triple {46232#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46233#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:55,011 INFO L273 TraceCheckUtils]: 87: Hoare triple {46233#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46233#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:55,012 INFO L273 TraceCheckUtils]: 88: Hoare triple {46233#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46233#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:55,013 INFO L273 TraceCheckUtils]: 89: Hoare triple {46233#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46234#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:55,013 INFO L273 TraceCheckUtils]: 90: Hoare triple {46234#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46234#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:55,014 INFO L273 TraceCheckUtils]: 91: Hoare triple {46234#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46234#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:55,014 INFO L273 TraceCheckUtils]: 92: Hoare triple {46234#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46235#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:55,015 INFO L273 TraceCheckUtils]: 93: Hoare triple {46235#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46235#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:55,015 INFO L273 TraceCheckUtils]: 94: Hoare triple {46235#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46235#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:55,016 INFO L273 TraceCheckUtils]: 95: Hoare triple {46235#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46236#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:55,017 INFO L273 TraceCheckUtils]: 96: Hoare triple {46236#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46236#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:55,017 INFO L273 TraceCheckUtils]: 97: Hoare triple {46236#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46236#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:55,018 INFO L273 TraceCheckUtils]: 98: Hoare triple {46236#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46237#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:55,018 INFO L273 TraceCheckUtils]: 99: Hoare triple {46237#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46237#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:55,019 INFO L273 TraceCheckUtils]: 100: Hoare triple {46237#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46237#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:55,020 INFO L273 TraceCheckUtils]: 101: Hoare triple {46237#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46238#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:55,020 INFO L273 TraceCheckUtils]: 102: Hoare triple {46238#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46238#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:55,021 INFO L273 TraceCheckUtils]: 103: Hoare triple {46238#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46238#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:55,021 INFO L273 TraceCheckUtils]: 104: Hoare triple {46238#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46239#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:55,022 INFO L273 TraceCheckUtils]: 105: Hoare triple {46239#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46239#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:55,022 INFO L273 TraceCheckUtils]: 106: Hoare triple {46239#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46239#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:55,023 INFO L273 TraceCheckUtils]: 107: Hoare triple {46239#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46240#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:55,024 INFO L273 TraceCheckUtils]: 108: Hoare triple {46240#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46240#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:55,024 INFO L273 TraceCheckUtils]: 109: Hoare triple {46240#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46240#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:55,025 INFO L273 TraceCheckUtils]: 110: Hoare triple {46240#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46241#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:55,025 INFO L273 TraceCheckUtils]: 111: Hoare triple {46241#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46241#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:55,026 INFO L273 TraceCheckUtils]: 112: Hoare triple {46241#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46241#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:55,026 INFO L273 TraceCheckUtils]: 113: Hoare triple {46241#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46242#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:55,027 INFO L273 TraceCheckUtils]: 114: Hoare triple {46242#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46242#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:55,028 INFO L273 TraceCheckUtils]: 115: Hoare triple {46242#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46242#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:55,028 INFO L273 TraceCheckUtils]: 116: Hoare triple {46242#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46243#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:55,029 INFO L273 TraceCheckUtils]: 117: Hoare triple {46243#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46243#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:55,029 INFO L273 TraceCheckUtils]: 118: Hoare triple {46243#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46243#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:55,030 INFO L273 TraceCheckUtils]: 119: Hoare triple {46243#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46244#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:55,030 INFO L273 TraceCheckUtils]: 120: Hoare triple {46244#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46244#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:55,031 INFO L273 TraceCheckUtils]: 121: Hoare triple {46244#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46244#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:55,032 INFO L273 TraceCheckUtils]: 122: Hoare triple {46244#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46245#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:55,032 INFO L273 TraceCheckUtils]: 123: Hoare triple {46245#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46245#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:55,033 INFO L273 TraceCheckUtils]: 124: Hoare triple {46245#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46245#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:55,033 INFO L273 TraceCheckUtils]: 125: Hoare triple {46245#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46246#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:55,034 INFO L273 TraceCheckUtils]: 126: Hoare triple {46246#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46246#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:55,034 INFO L273 TraceCheckUtils]: 127: Hoare triple {46246#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46246#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:55,035 INFO L273 TraceCheckUtils]: 128: Hoare triple {46246#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46247#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:55,036 INFO L273 TraceCheckUtils]: 129: Hoare triple {46247#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46247#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:55,036 INFO L273 TraceCheckUtils]: 130: Hoare triple {46247#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46247#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:55,037 INFO L273 TraceCheckUtils]: 131: Hoare triple {46247#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46248#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:55,037 INFO L273 TraceCheckUtils]: 132: Hoare triple {46248#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46248#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:55,038 INFO L273 TraceCheckUtils]: 133: Hoare triple {46248#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46248#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:55,039 INFO L273 TraceCheckUtils]: 134: Hoare triple {46248#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46249#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:55,039 INFO L273 TraceCheckUtils]: 135: Hoare triple {46249#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46249#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:55,040 INFO L273 TraceCheckUtils]: 136: Hoare triple {46249#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46249#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:55,040 INFO L273 TraceCheckUtils]: 137: Hoare triple {46249#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46250#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:55,041 INFO L273 TraceCheckUtils]: 138: Hoare triple {46250#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46250#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:55,041 INFO L273 TraceCheckUtils]: 139: Hoare triple {46250#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46250#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:55,042 INFO L273 TraceCheckUtils]: 140: Hoare triple {46250#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46251#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:55,043 INFO L273 TraceCheckUtils]: 141: Hoare triple {46251#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46251#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:55,043 INFO L273 TraceCheckUtils]: 142: Hoare triple {46251#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46251#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:55,044 INFO L273 TraceCheckUtils]: 143: Hoare triple {46251#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46252#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:55,044 INFO L273 TraceCheckUtils]: 144: Hoare triple {46252#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46252#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:55,045 INFO L273 TraceCheckUtils]: 145: Hoare triple {46252#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46252#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:55,045 INFO L273 TraceCheckUtils]: 146: Hoare triple {46252#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46253#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:55,046 INFO L273 TraceCheckUtils]: 147: Hoare triple {46253#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46253#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:55,046 INFO L273 TraceCheckUtils]: 148: Hoare triple {46253#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46253#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:55,047 INFO L273 TraceCheckUtils]: 149: Hoare triple {46253#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46254#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:55,048 INFO L273 TraceCheckUtils]: 150: Hoare triple {46254#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46254#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:55,048 INFO L273 TraceCheckUtils]: 151: Hoare triple {46254#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46254#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:55,049 INFO L273 TraceCheckUtils]: 152: Hoare triple {46254#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46255#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:55,049 INFO L273 TraceCheckUtils]: 153: Hoare triple {46255#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46255#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:55,050 INFO L273 TraceCheckUtils]: 154: Hoare triple {46255#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46255#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:55,051 INFO L273 TraceCheckUtils]: 155: Hoare triple {46255#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46256#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:55,051 INFO L273 TraceCheckUtils]: 156: Hoare triple {46256#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46256#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:55,052 INFO L273 TraceCheckUtils]: 157: Hoare triple {46256#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46256#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:55,052 INFO L273 TraceCheckUtils]: 158: Hoare triple {46256#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46257#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:55,053 INFO L273 TraceCheckUtils]: 159: Hoare triple {46257#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46257#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:55,053 INFO L273 TraceCheckUtils]: 160: Hoare triple {46257#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46257#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:55,054 INFO L273 TraceCheckUtils]: 161: Hoare triple {46257#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46258#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:55,055 INFO L273 TraceCheckUtils]: 162: Hoare triple {46258#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46258#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:55,055 INFO L273 TraceCheckUtils]: 163: Hoare triple {46258#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46258#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:55,056 INFO L273 TraceCheckUtils]: 164: Hoare triple {46258#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46259#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:55,056 INFO L273 TraceCheckUtils]: 165: Hoare triple {46259#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46259#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:55,057 INFO L273 TraceCheckUtils]: 166: Hoare triple {46259#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46259#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:55,058 INFO L273 TraceCheckUtils]: 167: Hoare triple {46259#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46260#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:55,058 INFO L273 TraceCheckUtils]: 168: Hoare triple {46260#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46260#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:55,059 INFO L273 TraceCheckUtils]: 169: Hoare triple {46260#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46260#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:55,059 INFO L273 TraceCheckUtils]: 170: Hoare triple {46260#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46261#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:55,060 INFO L273 TraceCheckUtils]: 171: Hoare triple {46261#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46261#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:55,060 INFO L273 TraceCheckUtils]: 172: Hoare triple {46261#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46261#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:55,061 INFO L273 TraceCheckUtils]: 173: Hoare triple {46261#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46262#(<= main_~i~0 57)} is VALID [2018-11-23 12:00:55,062 INFO L273 TraceCheckUtils]: 174: Hoare triple {46262#(<= main_~i~0 57)} assume !(~i~0 < 100000); {46205#false} is VALID [2018-11-23 12:00:55,062 INFO L273 TraceCheckUtils]: 175: Hoare triple {46205#false} havoc ~x~0;~x~0 := 0; {46205#false} is VALID [2018-11-23 12:00:55,062 INFO L273 TraceCheckUtils]: 176: Hoare triple {46205#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {46205#false} is VALID [2018-11-23 12:00:55,062 INFO L256 TraceCheckUtils]: 177: Hoare triple {46205#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {46205#false} is VALID [2018-11-23 12:00:55,062 INFO L273 TraceCheckUtils]: 178: Hoare triple {46205#false} ~cond := #in~cond; {46205#false} is VALID [2018-11-23 12:00:55,063 INFO L273 TraceCheckUtils]: 179: Hoare triple {46205#false} assume 0 == ~cond; {46205#false} is VALID [2018-11-23 12:00:55,063 INFO L273 TraceCheckUtils]: 180: Hoare triple {46205#false} assume !false; {46205#false} is VALID [2018-11-23 12:00:55,084 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 12:00:55,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:55,084 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 12:00:55,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:55,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:55,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:55,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:55,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {46204#true} call ULTIMATE.init(); {46204#true} is VALID [2018-11-23 12:00:55,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {46204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46204#true} is VALID [2018-11-23 12:00:55,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {46204#true} assume true; {46204#true} is VALID [2018-11-23 12:00:55,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46204#true} {46204#true} #54#return; {46204#true} is VALID [2018-11-23 12:00:55,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {46204#true} call #t~ret6 := main(); {46204#true} is VALID [2018-11-23 12:00:55,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {46204#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {46206#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:55,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {46206#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46206#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:55,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {46206#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46206#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:55,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {46206#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46207#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:55,868 INFO L273 TraceCheckUtils]: 9: Hoare triple {46207#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46207#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:55,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {46207#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46207#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:55,869 INFO L273 TraceCheckUtils]: 11: Hoare triple {46207#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46208#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:55,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {46208#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46208#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:55,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {46208#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46208#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:55,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {46208#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46209#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:55,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {46209#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46209#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:55,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {46209#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46209#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:55,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {46209#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46210#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:55,872 INFO L273 TraceCheckUtils]: 18: Hoare triple {46210#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46210#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:55,873 INFO L273 TraceCheckUtils]: 19: Hoare triple {46210#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46210#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:55,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {46210#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46211#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:55,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {46211#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46211#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:55,875 INFO L273 TraceCheckUtils]: 22: Hoare triple {46211#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46211#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:55,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {46211#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46212#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:55,876 INFO L273 TraceCheckUtils]: 24: Hoare triple {46212#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46212#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:55,876 INFO L273 TraceCheckUtils]: 25: Hoare triple {46212#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46212#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:55,877 INFO L273 TraceCheckUtils]: 26: Hoare triple {46212#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46213#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:55,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {46213#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46213#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:55,878 INFO L273 TraceCheckUtils]: 28: Hoare triple {46213#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46213#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:55,879 INFO L273 TraceCheckUtils]: 29: Hoare triple {46213#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46214#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:55,879 INFO L273 TraceCheckUtils]: 30: Hoare triple {46214#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46214#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:55,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {46214#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46214#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:55,881 INFO L273 TraceCheckUtils]: 32: Hoare triple {46214#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46215#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:55,881 INFO L273 TraceCheckUtils]: 33: Hoare triple {46215#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46215#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:55,882 INFO L273 TraceCheckUtils]: 34: Hoare triple {46215#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46215#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:55,882 INFO L273 TraceCheckUtils]: 35: Hoare triple {46215#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46216#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:55,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {46216#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46216#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:55,883 INFO L273 TraceCheckUtils]: 37: Hoare triple {46216#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46216#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:55,884 INFO L273 TraceCheckUtils]: 38: Hoare triple {46216#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46217#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:55,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {46217#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46217#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:55,885 INFO L273 TraceCheckUtils]: 40: Hoare triple {46217#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46217#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:55,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {46217#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46218#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:55,886 INFO L273 TraceCheckUtils]: 42: Hoare triple {46218#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46218#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:55,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {46218#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46218#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:55,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {46218#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46219#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:55,888 INFO L273 TraceCheckUtils]: 45: Hoare triple {46219#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46219#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:55,888 INFO L273 TraceCheckUtils]: 46: Hoare triple {46219#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46219#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:55,889 INFO L273 TraceCheckUtils]: 47: Hoare triple {46219#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46220#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:55,890 INFO L273 TraceCheckUtils]: 48: Hoare triple {46220#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46220#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:55,890 INFO L273 TraceCheckUtils]: 49: Hoare triple {46220#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46220#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:55,891 INFO L273 TraceCheckUtils]: 50: Hoare triple {46220#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46221#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:55,891 INFO L273 TraceCheckUtils]: 51: Hoare triple {46221#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46221#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:55,892 INFO L273 TraceCheckUtils]: 52: Hoare triple {46221#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46221#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:55,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {46221#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46222#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:55,893 INFO L273 TraceCheckUtils]: 54: Hoare triple {46222#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46222#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:55,894 INFO L273 TraceCheckUtils]: 55: Hoare triple {46222#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46222#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:55,894 INFO L273 TraceCheckUtils]: 56: Hoare triple {46222#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46223#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:55,895 INFO L273 TraceCheckUtils]: 57: Hoare triple {46223#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46223#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:55,895 INFO L273 TraceCheckUtils]: 58: Hoare triple {46223#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46223#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:55,896 INFO L273 TraceCheckUtils]: 59: Hoare triple {46223#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46224#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:55,897 INFO L273 TraceCheckUtils]: 60: Hoare triple {46224#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46224#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:55,897 INFO L273 TraceCheckUtils]: 61: Hoare triple {46224#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46224#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:55,898 INFO L273 TraceCheckUtils]: 62: Hoare triple {46224#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46225#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:55,898 INFO L273 TraceCheckUtils]: 63: Hoare triple {46225#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46225#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:55,899 INFO L273 TraceCheckUtils]: 64: Hoare triple {46225#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46225#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:55,899 INFO L273 TraceCheckUtils]: 65: Hoare triple {46225#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46226#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:55,900 INFO L273 TraceCheckUtils]: 66: Hoare triple {46226#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46226#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:55,900 INFO L273 TraceCheckUtils]: 67: Hoare triple {46226#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46226#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:55,901 INFO L273 TraceCheckUtils]: 68: Hoare triple {46226#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46227#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:55,902 INFO L273 TraceCheckUtils]: 69: Hoare triple {46227#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46227#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:55,902 INFO L273 TraceCheckUtils]: 70: Hoare triple {46227#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46227#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:55,903 INFO L273 TraceCheckUtils]: 71: Hoare triple {46227#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46228#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:55,903 INFO L273 TraceCheckUtils]: 72: Hoare triple {46228#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46228#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:55,904 INFO L273 TraceCheckUtils]: 73: Hoare triple {46228#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46228#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:55,905 INFO L273 TraceCheckUtils]: 74: Hoare triple {46228#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46229#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:55,905 INFO L273 TraceCheckUtils]: 75: Hoare triple {46229#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46229#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:55,906 INFO L273 TraceCheckUtils]: 76: Hoare triple {46229#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46229#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:55,906 INFO L273 TraceCheckUtils]: 77: Hoare triple {46229#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46230#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:55,907 INFO L273 TraceCheckUtils]: 78: Hoare triple {46230#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46230#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:55,907 INFO L273 TraceCheckUtils]: 79: Hoare triple {46230#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46230#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:55,908 INFO L273 TraceCheckUtils]: 80: Hoare triple {46230#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46231#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:55,909 INFO L273 TraceCheckUtils]: 81: Hoare triple {46231#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46231#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:55,909 INFO L273 TraceCheckUtils]: 82: Hoare triple {46231#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46231#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:55,910 INFO L273 TraceCheckUtils]: 83: Hoare triple {46231#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46232#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:55,910 INFO L273 TraceCheckUtils]: 84: Hoare triple {46232#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46232#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:55,911 INFO L273 TraceCheckUtils]: 85: Hoare triple {46232#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46232#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:55,911 INFO L273 TraceCheckUtils]: 86: Hoare triple {46232#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46233#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:55,912 INFO L273 TraceCheckUtils]: 87: Hoare triple {46233#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46233#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:55,912 INFO L273 TraceCheckUtils]: 88: Hoare triple {46233#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46233#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:55,913 INFO L273 TraceCheckUtils]: 89: Hoare triple {46233#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46234#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:55,914 INFO L273 TraceCheckUtils]: 90: Hoare triple {46234#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46234#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:55,914 INFO L273 TraceCheckUtils]: 91: Hoare triple {46234#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46234#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:55,915 INFO L273 TraceCheckUtils]: 92: Hoare triple {46234#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46235#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:55,915 INFO L273 TraceCheckUtils]: 93: Hoare triple {46235#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46235#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:55,916 INFO L273 TraceCheckUtils]: 94: Hoare triple {46235#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46235#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:55,917 INFO L273 TraceCheckUtils]: 95: Hoare triple {46235#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46236#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:55,917 INFO L273 TraceCheckUtils]: 96: Hoare triple {46236#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46236#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:55,918 INFO L273 TraceCheckUtils]: 97: Hoare triple {46236#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46236#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:55,918 INFO L273 TraceCheckUtils]: 98: Hoare triple {46236#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46237#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:55,919 INFO L273 TraceCheckUtils]: 99: Hoare triple {46237#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46237#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:55,919 INFO L273 TraceCheckUtils]: 100: Hoare triple {46237#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46237#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:55,920 INFO L273 TraceCheckUtils]: 101: Hoare triple {46237#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46238#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:55,921 INFO L273 TraceCheckUtils]: 102: Hoare triple {46238#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46238#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:55,921 INFO L273 TraceCheckUtils]: 103: Hoare triple {46238#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46238#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:55,922 INFO L273 TraceCheckUtils]: 104: Hoare triple {46238#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46239#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:55,922 INFO L273 TraceCheckUtils]: 105: Hoare triple {46239#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46239#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:55,923 INFO L273 TraceCheckUtils]: 106: Hoare triple {46239#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46239#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:55,924 INFO L273 TraceCheckUtils]: 107: Hoare triple {46239#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46240#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:55,924 INFO L273 TraceCheckUtils]: 108: Hoare triple {46240#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46240#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:55,925 INFO L273 TraceCheckUtils]: 109: Hoare triple {46240#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46240#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:55,925 INFO L273 TraceCheckUtils]: 110: Hoare triple {46240#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46241#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:55,926 INFO L273 TraceCheckUtils]: 111: Hoare triple {46241#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46241#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:55,926 INFO L273 TraceCheckUtils]: 112: Hoare triple {46241#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46241#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:55,927 INFO L273 TraceCheckUtils]: 113: Hoare triple {46241#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46242#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:55,927 INFO L273 TraceCheckUtils]: 114: Hoare triple {46242#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46242#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:55,928 INFO L273 TraceCheckUtils]: 115: Hoare triple {46242#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46242#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:55,929 INFO L273 TraceCheckUtils]: 116: Hoare triple {46242#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46243#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:55,929 INFO L273 TraceCheckUtils]: 117: Hoare triple {46243#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46243#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:55,930 INFO L273 TraceCheckUtils]: 118: Hoare triple {46243#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46243#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:55,930 INFO L273 TraceCheckUtils]: 119: Hoare triple {46243#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46244#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:55,931 INFO L273 TraceCheckUtils]: 120: Hoare triple {46244#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46244#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:55,931 INFO L273 TraceCheckUtils]: 121: Hoare triple {46244#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46244#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:55,932 INFO L273 TraceCheckUtils]: 122: Hoare triple {46244#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46245#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:55,933 INFO L273 TraceCheckUtils]: 123: Hoare triple {46245#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46245#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:55,933 INFO L273 TraceCheckUtils]: 124: Hoare triple {46245#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46245#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:55,934 INFO L273 TraceCheckUtils]: 125: Hoare triple {46245#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46246#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:55,934 INFO L273 TraceCheckUtils]: 126: Hoare triple {46246#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46246#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:55,935 INFO L273 TraceCheckUtils]: 127: Hoare triple {46246#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46246#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:55,936 INFO L273 TraceCheckUtils]: 128: Hoare triple {46246#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46247#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:55,936 INFO L273 TraceCheckUtils]: 129: Hoare triple {46247#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46247#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:55,937 INFO L273 TraceCheckUtils]: 130: Hoare triple {46247#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46247#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:55,937 INFO L273 TraceCheckUtils]: 131: Hoare triple {46247#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46248#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:55,938 INFO L273 TraceCheckUtils]: 132: Hoare triple {46248#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46248#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:55,938 INFO L273 TraceCheckUtils]: 133: Hoare triple {46248#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46248#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:55,939 INFO L273 TraceCheckUtils]: 134: Hoare triple {46248#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46249#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:55,939 INFO L273 TraceCheckUtils]: 135: Hoare triple {46249#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46249#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:55,940 INFO L273 TraceCheckUtils]: 136: Hoare triple {46249#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46249#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:55,941 INFO L273 TraceCheckUtils]: 137: Hoare triple {46249#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46250#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:55,941 INFO L273 TraceCheckUtils]: 138: Hoare triple {46250#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46250#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:55,942 INFO L273 TraceCheckUtils]: 139: Hoare triple {46250#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46250#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:55,942 INFO L273 TraceCheckUtils]: 140: Hoare triple {46250#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46251#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:55,943 INFO L273 TraceCheckUtils]: 141: Hoare triple {46251#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46251#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:55,943 INFO L273 TraceCheckUtils]: 142: Hoare triple {46251#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46251#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:55,944 INFO L273 TraceCheckUtils]: 143: Hoare triple {46251#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46252#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:55,945 INFO L273 TraceCheckUtils]: 144: Hoare triple {46252#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46252#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:55,945 INFO L273 TraceCheckUtils]: 145: Hoare triple {46252#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46252#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:55,946 INFO L273 TraceCheckUtils]: 146: Hoare triple {46252#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46253#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:55,946 INFO L273 TraceCheckUtils]: 147: Hoare triple {46253#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46253#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:55,947 INFO L273 TraceCheckUtils]: 148: Hoare triple {46253#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46253#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:55,948 INFO L273 TraceCheckUtils]: 149: Hoare triple {46253#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46254#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:55,948 INFO L273 TraceCheckUtils]: 150: Hoare triple {46254#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46254#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:55,949 INFO L273 TraceCheckUtils]: 151: Hoare triple {46254#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46254#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:55,949 INFO L273 TraceCheckUtils]: 152: Hoare triple {46254#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46255#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:55,950 INFO L273 TraceCheckUtils]: 153: Hoare triple {46255#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46255#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:55,950 INFO L273 TraceCheckUtils]: 154: Hoare triple {46255#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46255#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:55,951 INFO L273 TraceCheckUtils]: 155: Hoare triple {46255#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46256#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:55,951 INFO L273 TraceCheckUtils]: 156: Hoare triple {46256#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46256#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:55,952 INFO L273 TraceCheckUtils]: 157: Hoare triple {46256#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46256#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:55,953 INFO L273 TraceCheckUtils]: 158: Hoare triple {46256#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46257#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:55,953 INFO L273 TraceCheckUtils]: 159: Hoare triple {46257#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46257#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:55,954 INFO L273 TraceCheckUtils]: 160: Hoare triple {46257#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46257#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:55,954 INFO L273 TraceCheckUtils]: 161: Hoare triple {46257#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46258#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:55,955 INFO L273 TraceCheckUtils]: 162: Hoare triple {46258#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46258#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:55,955 INFO L273 TraceCheckUtils]: 163: Hoare triple {46258#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46258#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:55,956 INFO L273 TraceCheckUtils]: 164: Hoare triple {46258#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46259#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:55,957 INFO L273 TraceCheckUtils]: 165: Hoare triple {46259#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46259#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:55,957 INFO L273 TraceCheckUtils]: 166: Hoare triple {46259#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46259#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:55,958 INFO L273 TraceCheckUtils]: 167: Hoare triple {46259#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46260#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:55,958 INFO L273 TraceCheckUtils]: 168: Hoare triple {46260#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46260#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:55,959 INFO L273 TraceCheckUtils]: 169: Hoare triple {46260#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46260#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:55,960 INFO L273 TraceCheckUtils]: 170: Hoare triple {46260#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46261#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:55,960 INFO L273 TraceCheckUtils]: 171: Hoare triple {46261#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {46261#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:55,961 INFO L273 TraceCheckUtils]: 172: Hoare triple {46261#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {46261#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:55,961 INFO L273 TraceCheckUtils]: 173: Hoare triple {46261#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46262#(<= main_~i~0 57)} is VALID [2018-11-23 12:00:55,962 INFO L273 TraceCheckUtils]: 174: Hoare triple {46262#(<= main_~i~0 57)} assume !(~i~0 < 100000); {46205#false} is VALID [2018-11-23 12:00:55,962 INFO L273 TraceCheckUtils]: 175: Hoare triple {46205#false} havoc ~x~0;~x~0 := 0; {46205#false} is VALID [2018-11-23 12:00:55,962 INFO L273 TraceCheckUtils]: 176: Hoare triple {46205#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {46205#false} is VALID [2018-11-23 12:00:55,962 INFO L256 TraceCheckUtils]: 177: Hoare triple {46205#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {46205#false} is VALID [2018-11-23 12:00:55,963 INFO L273 TraceCheckUtils]: 178: Hoare triple {46205#false} ~cond := #in~cond; {46205#false} is VALID [2018-11-23 12:00:55,963 INFO L273 TraceCheckUtils]: 179: Hoare triple {46205#false} assume 0 == ~cond; {46205#false} is VALID [2018-11-23 12:00:55,963 INFO L273 TraceCheckUtils]: 180: Hoare triple {46205#false} assume !false; {46205#false} is VALID [2018-11-23 12:00:55,998 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 12:00:56,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:56,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-11-23 12:00:56,019 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 181 [2018-11-23 12:00:56,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:56,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2018-11-23 12:00:56,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:56,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-23 12:00:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-23 12:00:56,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 12:00:56,200 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 59 states. [2018-11-23 12:00:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:57,435 INFO L93 Difference]: Finished difference Result 202 states and 262 transitions. [2018-11-23 12:00:57,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-23 12:00:57,435 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 181 [2018-11-23 12:00:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:00:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 262 transitions. [2018-11-23 12:00:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:00:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 262 transitions. [2018-11-23 12:00:57,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 262 transitions. [2018-11-23 12:00:57,686 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 12:00:57,690 INFO L225 Difference]: With dead ends: 202 [2018-11-23 12:00:57,690 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 12:00:57,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 12:00:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 12:00:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-11-23 12:00:57,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:57,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 189 states. [2018-11-23 12:00:57,737 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 189 states. [2018-11-23 12:00:57,738 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 189 states. [2018-11-23 12:00:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:57,741 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2018-11-23 12:00:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2018-11-23 12:00:57,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:57,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:57,742 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 191 states. [2018-11-23 12:00:57,742 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 191 states. [2018-11-23 12:00:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:57,744 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2018-11-23 12:00:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2018-11-23 12:00:57,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:57,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:57,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:57,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-23 12:00:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2018-11-23 12:00:57,747 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 181 [2018-11-23 12:00:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:57,748 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2018-11-23 12:00:57,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-23 12:00:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2018-11-23 12:00:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:00:57,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:57,749 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:57,749 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:57,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1438496252, now seen corresponding path program 57 times [2018-11-23 12:00:57,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:57,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:57,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:59,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {47711#true} call ULTIMATE.init(); {47711#true} is VALID [2018-11-23 12:00:59,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {47711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47711#true} is VALID [2018-11-23 12:00:59,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {47711#true} assume true; {47711#true} is VALID [2018-11-23 12:00:59,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47711#true} {47711#true} #54#return; {47711#true} is VALID [2018-11-23 12:00:59,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {47711#true} call #t~ret6 := main(); {47711#true} is VALID [2018-11-23 12:00:59,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {47711#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {47713#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:59,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {47713#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47713#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:59,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {47713#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47713#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:59,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {47713#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47714#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:59,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {47714#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47714#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:59,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {47714#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47714#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:59,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {47714#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47715#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:59,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {47715#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47715#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:59,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {47715#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47715#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:59,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {47715#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47716#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:59,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {47716#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47716#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:59,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {47716#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47716#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:59,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {47716#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47717#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:59,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {47717#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47717#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:59,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {47717#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47717#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:59,283 INFO L273 TraceCheckUtils]: 20: Hoare triple {47717#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47718#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:59,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {47718#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47718#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:59,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {47718#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47718#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:59,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {47718#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47719#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:59,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {47719#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47719#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:59,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {47719#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47719#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:59,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {47719#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47720#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:59,287 INFO L273 TraceCheckUtils]: 27: Hoare triple {47720#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47720#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:59,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {47720#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47720#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:59,288 INFO L273 TraceCheckUtils]: 29: Hoare triple {47720#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47721#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:59,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {47721#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47721#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:59,289 INFO L273 TraceCheckUtils]: 31: Hoare triple {47721#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47721#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:59,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {47721#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47722#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:59,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {47722#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47722#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:59,291 INFO L273 TraceCheckUtils]: 34: Hoare triple {47722#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47722#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:59,292 INFO L273 TraceCheckUtils]: 35: Hoare triple {47722#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47723#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:59,292 INFO L273 TraceCheckUtils]: 36: Hoare triple {47723#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47723#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:59,293 INFO L273 TraceCheckUtils]: 37: Hoare triple {47723#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47723#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:59,293 INFO L273 TraceCheckUtils]: 38: Hoare triple {47723#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47724#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:59,294 INFO L273 TraceCheckUtils]: 39: Hoare triple {47724#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47724#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:59,294 INFO L273 TraceCheckUtils]: 40: Hoare triple {47724#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47724#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:59,295 INFO L273 TraceCheckUtils]: 41: Hoare triple {47724#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47725#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:59,296 INFO L273 TraceCheckUtils]: 42: Hoare triple {47725#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47725#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:59,296 INFO L273 TraceCheckUtils]: 43: Hoare triple {47725#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47725#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:59,297 INFO L273 TraceCheckUtils]: 44: Hoare triple {47725#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47726#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:59,297 INFO L273 TraceCheckUtils]: 45: Hoare triple {47726#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47726#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:59,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {47726#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47726#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:59,298 INFO L273 TraceCheckUtils]: 47: Hoare triple {47726#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47727#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:59,299 INFO L273 TraceCheckUtils]: 48: Hoare triple {47727#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47727#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:59,299 INFO L273 TraceCheckUtils]: 49: Hoare triple {47727#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47727#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:59,300 INFO L273 TraceCheckUtils]: 50: Hoare triple {47727#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47728#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:59,301 INFO L273 TraceCheckUtils]: 51: Hoare triple {47728#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47728#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:59,301 INFO L273 TraceCheckUtils]: 52: Hoare triple {47728#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47728#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:59,302 INFO L273 TraceCheckUtils]: 53: Hoare triple {47728#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47729#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:59,302 INFO L273 TraceCheckUtils]: 54: Hoare triple {47729#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47729#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:59,303 INFO L273 TraceCheckUtils]: 55: Hoare triple {47729#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47729#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:59,304 INFO L273 TraceCheckUtils]: 56: Hoare triple {47729#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47730#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:59,304 INFO L273 TraceCheckUtils]: 57: Hoare triple {47730#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47730#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:59,305 INFO L273 TraceCheckUtils]: 58: Hoare triple {47730#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47730#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:59,305 INFO L273 TraceCheckUtils]: 59: Hoare triple {47730#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47731#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:59,306 INFO L273 TraceCheckUtils]: 60: Hoare triple {47731#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47731#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:59,306 INFO L273 TraceCheckUtils]: 61: Hoare triple {47731#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47731#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:59,307 INFO L273 TraceCheckUtils]: 62: Hoare triple {47731#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47732#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:59,307 INFO L273 TraceCheckUtils]: 63: Hoare triple {47732#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47732#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:59,308 INFO L273 TraceCheckUtils]: 64: Hoare triple {47732#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47732#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:59,309 INFO L273 TraceCheckUtils]: 65: Hoare triple {47732#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47733#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:59,309 INFO L273 TraceCheckUtils]: 66: Hoare triple {47733#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47733#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:59,310 INFO L273 TraceCheckUtils]: 67: Hoare triple {47733#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47733#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:59,310 INFO L273 TraceCheckUtils]: 68: Hoare triple {47733#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47734#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:59,311 INFO L273 TraceCheckUtils]: 69: Hoare triple {47734#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47734#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:59,311 INFO L273 TraceCheckUtils]: 70: Hoare triple {47734#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47734#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:59,312 INFO L273 TraceCheckUtils]: 71: Hoare triple {47734#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47735#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:59,313 INFO L273 TraceCheckUtils]: 72: Hoare triple {47735#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47735#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:59,313 INFO L273 TraceCheckUtils]: 73: Hoare triple {47735#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47735#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:59,314 INFO L273 TraceCheckUtils]: 74: Hoare triple {47735#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47736#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:59,314 INFO L273 TraceCheckUtils]: 75: Hoare triple {47736#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47736#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:59,315 INFO L273 TraceCheckUtils]: 76: Hoare triple {47736#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47736#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:59,316 INFO L273 TraceCheckUtils]: 77: Hoare triple {47736#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47737#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:59,316 INFO L273 TraceCheckUtils]: 78: Hoare triple {47737#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47737#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:59,317 INFO L273 TraceCheckUtils]: 79: Hoare triple {47737#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47737#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:59,317 INFO L273 TraceCheckUtils]: 80: Hoare triple {47737#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47738#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:59,318 INFO L273 TraceCheckUtils]: 81: Hoare triple {47738#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47738#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:59,318 INFO L273 TraceCheckUtils]: 82: Hoare triple {47738#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47738#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:59,319 INFO L273 TraceCheckUtils]: 83: Hoare triple {47738#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47739#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:59,320 INFO L273 TraceCheckUtils]: 84: Hoare triple {47739#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47739#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:59,320 INFO L273 TraceCheckUtils]: 85: Hoare triple {47739#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47739#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:59,321 INFO L273 TraceCheckUtils]: 86: Hoare triple {47739#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47740#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:59,321 INFO L273 TraceCheckUtils]: 87: Hoare triple {47740#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47740#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:59,322 INFO L273 TraceCheckUtils]: 88: Hoare triple {47740#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47740#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:59,322 INFO L273 TraceCheckUtils]: 89: Hoare triple {47740#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47741#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:59,323 INFO L273 TraceCheckUtils]: 90: Hoare triple {47741#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47741#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:59,323 INFO L273 TraceCheckUtils]: 91: Hoare triple {47741#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47741#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:59,324 INFO L273 TraceCheckUtils]: 92: Hoare triple {47741#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47742#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:59,325 INFO L273 TraceCheckUtils]: 93: Hoare triple {47742#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47742#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:59,325 INFO L273 TraceCheckUtils]: 94: Hoare triple {47742#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47742#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:59,326 INFO L273 TraceCheckUtils]: 95: Hoare triple {47742#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47743#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:59,326 INFO L273 TraceCheckUtils]: 96: Hoare triple {47743#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47743#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:59,327 INFO L273 TraceCheckUtils]: 97: Hoare triple {47743#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47743#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:59,328 INFO L273 TraceCheckUtils]: 98: Hoare triple {47743#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47744#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:59,328 INFO L273 TraceCheckUtils]: 99: Hoare triple {47744#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47744#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:59,329 INFO L273 TraceCheckUtils]: 100: Hoare triple {47744#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47744#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:59,329 INFO L273 TraceCheckUtils]: 101: Hoare triple {47744#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47745#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:59,330 INFO L273 TraceCheckUtils]: 102: Hoare triple {47745#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47745#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:59,330 INFO L273 TraceCheckUtils]: 103: Hoare triple {47745#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47745#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:59,331 INFO L273 TraceCheckUtils]: 104: Hoare triple {47745#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47746#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:59,332 INFO L273 TraceCheckUtils]: 105: Hoare triple {47746#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47746#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:59,332 INFO L273 TraceCheckUtils]: 106: Hoare triple {47746#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47746#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:59,333 INFO L273 TraceCheckUtils]: 107: Hoare triple {47746#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47747#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:59,333 INFO L273 TraceCheckUtils]: 108: Hoare triple {47747#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47747#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:59,334 INFO L273 TraceCheckUtils]: 109: Hoare triple {47747#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47747#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:59,334 INFO L273 TraceCheckUtils]: 110: Hoare triple {47747#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47748#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:59,335 INFO L273 TraceCheckUtils]: 111: Hoare triple {47748#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47748#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:59,335 INFO L273 TraceCheckUtils]: 112: Hoare triple {47748#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47748#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:59,336 INFO L273 TraceCheckUtils]: 113: Hoare triple {47748#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47749#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:59,337 INFO L273 TraceCheckUtils]: 114: Hoare triple {47749#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47749#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:59,337 INFO L273 TraceCheckUtils]: 115: Hoare triple {47749#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47749#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:59,338 INFO L273 TraceCheckUtils]: 116: Hoare triple {47749#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47750#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:59,338 INFO L273 TraceCheckUtils]: 117: Hoare triple {47750#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47750#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:59,339 INFO L273 TraceCheckUtils]: 118: Hoare triple {47750#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47750#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:59,340 INFO L273 TraceCheckUtils]: 119: Hoare triple {47750#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47751#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:59,340 INFO L273 TraceCheckUtils]: 120: Hoare triple {47751#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47751#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:59,341 INFO L273 TraceCheckUtils]: 121: Hoare triple {47751#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47751#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:59,341 INFO L273 TraceCheckUtils]: 122: Hoare triple {47751#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47752#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:59,342 INFO L273 TraceCheckUtils]: 123: Hoare triple {47752#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47752#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:59,342 INFO L273 TraceCheckUtils]: 124: Hoare triple {47752#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47752#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:59,343 INFO L273 TraceCheckUtils]: 125: Hoare triple {47752#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47753#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:59,344 INFO L273 TraceCheckUtils]: 126: Hoare triple {47753#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47753#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:59,344 INFO L273 TraceCheckUtils]: 127: Hoare triple {47753#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47753#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:59,345 INFO L273 TraceCheckUtils]: 128: Hoare triple {47753#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47754#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:59,345 INFO L273 TraceCheckUtils]: 129: Hoare triple {47754#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47754#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:59,346 INFO L273 TraceCheckUtils]: 130: Hoare triple {47754#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47754#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:59,346 INFO L273 TraceCheckUtils]: 131: Hoare triple {47754#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47755#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:59,347 INFO L273 TraceCheckUtils]: 132: Hoare triple {47755#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47755#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:59,347 INFO L273 TraceCheckUtils]: 133: Hoare triple {47755#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47755#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:59,348 INFO L273 TraceCheckUtils]: 134: Hoare triple {47755#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47756#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:59,349 INFO L273 TraceCheckUtils]: 135: Hoare triple {47756#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47756#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:59,349 INFO L273 TraceCheckUtils]: 136: Hoare triple {47756#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47756#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:59,350 INFO L273 TraceCheckUtils]: 137: Hoare triple {47756#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47757#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:59,350 INFO L273 TraceCheckUtils]: 138: Hoare triple {47757#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47757#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:59,351 INFO L273 TraceCheckUtils]: 139: Hoare triple {47757#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47757#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:59,352 INFO L273 TraceCheckUtils]: 140: Hoare triple {47757#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47758#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:59,352 INFO L273 TraceCheckUtils]: 141: Hoare triple {47758#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47758#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:59,353 INFO L273 TraceCheckUtils]: 142: Hoare triple {47758#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47758#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:59,353 INFO L273 TraceCheckUtils]: 143: Hoare triple {47758#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47759#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:59,354 INFO L273 TraceCheckUtils]: 144: Hoare triple {47759#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47759#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:59,354 INFO L273 TraceCheckUtils]: 145: Hoare triple {47759#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47759#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:59,355 INFO L273 TraceCheckUtils]: 146: Hoare triple {47759#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47760#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:59,356 INFO L273 TraceCheckUtils]: 147: Hoare triple {47760#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47760#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:59,356 INFO L273 TraceCheckUtils]: 148: Hoare triple {47760#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47760#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:59,357 INFO L273 TraceCheckUtils]: 149: Hoare triple {47760#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47761#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:59,357 INFO L273 TraceCheckUtils]: 150: Hoare triple {47761#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47761#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:59,358 INFO L273 TraceCheckUtils]: 151: Hoare triple {47761#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47761#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:59,358 INFO L273 TraceCheckUtils]: 152: Hoare triple {47761#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47762#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:59,359 INFO L273 TraceCheckUtils]: 153: Hoare triple {47762#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47762#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:59,359 INFO L273 TraceCheckUtils]: 154: Hoare triple {47762#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47762#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:59,360 INFO L273 TraceCheckUtils]: 155: Hoare triple {47762#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47763#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:59,361 INFO L273 TraceCheckUtils]: 156: Hoare triple {47763#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47763#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:59,361 INFO L273 TraceCheckUtils]: 157: Hoare triple {47763#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47763#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:59,362 INFO L273 TraceCheckUtils]: 158: Hoare triple {47763#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47764#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:59,362 INFO L273 TraceCheckUtils]: 159: Hoare triple {47764#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47764#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:59,363 INFO L273 TraceCheckUtils]: 160: Hoare triple {47764#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47764#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:59,364 INFO L273 TraceCheckUtils]: 161: Hoare triple {47764#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47765#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:59,364 INFO L273 TraceCheckUtils]: 162: Hoare triple {47765#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47765#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:59,365 INFO L273 TraceCheckUtils]: 163: Hoare triple {47765#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47765#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:59,365 INFO L273 TraceCheckUtils]: 164: Hoare triple {47765#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47766#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:59,366 INFO L273 TraceCheckUtils]: 165: Hoare triple {47766#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47766#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:59,366 INFO L273 TraceCheckUtils]: 166: Hoare triple {47766#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47766#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:59,367 INFO L273 TraceCheckUtils]: 167: Hoare triple {47766#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47767#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:59,368 INFO L273 TraceCheckUtils]: 168: Hoare triple {47767#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47767#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:59,368 INFO L273 TraceCheckUtils]: 169: Hoare triple {47767#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47767#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:59,369 INFO L273 TraceCheckUtils]: 170: Hoare triple {47767#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47768#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:59,369 INFO L273 TraceCheckUtils]: 171: Hoare triple {47768#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47768#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:59,370 INFO L273 TraceCheckUtils]: 172: Hoare triple {47768#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47768#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:59,371 INFO L273 TraceCheckUtils]: 173: Hoare triple {47768#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47769#(<= main_~i~0 57)} is VALID [2018-11-23 12:00:59,371 INFO L273 TraceCheckUtils]: 174: Hoare triple {47769#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47769#(<= main_~i~0 57)} is VALID [2018-11-23 12:00:59,372 INFO L273 TraceCheckUtils]: 175: Hoare triple {47769#(<= main_~i~0 57)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47769#(<= main_~i~0 57)} is VALID [2018-11-23 12:00:59,372 INFO L273 TraceCheckUtils]: 176: Hoare triple {47769#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47770#(<= main_~i~0 58)} is VALID [2018-11-23 12:00:59,373 INFO L273 TraceCheckUtils]: 177: Hoare triple {47770#(<= main_~i~0 58)} assume !(~i~0 < 100000); {47712#false} is VALID [2018-11-23 12:00:59,373 INFO L273 TraceCheckUtils]: 178: Hoare triple {47712#false} havoc ~x~0;~x~0 := 0; {47712#false} is VALID [2018-11-23 12:00:59,373 INFO L273 TraceCheckUtils]: 179: Hoare triple {47712#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {47712#false} is VALID [2018-11-23 12:00:59,373 INFO L256 TraceCheckUtils]: 180: Hoare triple {47712#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {47712#false} is VALID [2018-11-23 12:00:59,374 INFO L273 TraceCheckUtils]: 181: Hoare triple {47712#false} ~cond := #in~cond; {47712#false} is VALID [2018-11-23 12:00:59,374 INFO L273 TraceCheckUtils]: 182: Hoare triple {47712#false} assume 0 == ~cond; {47712#false} is VALID [2018-11-23 12:00:59,374 INFO L273 TraceCheckUtils]: 183: Hoare triple {47712#false} assume !false; {47712#false} is VALID [2018-11-23 12:00:59,395 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 12:00:59,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:59,396 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 12:00:59,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:59,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-11-23 12:00:59,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:59,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:00,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {47711#true} call ULTIMATE.init(); {47711#true} is VALID [2018-11-23 12:01:00,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {47711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47711#true} is VALID [2018-11-23 12:01:00,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {47711#true} assume true; {47711#true} is VALID [2018-11-23 12:01:00,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47711#true} {47711#true} #54#return; {47711#true} is VALID [2018-11-23 12:01:00,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {47711#true} call #t~ret6 := main(); {47711#true} is VALID [2018-11-23 12:01:00,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {47711#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {47713#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:00,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {47713#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47713#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:00,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {47713#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47713#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:00,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {47713#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47714#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:00,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {47714#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47714#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:00,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {47714#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47714#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:00,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {47714#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47715#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:00,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {47715#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47715#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:00,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {47715#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47715#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:00,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {47715#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47716#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:00,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {47716#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47716#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:00,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {47716#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47716#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:00,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {47716#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47717#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:00,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {47717#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47717#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:00,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {47717#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47717#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:00,125 INFO L273 TraceCheckUtils]: 20: Hoare triple {47717#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47718#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:00,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {47718#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47718#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:00,126 INFO L273 TraceCheckUtils]: 22: Hoare triple {47718#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47718#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:00,127 INFO L273 TraceCheckUtils]: 23: Hoare triple {47718#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47719#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:00,127 INFO L273 TraceCheckUtils]: 24: Hoare triple {47719#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47719#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:00,128 INFO L273 TraceCheckUtils]: 25: Hoare triple {47719#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47719#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:00,128 INFO L273 TraceCheckUtils]: 26: Hoare triple {47719#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47720#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:00,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {47720#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47720#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:00,129 INFO L273 TraceCheckUtils]: 28: Hoare triple {47720#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47720#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:00,130 INFO L273 TraceCheckUtils]: 29: Hoare triple {47720#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47721#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:00,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {47721#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47721#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:00,131 INFO L273 TraceCheckUtils]: 31: Hoare triple {47721#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47721#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:00,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {47721#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47722#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:00,132 INFO L273 TraceCheckUtils]: 33: Hoare triple {47722#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47722#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:00,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {47722#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47722#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:00,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {47722#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47723#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:00,134 INFO L273 TraceCheckUtils]: 36: Hoare triple {47723#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47723#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:00,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {47723#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47723#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:00,135 INFO L273 TraceCheckUtils]: 38: Hoare triple {47723#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47724#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:00,136 INFO L273 TraceCheckUtils]: 39: Hoare triple {47724#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47724#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:00,136 INFO L273 TraceCheckUtils]: 40: Hoare triple {47724#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47724#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:00,137 INFO L273 TraceCheckUtils]: 41: Hoare triple {47724#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47725#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:00,137 INFO L273 TraceCheckUtils]: 42: Hoare triple {47725#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47725#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:00,138 INFO L273 TraceCheckUtils]: 43: Hoare triple {47725#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47725#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:00,139 INFO L273 TraceCheckUtils]: 44: Hoare triple {47725#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47726#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:00,139 INFO L273 TraceCheckUtils]: 45: Hoare triple {47726#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47726#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:00,140 INFO L273 TraceCheckUtils]: 46: Hoare triple {47726#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47726#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:00,140 INFO L273 TraceCheckUtils]: 47: Hoare triple {47726#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47727#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:00,141 INFO L273 TraceCheckUtils]: 48: Hoare triple {47727#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47727#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:00,141 INFO L273 TraceCheckUtils]: 49: Hoare triple {47727#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47727#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:00,142 INFO L273 TraceCheckUtils]: 50: Hoare triple {47727#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47728#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:00,143 INFO L273 TraceCheckUtils]: 51: Hoare triple {47728#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47728#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:00,143 INFO L273 TraceCheckUtils]: 52: Hoare triple {47728#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47728#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:00,144 INFO L273 TraceCheckUtils]: 53: Hoare triple {47728#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47729#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:00,144 INFO L273 TraceCheckUtils]: 54: Hoare triple {47729#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47729#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:00,145 INFO L273 TraceCheckUtils]: 55: Hoare triple {47729#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47729#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:00,146 INFO L273 TraceCheckUtils]: 56: Hoare triple {47729#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47730#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:00,146 INFO L273 TraceCheckUtils]: 57: Hoare triple {47730#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47730#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:00,147 INFO L273 TraceCheckUtils]: 58: Hoare triple {47730#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47730#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:00,147 INFO L273 TraceCheckUtils]: 59: Hoare triple {47730#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47731#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:00,148 INFO L273 TraceCheckUtils]: 60: Hoare triple {47731#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47731#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:00,148 INFO L273 TraceCheckUtils]: 61: Hoare triple {47731#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47731#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:00,149 INFO L273 TraceCheckUtils]: 62: Hoare triple {47731#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47732#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:00,150 INFO L273 TraceCheckUtils]: 63: Hoare triple {47732#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47732#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:00,150 INFO L273 TraceCheckUtils]: 64: Hoare triple {47732#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47732#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:00,151 INFO L273 TraceCheckUtils]: 65: Hoare triple {47732#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47733#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:00,151 INFO L273 TraceCheckUtils]: 66: Hoare triple {47733#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47733#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:00,152 INFO L273 TraceCheckUtils]: 67: Hoare triple {47733#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47733#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:00,153 INFO L273 TraceCheckUtils]: 68: Hoare triple {47733#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47734#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:00,153 INFO L273 TraceCheckUtils]: 69: Hoare triple {47734#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47734#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:00,154 INFO L273 TraceCheckUtils]: 70: Hoare triple {47734#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47734#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:00,154 INFO L273 TraceCheckUtils]: 71: Hoare triple {47734#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47735#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:00,155 INFO L273 TraceCheckUtils]: 72: Hoare triple {47735#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47735#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:00,155 INFO L273 TraceCheckUtils]: 73: Hoare triple {47735#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47735#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:00,156 INFO L273 TraceCheckUtils]: 74: Hoare triple {47735#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47736#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:00,157 INFO L273 TraceCheckUtils]: 75: Hoare triple {47736#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47736#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:00,157 INFO L273 TraceCheckUtils]: 76: Hoare triple {47736#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47736#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:00,158 INFO L273 TraceCheckUtils]: 77: Hoare triple {47736#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47737#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:00,158 INFO L273 TraceCheckUtils]: 78: Hoare triple {47737#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47737#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:00,159 INFO L273 TraceCheckUtils]: 79: Hoare triple {47737#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47737#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:00,160 INFO L273 TraceCheckUtils]: 80: Hoare triple {47737#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47738#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:00,160 INFO L273 TraceCheckUtils]: 81: Hoare triple {47738#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47738#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:00,161 INFO L273 TraceCheckUtils]: 82: Hoare triple {47738#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47738#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:00,162 INFO L273 TraceCheckUtils]: 83: Hoare triple {47738#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47739#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:00,162 INFO L273 TraceCheckUtils]: 84: Hoare triple {47739#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47739#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:00,163 INFO L273 TraceCheckUtils]: 85: Hoare triple {47739#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47739#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:00,163 INFO L273 TraceCheckUtils]: 86: Hoare triple {47739#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47740#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:00,164 INFO L273 TraceCheckUtils]: 87: Hoare triple {47740#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47740#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:00,164 INFO L273 TraceCheckUtils]: 88: Hoare triple {47740#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47740#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:00,165 INFO L273 TraceCheckUtils]: 89: Hoare triple {47740#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47741#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:00,165 INFO L273 TraceCheckUtils]: 90: Hoare triple {47741#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47741#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:00,166 INFO L273 TraceCheckUtils]: 91: Hoare triple {47741#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47741#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:00,167 INFO L273 TraceCheckUtils]: 92: Hoare triple {47741#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47742#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:00,167 INFO L273 TraceCheckUtils]: 93: Hoare triple {47742#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47742#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:00,168 INFO L273 TraceCheckUtils]: 94: Hoare triple {47742#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47742#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:00,168 INFO L273 TraceCheckUtils]: 95: Hoare triple {47742#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47743#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:00,169 INFO L273 TraceCheckUtils]: 96: Hoare triple {47743#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47743#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:00,169 INFO L273 TraceCheckUtils]: 97: Hoare triple {47743#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47743#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:00,170 INFO L273 TraceCheckUtils]: 98: Hoare triple {47743#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47744#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:00,171 INFO L273 TraceCheckUtils]: 99: Hoare triple {47744#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47744#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:00,171 INFO L273 TraceCheckUtils]: 100: Hoare triple {47744#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47744#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:00,172 INFO L273 TraceCheckUtils]: 101: Hoare triple {47744#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47745#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:00,172 INFO L273 TraceCheckUtils]: 102: Hoare triple {47745#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47745#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:00,173 INFO L273 TraceCheckUtils]: 103: Hoare triple {47745#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47745#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:00,174 INFO L273 TraceCheckUtils]: 104: Hoare triple {47745#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47746#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:00,174 INFO L273 TraceCheckUtils]: 105: Hoare triple {47746#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47746#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:00,175 INFO L273 TraceCheckUtils]: 106: Hoare triple {47746#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47746#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:00,175 INFO L273 TraceCheckUtils]: 107: Hoare triple {47746#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47747#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:00,176 INFO L273 TraceCheckUtils]: 108: Hoare triple {47747#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47747#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:00,176 INFO L273 TraceCheckUtils]: 109: Hoare triple {47747#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47747#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:00,177 INFO L273 TraceCheckUtils]: 110: Hoare triple {47747#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47748#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:00,178 INFO L273 TraceCheckUtils]: 111: Hoare triple {47748#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47748#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:00,178 INFO L273 TraceCheckUtils]: 112: Hoare triple {47748#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47748#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:00,179 INFO L273 TraceCheckUtils]: 113: Hoare triple {47748#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47749#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:00,179 INFO L273 TraceCheckUtils]: 114: Hoare triple {47749#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47749#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:00,180 INFO L273 TraceCheckUtils]: 115: Hoare triple {47749#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47749#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:00,181 INFO L273 TraceCheckUtils]: 116: Hoare triple {47749#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47750#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:00,181 INFO L273 TraceCheckUtils]: 117: Hoare triple {47750#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47750#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:00,182 INFO L273 TraceCheckUtils]: 118: Hoare triple {47750#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47750#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:00,182 INFO L273 TraceCheckUtils]: 119: Hoare triple {47750#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47751#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:00,183 INFO L273 TraceCheckUtils]: 120: Hoare triple {47751#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47751#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:00,183 INFO L273 TraceCheckUtils]: 121: Hoare triple {47751#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47751#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:00,184 INFO L273 TraceCheckUtils]: 122: Hoare triple {47751#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47752#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:00,185 INFO L273 TraceCheckUtils]: 123: Hoare triple {47752#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47752#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:00,185 INFO L273 TraceCheckUtils]: 124: Hoare triple {47752#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47752#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:00,186 INFO L273 TraceCheckUtils]: 125: Hoare triple {47752#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47753#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:00,186 INFO L273 TraceCheckUtils]: 126: Hoare triple {47753#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47753#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:00,187 INFO L273 TraceCheckUtils]: 127: Hoare triple {47753#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47753#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:00,187 INFO L273 TraceCheckUtils]: 128: Hoare triple {47753#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47754#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:00,188 INFO L273 TraceCheckUtils]: 129: Hoare triple {47754#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47754#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:00,188 INFO L273 TraceCheckUtils]: 130: Hoare triple {47754#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47754#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:00,189 INFO L273 TraceCheckUtils]: 131: Hoare triple {47754#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47755#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:00,190 INFO L273 TraceCheckUtils]: 132: Hoare triple {47755#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47755#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:00,190 INFO L273 TraceCheckUtils]: 133: Hoare triple {47755#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47755#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:00,191 INFO L273 TraceCheckUtils]: 134: Hoare triple {47755#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47756#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:00,191 INFO L273 TraceCheckUtils]: 135: Hoare triple {47756#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47756#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:00,192 INFO L273 TraceCheckUtils]: 136: Hoare triple {47756#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47756#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:00,193 INFO L273 TraceCheckUtils]: 137: Hoare triple {47756#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47757#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:00,193 INFO L273 TraceCheckUtils]: 138: Hoare triple {47757#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47757#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:00,194 INFO L273 TraceCheckUtils]: 139: Hoare triple {47757#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47757#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:00,194 INFO L273 TraceCheckUtils]: 140: Hoare triple {47757#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47758#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:00,195 INFO L273 TraceCheckUtils]: 141: Hoare triple {47758#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47758#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:00,195 INFO L273 TraceCheckUtils]: 142: Hoare triple {47758#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47758#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:00,196 INFO L273 TraceCheckUtils]: 143: Hoare triple {47758#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47759#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:00,197 INFO L273 TraceCheckUtils]: 144: Hoare triple {47759#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47759#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:00,197 INFO L273 TraceCheckUtils]: 145: Hoare triple {47759#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47759#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:00,198 INFO L273 TraceCheckUtils]: 146: Hoare triple {47759#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47760#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:00,198 INFO L273 TraceCheckUtils]: 147: Hoare triple {47760#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47760#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:00,199 INFO L273 TraceCheckUtils]: 148: Hoare triple {47760#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47760#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:00,200 INFO L273 TraceCheckUtils]: 149: Hoare triple {47760#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47761#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:00,200 INFO L273 TraceCheckUtils]: 150: Hoare triple {47761#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47761#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:00,201 INFO L273 TraceCheckUtils]: 151: Hoare triple {47761#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47761#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:00,201 INFO L273 TraceCheckUtils]: 152: Hoare triple {47761#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47762#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:00,202 INFO L273 TraceCheckUtils]: 153: Hoare triple {47762#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47762#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:00,202 INFO L273 TraceCheckUtils]: 154: Hoare triple {47762#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47762#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:00,203 INFO L273 TraceCheckUtils]: 155: Hoare triple {47762#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47763#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:00,204 INFO L273 TraceCheckUtils]: 156: Hoare triple {47763#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47763#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:00,204 INFO L273 TraceCheckUtils]: 157: Hoare triple {47763#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47763#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:00,205 INFO L273 TraceCheckUtils]: 158: Hoare triple {47763#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47764#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:00,205 INFO L273 TraceCheckUtils]: 159: Hoare triple {47764#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47764#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:00,206 INFO L273 TraceCheckUtils]: 160: Hoare triple {47764#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47764#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:00,206 INFO L273 TraceCheckUtils]: 161: Hoare triple {47764#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47765#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:00,207 INFO L273 TraceCheckUtils]: 162: Hoare triple {47765#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47765#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:00,208 INFO L273 TraceCheckUtils]: 163: Hoare triple {47765#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47765#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:00,208 INFO L273 TraceCheckUtils]: 164: Hoare triple {47765#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47766#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:00,209 INFO L273 TraceCheckUtils]: 165: Hoare triple {47766#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47766#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:00,209 INFO L273 TraceCheckUtils]: 166: Hoare triple {47766#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47766#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:00,210 INFO L273 TraceCheckUtils]: 167: Hoare triple {47766#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47767#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:00,210 INFO L273 TraceCheckUtils]: 168: Hoare triple {47767#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47767#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:00,211 INFO L273 TraceCheckUtils]: 169: Hoare triple {47767#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47767#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:00,212 INFO L273 TraceCheckUtils]: 170: Hoare triple {47767#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47768#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:00,212 INFO L273 TraceCheckUtils]: 171: Hoare triple {47768#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47768#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:00,213 INFO L273 TraceCheckUtils]: 172: Hoare triple {47768#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47768#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:00,213 INFO L273 TraceCheckUtils]: 173: Hoare triple {47768#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47769#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:00,214 INFO L273 TraceCheckUtils]: 174: Hoare triple {47769#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47769#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:00,214 INFO L273 TraceCheckUtils]: 175: Hoare triple {47769#(<= main_~i~0 57)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {47769#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:00,215 INFO L273 TraceCheckUtils]: 176: Hoare triple {47769#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47770#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:00,216 INFO L273 TraceCheckUtils]: 177: Hoare triple {47770#(<= main_~i~0 58)} assume !(~i~0 < 100000); {47712#false} is VALID [2018-11-23 12:01:00,216 INFO L273 TraceCheckUtils]: 178: Hoare triple {47712#false} havoc ~x~0;~x~0 := 0; {47712#false} is VALID [2018-11-23 12:01:00,216 INFO L273 TraceCheckUtils]: 179: Hoare triple {47712#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {47712#false} is VALID [2018-11-23 12:01:00,216 INFO L256 TraceCheckUtils]: 180: Hoare triple {47712#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {47712#false} is VALID [2018-11-23 12:01:00,217 INFO L273 TraceCheckUtils]: 181: Hoare triple {47712#false} ~cond := #in~cond; {47712#false} is VALID [2018-11-23 12:01:00,217 INFO L273 TraceCheckUtils]: 182: Hoare triple {47712#false} assume 0 == ~cond; {47712#false} is VALID [2018-11-23 12:01:00,217 INFO L273 TraceCheckUtils]: 183: Hoare triple {47712#false} assume !false; {47712#false} is VALID [2018-11-23 12:01:00,238 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 12:01:00,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:00,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-11-23 12:01:00,259 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 184 [2018-11-23 12:01:00,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:00,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2018-11-23 12:01:00,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:00,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-23 12:01:00,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-23 12:01:00,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 12:01:00,444 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand 60 states. [2018-11-23 12:01:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:01,494 INFO L93 Difference]: Finished difference Result 205 states and 266 transitions. [2018-11-23 12:01:01,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-23 12:01:01,494 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 184 [2018-11-23 12:01:01,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:01:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 266 transitions. [2018-11-23 12:01:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:01:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 266 transitions. [2018-11-23 12:01:01,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 266 transitions. [2018-11-23 12:01:01,785 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 12:01:01,789 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:01:01,789 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 12:01:01,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 12:01:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 12:01:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-11-23 12:01:01,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:01,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 192 states. [2018-11-23 12:01:01,839 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 192 states. [2018-11-23 12:01:01,840 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 192 states. [2018-11-23 12:01:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:01,844 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2018-11-23 12:01:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2018-11-23 12:01:01,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:01,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:01,844 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 194 states. [2018-11-23 12:01:01,844 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 194 states. [2018-11-23 12:01:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:01,847 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2018-11-23 12:01:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2018-11-23 12:01:01,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:01,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:01,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:01,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-23 12:01:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 251 transitions. [2018-11-23 12:01:01,850 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 251 transitions. Word has length 184 [2018-11-23 12:01:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:01,850 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 251 transitions. [2018-11-23 12:01:01,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-23 12:01:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 251 transitions. [2018-11-23 12:01:01,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-23 12:01:01,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:01,851 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:01,852 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:01,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:01,852 INFO L82 PathProgramCache]: Analyzing trace with hash -12799017, now seen corresponding path program 58 times [2018-11-23 12:01:01,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:01,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:01,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:01,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:01,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:03,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {49242#true} call ULTIMATE.init(); {49242#true} is VALID [2018-11-23 12:01:03,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {49242#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49242#true} is VALID [2018-11-23 12:01:03,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {49242#true} assume true; {49242#true} is VALID [2018-11-23 12:01:03,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49242#true} {49242#true} #54#return; {49242#true} is VALID [2018-11-23 12:01:03,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {49242#true} call #t~ret6 := main(); {49242#true} is VALID [2018-11-23 12:01:03,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {49242#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {49244#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:03,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {49244#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49244#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:03,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {49244#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49244#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:03,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {49244#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49245#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:03,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {49245#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49245#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:03,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {49245#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49245#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:03,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {49245#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49246#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:03,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {49246#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49246#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:03,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {49246#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49246#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:03,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {49246#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49247#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:03,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {49247#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49247#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:03,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {49247#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49247#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:03,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {49247#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49248#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:03,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {49248#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49248#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:03,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {49248#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49248#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:03,518 INFO L273 TraceCheckUtils]: 20: Hoare triple {49248#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49249#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:03,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {49249#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49249#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:03,519 INFO L273 TraceCheckUtils]: 22: Hoare triple {49249#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49249#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:03,519 INFO L273 TraceCheckUtils]: 23: Hoare triple {49249#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49250#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:03,520 INFO L273 TraceCheckUtils]: 24: Hoare triple {49250#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49250#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:03,520 INFO L273 TraceCheckUtils]: 25: Hoare triple {49250#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49250#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:03,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {49250#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49251#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:03,522 INFO L273 TraceCheckUtils]: 27: Hoare triple {49251#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49251#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:03,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {49251#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49251#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:03,523 INFO L273 TraceCheckUtils]: 29: Hoare triple {49251#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49252#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:03,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {49252#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49252#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:03,524 INFO L273 TraceCheckUtils]: 31: Hoare triple {49252#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49252#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:03,525 INFO L273 TraceCheckUtils]: 32: Hoare triple {49252#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49253#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:03,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {49253#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49253#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:03,526 INFO L273 TraceCheckUtils]: 34: Hoare triple {49253#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49253#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:03,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {49253#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49254#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:03,527 INFO L273 TraceCheckUtils]: 36: Hoare triple {49254#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49254#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:03,527 INFO L273 TraceCheckUtils]: 37: Hoare triple {49254#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49254#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:03,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {49254#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49255#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:03,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {49255#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49255#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:03,529 INFO L273 TraceCheckUtils]: 40: Hoare triple {49255#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49255#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:03,530 INFO L273 TraceCheckUtils]: 41: Hoare triple {49255#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49256#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:03,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {49256#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49256#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:03,531 INFO L273 TraceCheckUtils]: 43: Hoare triple {49256#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49256#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:03,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {49256#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49257#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:03,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {49257#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49257#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:03,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {49257#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49257#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:03,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {49257#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49258#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:03,534 INFO L273 TraceCheckUtils]: 48: Hoare triple {49258#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49258#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:03,534 INFO L273 TraceCheckUtils]: 49: Hoare triple {49258#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49258#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:03,535 INFO L273 TraceCheckUtils]: 50: Hoare triple {49258#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49259#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:03,535 INFO L273 TraceCheckUtils]: 51: Hoare triple {49259#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49259#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:03,536 INFO L273 TraceCheckUtils]: 52: Hoare triple {49259#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49259#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:03,537 INFO L273 TraceCheckUtils]: 53: Hoare triple {49259#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49260#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:03,537 INFO L273 TraceCheckUtils]: 54: Hoare triple {49260#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49260#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:03,538 INFO L273 TraceCheckUtils]: 55: Hoare triple {49260#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49260#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:03,538 INFO L273 TraceCheckUtils]: 56: Hoare triple {49260#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49261#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:03,539 INFO L273 TraceCheckUtils]: 57: Hoare triple {49261#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49261#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:03,539 INFO L273 TraceCheckUtils]: 58: Hoare triple {49261#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49261#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:03,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {49261#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49262#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:03,541 INFO L273 TraceCheckUtils]: 60: Hoare triple {49262#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49262#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:03,541 INFO L273 TraceCheckUtils]: 61: Hoare triple {49262#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49262#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:03,542 INFO L273 TraceCheckUtils]: 62: Hoare triple {49262#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49263#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:03,542 INFO L273 TraceCheckUtils]: 63: Hoare triple {49263#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49263#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:03,543 INFO L273 TraceCheckUtils]: 64: Hoare triple {49263#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49263#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:03,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {49263#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49264#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:03,544 INFO L273 TraceCheckUtils]: 66: Hoare triple {49264#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49264#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:03,545 INFO L273 TraceCheckUtils]: 67: Hoare triple {49264#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49264#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:03,545 INFO L273 TraceCheckUtils]: 68: Hoare triple {49264#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49265#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:03,546 INFO L273 TraceCheckUtils]: 69: Hoare triple {49265#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49265#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:03,546 INFO L273 TraceCheckUtils]: 70: Hoare triple {49265#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49265#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:03,547 INFO L273 TraceCheckUtils]: 71: Hoare triple {49265#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49266#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:03,547 INFO L273 TraceCheckUtils]: 72: Hoare triple {49266#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49266#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:03,548 INFO L273 TraceCheckUtils]: 73: Hoare triple {49266#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49266#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:03,549 INFO L273 TraceCheckUtils]: 74: Hoare triple {49266#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49267#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:03,549 INFO L273 TraceCheckUtils]: 75: Hoare triple {49267#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49267#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:03,550 INFO L273 TraceCheckUtils]: 76: Hoare triple {49267#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49267#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:03,550 INFO L273 TraceCheckUtils]: 77: Hoare triple {49267#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49268#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:03,551 INFO L273 TraceCheckUtils]: 78: Hoare triple {49268#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49268#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:03,551 INFO L273 TraceCheckUtils]: 79: Hoare triple {49268#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49268#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:03,552 INFO L273 TraceCheckUtils]: 80: Hoare triple {49268#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49269#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:03,553 INFO L273 TraceCheckUtils]: 81: Hoare triple {49269#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49269#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:03,553 INFO L273 TraceCheckUtils]: 82: Hoare triple {49269#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49269#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:03,554 INFO L273 TraceCheckUtils]: 83: Hoare triple {49269#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49270#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:03,554 INFO L273 TraceCheckUtils]: 84: Hoare triple {49270#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49270#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:03,555 INFO L273 TraceCheckUtils]: 85: Hoare triple {49270#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49270#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:03,556 INFO L273 TraceCheckUtils]: 86: Hoare triple {49270#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49271#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:03,556 INFO L273 TraceCheckUtils]: 87: Hoare triple {49271#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49271#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:03,557 INFO L273 TraceCheckUtils]: 88: Hoare triple {49271#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49271#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:03,557 INFO L273 TraceCheckUtils]: 89: Hoare triple {49271#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49272#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:03,558 INFO L273 TraceCheckUtils]: 90: Hoare triple {49272#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49272#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:03,558 INFO L273 TraceCheckUtils]: 91: Hoare triple {49272#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49272#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:03,559 INFO L273 TraceCheckUtils]: 92: Hoare triple {49272#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49273#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:03,560 INFO L273 TraceCheckUtils]: 93: Hoare triple {49273#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49273#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:03,560 INFO L273 TraceCheckUtils]: 94: Hoare triple {49273#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49273#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:03,561 INFO L273 TraceCheckUtils]: 95: Hoare triple {49273#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49274#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:03,561 INFO L273 TraceCheckUtils]: 96: Hoare triple {49274#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49274#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:03,562 INFO L273 TraceCheckUtils]: 97: Hoare triple {49274#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49274#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:03,563 INFO L273 TraceCheckUtils]: 98: Hoare triple {49274#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49275#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:03,563 INFO L273 TraceCheckUtils]: 99: Hoare triple {49275#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49275#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:03,564 INFO L273 TraceCheckUtils]: 100: Hoare triple {49275#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49275#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:03,564 INFO L273 TraceCheckUtils]: 101: Hoare triple {49275#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49276#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:03,565 INFO L273 TraceCheckUtils]: 102: Hoare triple {49276#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49276#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:03,565 INFO L273 TraceCheckUtils]: 103: Hoare triple {49276#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49276#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:03,566 INFO L273 TraceCheckUtils]: 104: Hoare triple {49276#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49277#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:03,566 INFO L273 TraceCheckUtils]: 105: Hoare triple {49277#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49277#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:03,567 INFO L273 TraceCheckUtils]: 106: Hoare triple {49277#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49277#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:03,568 INFO L273 TraceCheckUtils]: 107: Hoare triple {49277#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49278#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:03,568 INFO L273 TraceCheckUtils]: 108: Hoare triple {49278#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49278#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:03,569 INFO L273 TraceCheckUtils]: 109: Hoare triple {49278#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49278#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:03,569 INFO L273 TraceCheckUtils]: 110: Hoare triple {49278#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49279#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:03,570 INFO L273 TraceCheckUtils]: 111: Hoare triple {49279#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49279#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:03,570 INFO L273 TraceCheckUtils]: 112: Hoare triple {49279#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49279#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:03,571 INFO L273 TraceCheckUtils]: 113: Hoare triple {49279#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49280#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:03,572 INFO L273 TraceCheckUtils]: 114: Hoare triple {49280#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49280#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:03,572 INFO L273 TraceCheckUtils]: 115: Hoare triple {49280#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49280#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:03,573 INFO L273 TraceCheckUtils]: 116: Hoare triple {49280#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49281#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:03,573 INFO L273 TraceCheckUtils]: 117: Hoare triple {49281#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49281#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:03,574 INFO L273 TraceCheckUtils]: 118: Hoare triple {49281#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49281#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:03,575 INFO L273 TraceCheckUtils]: 119: Hoare triple {49281#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49282#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:03,575 INFO L273 TraceCheckUtils]: 120: Hoare triple {49282#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49282#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:03,576 INFO L273 TraceCheckUtils]: 121: Hoare triple {49282#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49282#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:03,576 INFO L273 TraceCheckUtils]: 122: Hoare triple {49282#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49283#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:03,577 INFO L273 TraceCheckUtils]: 123: Hoare triple {49283#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49283#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:03,577 INFO L273 TraceCheckUtils]: 124: Hoare triple {49283#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49283#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:03,578 INFO L273 TraceCheckUtils]: 125: Hoare triple {49283#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49284#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:03,579 INFO L273 TraceCheckUtils]: 126: Hoare triple {49284#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49284#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:03,579 INFO L273 TraceCheckUtils]: 127: Hoare triple {49284#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49284#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:03,580 INFO L273 TraceCheckUtils]: 128: Hoare triple {49284#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49285#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:03,580 INFO L273 TraceCheckUtils]: 129: Hoare triple {49285#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49285#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:03,581 INFO L273 TraceCheckUtils]: 130: Hoare triple {49285#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49285#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:03,582 INFO L273 TraceCheckUtils]: 131: Hoare triple {49285#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49286#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:03,582 INFO L273 TraceCheckUtils]: 132: Hoare triple {49286#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49286#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:03,583 INFO L273 TraceCheckUtils]: 133: Hoare triple {49286#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49286#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:03,583 INFO L273 TraceCheckUtils]: 134: Hoare triple {49286#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49287#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:03,584 INFO L273 TraceCheckUtils]: 135: Hoare triple {49287#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49287#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:03,584 INFO L273 TraceCheckUtils]: 136: Hoare triple {49287#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49287#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:03,585 INFO L273 TraceCheckUtils]: 137: Hoare triple {49287#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49288#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:03,585 INFO L273 TraceCheckUtils]: 138: Hoare triple {49288#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49288#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:03,586 INFO L273 TraceCheckUtils]: 139: Hoare triple {49288#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49288#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:03,587 INFO L273 TraceCheckUtils]: 140: Hoare triple {49288#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49289#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:03,588 INFO L273 TraceCheckUtils]: 141: Hoare triple {49289#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49289#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:03,588 INFO L273 TraceCheckUtils]: 142: Hoare triple {49289#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49289#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:03,589 INFO L273 TraceCheckUtils]: 143: Hoare triple {49289#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49290#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:03,589 INFO L273 TraceCheckUtils]: 144: Hoare triple {49290#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49290#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:03,590 INFO L273 TraceCheckUtils]: 145: Hoare triple {49290#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49290#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:03,591 INFO L273 TraceCheckUtils]: 146: Hoare triple {49290#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49291#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:03,591 INFO L273 TraceCheckUtils]: 147: Hoare triple {49291#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49291#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:03,592 INFO L273 TraceCheckUtils]: 148: Hoare triple {49291#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49291#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:03,592 INFO L273 TraceCheckUtils]: 149: Hoare triple {49291#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49292#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:03,593 INFO L273 TraceCheckUtils]: 150: Hoare triple {49292#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49292#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:03,593 INFO L273 TraceCheckUtils]: 151: Hoare triple {49292#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49292#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:03,594 INFO L273 TraceCheckUtils]: 152: Hoare triple {49292#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49293#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:03,595 INFO L273 TraceCheckUtils]: 153: Hoare triple {49293#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49293#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:03,595 INFO L273 TraceCheckUtils]: 154: Hoare triple {49293#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49293#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:03,596 INFO L273 TraceCheckUtils]: 155: Hoare triple {49293#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49294#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:03,596 INFO L273 TraceCheckUtils]: 156: Hoare triple {49294#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49294#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:03,597 INFO L273 TraceCheckUtils]: 157: Hoare triple {49294#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49294#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:03,598 INFO L273 TraceCheckUtils]: 158: Hoare triple {49294#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49295#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:03,598 INFO L273 TraceCheckUtils]: 159: Hoare triple {49295#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49295#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:03,599 INFO L273 TraceCheckUtils]: 160: Hoare triple {49295#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49295#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:03,599 INFO L273 TraceCheckUtils]: 161: Hoare triple {49295#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49296#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:03,600 INFO L273 TraceCheckUtils]: 162: Hoare triple {49296#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49296#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:03,600 INFO L273 TraceCheckUtils]: 163: Hoare triple {49296#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49296#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:03,601 INFO L273 TraceCheckUtils]: 164: Hoare triple {49296#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49297#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:03,602 INFO L273 TraceCheckUtils]: 165: Hoare triple {49297#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49297#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:03,602 INFO L273 TraceCheckUtils]: 166: Hoare triple {49297#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49297#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:03,603 INFO L273 TraceCheckUtils]: 167: Hoare triple {49297#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49298#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:03,603 INFO L273 TraceCheckUtils]: 168: Hoare triple {49298#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49298#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:03,604 INFO L273 TraceCheckUtils]: 169: Hoare triple {49298#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49298#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:03,604 INFO L273 TraceCheckUtils]: 170: Hoare triple {49298#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49299#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:03,605 INFO L273 TraceCheckUtils]: 171: Hoare triple {49299#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49299#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:03,605 INFO L273 TraceCheckUtils]: 172: Hoare triple {49299#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49299#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:03,606 INFO L273 TraceCheckUtils]: 173: Hoare triple {49299#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49300#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:03,607 INFO L273 TraceCheckUtils]: 174: Hoare triple {49300#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49300#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:03,607 INFO L273 TraceCheckUtils]: 175: Hoare triple {49300#(<= main_~i~0 57)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49300#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:03,608 INFO L273 TraceCheckUtils]: 176: Hoare triple {49300#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49301#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:03,608 INFO L273 TraceCheckUtils]: 177: Hoare triple {49301#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49301#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:03,609 INFO L273 TraceCheckUtils]: 178: Hoare triple {49301#(<= main_~i~0 58)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49301#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:03,610 INFO L273 TraceCheckUtils]: 179: Hoare triple {49301#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49302#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:03,610 INFO L273 TraceCheckUtils]: 180: Hoare triple {49302#(<= main_~i~0 59)} assume !(~i~0 < 100000); {49243#false} is VALID [2018-11-23 12:01:03,610 INFO L273 TraceCheckUtils]: 181: Hoare triple {49243#false} havoc ~x~0;~x~0 := 0; {49243#false} is VALID [2018-11-23 12:01:03,611 INFO L273 TraceCheckUtils]: 182: Hoare triple {49243#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {49243#false} is VALID [2018-11-23 12:01:03,611 INFO L256 TraceCheckUtils]: 183: Hoare triple {49243#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {49243#false} is VALID [2018-11-23 12:01:03,611 INFO L273 TraceCheckUtils]: 184: Hoare triple {49243#false} ~cond := #in~cond; {49243#false} is VALID [2018-11-23 12:01:03,611 INFO L273 TraceCheckUtils]: 185: Hoare triple {49243#false} assume 0 == ~cond; {49243#false} is VALID [2018-11-23 12:01:03,611 INFO L273 TraceCheckUtils]: 186: Hoare triple {49243#false} assume !false; {49243#false} is VALID [2018-11-23 12:01:03,632 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 12:01:03,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:03,633 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 12:01:03,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:01:03,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:01:03,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:03,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:04,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {49242#true} call ULTIMATE.init(); {49242#true} is VALID [2018-11-23 12:01:04,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {49242#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49242#true} is VALID [2018-11-23 12:01:04,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {49242#true} assume true; {49242#true} is VALID [2018-11-23 12:01:04,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49242#true} {49242#true} #54#return; {49242#true} is VALID [2018-11-23 12:01:04,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {49242#true} call #t~ret6 := main(); {49242#true} is VALID [2018-11-23 12:01:04,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {49242#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {49244#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:04,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {49244#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49244#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:04,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {49244#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49244#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:04,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {49244#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49245#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:04,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {49245#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49245#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:04,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {49245#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49245#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:04,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {49245#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49246#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:04,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {49246#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49246#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:04,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {49246#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49246#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:04,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {49246#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49247#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:04,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {49247#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49247#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:04,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {49247#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49247#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:04,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {49247#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49248#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:04,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {49248#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49248#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:04,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {49248#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49248#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:04,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {49248#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49249#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:04,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {49249#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49249#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:04,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {49249#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49249#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:04,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {49249#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49250#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:04,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {49250#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49250#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:04,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {49250#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49250#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:04,179 INFO L273 TraceCheckUtils]: 26: Hoare triple {49250#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49251#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:04,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {49251#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49251#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:04,180 INFO L273 TraceCheckUtils]: 28: Hoare triple {49251#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49251#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:04,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {49251#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49252#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:04,182 INFO L273 TraceCheckUtils]: 30: Hoare triple {49252#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49252#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:04,182 INFO L273 TraceCheckUtils]: 31: Hoare triple {49252#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49252#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:04,183 INFO L273 TraceCheckUtils]: 32: Hoare triple {49252#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49253#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:04,183 INFO L273 TraceCheckUtils]: 33: Hoare triple {49253#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49253#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:04,184 INFO L273 TraceCheckUtils]: 34: Hoare triple {49253#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49253#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:04,184 INFO L273 TraceCheckUtils]: 35: Hoare triple {49253#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49254#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:04,185 INFO L273 TraceCheckUtils]: 36: Hoare triple {49254#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49254#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:04,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {49254#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49254#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:04,186 INFO L273 TraceCheckUtils]: 38: Hoare triple {49254#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49255#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:04,187 INFO L273 TraceCheckUtils]: 39: Hoare triple {49255#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49255#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:04,187 INFO L273 TraceCheckUtils]: 40: Hoare triple {49255#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49255#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:04,188 INFO L273 TraceCheckUtils]: 41: Hoare triple {49255#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49256#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:04,189 INFO L273 TraceCheckUtils]: 42: Hoare triple {49256#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49256#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:04,189 INFO L273 TraceCheckUtils]: 43: Hoare triple {49256#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49256#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:04,190 INFO L273 TraceCheckUtils]: 44: Hoare triple {49256#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49257#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:04,190 INFO L273 TraceCheckUtils]: 45: Hoare triple {49257#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49257#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:04,191 INFO L273 TraceCheckUtils]: 46: Hoare triple {49257#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49257#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:04,191 INFO L273 TraceCheckUtils]: 47: Hoare triple {49257#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49258#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:04,192 INFO L273 TraceCheckUtils]: 48: Hoare triple {49258#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49258#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:04,192 INFO L273 TraceCheckUtils]: 49: Hoare triple {49258#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49258#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:04,193 INFO L273 TraceCheckUtils]: 50: Hoare triple {49258#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49259#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:04,194 INFO L273 TraceCheckUtils]: 51: Hoare triple {49259#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49259#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:04,194 INFO L273 TraceCheckUtils]: 52: Hoare triple {49259#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49259#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:04,195 INFO L273 TraceCheckUtils]: 53: Hoare triple {49259#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49260#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:04,195 INFO L273 TraceCheckUtils]: 54: Hoare triple {49260#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49260#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:04,196 INFO L273 TraceCheckUtils]: 55: Hoare triple {49260#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49260#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:04,197 INFO L273 TraceCheckUtils]: 56: Hoare triple {49260#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49261#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:04,197 INFO L273 TraceCheckUtils]: 57: Hoare triple {49261#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49261#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:04,198 INFO L273 TraceCheckUtils]: 58: Hoare triple {49261#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49261#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:04,198 INFO L273 TraceCheckUtils]: 59: Hoare triple {49261#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49262#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:04,199 INFO L273 TraceCheckUtils]: 60: Hoare triple {49262#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49262#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:04,199 INFO L273 TraceCheckUtils]: 61: Hoare triple {49262#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49262#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:04,200 INFO L273 TraceCheckUtils]: 62: Hoare triple {49262#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49263#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:04,201 INFO L273 TraceCheckUtils]: 63: Hoare triple {49263#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49263#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:04,201 INFO L273 TraceCheckUtils]: 64: Hoare triple {49263#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49263#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:04,202 INFO L273 TraceCheckUtils]: 65: Hoare triple {49263#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49264#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:04,202 INFO L273 TraceCheckUtils]: 66: Hoare triple {49264#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49264#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:04,203 INFO L273 TraceCheckUtils]: 67: Hoare triple {49264#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49264#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:04,204 INFO L273 TraceCheckUtils]: 68: Hoare triple {49264#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49265#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:04,204 INFO L273 TraceCheckUtils]: 69: Hoare triple {49265#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49265#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:04,205 INFO L273 TraceCheckUtils]: 70: Hoare triple {49265#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49265#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:04,205 INFO L273 TraceCheckUtils]: 71: Hoare triple {49265#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49266#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:04,206 INFO L273 TraceCheckUtils]: 72: Hoare triple {49266#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49266#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:04,206 INFO L273 TraceCheckUtils]: 73: Hoare triple {49266#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49266#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:04,207 INFO L273 TraceCheckUtils]: 74: Hoare triple {49266#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49267#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:04,208 INFO L273 TraceCheckUtils]: 75: Hoare triple {49267#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49267#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:04,208 INFO L273 TraceCheckUtils]: 76: Hoare triple {49267#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49267#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:04,209 INFO L273 TraceCheckUtils]: 77: Hoare triple {49267#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49268#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:04,209 INFO L273 TraceCheckUtils]: 78: Hoare triple {49268#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49268#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:04,210 INFO L273 TraceCheckUtils]: 79: Hoare triple {49268#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49268#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:04,210 INFO L273 TraceCheckUtils]: 80: Hoare triple {49268#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49269#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:04,211 INFO L273 TraceCheckUtils]: 81: Hoare triple {49269#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49269#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:04,211 INFO L273 TraceCheckUtils]: 82: Hoare triple {49269#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49269#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:04,212 INFO L273 TraceCheckUtils]: 83: Hoare triple {49269#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49270#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:04,213 INFO L273 TraceCheckUtils]: 84: Hoare triple {49270#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49270#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:04,213 INFO L273 TraceCheckUtils]: 85: Hoare triple {49270#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49270#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:04,214 INFO L273 TraceCheckUtils]: 86: Hoare triple {49270#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49271#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:04,214 INFO L273 TraceCheckUtils]: 87: Hoare triple {49271#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49271#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:04,215 INFO L273 TraceCheckUtils]: 88: Hoare triple {49271#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49271#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:04,216 INFO L273 TraceCheckUtils]: 89: Hoare triple {49271#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49272#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:04,216 INFO L273 TraceCheckUtils]: 90: Hoare triple {49272#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49272#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:04,217 INFO L273 TraceCheckUtils]: 91: Hoare triple {49272#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49272#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:04,217 INFO L273 TraceCheckUtils]: 92: Hoare triple {49272#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49273#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:04,218 INFO L273 TraceCheckUtils]: 93: Hoare triple {49273#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49273#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:04,218 INFO L273 TraceCheckUtils]: 94: Hoare triple {49273#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49273#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:04,219 INFO L273 TraceCheckUtils]: 95: Hoare triple {49273#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49274#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:04,220 INFO L273 TraceCheckUtils]: 96: Hoare triple {49274#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49274#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:04,220 INFO L273 TraceCheckUtils]: 97: Hoare triple {49274#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49274#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:04,221 INFO L273 TraceCheckUtils]: 98: Hoare triple {49274#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49275#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:04,221 INFO L273 TraceCheckUtils]: 99: Hoare triple {49275#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49275#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:04,222 INFO L273 TraceCheckUtils]: 100: Hoare triple {49275#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49275#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:04,223 INFO L273 TraceCheckUtils]: 101: Hoare triple {49275#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49276#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:04,223 INFO L273 TraceCheckUtils]: 102: Hoare triple {49276#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49276#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:04,224 INFO L273 TraceCheckUtils]: 103: Hoare triple {49276#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49276#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:04,224 INFO L273 TraceCheckUtils]: 104: Hoare triple {49276#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49277#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:04,225 INFO L273 TraceCheckUtils]: 105: Hoare triple {49277#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49277#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:04,225 INFO L273 TraceCheckUtils]: 106: Hoare triple {49277#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49277#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:04,226 INFO L273 TraceCheckUtils]: 107: Hoare triple {49277#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49278#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:04,226 INFO L273 TraceCheckUtils]: 108: Hoare triple {49278#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49278#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:04,227 INFO L273 TraceCheckUtils]: 109: Hoare triple {49278#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49278#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:04,228 INFO L273 TraceCheckUtils]: 110: Hoare triple {49278#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49279#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:04,228 INFO L273 TraceCheckUtils]: 111: Hoare triple {49279#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49279#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:04,229 INFO L273 TraceCheckUtils]: 112: Hoare triple {49279#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49279#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:04,229 INFO L273 TraceCheckUtils]: 113: Hoare triple {49279#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49280#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:04,230 INFO L273 TraceCheckUtils]: 114: Hoare triple {49280#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49280#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:04,230 INFO L273 TraceCheckUtils]: 115: Hoare triple {49280#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49280#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:04,231 INFO L273 TraceCheckUtils]: 116: Hoare triple {49280#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49281#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:04,232 INFO L273 TraceCheckUtils]: 117: Hoare triple {49281#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49281#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:04,232 INFO L273 TraceCheckUtils]: 118: Hoare triple {49281#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49281#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:04,233 INFO L273 TraceCheckUtils]: 119: Hoare triple {49281#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49282#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:04,233 INFO L273 TraceCheckUtils]: 120: Hoare triple {49282#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49282#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:04,234 INFO L273 TraceCheckUtils]: 121: Hoare triple {49282#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49282#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:04,235 INFO L273 TraceCheckUtils]: 122: Hoare triple {49282#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49283#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:04,235 INFO L273 TraceCheckUtils]: 123: Hoare triple {49283#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49283#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:04,236 INFO L273 TraceCheckUtils]: 124: Hoare triple {49283#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49283#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:04,236 INFO L273 TraceCheckUtils]: 125: Hoare triple {49283#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49284#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:04,237 INFO L273 TraceCheckUtils]: 126: Hoare triple {49284#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49284#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:04,237 INFO L273 TraceCheckUtils]: 127: Hoare triple {49284#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49284#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:04,238 INFO L273 TraceCheckUtils]: 128: Hoare triple {49284#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49285#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:04,239 INFO L273 TraceCheckUtils]: 129: Hoare triple {49285#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49285#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:04,239 INFO L273 TraceCheckUtils]: 130: Hoare triple {49285#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49285#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:04,240 INFO L273 TraceCheckUtils]: 131: Hoare triple {49285#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49286#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:04,240 INFO L273 TraceCheckUtils]: 132: Hoare triple {49286#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49286#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:04,241 INFO L273 TraceCheckUtils]: 133: Hoare triple {49286#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49286#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:04,242 INFO L273 TraceCheckUtils]: 134: Hoare triple {49286#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49287#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:04,242 INFO L273 TraceCheckUtils]: 135: Hoare triple {49287#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49287#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:04,243 INFO L273 TraceCheckUtils]: 136: Hoare triple {49287#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49287#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:04,243 INFO L273 TraceCheckUtils]: 137: Hoare triple {49287#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49288#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:04,244 INFO L273 TraceCheckUtils]: 138: Hoare triple {49288#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49288#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:04,244 INFO L273 TraceCheckUtils]: 139: Hoare triple {49288#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49288#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:04,245 INFO L273 TraceCheckUtils]: 140: Hoare triple {49288#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49289#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:04,246 INFO L273 TraceCheckUtils]: 141: Hoare triple {49289#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49289#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:04,246 INFO L273 TraceCheckUtils]: 142: Hoare triple {49289#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49289#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:04,247 INFO L273 TraceCheckUtils]: 143: Hoare triple {49289#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49290#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:04,247 INFO L273 TraceCheckUtils]: 144: Hoare triple {49290#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49290#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:04,248 INFO L273 TraceCheckUtils]: 145: Hoare triple {49290#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49290#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:04,248 INFO L273 TraceCheckUtils]: 146: Hoare triple {49290#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49291#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:04,249 INFO L273 TraceCheckUtils]: 147: Hoare triple {49291#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49291#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:04,249 INFO L273 TraceCheckUtils]: 148: Hoare triple {49291#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49291#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:04,250 INFO L273 TraceCheckUtils]: 149: Hoare triple {49291#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49292#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:04,251 INFO L273 TraceCheckUtils]: 150: Hoare triple {49292#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49292#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:04,251 INFO L273 TraceCheckUtils]: 151: Hoare triple {49292#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49292#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:04,252 INFO L273 TraceCheckUtils]: 152: Hoare triple {49292#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49293#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:04,252 INFO L273 TraceCheckUtils]: 153: Hoare triple {49293#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49293#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:04,253 INFO L273 TraceCheckUtils]: 154: Hoare triple {49293#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49293#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:04,254 INFO L273 TraceCheckUtils]: 155: Hoare triple {49293#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49294#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:04,254 INFO L273 TraceCheckUtils]: 156: Hoare triple {49294#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49294#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:04,255 INFO L273 TraceCheckUtils]: 157: Hoare triple {49294#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49294#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:04,255 INFO L273 TraceCheckUtils]: 158: Hoare triple {49294#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49295#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:04,256 INFO L273 TraceCheckUtils]: 159: Hoare triple {49295#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49295#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:04,256 INFO L273 TraceCheckUtils]: 160: Hoare triple {49295#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49295#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:04,257 INFO L273 TraceCheckUtils]: 161: Hoare triple {49295#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49296#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:04,258 INFO L273 TraceCheckUtils]: 162: Hoare triple {49296#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49296#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:04,258 INFO L273 TraceCheckUtils]: 163: Hoare triple {49296#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49296#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:04,259 INFO L273 TraceCheckUtils]: 164: Hoare triple {49296#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49297#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:04,259 INFO L273 TraceCheckUtils]: 165: Hoare triple {49297#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49297#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:04,260 INFO L273 TraceCheckUtils]: 166: Hoare triple {49297#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49297#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:04,261 INFO L273 TraceCheckUtils]: 167: Hoare triple {49297#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49298#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:04,261 INFO L273 TraceCheckUtils]: 168: Hoare triple {49298#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49298#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:04,262 INFO L273 TraceCheckUtils]: 169: Hoare triple {49298#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49298#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:04,262 INFO L273 TraceCheckUtils]: 170: Hoare triple {49298#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49299#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:04,263 INFO L273 TraceCheckUtils]: 171: Hoare triple {49299#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49299#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:04,263 INFO L273 TraceCheckUtils]: 172: Hoare triple {49299#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49299#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:04,264 INFO L273 TraceCheckUtils]: 173: Hoare triple {49299#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49300#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:04,265 INFO L273 TraceCheckUtils]: 174: Hoare triple {49300#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49300#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:04,265 INFO L273 TraceCheckUtils]: 175: Hoare triple {49300#(<= main_~i~0 57)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49300#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:04,266 INFO L273 TraceCheckUtils]: 176: Hoare triple {49300#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49301#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:04,266 INFO L273 TraceCheckUtils]: 177: Hoare triple {49301#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {49301#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:04,267 INFO L273 TraceCheckUtils]: 178: Hoare triple {49301#(<= main_~i~0 58)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {49301#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:04,268 INFO L273 TraceCheckUtils]: 179: Hoare triple {49301#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49302#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:04,268 INFO L273 TraceCheckUtils]: 180: Hoare triple {49302#(<= main_~i~0 59)} assume !(~i~0 < 100000); {49243#false} is VALID [2018-11-23 12:01:04,268 INFO L273 TraceCheckUtils]: 181: Hoare triple {49243#false} havoc ~x~0;~x~0 := 0; {49243#false} is VALID [2018-11-23 12:01:04,269 INFO L273 TraceCheckUtils]: 182: Hoare triple {49243#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {49243#false} is VALID [2018-11-23 12:01:04,269 INFO L256 TraceCheckUtils]: 183: Hoare triple {49243#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {49243#false} is VALID [2018-11-23 12:01:04,269 INFO L273 TraceCheckUtils]: 184: Hoare triple {49243#false} ~cond := #in~cond; {49243#false} is VALID [2018-11-23 12:01:04,269 INFO L273 TraceCheckUtils]: 185: Hoare triple {49243#false} assume 0 == ~cond; {49243#false} is VALID [2018-11-23 12:01:04,269 INFO L273 TraceCheckUtils]: 186: Hoare triple {49243#false} assume !false; {49243#false} is VALID [2018-11-23 12:01:04,291 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 12:01:04,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:04,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-11-23 12:01:04,311 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 187 [2018-11-23 12:01:04,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:04,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states. [2018-11-23 12:01:04,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:04,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-23 12:01:04,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-23 12:01:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 12:01:04,501 INFO L87 Difference]: Start difference. First operand 192 states and 251 transitions. Second operand 61 states. [2018-11-23 12:01:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:05,469 INFO L93 Difference]: Finished difference Result 208 states and 270 transitions. [2018-11-23 12:01:05,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-23 12:01:05,469 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 187 [2018-11-23 12:01:05,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:01:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 270 transitions. [2018-11-23 12:01:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:01:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 270 transitions. [2018-11-23 12:01:05,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 270 transitions. [2018-11-23 12:01:05,767 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 12:01:05,770 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:01:05,770 INFO L226 Difference]: Without dead ends: 197 [2018-11-23 12:01:05,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 12:01:05,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-23 12:01:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-11-23 12:01:06,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:06,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 195 states. [2018-11-23 12:01:06,002 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 195 states. [2018-11-23 12:01:06,002 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 195 states. [2018-11-23 12:01:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:06,006 INFO L93 Difference]: Finished difference Result 197 states and 258 transitions. [2018-11-23 12:01:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2018-11-23 12:01:06,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:06,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:06,006 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 197 states. [2018-11-23 12:01:06,006 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 197 states. [2018-11-23 12:01:06,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:06,009 INFO L93 Difference]: Finished difference Result 197 states and 258 transitions. [2018-11-23 12:01:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2018-11-23 12:01:06,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:06,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:06,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:06,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-23 12:01:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2018-11-23 12:01:06,012 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 187 [2018-11-23 12:01:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:06,013 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2018-11-23 12:01:06,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-23 12:01:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2018-11-23 12:01:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 12:01:06,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:06,013 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:06,014 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:06,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:06,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1938724, now seen corresponding path program 59 times [2018-11-23 12:01:06,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:06,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:06,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:07,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {50797#true} call ULTIMATE.init(); {50797#true} is VALID [2018-11-23 12:01:07,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {50797#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50797#true} is VALID [2018-11-23 12:01:07,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {50797#true} assume true; {50797#true} is VALID [2018-11-23 12:01:07,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50797#true} {50797#true} #54#return; {50797#true} is VALID [2018-11-23 12:01:07,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {50797#true} call #t~ret6 := main(); {50797#true} is VALID [2018-11-23 12:01:07,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {50797#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {50799#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:07,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {50799#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50799#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:07,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {50799#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50799#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:07,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {50799#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50800#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:07,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {50800#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50800#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:07,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {50800#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50800#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:07,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {50800#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50801#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:07,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {50801#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50801#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:07,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {50801#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50801#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:07,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {50801#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50802#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:07,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {50802#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50802#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:07,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {50802#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50802#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:07,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {50802#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50803#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:07,727 INFO L273 TraceCheckUtils]: 18: Hoare triple {50803#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50803#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:07,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {50803#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50803#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:07,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {50803#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50804#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:07,729 INFO L273 TraceCheckUtils]: 21: Hoare triple {50804#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50804#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:07,729 INFO L273 TraceCheckUtils]: 22: Hoare triple {50804#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50804#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:07,730 INFO L273 TraceCheckUtils]: 23: Hoare triple {50804#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50805#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:07,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {50805#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50805#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:07,731 INFO L273 TraceCheckUtils]: 25: Hoare triple {50805#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50805#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:07,732 INFO L273 TraceCheckUtils]: 26: Hoare triple {50805#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50806#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:07,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {50806#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50806#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:07,733 INFO L273 TraceCheckUtils]: 28: Hoare triple {50806#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50806#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:07,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {50806#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50807#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:07,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {50807#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50807#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:07,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {50807#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50807#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:07,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {50807#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50808#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:07,736 INFO L273 TraceCheckUtils]: 33: Hoare triple {50808#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50808#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:07,736 INFO L273 TraceCheckUtils]: 34: Hoare triple {50808#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50808#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:07,737 INFO L273 TraceCheckUtils]: 35: Hoare triple {50808#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50809#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:07,737 INFO L273 TraceCheckUtils]: 36: Hoare triple {50809#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50809#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:07,738 INFO L273 TraceCheckUtils]: 37: Hoare triple {50809#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50809#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:07,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {50809#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50810#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:07,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {50810#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50810#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:07,740 INFO L273 TraceCheckUtils]: 40: Hoare triple {50810#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50810#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:07,740 INFO L273 TraceCheckUtils]: 41: Hoare triple {50810#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50811#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:07,741 INFO L273 TraceCheckUtils]: 42: Hoare triple {50811#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50811#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:07,741 INFO L273 TraceCheckUtils]: 43: Hoare triple {50811#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50811#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:07,742 INFO L273 TraceCheckUtils]: 44: Hoare triple {50811#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50812#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:07,743 INFO L273 TraceCheckUtils]: 45: Hoare triple {50812#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50812#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:07,743 INFO L273 TraceCheckUtils]: 46: Hoare triple {50812#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50812#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:07,744 INFO L273 TraceCheckUtils]: 47: Hoare triple {50812#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50813#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:07,744 INFO L273 TraceCheckUtils]: 48: Hoare triple {50813#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50813#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:07,745 INFO L273 TraceCheckUtils]: 49: Hoare triple {50813#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50813#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:07,746 INFO L273 TraceCheckUtils]: 50: Hoare triple {50813#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50814#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:07,746 INFO L273 TraceCheckUtils]: 51: Hoare triple {50814#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50814#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:07,747 INFO L273 TraceCheckUtils]: 52: Hoare triple {50814#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50814#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:07,747 INFO L273 TraceCheckUtils]: 53: Hoare triple {50814#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50815#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:07,748 INFO L273 TraceCheckUtils]: 54: Hoare triple {50815#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50815#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:07,748 INFO L273 TraceCheckUtils]: 55: Hoare triple {50815#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50815#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:07,749 INFO L273 TraceCheckUtils]: 56: Hoare triple {50815#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50816#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:07,750 INFO L273 TraceCheckUtils]: 57: Hoare triple {50816#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50816#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:07,750 INFO L273 TraceCheckUtils]: 58: Hoare triple {50816#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50816#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:07,751 INFO L273 TraceCheckUtils]: 59: Hoare triple {50816#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50817#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:07,751 INFO L273 TraceCheckUtils]: 60: Hoare triple {50817#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50817#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:07,752 INFO L273 TraceCheckUtils]: 61: Hoare triple {50817#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50817#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:07,752 INFO L273 TraceCheckUtils]: 62: Hoare triple {50817#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50818#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:07,753 INFO L273 TraceCheckUtils]: 63: Hoare triple {50818#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50818#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:07,753 INFO L273 TraceCheckUtils]: 64: Hoare triple {50818#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50818#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:07,754 INFO L273 TraceCheckUtils]: 65: Hoare triple {50818#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50819#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:07,755 INFO L273 TraceCheckUtils]: 66: Hoare triple {50819#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50819#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:07,755 INFO L273 TraceCheckUtils]: 67: Hoare triple {50819#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50819#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:07,756 INFO L273 TraceCheckUtils]: 68: Hoare triple {50819#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50820#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:07,756 INFO L273 TraceCheckUtils]: 69: Hoare triple {50820#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50820#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:07,757 INFO L273 TraceCheckUtils]: 70: Hoare triple {50820#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50820#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:07,758 INFO L273 TraceCheckUtils]: 71: Hoare triple {50820#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50821#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:07,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {50821#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50821#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:07,759 INFO L273 TraceCheckUtils]: 73: Hoare triple {50821#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50821#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:07,759 INFO L273 TraceCheckUtils]: 74: Hoare triple {50821#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50822#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:07,760 INFO L273 TraceCheckUtils]: 75: Hoare triple {50822#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50822#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:07,760 INFO L273 TraceCheckUtils]: 76: Hoare triple {50822#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50822#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:07,761 INFO L273 TraceCheckUtils]: 77: Hoare triple {50822#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50823#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:07,762 INFO L273 TraceCheckUtils]: 78: Hoare triple {50823#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50823#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:07,762 INFO L273 TraceCheckUtils]: 79: Hoare triple {50823#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50823#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:07,763 INFO L273 TraceCheckUtils]: 80: Hoare triple {50823#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50824#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:07,763 INFO L273 TraceCheckUtils]: 81: Hoare triple {50824#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50824#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:07,764 INFO L273 TraceCheckUtils]: 82: Hoare triple {50824#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50824#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:07,764 INFO L273 TraceCheckUtils]: 83: Hoare triple {50824#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50825#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:07,765 INFO L273 TraceCheckUtils]: 84: Hoare triple {50825#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50825#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:07,765 INFO L273 TraceCheckUtils]: 85: Hoare triple {50825#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50825#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:07,766 INFO L273 TraceCheckUtils]: 86: Hoare triple {50825#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50826#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:07,767 INFO L273 TraceCheckUtils]: 87: Hoare triple {50826#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50826#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:07,767 INFO L273 TraceCheckUtils]: 88: Hoare triple {50826#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50826#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:07,768 INFO L273 TraceCheckUtils]: 89: Hoare triple {50826#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50827#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:07,768 INFO L273 TraceCheckUtils]: 90: Hoare triple {50827#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50827#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:07,769 INFO L273 TraceCheckUtils]: 91: Hoare triple {50827#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50827#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:07,770 INFO L273 TraceCheckUtils]: 92: Hoare triple {50827#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50828#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:07,770 INFO L273 TraceCheckUtils]: 93: Hoare triple {50828#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50828#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:07,771 INFO L273 TraceCheckUtils]: 94: Hoare triple {50828#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50828#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:07,771 INFO L273 TraceCheckUtils]: 95: Hoare triple {50828#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50829#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:07,772 INFO L273 TraceCheckUtils]: 96: Hoare triple {50829#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50829#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:07,772 INFO L273 TraceCheckUtils]: 97: Hoare triple {50829#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50829#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:07,773 INFO L273 TraceCheckUtils]: 98: Hoare triple {50829#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50830#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:07,774 INFO L273 TraceCheckUtils]: 99: Hoare triple {50830#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50830#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:07,774 INFO L273 TraceCheckUtils]: 100: Hoare triple {50830#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50830#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:07,775 INFO L273 TraceCheckUtils]: 101: Hoare triple {50830#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50831#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:07,775 INFO L273 TraceCheckUtils]: 102: Hoare triple {50831#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50831#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:07,776 INFO L273 TraceCheckUtils]: 103: Hoare triple {50831#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50831#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:07,777 INFO L273 TraceCheckUtils]: 104: Hoare triple {50831#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50832#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:07,777 INFO L273 TraceCheckUtils]: 105: Hoare triple {50832#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50832#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:07,778 INFO L273 TraceCheckUtils]: 106: Hoare triple {50832#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50832#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:07,778 INFO L273 TraceCheckUtils]: 107: Hoare triple {50832#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50833#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:07,779 INFO L273 TraceCheckUtils]: 108: Hoare triple {50833#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50833#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:07,779 INFO L273 TraceCheckUtils]: 109: Hoare triple {50833#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50833#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:07,780 INFO L273 TraceCheckUtils]: 110: Hoare triple {50833#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50834#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:07,781 INFO L273 TraceCheckUtils]: 111: Hoare triple {50834#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50834#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:07,781 INFO L273 TraceCheckUtils]: 112: Hoare triple {50834#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50834#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:07,782 INFO L273 TraceCheckUtils]: 113: Hoare triple {50834#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50835#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:07,782 INFO L273 TraceCheckUtils]: 114: Hoare triple {50835#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50835#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:07,783 INFO L273 TraceCheckUtils]: 115: Hoare triple {50835#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50835#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:07,784 INFO L273 TraceCheckUtils]: 116: Hoare triple {50835#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50836#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:07,784 INFO L273 TraceCheckUtils]: 117: Hoare triple {50836#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50836#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:07,785 INFO L273 TraceCheckUtils]: 118: Hoare triple {50836#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50836#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:07,785 INFO L273 TraceCheckUtils]: 119: Hoare triple {50836#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50837#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:07,786 INFO L273 TraceCheckUtils]: 120: Hoare triple {50837#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50837#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:07,786 INFO L273 TraceCheckUtils]: 121: Hoare triple {50837#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50837#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:07,787 INFO L273 TraceCheckUtils]: 122: Hoare triple {50837#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50838#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:07,787 INFO L273 TraceCheckUtils]: 123: Hoare triple {50838#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50838#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:07,788 INFO L273 TraceCheckUtils]: 124: Hoare triple {50838#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50838#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:07,789 INFO L273 TraceCheckUtils]: 125: Hoare triple {50838#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50839#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:07,789 INFO L273 TraceCheckUtils]: 126: Hoare triple {50839#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50839#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:07,790 INFO L273 TraceCheckUtils]: 127: Hoare triple {50839#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50839#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:07,790 INFO L273 TraceCheckUtils]: 128: Hoare triple {50839#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50840#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:07,791 INFO L273 TraceCheckUtils]: 129: Hoare triple {50840#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50840#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:07,791 INFO L273 TraceCheckUtils]: 130: Hoare triple {50840#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50840#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:07,792 INFO L273 TraceCheckUtils]: 131: Hoare triple {50840#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50841#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:07,793 INFO L273 TraceCheckUtils]: 132: Hoare triple {50841#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50841#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:07,793 INFO L273 TraceCheckUtils]: 133: Hoare triple {50841#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50841#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:07,794 INFO L273 TraceCheckUtils]: 134: Hoare triple {50841#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50842#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:07,794 INFO L273 TraceCheckUtils]: 135: Hoare triple {50842#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50842#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:07,795 INFO L273 TraceCheckUtils]: 136: Hoare triple {50842#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50842#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:07,796 INFO L273 TraceCheckUtils]: 137: Hoare triple {50842#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50843#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:07,796 INFO L273 TraceCheckUtils]: 138: Hoare triple {50843#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50843#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:07,797 INFO L273 TraceCheckUtils]: 139: Hoare triple {50843#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50843#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:07,797 INFO L273 TraceCheckUtils]: 140: Hoare triple {50843#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:07,798 INFO L273 TraceCheckUtils]: 141: Hoare triple {50844#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50844#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:07,798 INFO L273 TraceCheckUtils]: 142: Hoare triple {50844#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50844#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:07,799 INFO L273 TraceCheckUtils]: 143: Hoare triple {50844#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50845#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:07,799 INFO L273 TraceCheckUtils]: 144: Hoare triple {50845#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50845#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:07,800 INFO L273 TraceCheckUtils]: 145: Hoare triple {50845#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50845#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:07,801 INFO L273 TraceCheckUtils]: 146: Hoare triple {50845#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50846#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:07,801 INFO L273 TraceCheckUtils]: 147: Hoare triple {50846#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50846#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:07,802 INFO L273 TraceCheckUtils]: 148: Hoare triple {50846#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50846#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:07,802 INFO L273 TraceCheckUtils]: 149: Hoare triple {50846#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50847#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:07,803 INFO L273 TraceCheckUtils]: 150: Hoare triple {50847#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50847#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:07,803 INFO L273 TraceCheckUtils]: 151: Hoare triple {50847#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50847#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:07,804 INFO L273 TraceCheckUtils]: 152: Hoare triple {50847#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50848#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:07,805 INFO L273 TraceCheckUtils]: 153: Hoare triple {50848#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50848#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:07,805 INFO L273 TraceCheckUtils]: 154: Hoare triple {50848#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50848#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:07,806 INFO L273 TraceCheckUtils]: 155: Hoare triple {50848#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50849#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:07,806 INFO L273 TraceCheckUtils]: 156: Hoare triple {50849#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50849#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:07,807 INFO L273 TraceCheckUtils]: 157: Hoare triple {50849#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50849#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:07,808 INFO L273 TraceCheckUtils]: 158: Hoare triple {50849#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50850#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:07,808 INFO L273 TraceCheckUtils]: 159: Hoare triple {50850#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50850#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:07,809 INFO L273 TraceCheckUtils]: 160: Hoare triple {50850#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50850#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:07,809 INFO L273 TraceCheckUtils]: 161: Hoare triple {50850#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:07,810 INFO L273 TraceCheckUtils]: 162: Hoare triple {50851#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50851#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:07,810 INFO L273 TraceCheckUtils]: 163: Hoare triple {50851#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50851#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:07,811 INFO L273 TraceCheckUtils]: 164: Hoare triple {50851#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50852#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:07,812 INFO L273 TraceCheckUtils]: 165: Hoare triple {50852#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50852#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:07,812 INFO L273 TraceCheckUtils]: 166: Hoare triple {50852#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50852#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:07,813 INFO L273 TraceCheckUtils]: 167: Hoare triple {50852#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50853#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:07,813 INFO L273 TraceCheckUtils]: 168: Hoare triple {50853#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50853#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:07,814 INFO L273 TraceCheckUtils]: 169: Hoare triple {50853#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50853#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:07,815 INFO L273 TraceCheckUtils]: 170: Hoare triple {50853#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50854#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:07,815 INFO L273 TraceCheckUtils]: 171: Hoare triple {50854#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50854#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:07,816 INFO L273 TraceCheckUtils]: 172: Hoare triple {50854#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50854#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:07,816 INFO L273 TraceCheckUtils]: 173: Hoare triple {50854#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50855#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:07,817 INFO L273 TraceCheckUtils]: 174: Hoare triple {50855#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50855#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:07,817 INFO L273 TraceCheckUtils]: 175: Hoare triple {50855#(<= main_~i~0 57)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50855#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:07,818 INFO L273 TraceCheckUtils]: 176: Hoare triple {50855#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50856#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:07,819 INFO L273 TraceCheckUtils]: 177: Hoare triple {50856#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50856#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:07,819 INFO L273 TraceCheckUtils]: 178: Hoare triple {50856#(<= main_~i~0 58)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50856#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:07,820 INFO L273 TraceCheckUtils]: 179: Hoare triple {50856#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50857#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:07,820 INFO L273 TraceCheckUtils]: 180: Hoare triple {50857#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50857#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:07,821 INFO L273 TraceCheckUtils]: 181: Hoare triple {50857#(<= main_~i~0 59)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50857#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:07,821 INFO L273 TraceCheckUtils]: 182: Hoare triple {50857#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:07,822 INFO L273 TraceCheckUtils]: 183: Hoare triple {50858#(<= main_~i~0 60)} assume !(~i~0 < 100000); {50798#false} is VALID [2018-11-23 12:01:07,822 INFO L273 TraceCheckUtils]: 184: Hoare triple {50798#false} havoc ~x~0;~x~0 := 0; {50798#false} is VALID [2018-11-23 12:01:07,822 INFO L273 TraceCheckUtils]: 185: Hoare triple {50798#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {50798#false} is VALID [2018-11-23 12:01:07,823 INFO L256 TraceCheckUtils]: 186: Hoare triple {50798#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {50798#false} is VALID [2018-11-23 12:01:07,823 INFO L273 TraceCheckUtils]: 187: Hoare triple {50798#false} ~cond := #in~cond; {50798#false} is VALID [2018-11-23 12:01:07,823 INFO L273 TraceCheckUtils]: 188: Hoare triple {50798#false} assume 0 == ~cond; {50798#false} is VALID [2018-11-23 12:01:07,823 INFO L273 TraceCheckUtils]: 189: Hoare triple {50798#false} assume !false; {50798#false} is VALID [2018-11-23 12:01:07,858 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 12:01:07,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:07,859 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 12:01:07,867 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:01:08,029 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-11-23 12:01:08,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:08,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:08,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {50797#true} call ULTIMATE.init(); {50797#true} is VALID [2018-11-23 12:01:08,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {50797#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50797#true} is VALID [2018-11-23 12:01:08,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {50797#true} assume true; {50797#true} is VALID [2018-11-23 12:01:08,503 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50797#true} {50797#true} #54#return; {50797#true} is VALID [2018-11-23 12:01:08,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {50797#true} call #t~ret6 := main(); {50797#true} is VALID [2018-11-23 12:01:08,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {50797#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {50799#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:08,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {50799#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50799#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:08,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {50799#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50799#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:08,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {50799#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50800#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:08,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {50800#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50800#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:08,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {50800#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50800#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:08,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {50800#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50801#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:08,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {50801#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50801#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:08,507 INFO L273 TraceCheckUtils]: 13: Hoare triple {50801#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50801#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:08,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {50801#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50802#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:08,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {50802#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50802#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:08,508 INFO L273 TraceCheckUtils]: 16: Hoare triple {50802#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50802#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:08,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {50802#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50803#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:08,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {50803#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50803#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:08,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {50803#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50803#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:08,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {50803#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50804#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:08,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {50804#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50804#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:08,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {50804#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50804#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:08,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {50804#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50805#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:08,513 INFO L273 TraceCheckUtils]: 24: Hoare triple {50805#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50805#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:08,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {50805#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50805#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:08,514 INFO L273 TraceCheckUtils]: 26: Hoare triple {50805#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50806#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:08,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {50806#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50806#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:08,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {50806#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50806#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:08,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {50806#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50807#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:08,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {50807#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50807#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:08,517 INFO L273 TraceCheckUtils]: 31: Hoare triple {50807#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50807#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:08,518 INFO L273 TraceCheckUtils]: 32: Hoare triple {50807#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50808#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:08,518 INFO L273 TraceCheckUtils]: 33: Hoare triple {50808#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50808#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:08,519 INFO L273 TraceCheckUtils]: 34: Hoare triple {50808#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50808#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:08,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {50808#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50809#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:08,520 INFO L273 TraceCheckUtils]: 36: Hoare triple {50809#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50809#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:08,520 INFO L273 TraceCheckUtils]: 37: Hoare triple {50809#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50809#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:08,521 INFO L273 TraceCheckUtils]: 38: Hoare triple {50809#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50810#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:08,522 INFO L273 TraceCheckUtils]: 39: Hoare triple {50810#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50810#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:08,522 INFO L273 TraceCheckUtils]: 40: Hoare triple {50810#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50810#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:08,523 INFO L273 TraceCheckUtils]: 41: Hoare triple {50810#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50811#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:08,523 INFO L273 TraceCheckUtils]: 42: Hoare triple {50811#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50811#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:08,524 INFO L273 TraceCheckUtils]: 43: Hoare triple {50811#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50811#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:08,525 INFO L273 TraceCheckUtils]: 44: Hoare triple {50811#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50812#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:08,525 INFO L273 TraceCheckUtils]: 45: Hoare triple {50812#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50812#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:08,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {50812#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50812#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:08,526 INFO L273 TraceCheckUtils]: 47: Hoare triple {50812#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50813#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:08,527 INFO L273 TraceCheckUtils]: 48: Hoare triple {50813#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50813#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:08,527 INFO L273 TraceCheckUtils]: 49: Hoare triple {50813#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50813#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:08,528 INFO L273 TraceCheckUtils]: 50: Hoare triple {50813#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50814#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:08,529 INFO L273 TraceCheckUtils]: 51: Hoare triple {50814#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50814#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:08,529 INFO L273 TraceCheckUtils]: 52: Hoare triple {50814#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50814#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:08,530 INFO L273 TraceCheckUtils]: 53: Hoare triple {50814#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50815#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:08,530 INFO L273 TraceCheckUtils]: 54: Hoare triple {50815#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50815#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:08,531 INFO L273 TraceCheckUtils]: 55: Hoare triple {50815#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50815#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:08,531 INFO L273 TraceCheckUtils]: 56: Hoare triple {50815#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50816#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:08,532 INFO L273 TraceCheckUtils]: 57: Hoare triple {50816#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50816#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:08,532 INFO L273 TraceCheckUtils]: 58: Hoare triple {50816#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50816#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:08,533 INFO L273 TraceCheckUtils]: 59: Hoare triple {50816#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50817#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:08,534 INFO L273 TraceCheckUtils]: 60: Hoare triple {50817#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50817#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:08,534 INFO L273 TraceCheckUtils]: 61: Hoare triple {50817#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50817#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:08,535 INFO L273 TraceCheckUtils]: 62: Hoare triple {50817#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50818#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:08,535 INFO L273 TraceCheckUtils]: 63: Hoare triple {50818#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50818#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:08,536 INFO L273 TraceCheckUtils]: 64: Hoare triple {50818#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50818#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:08,537 INFO L273 TraceCheckUtils]: 65: Hoare triple {50818#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50819#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:08,537 INFO L273 TraceCheckUtils]: 66: Hoare triple {50819#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50819#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:08,538 INFO L273 TraceCheckUtils]: 67: Hoare triple {50819#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50819#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:08,538 INFO L273 TraceCheckUtils]: 68: Hoare triple {50819#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50820#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:08,539 INFO L273 TraceCheckUtils]: 69: Hoare triple {50820#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50820#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:08,539 INFO L273 TraceCheckUtils]: 70: Hoare triple {50820#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50820#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:08,540 INFO L273 TraceCheckUtils]: 71: Hoare triple {50820#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50821#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:08,541 INFO L273 TraceCheckUtils]: 72: Hoare triple {50821#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50821#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:08,541 INFO L273 TraceCheckUtils]: 73: Hoare triple {50821#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50821#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:08,542 INFO L273 TraceCheckUtils]: 74: Hoare triple {50821#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50822#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:08,542 INFO L273 TraceCheckUtils]: 75: Hoare triple {50822#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50822#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:08,543 INFO L273 TraceCheckUtils]: 76: Hoare triple {50822#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50822#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:08,544 INFO L273 TraceCheckUtils]: 77: Hoare triple {50822#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50823#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:08,544 INFO L273 TraceCheckUtils]: 78: Hoare triple {50823#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50823#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:08,545 INFO L273 TraceCheckUtils]: 79: Hoare triple {50823#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50823#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:08,545 INFO L273 TraceCheckUtils]: 80: Hoare triple {50823#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50824#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:08,546 INFO L273 TraceCheckUtils]: 81: Hoare triple {50824#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50824#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:08,546 INFO L273 TraceCheckUtils]: 82: Hoare triple {50824#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50824#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:08,547 INFO L273 TraceCheckUtils]: 83: Hoare triple {50824#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50825#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:08,548 INFO L273 TraceCheckUtils]: 84: Hoare triple {50825#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50825#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:08,548 INFO L273 TraceCheckUtils]: 85: Hoare triple {50825#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50825#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:08,549 INFO L273 TraceCheckUtils]: 86: Hoare triple {50825#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50826#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:08,549 INFO L273 TraceCheckUtils]: 87: Hoare triple {50826#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50826#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:08,550 INFO L273 TraceCheckUtils]: 88: Hoare triple {50826#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50826#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:08,550 INFO L273 TraceCheckUtils]: 89: Hoare triple {50826#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50827#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:08,551 INFO L273 TraceCheckUtils]: 90: Hoare triple {50827#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50827#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:08,551 INFO L273 TraceCheckUtils]: 91: Hoare triple {50827#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50827#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:08,552 INFO L273 TraceCheckUtils]: 92: Hoare triple {50827#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50828#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:08,553 INFO L273 TraceCheckUtils]: 93: Hoare triple {50828#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50828#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:08,553 INFO L273 TraceCheckUtils]: 94: Hoare triple {50828#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50828#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:08,554 INFO L273 TraceCheckUtils]: 95: Hoare triple {50828#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50829#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:08,554 INFO L273 TraceCheckUtils]: 96: Hoare triple {50829#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50829#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:08,555 INFO L273 TraceCheckUtils]: 97: Hoare triple {50829#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50829#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:08,556 INFO L273 TraceCheckUtils]: 98: Hoare triple {50829#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50830#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:08,556 INFO L273 TraceCheckUtils]: 99: Hoare triple {50830#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50830#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:08,557 INFO L273 TraceCheckUtils]: 100: Hoare triple {50830#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50830#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:08,557 INFO L273 TraceCheckUtils]: 101: Hoare triple {50830#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50831#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:08,558 INFO L273 TraceCheckUtils]: 102: Hoare triple {50831#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50831#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:08,558 INFO L273 TraceCheckUtils]: 103: Hoare triple {50831#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50831#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:08,559 INFO L273 TraceCheckUtils]: 104: Hoare triple {50831#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50832#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:08,560 INFO L273 TraceCheckUtils]: 105: Hoare triple {50832#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50832#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:08,560 INFO L273 TraceCheckUtils]: 106: Hoare triple {50832#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50832#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:08,561 INFO L273 TraceCheckUtils]: 107: Hoare triple {50832#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50833#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:08,561 INFO L273 TraceCheckUtils]: 108: Hoare triple {50833#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50833#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:08,562 INFO L273 TraceCheckUtils]: 109: Hoare triple {50833#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50833#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:08,563 INFO L273 TraceCheckUtils]: 110: Hoare triple {50833#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50834#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:08,563 INFO L273 TraceCheckUtils]: 111: Hoare triple {50834#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50834#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:08,564 INFO L273 TraceCheckUtils]: 112: Hoare triple {50834#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50834#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:08,564 INFO L273 TraceCheckUtils]: 113: Hoare triple {50834#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50835#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:08,565 INFO L273 TraceCheckUtils]: 114: Hoare triple {50835#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50835#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:08,565 INFO L273 TraceCheckUtils]: 115: Hoare triple {50835#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50835#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:08,566 INFO L273 TraceCheckUtils]: 116: Hoare triple {50835#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50836#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:08,567 INFO L273 TraceCheckUtils]: 117: Hoare triple {50836#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50836#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:08,567 INFO L273 TraceCheckUtils]: 118: Hoare triple {50836#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50836#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:08,568 INFO L273 TraceCheckUtils]: 119: Hoare triple {50836#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50837#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:08,568 INFO L273 TraceCheckUtils]: 120: Hoare triple {50837#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50837#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:08,569 INFO L273 TraceCheckUtils]: 121: Hoare triple {50837#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50837#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:08,570 INFO L273 TraceCheckUtils]: 122: Hoare triple {50837#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50838#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:08,570 INFO L273 TraceCheckUtils]: 123: Hoare triple {50838#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50838#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:08,571 INFO L273 TraceCheckUtils]: 124: Hoare triple {50838#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50838#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:08,571 INFO L273 TraceCheckUtils]: 125: Hoare triple {50838#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50839#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:08,572 INFO L273 TraceCheckUtils]: 126: Hoare triple {50839#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50839#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:08,572 INFO L273 TraceCheckUtils]: 127: Hoare triple {50839#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50839#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:08,573 INFO L273 TraceCheckUtils]: 128: Hoare triple {50839#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50840#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:08,574 INFO L273 TraceCheckUtils]: 129: Hoare triple {50840#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50840#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:08,574 INFO L273 TraceCheckUtils]: 130: Hoare triple {50840#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50840#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:08,575 INFO L273 TraceCheckUtils]: 131: Hoare triple {50840#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50841#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:08,575 INFO L273 TraceCheckUtils]: 132: Hoare triple {50841#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50841#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:08,576 INFO L273 TraceCheckUtils]: 133: Hoare triple {50841#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50841#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:08,576 INFO L273 TraceCheckUtils]: 134: Hoare triple {50841#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50842#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:08,577 INFO L273 TraceCheckUtils]: 135: Hoare triple {50842#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50842#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:08,578 INFO L273 TraceCheckUtils]: 136: Hoare triple {50842#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50842#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:08,578 INFO L273 TraceCheckUtils]: 137: Hoare triple {50842#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50843#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:08,579 INFO L273 TraceCheckUtils]: 138: Hoare triple {50843#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50843#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:08,579 INFO L273 TraceCheckUtils]: 139: Hoare triple {50843#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50843#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:08,580 INFO L273 TraceCheckUtils]: 140: Hoare triple {50843#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:08,581 INFO L273 TraceCheckUtils]: 141: Hoare triple {50844#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50844#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:08,581 INFO L273 TraceCheckUtils]: 142: Hoare triple {50844#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50844#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:08,582 INFO L273 TraceCheckUtils]: 143: Hoare triple {50844#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50845#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:08,582 INFO L273 TraceCheckUtils]: 144: Hoare triple {50845#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50845#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:08,583 INFO L273 TraceCheckUtils]: 145: Hoare triple {50845#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50845#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:08,583 INFO L273 TraceCheckUtils]: 146: Hoare triple {50845#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50846#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:08,584 INFO L273 TraceCheckUtils]: 147: Hoare triple {50846#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50846#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:08,584 INFO L273 TraceCheckUtils]: 148: Hoare triple {50846#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50846#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:08,585 INFO L273 TraceCheckUtils]: 149: Hoare triple {50846#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50847#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:08,586 INFO L273 TraceCheckUtils]: 150: Hoare triple {50847#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50847#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:08,586 INFO L273 TraceCheckUtils]: 151: Hoare triple {50847#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50847#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:08,587 INFO L273 TraceCheckUtils]: 152: Hoare triple {50847#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50848#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:08,587 INFO L273 TraceCheckUtils]: 153: Hoare triple {50848#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50848#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:08,588 INFO L273 TraceCheckUtils]: 154: Hoare triple {50848#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50848#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:08,589 INFO L273 TraceCheckUtils]: 155: Hoare triple {50848#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50849#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:08,589 INFO L273 TraceCheckUtils]: 156: Hoare triple {50849#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50849#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:08,590 INFO L273 TraceCheckUtils]: 157: Hoare triple {50849#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50849#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:08,590 INFO L273 TraceCheckUtils]: 158: Hoare triple {50849#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50850#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:08,591 INFO L273 TraceCheckUtils]: 159: Hoare triple {50850#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50850#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:08,591 INFO L273 TraceCheckUtils]: 160: Hoare triple {50850#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50850#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:08,592 INFO L273 TraceCheckUtils]: 161: Hoare triple {50850#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:08,593 INFO L273 TraceCheckUtils]: 162: Hoare triple {50851#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50851#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:08,593 INFO L273 TraceCheckUtils]: 163: Hoare triple {50851#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50851#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:08,594 INFO L273 TraceCheckUtils]: 164: Hoare triple {50851#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50852#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:08,594 INFO L273 TraceCheckUtils]: 165: Hoare triple {50852#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50852#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:08,595 INFO L273 TraceCheckUtils]: 166: Hoare triple {50852#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50852#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:08,596 INFO L273 TraceCheckUtils]: 167: Hoare triple {50852#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50853#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:08,596 INFO L273 TraceCheckUtils]: 168: Hoare triple {50853#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50853#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:08,597 INFO L273 TraceCheckUtils]: 169: Hoare triple {50853#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50853#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:08,597 INFO L273 TraceCheckUtils]: 170: Hoare triple {50853#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50854#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:08,598 INFO L273 TraceCheckUtils]: 171: Hoare triple {50854#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50854#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:08,598 INFO L273 TraceCheckUtils]: 172: Hoare triple {50854#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50854#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:08,599 INFO L273 TraceCheckUtils]: 173: Hoare triple {50854#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50855#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:08,599 INFO L273 TraceCheckUtils]: 174: Hoare triple {50855#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50855#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:08,600 INFO L273 TraceCheckUtils]: 175: Hoare triple {50855#(<= main_~i~0 57)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50855#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:08,601 INFO L273 TraceCheckUtils]: 176: Hoare triple {50855#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50856#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:08,601 INFO L273 TraceCheckUtils]: 177: Hoare triple {50856#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50856#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:08,602 INFO L273 TraceCheckUtils]: 178: Hoare triple {50856#(<= main_~i~0 58)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50856#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:08,602 INFO L273 TraceCheckUtils]: 179: Hoare triple {50856#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50857#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:08,603 INFO L273 TraceCheckUtils]: 180: Hoare triple {50857#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50857#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:08,603 INFO L273 TraceCheckUtils]: 181: Hoare triple {50857#(<= main_~i~0 59)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {50857#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:08,604 INFO L273 TraceCheckUtils]: 182: Hoare triple {50857#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:08,605 INFO L273 TraceCheckUtils]: 183: Hoare triple {50858#(<= main_~i~0 60)} assume !(~i~0 < 100000); {50798#false} is VALID [2018-11-23 12:01:08,605 INFO L273 TraceCheckUtils]: 184: Hoare triple {50798#false} havoc ~x~0;~x~0 := 0; {50798#false} is VALID [2018-11-23 12:01:08,605 INFO L273 TraceCheckUtils]: 185: Hoare triple {50798#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {50798#false} is VALID [2018-11-23 12:01:08,605 INFO L256 TraceCheckUtils]: 186: Hoare triple {50798#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {50798#false} is VALID [2018-11-23 12:01:08,606 INFO L273 TraceCheckUtils]: 187: Hoare triple {50798#false} ~cond := #in~cond; {50798#false} is VALID [2018-11-23 12:01:08,606 INFO L273 TraceCheckUtils]: 188: Hoare triple {50798#false} assume 0 == ~cond; {50798#false} is VALID [2018-11-23 12:01:08,606 INFO L273 TraceCheckUtils]: 189: Hoare triple {50798#false} assume !false; {50798#false} is VALID [2018-11-23 12:01:08,629 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 12:01:08,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:08,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-11-23 12:01:08,649 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 190 [2018-11-23 12:01:08,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:08,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2018-11-23 12:01:08,837 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 12:01:08,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-23 12:01:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-23 12:01:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 12:01:08,839 INFO L87 Difference]: Start difference. First operand 195 states and 255 transitions. Second operand 62 states. [2018-11-23 12:01:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:09,983 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2018-11-23 12:01:09,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 12:01:09,983 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 190 [2018-11-23 12:01:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:01:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 274 transitions. [2018-11-23 12:01:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:01:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 274 transitions. [2018-11-23 12:01:09,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 274 transitions. [2018-11-23 12:01:10,243 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 12:01:10,248 INFO L225 Difference]: With dead ends: 211 [2018-11-23 12:01:10,248 INFO L226 Difference]: Without dead ends: 200 [2018-11-23 12:01:10,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 12:01:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-23 12:01:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-11-23 12:01:10,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:10,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 198 states. [2018-11-23 12:01:10,345 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 198 states. [2018-11-23 12:01:10,345 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 198 states. [2018-11-23 12:01:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:10,349 INFO L93 Difference]: Finished difference Result 200 states and 262 transitions. [2018-11-23 12:01:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-11-23 12:01:10,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:10,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:10,349 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 200 states. [2018-11-23 12:01:10,349 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 200 states. [2018-11-23 12:01:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:10,352 INFO L93 Difference]: Finished difference Result 200 states and 262 transitions. [2018-11-23 12:01:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-11-23 12:01:10,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:10,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:10,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:10,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-23 12:01:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2018-11-23 12:01:10,355 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 190 [2018-11-23 12:01:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:10,356 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2018-11-23 12:01:10,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-23 12:01:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2018-11-23 12:01:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-23 12:01:10,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:10,357 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:10,357 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:10,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash 967316663, now seen corresponding path program 60 times [2018-11-23 12:01:10,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:10,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:10,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:10,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:10,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:12,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {52376#true} call ULTIMATE.init(); {52376#true} is VALID [2018-11-23 12:01:12,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {52376#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52376#true} is VALID [2018-11-23 12:01:12,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {52376#true} assume true; {52376#true} is VALID [2018-11-23 12:01:12,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52376#true} {52376#true} #54#return; {52376#true} is VALID [2018-11-23 12:01:12,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {52376#true} call #t~ret6 := main(); {52376#true} is VALID [2018-11-23 12:01:12,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {52376#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {52378#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:12,201 INFO L273 TraceCheckUtils]: 6: Hoare triple {52378#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52378#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:12,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {52378#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52378#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:12,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {52378#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52379#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:12,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {52379#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52379#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:12,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {52379#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52379#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:12,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {52379#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52380#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:12,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {52380#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52380#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:12,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {52380#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52380#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:12,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {52380#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52381#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:12,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {52381#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52381#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:12,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {52381#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52381#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:12,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {52381#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52382#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:12,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {52382#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52382#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:12,206 INFO L273 TraceCheckUtils]: 19: Hoare triple {52382#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52382#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:12,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {52382#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52383#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:12,207 INFO L273 TraceCheckUtils]: 21: Hoare triple {52383#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52383#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:12,207 INFO L273 TraceCheckUtils]: 22: Hoare triple {52383#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52383#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:12,208 INFO L273 TraceCheckUtils]: 23: Hoare triple {52383#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52384#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:12,208 INFO L273 TraceCheckUtils]: 24: Hoare triple {52384#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52384#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:12,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {52384#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52384#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:12,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {52384#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52385#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:12,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {52385#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52385#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:12,210 INFO L273 TraceCheckUtils]: 28: Hoare triple {52385#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52385#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:12,211 INFO L273 TraceCheckUtils]: 29: Hoare triple {52385#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52386#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:12,212 INFO L273 TraceCheckUtils]: 30: Hoare triple {52386#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52386#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:12,212 INFO L273 TraceCheckUtils]: 31: Hoare triple {52386#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52386#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:12,213 INFO L273 TraceCheckUtils]: 32: Hoare triple {52386#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52387#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:12,213 INFO L273 TraceCheckUtils]: 33: Hoare triple {52387#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52387#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:12,214 INFO L273 TraceCheckUtils]: 34: Hoare triple {52387#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52387#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:12,214 INFO L273 TraceCheckUtils]: 35: Hoare triple {52387#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52388#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:12,215 INFO L273 TraceCheckUtils]: 36: Hoare triple {52388#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52388#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:12,215 INFO L273 TraceCheckUtils]: 37: Hoare triple {52388#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52388#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:12,216 INFO L273 TraceCheckUtils]: 38: Hoare triple {52388#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52389#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:12,216 INFO L273 TraceCheckUtils]: 39: Hoare triple {52389#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52389#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:12,217 INFO L273 TraceCheckUtils]: 40: Hoare triple {52389#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52389#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:12,218 INFO L273 TraceCheckUtils]: 41: Hoare triple {52389#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52390#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:12,218 INFO L273 TraceCheckUtils]: 42: Hoare triple {52390#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52390#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:12,218 INFO L273 TraceCheckUtils]: 43: Hoare triple {52390#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52390#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:12,219 INFO L273 TraceCheckUtils]: 44: Hoare triple {52390#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52391#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:12,220 INFO L273 TraceCheckUtils]: 45: Hoare triple {52391#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52391#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:12,220 INFO L273 TraceCheckUtils]: 46: Hoare triple {52391#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52391#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:12,221 INFO L273 TraceCheckUtils]: 47: Hoare triple {52391#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52392#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:12,221 INFO L273 TraceCheckUtils]: 48: Hoare triple {52392#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52392#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:12,222 INFO L273 TraceCheckUtils]: 49: Hoare triple {52392#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52392#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:12,222 INFO L273 TraceCheckUtils]: 50: Hoare triple {52392#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52393#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:12,223 INFO L273 TraceCheckUtils]: 51: Hoare triple {52393#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52393#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:12,223 INFO L273 TraceCheckUtils]: 52: Hoare triple {52393#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52393#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:12,224 INFO L273 TraceCheckUtils]: 53: Hoare triple {52393#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52394#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:12,224 INFO L273 TraceCheckUtils]: 54: Hoare triple {52394#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52394#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:12,225 INFO L273 TraceCheckUtils]: 55: Hoare triple {52394#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52394#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:12,225 INFO L273 TraceCheckUtils]: 56: Hoare triple {52394#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52395#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:12,226 INFO L273 TraceCheckUtils]: 57: Hoare triple {52395#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52395#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:12,226 INFO L273 TraceCheckUtils]: 58: Hoare triple {52395#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52395#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:12,227 INFO L273 TraceCheckUtils]: 59: Hoare triple {52395#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52396#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:12,228 INFO L273 TraceCheckUtils]: 60: Hoare triple {52396#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52396#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:12,228 INFO L273 TraceCheckUtils]: 61: Hoare triple {52396#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52396#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:12,229 INFO L273 TraceCheckUtils]: 62: Hoare triple {52396#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52397#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:12,229 INFO L273 TraceCheckUtils]: 63: Hoare triple {52397#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52397#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:12,230 INFO L273 TraceCheckUtils]: 64: Hoare triple {52397#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52397#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:12,230 INFO L273 TraceCheckUtils]: 65: Hoare triple {52397#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52398#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:12,231 INFO L273 TraceCheckUtils]: 66: Hoare triple {52398#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52398#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:12,231 INFO L273 TraceCheckUtils]: 67: Hoare triple {52398#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52398#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:12,232 INFO L273 TraceCheckUtils]: 68: Hoare triple {52398#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52399#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:12,233 INFO L273 TraceCheckUtils]: 69: Hoare triple {52399#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52399#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:12,233 INFO L273 TraceCheckUtils]: 70: Hoare triple {52399#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52399#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:12,234 INFO L273 TraceCheckUtils]: 71: Hoare triple {52399#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52400#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:12,234 INFO L273 TraceCheckUtils]: 72: Hoare triple {52400#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52400#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:12,235 INFO L273 TraceCheckUtils]: 73: Hoare triple {52400#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52400#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:12,236 INFO L273 TraceCheckUtils]: 74: Hoare triple {52400#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52401#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:12,236 INFO L273 TraceCheckUtils]: 75: Hoare triple {52401#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52401#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:12,237 INFO L273 TraceCheckUtils]: 76: Hoare triple {52401#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52401#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:12,237 INFO L273 TraceCheckUtils]: 77: Hoare triple {52401#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52402#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:12,238 INFO L273 TraceCheckUtils]: 78: Hoare triple {52402#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52402#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:12,238 INFO L273 TraceCheckUtils]: 79: Hoare triple {52402#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52402#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:12,239 INFO L273 TraceCheckUtils]: 80: Hoare triple {52402#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52403#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:12,239 INFO L273 TraceCheckUtils]: 81: Hoare triple {52403#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52403#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:12,240 INFO L273 TraceCheckUtils]: 82: Hoare triple {52403#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52403#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:12,240 INFO L273 TraceCheckUtils]: 83: Hoare triple {52403#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52404#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:12,241 INFO L273 TraceCheckUtils]: 84: Hoare triple {52404#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52404#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:12,241 INFO L273 TraceCheckUtils]: 85: Hoare triple {52404#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52404#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:12,242 INFO L273 TraceCheckUtils]: 86: Hoare triple {52404#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52405#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:12,243 INFO L273 TraceCheckUtils]: 87: Hoare triple {52405#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52405#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:12,243 INFO L273 TraceCheckUtils]: 88: Hoare triple {52405#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52405#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:12,244 INFO L273 TraceCheckUtils]: 89: Hoare triple {52405#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52406#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:12,244 INFO L273 TraceCheckUtils]: 90: Hoare triple {52406#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52406#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:12,245 INFO L273 TraceCheckUtils]: 91: Hoare triple {52406#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52406#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:12,245 INFO L273 TraceCheckUtils]: 92: Hoare triple {52406#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52407#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:12,246 INFO L273 TraceCheckUtils]: 93: Hoare triple {52407#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52407#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:12,246 INFO L273 TraceCheckUtils]: 94: Hoare triple {52407#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52407#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:12,247 INFO L273 TraceCheckUtils]: 95: Hoare triple {52407#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52408#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:12,247 INFO L273 TraceCheckUtils]: 96: Hoare triple {52408#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52408#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:12,248 INFO L273 TraceCheckUtils]: 97: Hoare triple {52408#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52408#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:12,248 INFO L273 TraceCheckUtils]: 98: Hoare triple {52408#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52409#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:12,249 INFO L273 TraceCheckUtils]: 99: Hoare triple {52409#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52409#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:12,249 INFO L273 TraceCheckUtils]: 100: Hoare triple {52409#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52409#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:12,250 INFO L273 TraceCheckUtils]: 101: Hoare triple {52409#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52410#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:12,251 INFO L273 TraceCheckUtils]: 102: Hoare triple {52410#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52410#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:12,251 INFO L273 TraceCheckUtils]: 103: Hoare triple {52410#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52410#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:12,252 INFO L273 TraceCheckUtils]: 104: Hoare triple {52410#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52411#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:12,252 INFO L273 TraceCheckUtils]: 105: Hoare triple {52411#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52411#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:12,253 INFO L273 TraceCheckUtils]: 106: Hoare triple {52411#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52411#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:12,253 INFO L273 TraceCheckUtils]: 107: Hoare triple {52411#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52412#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:12,254 INFO L273 TraceCheckUtils]: 108: Hoare triple {52412#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52412#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:12,254 INFO L273 TraceCheckUtils]: 109: Hoare triple {52412#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52412#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:12,255 INFO L273 TraceCheckUtils]: 110: Hoare triple {52412#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52413#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:12,255 INFO L273 TraceCheckUtils]: 111: Hoare triple {52413#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52413#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:12,256 INFO L273 TraceCheckUtils]: 112: Hoare triple {52413#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52413#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:12,256 INFO L273 TraceCheckUtils]: 113: Hoare triple {52413#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52414#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:12,257 INFO L273 TraceCheckUtils]: 114: Hoare triple {52414#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52414#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:12,257 INFO L273 TraceCheckUtils]: 115: Hoare triple {52414#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52414#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:12,258 INFO L273 TraceCheckUtils]: 116: Hoare triple {52414#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52415#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:12,259 INFO L273 TraceCheckUtils]: 117: Hoare triple {52415#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52415#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:12,259 INFO L273 TraceCheckUtils]: 118: Hoare triple {52415#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52415#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:12,260 INFO L273 TraceCheckUtils]: 119: Hoare triple {52415#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52416#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:12,260 INFO L273 TraceCheckUtils]: 120: Hoare triple {52416#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52416#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:12,261 INFO L273 TraceCheckUtils]: 121: Hoare triple {52416#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52416#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:12,261 INFO L273 TraceCheckUtils]: 122: Hoare triple {52416#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52417#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:12,262 INFO L273 TraceCheckUtils]: 123: Hoare triple {52417#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52417#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:12,262 INFO L273 TraceCheckUtils]: 124: Hoare triple {52417#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52417#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:12,263 INFO L273 TraceCheckUtils]: 125: Hoare triple {52417#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52418#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:12,263 INFO L273 TraceCheckUtils]: 126: Hoare triple {52418#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52418#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:12,264 INFO L273 TraceCheckUtils]: 127: Hoare triple {52418#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52418#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:12,265 INFO L273 TraceCheckUtils]: 128: Hoare triple {52418#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52419#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:12,265 INFO L273 TraceCheckUtils]: 129: Hoare triple {52419#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52419#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:12,265 INFO L273 TraceCheckUtils]: 130: Hoare triple {52419#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52419#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:12,266 INFO L273 TraceCheckUtils]: 131: Hoare triple {52419#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52420#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:12,267 INFO L273 TraceCheckUtils]: 132: Hoare triple {52420#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52420#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:12,267 INFO L273 TraceCheckUtils]: 133: Hoare triple {52420#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52420#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:12,268 INFO L273 TraceCheckUtils]: 134: Hoare triple {52420#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52421#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:12,268 INFO L273 TraceCheckUtils]: 135: Hoare triple {52421#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52421#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:12,269 INFO L273 TraceCheckUtils]: 136: Hoare triple {52421#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52421#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:12,269 INFO L273 TraceCheckUtils]: 137: Hoare triple {52421#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52422#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:12,270 INFO L273 TraceCheckUtils]: 138: Hoare triple {52422#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52422#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:12,270 INFO L273 TraceCheckUtils]: 139: Hoare triple {52422#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52422#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:12,271 INFO L273 TraceCheckUtils]: 140: Hoare triple {52422#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52423#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:12,271 INFO L273 TraceCheckUtils]: 141: Hoare triple {52423#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52423#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:12,272 INFO L273 TraceCheckUtils]: 142: Hoare triple {52423#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52423#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:12,273 INFO L273 TraceCheckUtils]: 143: Hoare triple {52423#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52424#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:12,273 INFO L273 TraceCheckUtils]: 144: Hoare triple {52424#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52424#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:12,273 INFO L273 TraceCheckUtils]: 145: Hoare triple {52424#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52424#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:12,274 INFO L273 TraceCheckUtils]: 146: Hoare triple {52424#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52425#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:12,275 INFO L273 TraceCheckUtils]: 147: Hoare triple {52425#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52425#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:12,275 INFO L273 TraceCheckUtils]: 148: Hoare triple {52425#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52425#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:12,276 INFO L273 TraceCheckUtils]: 149: Hoare triple {52425#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52426#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:12,276 INFO L273 TraceCheckUtils]: 150: Hoare triple {52426#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52426#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:12,277 INFO L273 TraceCheckUtils]: 151: Hoare triple {52426#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52426#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:12,277 INFO L273 TraceCheckUtils]: 152: Hoare triple {52426#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52427#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:12,278 INFO L273 TraceCheckUtils]: 153: Hoare triple {52427#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52427#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:12,278 INFO L273 TraceCheckUtils]: 154: Hoare triple {52427#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52427#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:12,279 INFO L273 TraceCheckUtils]: 155: Hoare triple {52427#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52428#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:12,279 INFO L273 TraceCheckUtils]: 156: Hoare triple {52428#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52428#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:12,280 INFO L273 TraceCheckUtils]: 157: Hoare triple {52428#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52428#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:12,281 INFO L273 TraceCheckUtils]: 158: Hoare triple {52428#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52429#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:12,281 INFO L273 TraceCheckUtils]: 159: Hoare triple {52429#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52429#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:12,281 INFO L273 TraceCheckUtils]: 160: Hoare triple {52429#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52429#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:12,282 INFO L273 TraceCheckUtils]: 161: Hoare triple {52429#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52430#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:12,283 INFO L273 TraceCheckUtils]: 162: Hoare triple {52430#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52430#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:12,283 INFO L273 TraceCheckUtils]: 163: Hoare triple {52430#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52430#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:12,284 INFO L273 TraceCheckUtils]: 164: Hoare triple {52430#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52431#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:12,284 INFO L273 TraceCheckUtils]: 165: Hoare triple {52431#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52431#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:12,285 INFO L273 TraceCheckUtils]: 166: Hoare triple {52431#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52431#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:12,285 INFO L273 TraceCheckUtils]: 167: Hoare triple {52431#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52432#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:12,286 INFO L273 TraceCheckUtils]: 168: Hoare triple {52432#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52432#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:12,286 INFO L273 TraceCheckUtils]: 169: Hoare triple {52432#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52432#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:12,287 INFO L273 TraceCheckUtils]: 170: Hoare triple {52432#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52433#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:12,287 INFO L273 TraceCheckUtils]: 171: Hoare triple {52433#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52433#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:12,288 INFO L273 TraceCheckUtils]: 172: Hoare triple {52433#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52433#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:12,289 INFO L273 TraceCheckUtils]: 173: Hoare triple {52433#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52434#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:12,289 INFO L273 TraceCheckUtils]: 174: Hoare triple {52434#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52434#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:12,289 INFO L273 TraceCheckUtils]: 175: Hoare triple {52434#(<= main_~i~0 57)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52434#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:12,290 INFO L273 TraceCheckUtils]: 176: Hoare triple {52434#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52435#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:12,291 INFO L273 TraceCheckUtils]: 177: Hoare triple {52435#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52435#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:12,291 INFO L273 TraceCheckUtils]: 178: Hoare triple {52435#(<= main_~i~0 58)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52435#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:12,292 INFO L273 TraceCheckUtils]: 179: Hoare triple {52435#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52436#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:12,292 INFO L273 TraceCheckUtils]: 180: Hoare triple {52436#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52436#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:12,293 INFO L273 TraceCheckUtils]: 181: Hoare triple {52436#(<= main_~i~0 59)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52436#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:12,293 INFO L273 TraceCheckUtils]: 182: Hoare triple {52436#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52437#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:12,294 INFO L273 TraceCheckUtils]: 183: Hoare triple {52437#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52437#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:12,294 INFO L273 TraceCheckUtils]: 184: Hoare triple {52437#(<= main_~i~0 60)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52437#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:12,295 INFO L273 TraceCheckUtils]: 185: Hoare triple {52437#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52438#(<= main_~i~0 61)} is VALID [2018-11-23 12:01:12,296 INFO L273 TraceCheckUtils]: 186: Hoare triple {52438#(<= main_~i~0 61)} assume !(~i~0 < 100000); {52377#false} is VALID [2018-11-23 12:01:12,296 INFO L273 TraceCheckUtils]: 187: Hoare triple {52377#false} havoc ~x~0;~x~0 := 0; {52377#false} is VALID [2018-11-23 12:01:12,296 INFO L273 TraceCheckUtils]: 188: Hoare triple {52377#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {52377#false} is VALID [2018-11-23 12:01:12,296 INFO L256 TraceCheckUtils]: 189: Hoare triple {52377#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {52377#false} is VALID [2018-11-23 12:01:12,296 INFO L273 TraceCheckUtils]: 190: Hoare triple {52377#false} ~cond := #in~cond; {52377#false} is VALID [2018-11-23 12:01:12,296 INFO L273 TraceCheckUtils]: 191: Hoare triple {52377#false} assume 0 == ~cond; {52377#false} is VALID [2018-11-23 12:01:12,297 INFO L273 TraceCheckUtils]: 192: Hoare triple {52377#false} assume !false; {52377#false} is VALID [2018-11-23 12:01:12,320 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 12:01:12,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:12,320 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 12:01:12,328 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:01:12,496 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-11-23 12:01:12,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:12,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:12,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {52376#true} call ULTIMATE.init(); {52376#true} is VALID [2018-11-23 12:01:12,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {52376#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52376#true} is VALID [2018-11-23 12:01:12,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {52376#true} assume true; {52376#true} is VALID [2018-11-23 12:01:12,930 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52376#true} {52376#true} #54#return; {52376#true} is VALID [2018-11-23 12:01:12,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {52376#true} call #t~ret6 := main(); {52376#true} is VALID [2018-11-23 12:01:12,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {52376#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {52378#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:12,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {52378#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52378#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:12,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {52378#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52378#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:12,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {52378#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52379#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:12,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {52379#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52379#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:12,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {52379#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52379#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:12,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {52379#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52380#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:12,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {52380#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52380#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:12,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {52380#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52380#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:12,934 INFO L273 TraceCheckUtils]: 14: Hoare triple {52380#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52381#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:12,935 INFO L273 TraceCheckUtils]: 15: Hoare triple {52381#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52381#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:12,935 INFO L273 TraceCheckUtils]: 16: Hoare triple {52381#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52381#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:12,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {52381#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52382#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:12,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {52382#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52382#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:12,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {52382#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52382#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:12,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {52382#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52383#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:12,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {52383#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52383#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:12,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {52383#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52383#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:12,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {52383#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52384#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:12,940 INFO L273 TraceCheckUtils]: 24: Hoare triple {52384#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52384#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:12,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {52384#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52384#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:12,941 INFO L273 TraceCheckUtils]: 26: Hoare triple {52384#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52385#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:12,941 INFO L273 TraceCheckUtils]: 27: Hoare triple {52385#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52385#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:12,942 INFO L273 TraceCheckUtils]: 28: Hoare triple {52385#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52385#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:12,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {52385#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52386#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:12,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {52386#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52386#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:12,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {52386#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52386#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:12,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {52386#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52387#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:12,945 INFO L273 TraceCheckUtils]: 33: Hoare triple {52387#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52387#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:12,945 INFO L273 TraceCheckUtils]: 34: Hoare triple {52387#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52387#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:12,946 INFO L273 TraceCheckUtils]: 35: Hoare triple {52387#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52388#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:12,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {52388#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52388#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:12,947 INFO L273 TraceCheckUtils]: 37: Hoare triple {52388#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52388#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:12,947 INFO L273 TraceCheckUtils]: 38: Hoare triple {52388#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52389#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:12,948 INFO L273 TraceCheckUtils]: 39: Hoare triple {52389#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52389#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:12,948 INFO L273 TraceCheckUtils]: 40: Hoare triple {52389#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52389#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:12,949 INFO L273 TraceCheckUtils]: 41: Hoare triple {52389#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52390#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:12,950 INFO L273 TraceCheckUtils]: 42: Hoare triple {52390#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52390#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:12,950 INFO L273 TraceCheckUtils]: 43: Hoare triple {52390#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52390#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:12,951 INFO L273 TraceCheckUtils]: 44: Hoare triple {52390#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52391#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:12,951 INFO L273 TraceCheckUtils]: 45: Hoare triple {52391#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52391#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:12,952 INFO L273 TraceCheckUtils]: 46: Hoare triple {52391#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52391#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:12,953 INFO L273 TraceCheckUtils]: 47: Hoare triple {52391#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52392#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:12,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {52392#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52392#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:12,954 INFO L273 TraceCheckUtils]: 49: Hoare triple {52392#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52392#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:12,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {52392#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52393#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:12,955 INFO L273 TraceCheckUtils]: 51: Hoare triple {52393#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52393#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:12,955 INFO L273 TraceCheckUtils]: 52: Hoare triple {52393#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52393#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:12,956 INFO L273 TraceCheckUtils]: 53: Hoare triple {52393#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52394#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:12,956 INFO L273 TraceCheckUtils]: 54: Hoare triple {52394#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52394#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:12,957 INFO L273 TraceCheckUtils]: 55: Hoare triple {52394#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52394#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:12,957 INFO L273 TraceCheckUtils]: 56: Hoare triple {52394#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52395#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:12,958 INFO L273 TraceCheckUtils]: 57: Hoare triple {52395#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52395#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:12,958 INFO L273 TraceCheckUtils]: 58: Hoare triple {52395#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52395#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:12,959 INFO L273 TraceCheckUtils]: 59: Hoare triple {52395#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52396#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:12,960 INFO L273 TraceCheckUtils]: 60: Hoare triple {52396#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52396#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:12,960 INFO L273 TraceCheckUtils]: 61: Hoare triple {52396#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52396#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:12,961 INFO L273 TraceCheckUtils]: 62: Hoare triple {52396#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52397#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:12,961 INFO L273 TraceCheckUtils]: 63: Hoare triple {52397#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52397#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:12,962 INFO L273 TraceCheckUtils]: 64: Hoare triple {52397#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52397#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:12,962 INFO L273 TraceCheckUtils]: 65: Hoare triple {52397#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52398#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:12,963 INFO L273 TraceCheckUtils]: 66: Hoare triple {52398#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52398#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:12,963 INFO L273 TraceCheckUtils]: 67: Hoare triple {52398#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52398#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:12,964 INFO L273 TraceCheckUtils]: 68: Hoare triple {52398#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52399#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:12,964 INFO L273 TraceCheckUtils]: 69: Hoare triple {52399#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52399#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:12,965 INFO L273 TraceCheckUtils]: 70: Hoare triple {52399#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52399#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:12,966 INFO L273 TraceCheckUtils]: 71: Hoare triple {52399#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52400#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:12,966 INFO L273 TraceCheckUtils]: 72: Hoare triple {52400#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52400#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:12,967 INFO L273 TraceCheckUtils]: 73: Hoare triple {52400#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52400#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:12,967 INFO L273 TraceCheckUtils]: 74: Hoare triple {52400#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52401#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:12,968 INFO L273 TraceCheckUtils]: 75: Hoare triple {52401#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52401#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:12,968 INFO L273 TraceCheckUtils]: 76: Hoare triple {52401#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52401#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:12,969 INFO L273 TraceCheckUtils]: 77: Hoare triple {52401#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52402#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:12,969 INFO L273 TraceCheckUtils]: 78: Hoare triple {52402#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52402#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:12,970 INFO L273 TraceCheckUtils]: 79: Hoare triple {52402#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52402#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:12,970 INFO L273 TraceCheckUtils]: 80: Hoare triple {52402#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52403#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:12,971 INFO L273 TraceCheckUtils]: 81: Hoare triple {52403#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52403#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:12,971 INFO L273 TraceCheckUtils]: 82: Hoare triple {52403#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52403#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:12,972 INFO L273 TraceCheckUtils]: 83: Hoare triple {52403#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52404#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:12,973 INFO L273 TraceCheckUtils]: 84: Hoare triple {52404#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52404#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:12,973 INFO L273 TraceCheckUtils]: 85: Hoare triple {52404#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52404#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:12,974 INFO L273 TraceCheckUtils]: 86: Hoare triple {52404#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52405#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:12,974 INFO L273 TraceCheckUtils]: 87: Hoare triple {52405#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52405#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:12,975 INFO L273 TraceCheckUtils]: 88: Hoare triple {52405#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52405#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:12,976 INFO L273 TraceCheckUtils]: 89: Hoare triple {52405#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52406#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:12,976 INFO L273 TraceCheckUtils]: 90: Hoare triple {52406#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52406#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:12,977 INFO L273 TraceCheckUtils]: 91: Hoare triple {52406#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52406#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:12,977 INFO L273 TraceCheckUtils]: 92: Hoare triple {52406#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52407#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:12,978 INFO L273 TraceCheckUtils]: 93: Hoare triple {52407#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52407#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:12,978 INFO L273 TraceCheckUtils]: 94: Hoare triple {52407#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52407#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:12,979 INFO L273 TraceCheckUtils]: 95: Hoare triple {52407#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52408#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:12,979 INFO L273 TraceCheckUtils]: 96: Hoare triple {52408#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52408#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:12,980 INFO L273 TraceCheckUtils]: 97: Hoare triple {52408#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52408#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:12,981 INFO L273 TraceCheckUtils]: 98: Hoare triple {52408#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52409#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:12,981 INFO L273 TraceCheckUtils]: 99: Hoare triple {52409#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52409#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:12,982 INFO L273 TraceCheckUtils]: 100: Hoare triple {52409#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52409#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:12,982 INFO L273 TraceCheckUtils]: 101: Hoare triple {52409#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52410#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:12,983 INFO L273 TraceCheckUtils]: 102: Hoare triple {52410#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52410#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:12,983 INFO L273 TraceCheckUtils]: 103: Hoare triple {52410#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52410#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:12,984 INFO L273 TraceCheckUtils]: 104: Hoare triple {52410#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52411#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:12,984 INFO L273 TraceCheckUtils]: 105: Hoare triple {52411#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52411#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:12,985 INFO L273 TraceCheckUtils]: 106: Hoare triple {52411#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52411#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:12,986 INFO L273 TraceCheckUtils]: 107: Hoare triple {52411#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52412#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:12,986 INFO L273 TraceCheckUtils]: 108: Hoare triple {52412#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52412#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:12,987 INFO L273 TraceCheckUtils]: 109: Hoare triple {52412#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52412#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:12,987 INFO L273 TraceCheckUtils]: 110: Hoare triple {52412#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52413#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:12,988 INFO L273 TraceCheckUtils]: 111: Hoare triple {52413#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52413#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:12,988 INFO L273 TraceCheckUtils]: 112: Hoare triple {52413#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52413#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:12,989 INFO L273 TraceCheckUtils]: 113: Hoare triple {52413#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52414#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:12,989 INFO L273 TraceCheckUtils]: 114: Hoare triple {52414#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52414#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:12,990 INFO L273 TraceCheckUtils]: 115: Hoare triple {52414#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52414#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:12,991 INFO L273 TraceCheckUtils]: 116: Hoare triple {52414#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52415#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:12,991 INFO L273 TraceCheckUtils]: 117: Hoare triple {52415#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52415#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:12,991 INFO L273 TraceCheckUtils]: 118: Hoare triple {52415#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52415#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:12,992 INFO L273 TraceCheckUtils]: 119: Hoare triple {52415#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52416#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:12,993 INFO L273 TraceCheckUtils]: 120: Hoare triple {52416#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52416#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:12,993 INFO L273 TraceCheckUtils]: 121: Hoare triple {52416#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52416#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:12,994 INFO L273 TraceCheckUtils]: 122: Hoare triple {52416#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52417#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:12,994 INFO L273 TraceCheckUtils]: 123: Hoare triple {52417#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52417#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:12,995 INFO L273 TraceCheckUtils]: 124: Hoare triple {52417#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52417#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:12,996 INFO L273 TraceCheckUtils]: 125: Hoare triple {52417#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52418#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:12,996 INFO L273 TraceCheckUtils]: 126: Hoare triple {52418#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52418#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:12,997 INFO L273 TraceCheckUtils]: 127: Hoare triple {52418#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52418#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:12,997 INFO L273 TraceCheckUtils]: 128: Hoare triple {52418#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52419#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:12,998 INFO L273 TraceCheckUtils]: 129: Hoare triple {52419#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52419#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:12,998 INFO L273 TraceCheckUtils]: 130: Hoare triple {52419#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52419#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:12,999 INFO L273 TraceCheckUtils]: 131: Hoare triple {52419#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52420#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:12,999 INFO L273 TraceCheckUtils]: 132: Hoare triple {52420#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52420#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:13,000 INFO L273 TraceCheckUtils]: 133: Hoare triple {52420#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52420#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:13,001 INFO L273 TraceCheckUtils]: 134: Hoare triple {52420#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52421#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:13,001 INFO L273 TraceCheckUtils]: 135: Hoare triple {52421#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52421#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:13,002 INFO L273 TraceCheckUtils]: 136: Hoare triple {52421#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52421#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:13,002 INFO L273 TraceCheckUtils]: 137: Hoare triple {52421#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52422#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:13,003 INFO L273 TraceCheckUtils]: 138: Hoare triple {52422#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52422#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:13,003 INFO L273 TraceCheckUtils]: 139: Hoare triple {52422#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52422#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:13,004 INFO L273 TraceCheckUtils]: 140: Hoare triple {52422#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52423#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:13,004 INFO L273 TraceCheckUtils]: 141: Hoare triple {52423#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52423#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:13,005 INFO L273 TraceCheckUtils]: 142: Hoare triple {52423#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52423#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:13,006 INFO L273 TraceCheckUtils]: 143: Hoare triple {52423#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52424#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:13,006 INFO L273 TraceCheckUtils]: 144: Hoare triple {52424#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52424#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:13,007 INFO L273 TraceCheckUtils]: 145: Hoare triple {52424#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52424#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:13,007 INFO L273 TraceCheckUtils]: 146: Hoare triple {52424#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52425#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:13,008 INFO L273 TraceCheckUtils]: 147: Hoare triple {52425#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52425#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:13,008 INFO L273 TraceCheckUtils]: 148: Hoare triple {52425#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52425#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:13,009 INFO L273 TraceCheckUtils]: 149: Hoare triple {52425#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52426#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:13,010 INFO L273 TraceCheckUtils]: 150: Hoare triple {52426#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52426#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:13,010 INFO L273 TraceCheckUtils]: 151: Hoare triple {52426#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52426#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:13,011 INFO L273 TraceCheckUtils]: 152: Hoare triple {52426#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52427#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:13,011 INFO L273 TraceCheckUtils]: 153: Hoare triple {52427#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52427#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:13,012 INFO L273 TraceCheckUtils]: 154: Hoare triple {52427#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52427#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:13,012 INFO L273 TraceCheckUtils]: 155: Hoare triple {52427#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52428#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:13,013 INFO L273 TraceCheckUtils]: 156: Hoare triple {52428#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52428#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:13,013 INFO L273 TraceCheckUtils]: 157: Hoare triple {52428#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52428#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:13,014 INFO L273 TraceCheckUtils]: 158: Hoare triple {52428#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52429#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:13,015 INFO L273 TraceCheckUtils]: 159: Hoare triple {52429#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52429#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:13,015 INFO L273 TraceCheckUtils]: 160: Hoare triple {52429#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52429#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:13,016 INFO L273 TraceCheckUtils]: 161: Hoare triple {52429#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52430#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:13,016 INFO L273 TraceCheckUtils]: 162: Hoare triple {52430#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52430#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:13,017 INFO L273 TraceCheckUtils]: 163: Hoare triple {52430#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52430#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:13,017 INFO L273 TraceCheckUtils]: 164: Hoare triple {52430#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52431#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:13,018 INFO L273 TraceCheckUtils]: 165: Hoare triple {52431#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52431#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:13,018 INFO L273 TraceCheckUtils]: 166: Hoare triple {52431#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52431#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:13,019 INFO L273 TraceCheckUtils]: 167: Hoare triple {52431#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52432#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:13,020 INFO L273 TraceCheckUtils]: 168: Hoare triple {52432#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52432#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:13,020 INFO L273 TraceCheckUtils]: 169: Hoare triple {52432#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52432#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:13,021 INFO L273 TraceCheckUtils]: 170: Hoare triple {52432#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52433#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:13,021 INFO L273 TraceCheckUtils]: 171: Hoare triple {52433#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52433#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:13,022 INFO L273 TraceCheckUtils]: 172: Hoare triple {52433#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52433#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:13,022 INFO L273 TraceCheckUtils]: 173: Hoare triple {52433#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52434#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:13,023 INFO L273 TraceCheckUtils]: 174: Hoare triple {52434#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52434#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:13,023 INFO L273 TraceCheckUtils]: 175: Hoare triple {52434#(<= main_~i~0 57)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52434#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:13,024 INFO L273 TraceCheckUtils]: 176: Hoare triple {52434#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52435#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:13,025 INFO L273 TraceCheckUtils]: 177: Hoare triple {52435#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52435#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:13,025 INFO L273 TraceCheckUtils]: 178: Hoare triple {52435#(<= main_~i~0 58)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52435#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:13,026 INFO L273 TraceCheckUtils]: 179: Hoare triple {52435#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52436#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:13,026 INFO L273 TraceCheckUtils]: 180: Hoare triple {52436#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52436#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:13,027 INFO L273 TraceCheckUtils]: 181: Hoare triple {52436#(<= main_~i~0 59)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52436#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:13,027 INFO L273 TraceCheckUtils]: 182: Hoare triple {52436#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52437#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:13,028 INFO L273 TraceCheckUtils]: 183: Hoare triple {52437#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52437#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:13,028 INFO L273 TraceCheckUtils]: 184: Hoare triple {52437#(<= main_~i~0 60)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {52437#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:13,029 INFO L273 TraceCheckUtils]: 185: Hoare triple {52437#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52438#(<= main_~i~0 61)} is VALID [2018-11-23 12:01:13,030 INFO L273 TraceCheckUtils]: 186: Hoare triple {52438#(<= main_~i~0 61)} assume !(~i~0 < 100000); {52377#false} is VALID [2018-11-23 12:01:13,030 INFO L273 TraceCheckUtils]: 187: Hoare triple {52377#false} havoc ~x~0;~x~0 := 0; {52377#false} is VALID [2018-11-23 12:01:13,030 INFO L273 TraceCheckUtils]: 188: Hoare triple {52377#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {52377#false} is VALID [2018-11-23 12:01:13,030 INFO L256 TraceCheckUtils]: 189: Hoare triple {52377#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {52377#false} is VALID [2018-11-23 12:01:13,030 INFO L273 TraceCheckUtils]: 190: Hoare triple {52377#false} ~cond := #in~cond; {52377#false} is VALID [2018-11-23 12:01:13,031 INFO L273 TraceCheckUtils]: 191: Hoare triple {52377#false} assume 0 == ~cond; {52377#false} is VALID [2018-11-23 12:01:13,031 INFO L273 TraceCheckUtils]: 192: Hoare triple {52377#false} assume !false; {52377#false} is VALID [2018-11-23 12:01:13,055 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 12:01:13,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:13,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-11-23 12:01:13,074 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 193 [2018-11-23 12:01:13,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:13,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states. [2018-11-23 12:01:13,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:13,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-23 12:01:13,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-23 12:01:13,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 12:01:13,261 INFO L87 Difference]: Start difference. First operand 198 states and 259 transitions. Second operand 63 states. [2018-11-23 12:01:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:14,561 INFO L93 Difference]: Finished difference Result 214 states and 278 transitions. [2018-11-23 12:01:14,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-23 12:01:14,561 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 193 [2018-11-23 12:01:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:01:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 278 transitions. [2018-11-23 12:01:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:01:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 278 transitions. [2018-11-23 12:01:14,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states and 278 transitions. [2018-11-23 12:01:14,810 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 12:01:14,814 INFO L225 Difference]: With dead ends: 214 [2018-11-23 12:01:14,814 INFO L226 Difference]: Without dead ends: 203 [2018-11-23 12:01:14,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 12:01:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-23 12:01:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-23 12:01:14,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:14,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand 201 states. [2018-11-23 12:01:14,869 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 201 states. [2018-11-23 12:01:14,869 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 201 states. [2018-11-23 12:01:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:14,872 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2018-11-23 12:01:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2018-11-23 12:01:14,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:14,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:14,873 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 203 states. [2018-11-23 12:01:14,873 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 203 states. [2018-11-23 12:01:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:14,875 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2018-11-23 12:01:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2018-11-23 12:01:14,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:14,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:14,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:14,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-23 12:01:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 263 transitions. [2018-11-23 12:01:14,879 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 263 transitions. Word has length 193 [2018-11-23 12:01:14,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:14,879 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 263 transitions. [2018-11-23 12:01:14,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-23 12:01:14,879 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2018-11-23 12:01:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-23 12:01:14,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:14,880 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:14,880 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:14,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:14,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1440483396, now seen corresponding path program 61 times [2018-11-23 12:01:14,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:14,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:14,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:14,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:14,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:16,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {53979#true} call ULTIMATE.init(); {53979#true} is VALID [2018-11-23 12:01:16,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {53979#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53979#true} is VALID [2018-11-23 12:01:16,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {53979#true} assume true; {53979#true} is VALID [2018-11-23 12:01:16,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53979#true} {53979#true} #54#return; {53979#true} is VALID [2018-11-23 12:01:16,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {53979#true} call #t~ret6 := main(); {53979#true} is VALID [2018-11-23 12:01:16,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {53979#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {53981#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:16,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {53981#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53981#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:16,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {53981#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53981#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:16,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {53981#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53982#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:16,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {53982#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53982#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:16,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {53982#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53982#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:16,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {53982#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53983#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:16,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {53983#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53983#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:16,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {53983#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53983#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:16,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {53983#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53984#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:16,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {53984#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53984#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:16,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {53984#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53984#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:16,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {53984#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53985#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:16,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {53985#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53985#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:16,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {53985#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53985#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:16,881 INFO L273 TraceCheckUtils]: 20: Hoare triple {53985#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53986#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:16,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {53986#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53986#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:16,882 INFO L273 TraceCheckUtils]: 22: Hoare triple {53986#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53986#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:16,883 INFO L273 TraceCheckUtils]: 23: Hoare triple {53986#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53987#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:16,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {53987#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53987#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:16,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {53987#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53987#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:16,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {53987#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53988#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:16,885 INFO L273 TraceCheckUtils]: 27: Hoare triple {53988#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53988#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:16,885 INFO L273 TraceCheckUtils]: 28: Hoare triple {53988#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53988#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:16,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {53988#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53989#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:16,886 INFO L273 TraceCheckUtils]: 30: Hoare triple {53989#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53989#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:16,887 INFO L273 TraceCheckUtils]: 31: Hoare triple {53989#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53989#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:16,888 INFO L273 TraceCheckUtils]: 32: Hoare triple {53989#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53990#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:16,888 INFO L273 TraceCheckUtils]: 33: Hoare triple {53990#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53990#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:16,889 INFO L273 TraceCheckUtils]: 34: Hoare triple {53990#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53990#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:16,889 INFO L273 TraceCheckUtils]: 35: Hoare triple {53990#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53991#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:16,890 INFO L273 TraceCheckUtils]: 36: Hoare triple {53991#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53991#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:16,890 INFO L273 TraceCheckUtils]: 37: Hoare triple {53991#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53991#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:16,891 INFO L273 TraceCheckUtils]: 38: Hoare triple {53991#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53992#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:16,892 INFO L273 TraceCheckUtils]: 39: Hoare triple {53992#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53992#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:16,892 INFO L273 TraceCheckUtils]: 40: Hoare triple {53992#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53992#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:16,893 INFO L273 TraceCheckUtils]: 41: Hoare triple {53992#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53993#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:16,893 INFO L273 TraceCheckUtils]: 42: Hoare triple {53993#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53993#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:16,894 INFO L273 TraceCheckUtils]: 43: Hoare triple {53993#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53993#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:16,894 INFO L273 TraceCheckUtils]: 44: Hoare triple {53993#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53994#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:16,895 INFO L273 TraceCheckUtils]: 45: Hoare triple {53994#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53994#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:16,895 INFO L273 TraceCheckUtils]: 46: Hoare triple {53994#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53994#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:16,896 INFO L273 TraceCheckUtils]: 47: Hoare triple {53994#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53995#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:16,896 INFO L273 TraceCheckUtils]: 48: Hoare triple {53995#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53995#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:16,897 INFO L273 TraceCheckUtils]: 49: Hoare triple {53995#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53995#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:16,898 INFO L273 TraceCheckUtils]: 50: Hoare triple {53995#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53996#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:16,898 INFO L273 TraceCheckUtils]: 51: Hoare triple {53996#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53996#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:16,899 INFO L273 TraceCheckUtils]: 52: Hoare triple {53996#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53996#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:16,899 INFO L273 TraceCheckUtils]: 53: Hoare triple {53996#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53997#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:16,900 INFO L273 TraceCheckUtils]: 54: Hoare triple {53997#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53997#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:16,900 INFO L273 TraceCheckUtils]: 55: Hoare triple {53997#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53997#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:16,901 INFO L273 TraceCheckUtils]: 56: Hoare triple {53997#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53998#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:16,901 INFO L273 TraceCheckUtils]: 57: Hoare triple {53998#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53998#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:16,902 INFO L273 TraceCheckUtils]: 58: Hoare triple {53998#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53998#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:16,902 INFO L273 TraceCheckUtils]: 59: Hoare triple {53998#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53999#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:16,903 INFO L273 TraceCheckUtils]: 60: Hoare triple {53999#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53999#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:16,903 INFO L273 TraceCheckUtils]: 61: Hoare triple {53999#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53999#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:16,904 INFO L273 TraceCheckUtils]: 62: Hoare triple {53999#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54000#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:16,904 INFO L273 TraceCheckUtils]: 63: Hoare triple {54000#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54000#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:16,905 INFO L273 TraceCheckUtils]: 64: Hoare triple {54000#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54000#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:16,906 INFO L273 TraceCheckUtils]: 65: Hoare triple {54000#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54001#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:16,906 INFO L273 TraceCheckUtils]: 66: Hoare triple {54001#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54001#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:16,907 INFO L273 TraceCheckUtils]: 67: Hoare triple {54001#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54001#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:16,907 INFO L273 TraceCheckUtils]: 68: Hoare triple {54001#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54002#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:16,908 INFO L273 TraceCheckUtils]: 69: Hoare triple {54002#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54002#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:16,908 INFO L273 TraceCheckUtils]: 70: Hoare triple {54002#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54002#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:16,909 INFO L273 TraceCheckUtils]: 71: Hoare triple {54002#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54003#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:16,909 INFO L273 TraceCheckUtils]: 72: Hoare triple {54003#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54003#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:16,910 INFO L273 TraceCheckUtils]: 73: Hoare triple {54003#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54003#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:16,910 INFO L273 TraceCheckUtils]: 74: Hoare triple {54003#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54004#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:16,911 INFO L273 TraceCheckUtils]: 75: Hoare triple {54004#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54004#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:16,911 INFO L273 TraceCheckUtils]: 76: Hoare triple {54004#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54004#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:16,912 INFO L273 TraceCheckUtils]: 77: Hoare triple {54004#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54005#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:16,912 INFO L273 TraceCheckUtils]: 78: Hoare triple {54005#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54005#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:16,913 INFO L273 TraceCheckUtils]: 79: Hoare triple {54005#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54005#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:16,914 INFO L273 TraceCheckUtils]: 80: Hoare triple {54005#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54006#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:16,914 INFO L273 TraceCheckUtils]: 81: Hoare triple {54006#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54006#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:16,914 INFO L273 TraceCheckUtils]: 82: Hoare triple {54006#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54006#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:16,915 INFO L273 TraceCheckUtils]: 83: Hoare triple {54006#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54007#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:16,916 INFO L273 TraceCheckUtils]: 84: Hoare triple {54007#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54007#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:16,916 INFO L273 TraceCheckUtils]: 85: Hoare triple {54007#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54007#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:16,917 INFO L273 TraceCheckUtils]: 86: Hoare triple {54007#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54008#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:16,917 INFO L273 TraceCheckUtils]: 87: Hoare triple {54008#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54008#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:16,918 INFO L273 TraceCheckUtils]: 88: Hoare triple {54008#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54008#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:16,918 INFO L273 TraceCheckUtils]: 89: Hoare triple {54008#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54009#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:16,919 INFO L273 TraceCheckUtils]: 90: Hoare triple {54009#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54009#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:16,919 INFO L273 TraceCheckUtils]: 91: Hoare triple {54009#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54009#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:16,920 INFO L273 TraceCheckUtils]: 92: Hoare triple {54009#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54010#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:16,921 INFO L273 TraceCheckUtils]: 93: Hoare triple {54010#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54010#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:16,921 INFO L273 TraceCheckUtils]: 94: Hoare triple {54010#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54010#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:16,922 INFO L273 TraceCheckUtils]: 95: Hoare triple {54010#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54011#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:16,922 INFO L273 TraceCheckUtils]: 96: Hoare triple {54011#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54011#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:16,923 INFO L273 TraceCheckUtils]: 97: Hoare triple {54011#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54011#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:16,923 INFO L273 TraceCheckUtils]: 98: Hoare triple {54011#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54012#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:16,924 INFO L273 TraceCheckUtils]: 99: Hoare triple {54012#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54012#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:16,924 INFO L273 TraceCheckUtils]: 100: Hoare triple {54012#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54012#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:16,925 INFO L273 TraceCheckUtils]: 101: Hoare triple {54012#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54013#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:16,925 INFO L273 TraceCheckUtils]: 102: Hoare triple {54013#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54013#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:16,926 INFO L273 TraceCheckUtils]: 103: Hoare triple {54013#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54013#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:16,927 INFO L273 TraceCheckUtils]: 104: Hoare triple {54013#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54014#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:16,927 INFO L273 TraceCheckUtils]: 105: Hoare triple {54014#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54014#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:16,927 INFO L273 TraceCheckUtils]: 106: Hoare triple {54014#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54014#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:16,928 INFO L273 TraceCheckUtils]: 107: Hoare triple {54014#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54015#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:16,929 INFO L273 TraceCheckUtils]: 108: Hoare triple {54015#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54015#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:16,929 INFO L273 TraceCheckUtils]: 109: Hoare triple {54015#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54015#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:16,930 INFO L273 TraceCheckUtils]: 110: Hoare triple {54015#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54016#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:16,930 INFO L273 TraceCheckUtils]: 111: Hoare triple {54016#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54016#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:16,931 INFO L273 TraceCheckUtils]: 112: Hoare triple {54016#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54016#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:16,931 INFO L273 TraceCheckUtils]: 113: Hoare triple {54016#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54017#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:16,932 INFO L273 TraceCheckUtils]: 114: Hoare triple {54017#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54017#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:16,932 INFO L273 TraceCheckUtils]: 115: Hoare triple {54017#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54017#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:16,933 INFO L273 TraceCheckUtils]: 116: Hoare triple {54017#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54018#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:16,933 INFO L273 TraceCheckUtils]: 117: Hoare triple {54018#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54018#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:16,934 INFO L273 TraceCheckUtils]: 118: Hoare triple {54018#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54018#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:16,935 INFO L273 TraceCheckUtils]: 119: Hoare triple {54018#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54019#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:16,935 INFO L273 TraceCheckUtils]: 120: Hoare triple {54019#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54019#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:16,935 INFO L273 TraceCheckUtils]: 121: Hoare triple {54019#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54019#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:16,936 INFO L273 TraceCheckUtils]: 122: Hoare triple {54019#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54020#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:16,937 INFO L273 TraceCheckUtils]: 123: Hoare triple {54020#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54020#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:16,937 INFO L273 TraceCheckUtils]: 124: Hoare triple {54020#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54020#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:16,938 INFO L273 TraceCheckUtils]: 125: Hoare triple {54020#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54021#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:16,938 INFO L273 TraceCheckUtils]: 126: Hoare triple {54021#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54021#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:16,939 INFO L273 TraceCheckUtils]: 127: Hoare triple {54021#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54021#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:16,939 INFO L273 TraceCheckUtils]: 128: Hoare triple {54021#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54022#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:16,940 INFO L273 TraceCheckUtils]: 129: Hoare triple {54022#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54022#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:16,940 INFO L273 TraceCheckUtils]: 130: Hoare triple {54022#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54022#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:16,941 INFO L273 TraceCheckUtils]: 131: Hoare triple {54022#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54023#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:16,942 INFO L273 TraceCheckUtils]: 132: Hoare triple {54023#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54023#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:16,942 INFO L273 TraceCheckUtils]: 133: Hoare triple {54023#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54023#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:16,943 INFO L273 TraceCheckUtils]: 134: Hoare triple {54023#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54024#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:16,943 INFO L273 TraceCheckUtils]: 135: Hoare triple {54024#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54024#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:16,944 INFO L273 TraceCheckUtils]: 136: Hoare triple {54024#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54024#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:16,945 INFO L273 TraceCheckUtils]: 137: Hoare triple {54024#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54025#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:16,945 INFO L273 TraceCheckUtils]: 138: Hoare triple {54025#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54025#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:16,946 INFO L273 TraceCheckUtils]: 139: Hoare triple {54025#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54025#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:16,946 INFO L273 TraceCheckUtils]: 140: Hoare triple {54025#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54026#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:16,947 INFO L273 TraceCheckUtils]: 141: Hoare triple {54026#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54026#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:16,947 INFO L273 TraceCheckUtils]: 142: Hoare triple {54026#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54026#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:16,948 INFO L273 TraceCheckUtils]: 143: Hoare triple {54026#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54027#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:16,948 INFO L273 TraceCheckUtils]: 144: Hoare triple {54027#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54027#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:16,949 INFO L273 TraceCheckUtils]: 145: Hoare triple {54027#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54027#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:16,950 INFO L273 TraceCheckUtils]: 146: Hoare triple {54027#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54028#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:16,950 INFO L273 TraceCheckUtils]: 147: Hoare triple {54028#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54028#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:16,951 INFO L273 TraceCheckUtils]: 148: Hoare triple {54028#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54028#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:16,951 INFO L273 TraceCheckUtils]: 149: Hoare triple {54028#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54029#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:16,952 INFO L273 TraceCheckUtils]: 150: Hoare triple {54029#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54029#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:16,952 INFO L273 TraceCheckUtils]: 151: Hoare triple {54029#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54029#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:16,953 INFO L273 TraceCheckUtils]: 152: Hoare triple {54029#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54030#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:16,954 INFO L273 TraceCheckUtils]: 153: Hoare triple {54030#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54030#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:16,954 INFO L273 TraceCheckUtils]: 154: Hoare triple {54030#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54030#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:16,955 INFO L273 TraceCheckUtils]: 155: Hoare triple {54030#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54031#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:16,955 INFO L273 TraceCheckUtils]: 156: Hoare triple {54031#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54031#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:16,956 INFO L273 TraceCheckUtils]: 157: Hoare triple {54031#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54031#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:16,956 INFO L273 TraceCheckUtils]: 158: Hoare triple {54031#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54032#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:16,957 INFO L273 TraceCheckUtils]: 159: Hoare triple {54032#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54032#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:16,957 INFO L273 TraceCheckUtils]: 160: Hoare triple {54032#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54032#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:16,958 INFO L273 TraceCheckUtils]: 161: Hoare triple {54032#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54033#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:16,959 INFO L273 TraceCheckUtils]: 162: Hoare triple {54033#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54033#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:16,959 INFO L273 TraceCheckUtils]: 163: Hoare triple {54033#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54033#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:16,960 INFO L273 TraceCheckUtils]: 164: Hoare triple {54033#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54034#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:16,960 INFO L273 TraceCheckUtils]: 165: Hoare triple {54034#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54034#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:16,961 INFO L273 TraceCheckUtils]: 166: Hoare triple {54034#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54034#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:16,962 INFO L273 TraceCheckUtils]: 167: Hoare triple {54034#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54035#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:16,962 INFO L273 TraceCheckUtils]: 168: Hoare triple {54035#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54035#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:16,963 INFO L273 TraceCheckUtils]: 169: Hoare triple {54035#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54035#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:16,963 INFO L273 TraceCheckUtils]: 170: Hoare triple {54035#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54036#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:16,964 INFO L273 TraceCheckUtils]: 171: Hoare triple {54036#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54036#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:16,964 INFO L273 TraceCheckUtils]: 172: Hoare triple {54036#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54036#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:16,965 INFO L273 TraceCheckUtils]: 173: Hoare triple {54036#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54037#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:16,966 INFO L273 TraceCheckUtils]: 174: Hoare triple {54037#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54037#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:16,966 INFO L273 TraceCheckUtils]: 175: Hoare triple {54037#(<= main_~i~0 57)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54037#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:16,967 INFO L273 TraceCheckUtils]: 176: Hoare triple {54037#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54038#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:16,967 INFO L273 TraceCheckUtils]: 177: Hoare triple {54038#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54038#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:16,968 INFO L273 TraceCheckUtils]: 178: Hoare triple {54038#(<= main_~i~0 58)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54038#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:16,968 INFO L273 TraceCheckUtils]: 179: Hoare triple {54038#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54039#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:16,969 INFO L273 TraceCheckUtils]: 180: Hoare triple {54039#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54039#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:16,969 INFO L273 TraceCheckUtils]: 181: Hoare triple {54039#(<= main_~i~0 59)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54039#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:16,970 INFO L273 TraceCheckUtils]: 182: Hoare triple {54039#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54040#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:16,971 INFO L273 TraceCheckUtils]: 183: Hoare triple {54040#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54040#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:16,971 INFO L273 TraceCheckUtils]: 184: Hoare triple {54040#(<= main_~i~0 60)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54040#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:16,972 INFO L273 TraceCheckUtils]: 185: Hoare triple {54040#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54041#(<= main_~i~0 61)} is VALID [2018-11-23 12:01:16,972 INFO L273 TraceCheckUtils]: 186: Hoare triple {54041#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54041#(<= main_~i~0 61)} is VALID [2018-11-23 12:01:16,973 INFO L273 TraceCheckUtils]: 187: Hoare triple {54041#(<= main_~i~0 61)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54041#(<= main_~i~0 61)} is VALID [2018-11-23 12:01:16,973 INFO L273 TraceCheckUtils]: 188: Hoare triple {54041#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54042#(<= main_~i~0 62)} is VALID [2018-11-23 12:01:16,974 INFO L273 TraceCheckUtils]: 189: Hoare triple {54042#(<= main_~i~0 62)} assume !(~i~0 < 100000); {53980#false} is VALID [2018-11-23 12:01:16,974 INFO L273 TraceCheckUtils]: 190: Hoare triple {53980#false} havoc ~x~0;~x~0 := 0; {53980#false} is VALID [2018-11-23 12:01:16,975 INFO L273 TraceCheckUtils]: 191: Hoare triple {53980#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {53980#false} is VALID [2018-11-23 12:01:16,975 INFO L256 TraceCheckUtils]: 192: Hoare triple {53980#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {53980#false} is VALID [2018-11-23 12:01:16,975 INFO L273 TraceCheckUtils]: 193: Hoare triple {53980#false} ~cond := #in~cond; {53980#false} is VALID [2018-11-23 12:01:16,975 INFO L273 TraceCheckUtils]: 194: Hoare triple {53980#false} assume 0 == ~cond; {53980#false} is VALID [2018-11-23 12:01:16,975 INFO L273 TraceCheckUtils]: 195: Hoare triple {53980#false} assume !false; {53980#false} is VALID [2018-11-23 12:01:17,000 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 12:01:17,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:17,000 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 12:01:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:17,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:17,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {53979#true} call ULTIMATE.init(); {53979#true} is VALID [2018-11-23 12:01:17,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {53979#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53979#true} is VALID [2018-11-23 12:01:17,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {53979#true} assume true; {53979#true} is VALID [2018-11-23 12:01:17,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53979#true} {53979#true} #54#return; {53979#true} is VALID [2018-11-23 12:01:17,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {53979#true} call #t~ret6 := main(); {53979#true} is VALID [2018-11-23 12:01:17,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {53979#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {53981#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:17,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {53981#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53981#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:17,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {53981#(<= main_~i~0 1)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53981#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:17,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {53981#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53982#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:17,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {53982#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53982#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:17,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {53982#(<= main_~i~0 2)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53982#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:17,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {53982#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53983#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:17,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {53983#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53983#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:17,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {53983#(<= main_~i~0 3)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53983#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:17,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {53983#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53984#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:17,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {53984#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53984#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:17,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {53984#(<= main_~i~0 4)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53984#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:17,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {53984#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53985#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:17,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {53985#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53985#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:17,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {53985#(<= main_~i~0 5)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53985#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:17,529 INFO L273 TraceCheckUtils]: 20: Hoare triple {53985#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53986#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:17,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {53986#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53986#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:17,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {53986#(<= main_~i~0 6)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53986#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:17,531 INFO L273 TraceCheckUtils]: 23: Hoare triple {53986#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53987#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:17,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {53987#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53987#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:17,532 INFO L273 TraceCheckUtils]: 25: Hoare triple {53987#(<= main_~i~0 7)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53987#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:17,533 INFO L273 TraceCheckUtils]: 26: Hoare triple {53987#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53988#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:17,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {53988#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53988#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:17,534 INFO L273 TraceCheckUtils]: 28: Hoare triple {53988#(<= main_~i~0 8)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53988#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:17,534 INFO L273 TraceCheckUtils]: 29: Hoare triple {53988#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53989#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:17,535 INFO L273 TraceCheckUtils]: 30: Hoare triple {53989#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53989#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:17,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {53989#(<= main_~i~0 9)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53989#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:17,536 INFO L273 TraceCheckUtils]: 32: Hoare triple {53989#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53990#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:17,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {53990#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53990#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:17,537 INFO L273 TraceCheckUtils]: 34: Hoare triple {53990#(<= main_~i~0 10)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53990#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:17,538 INFO L273 TraceCheckUtils]: 35: Hoare triple {53990#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53991#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:17,538 INFO L273 TraceCheckUtils]: 36: Hoare triple {53991#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53991#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:17,539 INFO L273 TraceCheckUtils]: 37: Hoare triple {53991#(<= main_~i~0 11)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53991#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:17,540 INFO L273 TraceCheckUtils]: 38: Hoare triple {53991#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53992#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:17,540 INFO L273 TraceCheckUtils]: 39: Hoare triple {53992#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53992#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:17,541 INFO L273 TraceCheckUtils]: 40: Hoare triple {53992#(<= main_~i~0 12)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53992#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:17,541 INFO L273 TraceCheckUtils]: 41: Hoare triple {53992#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53993#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:17,542 INFO L273 TraceCheckUtils]: 42: Hoare triple {53993#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53993#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:17,542 INFO L273 TraceCheckUtils]: 43: Hoare triple {53993#(<= main_~i~0 13)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53993#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:17,543 INFO L273 TraceCheckUtils]: 44: Hoare triple {53993#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53994#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:17,543 INFO L273 TraceCheckUtils]: 45: Hoare triple {53994#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53994#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:17,544 INFO L273 TraceCheckUtils]: 46: Hoare triple {53994#(<= main_~i~0 14)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53994#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:17,545 INFO L273 TraceCheckUtils]: 47: Hoare triple {53994#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53995#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:17,545 INFO L273 TraceCheckUtils]: 48: Hoare triple {53995#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53995#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:17,546 INFO L273 TraceCheckUtils]: 49: Hoare triple {53995#(<= main_~i~0 15)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53995#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:17,546 INFO L273 TraceCheckUtils]: 50: Hoare triple {53995#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53996#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:17,547 INFO L273 TraceCheckUtils]: 51: Hoare triple {53996#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53996#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:17,547 INFO L273 TraceCheckUtils]: 52: Hoare triple {53996#(<= main_~i~0 16)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53996#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:17,548 INFO L273 TraceCheckUtils]: 53: Hoare triple {53996#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53997#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:17,549 INFO L273 TraceCheckUtils]: 54: Hoare triple {53997#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53997#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:17,549 INFO L273 TraceCheckUtils]: 55: Hoare triple {53997#(<= main_~i~0 17)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53997#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:17,550 INFO L273 TraceCheckUtils]: 56: Hoare triple {53997#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53998#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:17,550 INFO L273 TraceCheckUtils]: 57: Hoare triple {53998#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53998#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:17,551 INFO L273 TraceCheckUtils]: 58: Hoare triple {53998#(<= main_~i~0 18)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53998#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:17,551 INFO L273 TraceCheckUtils]: 59: Hoare triple {53998#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53999#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:17,552 INFO L273 TraceCheckUtils]: 60: Hoare triple {53999#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53999#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:17,552 INFO L273 TraceCheckUtils]: 61: Hoare triple {53999#(<= main_~i~0 19)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {53999#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:17,553 INFO L273 TraceCheckUtils]: 62: Hoare triple {53999#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54000#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:17,554 INFO L273 TraceCheckUtils]: 63: Hoare triple {54000#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54000#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:17,554 INFO L273 TraceCheckUtils]: 64: Hoare triple {54000#(<= main_~i~0 20)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54000#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:17,555 INFO L273 TraceCheckUtils]: 65: Hoare triple {54000#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54001#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:17,555 INFO L273 TraceCheckUtils]: 66: Hoare triple {54001#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54001#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:17,556 INFO L273 TraceCheckUtils]: 67: Hoare triple {54001#(<= main_~i~0 21)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54001#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:17,557 INFO L273 TraceCheckUtils]: 68: Hoare triple {54001#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54002#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:17,557 INFO L273 TraceCheckUtils]: 69: Hoare triple {54002#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54002#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:17,558 INFO L273 TraceCheckUtils]: 70: Hoare triple {54002#(<= main_~i~0 22)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54002#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:17,558 INFO L273 TraceCheckUtils]: 71: Hoare triple {54002#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54003#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:17,559 INFO L273 TraceCheckUtils]: 72: Hoare triple {54003#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54003#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:17,559 INFO L273 TraceCheckUtils]: 73: Hoare triple {54003#(<= main_~i~0 23)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54003#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:17,560 INFO L273 TraceCheckUtils]: 74: Hoare triple {54003#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54004#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:17,561 INFO L273 TraceCheckUtils]: 75: Hoare triple {54004#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54004#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:17,561 INFO L273 TraceCheckUtils]: 76: Hoare triple {54004#(<= main_~i~0 24)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54004#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:17,562 INFO L273 TraceCheckUtils]: 77: Hoare triple {54004#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54005#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:17,562 INFO L273 TraceCheckUtils]: 78: Hoare triple {54005#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54005#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:17,563 INFO L273 TraceCheckUtils]: 79: Hoare triple {54005#(<= main_~i~0 25)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54005#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:17,563 INFO L273 TraceCheckUtils]: 80: Hoare triple {54005#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54006#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:17,564 INFO L273 TraceCheckUtils]: 81: Hoare triple {54006#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54006#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:17,564 INFO L273 TraceCheckUtils]: 82: Hoare triple {54006#(<= main_~i~0 26)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54006#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:17,565 INFO L273 TraceCheckUtils]: 83: Hoare triple {54006#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54007#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:17,566 INFO L273 TraceCheckUtils]: 84: Hoare triple {54007#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54007#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:17,566 INFO L273 TraceCheckUtils]: 85: Hoare triple {54007#(<= main_~i~0 27)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54007#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:17,567 INFO L273 TraceCheckUtils]: 86: Hoare triple {54007#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54008#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:17,567 INFO L273 TraceCheckUtils]: 87: Hoare triple {54008#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54008#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:17,568 INFO L273 TraceCheckUtils]: 88: Hoare triple {54008#(<= main_~i~0 28)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54008#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:17,569 INFO L273 TraceCheckUtils]: 89: Hoare triple {54008#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54009#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:17,569 INFO L273 TraceCheckUtils]: 90: Hoare triple {54009#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54009#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:17,570 INFO L273 TraceCheckUtils]: 91: Hoare triple {54009#(<= main_~i~0 29)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54009#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:17,570 INFO L273 TraceCheckUtils]: 92: Hoare triple {54009#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54010#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:17,571 INFO L273 TraceCheckUtils]: 93: Hoare triple {54010#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54010#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:17,571 INFO L273 TraceCheckUtils]: 94: Hoare triple {54010#(<= main_~i~0 30)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54010#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:17,572 INFO L273 TraceCheckUtils]: 95: Hoare triple {54010#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54011#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:17,572 INFO L273 TraceCheckUtils]: 96: Hoare triple {54011#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54011#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:17,573 INFO L273 TraceCheckUtils]: 97: Hoare triple {54011#(<= main_~i~0 31)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54011#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:17,574 INFO L273 TraceCheckUtils]: 98: Hoare triple {54011#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54012#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:17,574 INFO L273 TraceCheckUtils]: 99: Hoare triple {54012#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54012#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 100: Hoare triple {54012#(<= main_~i~0 32)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54012#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 101: Hoare triple {54012#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54013#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 102: Hoare triple {54013#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54013#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 103: Hoare triple {54013#(<= main_~i~0 33)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54013#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:17,577 INFO L273 TraceCheckUtils]: 104: Hoare triple {54013#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54014#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:17,578 INFO L273 TraceCheckUtils]: 105: Hoare triple {54014#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54014#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:17,578 INFO L273 TraceCheckUtils]: 106: Hoare triple {54014#(<= main_~i~0 34)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54014#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:17,579 INFO L273 TraceCheckUtils]: 107: Hoare triple {54014#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54015#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:17,579 INFO L273 TraceCheckUtils]: 108: Hoare triple {54015#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54015#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 109: Hoare triple {54015#(<= main_~i~0 35)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54015#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 110: Hoare triple {54015#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54016#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 111: Hoare triple {54016#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54016#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 112: Hoare triple {54016#(<= main_~i~0 36)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54016#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:17,582 INFO L273 TraceCheckUtils]: 113: Hoare triple {54016#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54017#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 114: Hoare triple {54017#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54017#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 115: Hoare triple {54017#(<= main_~i~0 37)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54017#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 116: Hoare triple {54017#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54018#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 117: Hoare triple {54018#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54018#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 118: Hoare triple {54018#(<= main_~i~0 38)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54018#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 119: Hoare triple {54018#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54019#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:17,586 INFO L273 TraceCheckUtils]: 120: Hoare triple {54019#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54019#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:17,586 INFO L273 TraceCheckUtils]: 121: Hoare triple {54019#(<= main_~i~0 39)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54019#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:17,587 INFO L273 TraceCheckUtils]: 122: Hoare triple {54019#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54020#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:17,587 INFO L273 TraceCheckUtils]: 123: Hoare triple {54020#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54020#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:17,588 INFO L273 TraceCheckUtils]: 124: Hoare triple {54020#(<= main_~i~0 40)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54020#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:17,588 INFO L273 TraceCheckUtils]: 125: Hoare triple {54020#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54021#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:17,589 INFO L273 TraceCheckUtils]: 126: Hoare triple {54021#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54021#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:17,589 INFO L273 TraceCheckUtils]: 127: Hoare triple {54021#(<= main_~i~0 41)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54021#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:17,590 INFO L273 TraceCheckUtils]: 128: Hoare triple {54021#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54022#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:17,591 INFO L273 TraceCheckUtils]: 129: Hoare triple {54022#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54022#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:17,591 INFO L273 TraceCheckUtils]: 130: Hoare triple {54022#(<= main_~i~0 42)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54022#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:17,592 INFO L273 TraceCheckUtils]: 131: Hoare triple {54022#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54023#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:17,592 INFO L273 TraceCheckUtils]: 132: Hoare triple {54023#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54023#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:17,593 INFO L273 TraceCheckUtils]: 133: Hoare triple {54023#(<= main_~i~0 43)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54023#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:17,593 INFO L273 TraceCheckUtils]: 134: Hoare triple {54023#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54024#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:17,594 INFO L273 TraceCheckUtils]: 135: Hoare triple {54024#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54024#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:17,594 INFO L273 TraceCheckUtils]: 136: Hoare triple {54024#(<= main_~i~0 44)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54024#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:17,595 INFO L273 TraceCheckUtils]: 137: Hoare triple {54024#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54025#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:17,595 INFO L273 TraceCheckUtils]: 138: Hoare triple {54025#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54025#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:17,596 INFO L273 TraceCheckUtils]: 139: Hoare triple {54025#(<= main_~i~0 45)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54025#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:17,596 INFO L273 TraceCheckUtils]: 140: Hoare triple {54025#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54026#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:17,597 INFO L273 TraceCheckUtils]: 141: Hoare triple {54026#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54026#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:17,597 INFO L273 TraceCheckUtils]: 142: Hoare triple {54026#(<= main_~i~0 46)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54026#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:17,598 INFO L273 TraceCheckUtils]: 143: Hoare triple {54026#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54027#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:17,599 INFO L273 TraceCheckUtils]: 144: Hoare triple {54027#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54027#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:17,599 INFO L273 TraceCheckUtils]: 145: Hoare triple {54027#(<= main_~i~0 47)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54027#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:17,600 INFO L273 TraceCheckUtils]: 146: Hoare triple {54027#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54028#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:17,600 INFO L273 TraceCheckUtils]: 147: Hoare triple {54028#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54028#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:17,601 INFO L273 TraceCheckUtils]: 148: Hoare triple {54028#(<= main_~i~0 48)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54028#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:17,601 INFO L273 TraceCheckUtils]: 149: Hoare triple {54028#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54029#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:17,602 INFO L273 TraceCheckUtils]: 150: Hoare triple {54029#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54029#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:17,602 INFO L273 TraceCheckUtils]: 151: Hoare triple {54029#(<= main_~i~0 49)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54029#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:17,603 INFO L273 TraceCheckUtils]: 152: Hoare triple {54029#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54030#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:17,603 INFO L273 TraceCheckUtils]: 153: Hoare triple {54030#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54030#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:17,604 INFO L273 TraceCheckUtils]: 154: Hoare triple {54030#(<= main_~i~0 50)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54030#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:17,605 INFO L273 TraceCheckUtils]: 155: Hoare triple {54030#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54031#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:17,605 INFO L273 TraceCheckUtils]: 156: Hoare triple {54031#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54031#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:17,605 INFO L273 TraceCheckUtils]: 157: Hoare triple {54031#(<= main_~i~0 51)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54031#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:17,606 INFO L273 TraceCheckUtils]: 158: Hoare triple {54031#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54032#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:17,607 INFO L273 TraceCheckUtils]: 159: Hoare triple {54032#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54032#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:17,607 INFO L273 TraceCheckUtils]: 160: Hoare triple {54032#(<= main_~i~0 52)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54032#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:17,608 INFO L273 TraceCheckUtils]: 161: Hoare triple {54032#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54033#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:17,608 INFO L273 TraceCheckUtils]: 162: Hoare triple {54033#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54033#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:17,609 INFO L273 TraceCheckUtils]: 163: Hoare triple {54033#(<= main_~i~0 53)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54033#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:17,609 INFO L273 TraceCheckUtils]: 164: Hoare triple {54033#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54034#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:17,610 INFO L273 TraceCheckUtils]: 165: Hoare triple {54034#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54034#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:17,610 INFO L273 TraceCheckUtils]: 166: Hoare triple {54034#(<= main_~i~0 54)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54034#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:17,611 INFO L273 TraceCheckUtils]: 167: Hoare triple {54034#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54035#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:17,611 INFO L273 TraceCheckUtils]: 168: Hoare triple {54035#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54035#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:17,612 INFO L273 TraceCheckUtils]: 169: Hoare triple {54035#(<= main_~i~0 55)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54035#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:17,612 INFO L273 TraceCheckUtils]: 170: Hoare triple {54035#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54036#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:17,613 INFO L273 TraceCheckUtils]: 171: Hoare triple {54036#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54036#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:17,613 INFO L273 TraceCheckUtils]: 172: Hoare triple {54036#(<= main_~i~0 56)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54036#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:17,614 INFO L273 TraceCheckUtils]: 173: Hoare triple {54036#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54037#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:17,615 INFO L273 TraceCheckUtils]: 174: Hoare triple {54037#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54037#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:17,615 INFO L273 TraceCheckUtils]: 175: Hoare triple {54037#(<= main_~i~0 57)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54037#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:17,616 INFO L273 TraceCheckUtils]: 176: Hoare triple {54037#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54038#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:17,616 INFO L273 TraceCheckUtils]: 177: Hoare triple {54038#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54038#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:17,617 INFO L273 TraceCheckUtils]: 178: Hoare triple {54038#(<= main_~i~0 58)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54038#(<= main_~i~0 58)} is VALID [2018-11-23 12:01:17,617 INFO L273 TraceCheckUtils]: 179: Hoare triple {54038#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54039#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:17,618 INFO L273 TraceCheckUtils]: 180: Hoare triple {54039#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54039#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:17,618 INFO L273 TraceCheckUtils]: 181: Hoare triple {54039#(<= main_~i~0 59)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54039#(<= main_~i~0 59)} is VALID [2018-11-23 12:01:17,619 INFO L273 TraceCheckUtils]: 182: Hoare triple {54039#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54040#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:17,619 INFO L273 TraceCheckUtils]: 183: Hoare triple {54040#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54040#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:17,620 INFO L273 TraceCheckUtils]: 184: Hoare triple {54040#(<= main_~i~0 60)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54040#(<= main_~i~0 60)} is VALID [2018-11-23 12:01:17,620 INFO L273 TraceCheckUtils]: 185: Hoare triple {54040#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54041#(<= main_~i~0 61)} is VALID [2018-11-23 12:01:17,621 INFO L273 TraceCheckUtils]: 186: Hoare triple {54041#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {54041#(<= main_~i~0 61)} is VALID [2018-11-23 12:01:17,621 INFO L273 TraceCheckUtils]: 187: Hoare triple {54041#(<= main_~i~0 61)} assume ~largest~0 < #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest~0 := #t~mem3;havoc #t~mem3; {54041#(<= main_~i~0 61)} is VALID [2018-11-23 12:01:17,622 INFO L273 TraceCheckUtils]: 188: Hoare triple {54041#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54042#(<= main_~i~0 62)} is VALID [2018-11-23 12:01:17,623 INFO L273 TraceCheckUtils]: 189: Hoare triple {54042#(<= main_~i~0 62)} assume !(~i~0 < 100000); {53980#false} is VALID [2018-11-23 12:01:17,623 INFO L273 TraceCheckUtils]: 190: Hoare triple {53980#false} havoc ~x~0;~x~0 := 0; {53980#false} is VALID [2018-11-23 12:01:17,623 INFO L273 TraceCheckUtils]: 191: Hoare triple {53980#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {53980#false} is VALID [2018-11-23 12:01:17,623 INFO L256 TraceCheckUtils]: 192: Hoare triple {53980#false} call __VERIFIER_assert((if ~largest~0 >= #t~mem5 then 1 else 0)); {53980#false} is VALID [2018-11-23 12:01:17,623 INFO L273 TraceCheckUtils]: 193: Hoare triple {53980#false} ~cond := #in~cond; {53980#false} is VALID [2018-11-23 12:01:17,623 INFO L273 TraceCheckUtils]: 194: Hoare triple {53980#false} assume 0 == ~cond; {53980#false} is VALID [2018-11-23 12:01:17,624 INFO L273 TraceCheckUtils]: 195: Hoare triple {53980#false} assume !false; {53980#false} is VALID [2018-11-23 12:01:17,648 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 12:01:17,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:17,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-11-23 12:01:17,667 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 196 [2018-11-23 12:01:17,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:17,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states.