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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-examples/sanfoundry_02_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:41:19,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:41:19,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:41:19,844 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:41:19,844 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:41:19,845 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:41:19,847 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:41:19,849 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:41:19,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:41:19,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:41:19,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:41:19,853 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:41:19,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:41:19,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:41:19,856 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:41:19,856 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:41:19,857 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:41:19,865 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:41:19,867 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:41:19,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:41:19,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:41:19,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:41:19,882 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:41:19,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:41:19,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:41:19,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:41:19,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:41:19,887 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:41:19,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:41:19,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:41:19,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:41:19,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:41:19,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:41:19,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:41:19,897 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:41:19,898 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:41:19,898 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:41:19,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:41:19,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:41:19,930 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:41:19,930 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:41:19,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:41:19,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:41:19,931 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:41:19,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:41:19,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:41:19,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:41:19,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:41:19,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:41:19,933 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:41:19,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:41:19,934 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:41:19,934 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:41:19,934 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:41:19,934 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:41:19,934 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:41:19,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:41:19,935 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:41:19,935 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:41:19,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:41:19,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:41:19,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:41:19,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:41:19,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:41:19,936 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:41:19,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:41:19,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:41:19,938 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:41:20,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:41:20,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:41:20,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:41:20,026 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:41:20,026 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:41:20,027 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_02_true-unreach-call_ground.i [2018-11-14 18:41:20,089 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/209322536/d3aee2772ee5479297edd769070f675a/FLAG21675ffcd [2018-11-14 18:41:20,502 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:41:20,503 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_02_true-unreach-call_ground.i [2018-11-14 18:41:20,510 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/209322536/d3aee2772ee5479297edd769070f675a/FLAG21675ffcd [2018-11-14 18:41:20,526 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/209322536/d3aee2772ee5479297edd769070f675a [2018-11-14 18:41:20,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:41:20,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:41:20,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:41:20,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:41:20,543 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:41:20,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425d5bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20, skipping insertion in model container [2018-11-14 18:41:20,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:41:20,591 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:41:20,840 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:41:20,844 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:41:20,881 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:41:20,914 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:41:20,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20 WrapperNode [2018-11-14 18:41:20,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:41:20,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:41:20,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:41:20,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:41:20,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (1/1) ... [2018-11-14 18:41:20,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:41:20,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:41:20,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:41:20,995 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:41:20,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (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-14 18:41:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:41:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:41:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:41:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:41:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:41:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:41:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:41:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:41:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:41:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:41:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:41:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:41:21,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:41:21,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:41:21,905 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:41:21,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:41:21 BoogieIcfgContainer [2018-11-14 18:41:21,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:41:21,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:41:21,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:41:21,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:41:21,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:41:20" (1/3) ... [2018-11-14 18:41:21,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17613b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:41:21, skipping insertion in model container [2018-11-14 18:41:21,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:20" (2/3) ... [2018-11-14 18:41:21,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17613b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:41:21, skipping insertion in model container [2018-11-14 18:41:21,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:41:21" (3/3) ... [2018-11-14 18:41:21,915 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_02_true-unreach-call_ground.i [2018-11-14 18:41:21,924 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:41:21,932 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:41:21,947 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:41:21,980 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:41:21,981 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:41:21,982 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:41:21,982 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:41:21,982 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:41:21,984 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:41:21,984 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:41:21,984 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:41:21,985 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:41:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-14 18:41:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:41:22,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:22,014 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:22,017 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:22,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1410520056, now seen corresponding path program 1 times [2018-11-14 18:41:22,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:22,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:22,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:22,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:22,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:22,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-14 18:41:22,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40#true} is VALID [2018-11-14 18:41:22,215 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-14 18:41:22,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #91#return; {40#true} is VALID [2018-11-14 18:41:22,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret13 := main(); {40#true} is VALID [2018-11-14 18:41:22,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {40#true} is VALID [2018-11-14 18:41:22,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {40#true} is VALID [2018-11-14 18:41:22,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#true} ~i~0 := 2; {40#true} is VALID [2018-11-14 18:41:22,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-14 18:41:22,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {41#false} havoc ~x~0;~x~0 := 0; {41#false} is VALID [2018-11-14 18:41:22,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-14 18:41:22,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {41#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {41#false} is VALID [2018-11-14 18:41:22,219 INFO L256 TraceCheckUtils]: 12: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {41#false} is VALID [2018-11-14 18:41:22,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2018-11-14 18:41:22,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {41#false} assume ~cond == 0; {41#false} is VALID [2018-11-14 18:41:22,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-14 18:41:22,223 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-14 18:41:22,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:22,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:41:22,232 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:41:22,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:22,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:41:22,457 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-14 18:41:22,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:41:22,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:41:22,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:41:22,472 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-14 18:41:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:22,627 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2018-11-14 18:41:22,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:41:22,628 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:41:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:41:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2018-11-14 18:41:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:41:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2018-11-14 18:41:22,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 80 transitions. [2018-11-14 18:41:22,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:22,937 INFO L225 Difference]: With dead ends: 61 [2018-11-14 18:41:22,937 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 18:41:22,941 INFO L604 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-14 18:41:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 18:41:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 18:41:22,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:22,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 18:41:22,996 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 18:41:22,996 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 18:41:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:23,002 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-11-14 18:41:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-14 18:41:23,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:23,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:23,004 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 18:41:23,004 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 18:41:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:23,010 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-11-14 18:41:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-14 18:41:23,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:23,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:23,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:23,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:41:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-14 18:41:23,017 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 16 [2018-11-14 18:41:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:23,018 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-14 18:41:23,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:41:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-14 18:41:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 18:41:23,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:23,020 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:23,020 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:23,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:23,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1542445492, now seen corresponding path program 1 times [2018-11-14 18:41:23,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:23,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:23,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:23,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:23,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:23,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID [2018-11-14 18:41:23,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {226#true} is VALID [2018-11-14 18:41:23,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-14 18:41:23,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} #91#return; {226#true} is VALID [2018-11-14 18:41:23,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {226#true} call #t~ret13 := main(); {226#true} is VALID [2018-11-14 18:41:23,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {226#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {226#true} is VALID [2018-11-14 18:41:23,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {226#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {226#true} is VALID [2018-11-14 18:41:23,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#true} ~i~0 := 2; {228#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:23,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {228#(<= main_~i~0 2)} assume true; {228#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:23,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {228#(<= main_~i~0 2)} assume !(~i~0 < 100000); {227#false} is VALID [2018-11-14 18:41:23,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {227#false} havoc ~x~0;~x~0 := 0; {227#false} is VALID [2018-11-14 18:41:23,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {227#false} assume true; {227#false} is VALID [2018-11-14 18:41:23,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {227#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {227#false} is VALID [2018-11-14 18:41:23,132 INFO L256 TraceCheckUtils]: 13: Hoare triple {227#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {227#false} is VALID [2018-11-14 18:41:23,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {227#false} ~cond := #in~cond; {227#false} is VALID [2018-11-14 18:41:23,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {227#false} assume ~cond == 0; {227#false} is VALID [2018-11-14 18:41:23,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {227#false} assume !false; {227#false} is VALID [2018-11-14 18:41:23,136 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-14 18:41:23,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:23,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:41:23,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:41:23,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:23,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:41:23,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:23,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:41:23,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:41:23,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:41:23,253 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 3 states. [2018-11-14 18:41:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:23,882 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-14 18:41:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:41:23,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:41:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:41:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-14 18:41:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:41:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-14 18:41:23,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-14 18:41:24,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:24,035 INFO L225 Difference]: With dead ends: 56 [2018-11-14 18:41:24,035 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 18:41:24,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:41:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 18:41:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-11-14 18:41:24,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:24,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2018-11-14 18:41:24,050 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2018-11-14 18:41:24,051 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2018-11-14 18:41:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:24,055 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-14 18:41:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-14 18:41:24,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:24,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:24,057 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2018-11-14 18:41:24,057 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2018-11-14 18:41:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:24,061 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-14 18:41:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-14 18:41:24,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:24,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:24,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:24,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:41:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-14 18:41:24,065 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-11-14 18:41:24,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:24,066 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-14 18:41:24,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:41:24,066 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-14 18:41:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:41:24,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:24,067 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:24,068 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:24,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1351724350, now seen corresponding path program 1 times [2018-11-14 18:41:24,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:24,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:24,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:24,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:24,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2018-11-14 18:41:24,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {422#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {422#true} is VALID [2018-11-14 18:41:24,223 INFO L273 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-14 18:41:24,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #91#return; {422#true} is VALID [2018-11-14 18:41:24,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret13 := main(); {422#true} is VALID [2018-11-14 18:41:24,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {422#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {422#true} is VALID [2018-11-14 18:41:24,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {422#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {422#true} is VALID [2018-11-14 18:41:24,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {422#true} ~i~0 := 2; {424#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:24,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {424#(<= main_~i~0 2)} assume true; {424#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:24,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {424#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {424#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:24,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {424#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {424#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:24,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {424#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {425#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:24,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {425#(<= main_~i~0 3)} assume true; {425#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:24,231 INFO L273 TraceCheckUtils]: 13: Hoare triple {425#(<= main_~i~0 3)} assume !(~i~0 < 100000); {423#false} is VALID [2018-11-14 18:41:24,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {423#false} havoc ~x~0;~x~0 := 0; {423#false} is VALID [2018-11-14 18:41:24,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {423#false} assume true; {423#false} is VALID [2018-11-14 18:41:24,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {423#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {423#false} is VALID [2018-11-14 18:41:24,232 INFO L256 TraceCheckUtils]: 17: Hoare triple {423#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {423#false} is VALID [2018-11-14 18:41:24,233 INFO L273 TraceCheckUtils]: 18: Hoare triple {423#false} ~cond := #in~cond; {423#false} is VALID [2018-11-14 18:41:24,233 INFO L273 TraceCheckUtils]: 19: Hoare triple {423#false} assume ~cond == 0; {423#false} is VALID [2018-11-14 18:41:24,233 INFO L273 TraceCheckUtils]: 20: Hoare triple {423#false} assume !false; {423#false} is VALID [2018-11-14 18:41:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:24,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:24,237 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-14 18:41:24,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:24,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:24,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2018-11-14 18:41:24,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {422#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {422#true} is VALID [2018-11-14 18:41:24,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-14 18:41:24,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #91#return; {422#true} is VALID [2018-11-14 18:41:24,587 INFO L256 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret13 := main(); {422#true} is VALID [2018-11-14 18:41:24,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {422#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {422#true} is VALID [2018-11-14 18:41:24,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {422#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {422#true} is VALID [2018-11-14 18:41:24,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {422#true} ~i~0 := 2; {424#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:24,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {424#(<= main_~i~0 2)} assume true; {424#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:24,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {424#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {424#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:24,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {424#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {424#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:24,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {424#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {425#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:24,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {425#(<= main_~i~0 3)} assume true; {425#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:24,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {425#(<= main_~i~0 3)} assume !(~i~0 < 100000); {423#false} is VALID [2018-11-14 18:41:24,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {423#false} havoc ~x~0;~x~0 := 0; {423#false} is VALID [2018-11-14 18:41:24,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {423#false} assume true; {423#false} is VALID [2018-11-14 18:41:24,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {423#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {423#false} is VALID [2018-11-14 18:41:24,611 INFO L256 TraceCheckUtils]: 17: Hoare triple {423#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {423#false} is VALID [2018-11-14 18:41:24,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {423#false} ~cond := #in~cond; {423#false} is VALID [2018-11-14 18:41:24,612 INFO L273 TraceCheckUtils]: 19: Hoare triple {423#false} assume ~cond == 0; {423#false} is VALID [2018-11-14 18:41:24,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {423#false} assume !false; {423#false} is VALID [2018-11-14 18:41:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:24,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:24,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-14 18:41:24,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 18:41:24,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:24,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:41:24,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:24,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:41:24,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:41:24,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:41:24,675 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-11-14 18:41:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:25,053 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-11-14 18:41:25,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:41:25,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 18:41:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:41:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-14 18:41:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:41:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-14 18:41:25,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2018-11-14 18:41:25,185 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-14 18:41:25,188 INFO L225 Difference]: With dead ends: 61 [2018-11-14 18:41:25,188 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:41:25,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:41:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:41:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-14 18:41:25,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:25,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 39 states. [2018-11-14 18:41:25,217 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 39 states. [2018-11-14 18:41:25,217 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 39 states. [2018-11-14 18:41:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:25,220 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-11-14 18:41:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2018-11-14 18:41:25,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:25,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:25,222 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 42 states. [2018-11-14 18:41:25,222 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 42 states. [2018-11-14 18:41:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:25,230 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-11-14 18:41:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2018-11-14 18:41:25,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:25,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:25,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:25,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 18:41:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-14 18:41:25,234 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2018-11-14 18:41:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:25,235 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-14 18:41:25,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:41:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-14 18:41:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:41:25,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:25,236 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:25,237 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:25,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1110600496, now seen corresponding path program 2 times [2018-11-14 18:41:25,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:25,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:25,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:25,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:25,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:25,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-14 18:41:25,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {701#true} is VALID [2018-11-14 18:41:25,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-14 18:41:25,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #91#return; {701#true} is VALID [2018-11-14 18:41:25,388 INFO L256 TraceCheckUtils]: 4: Hoare triple {701#true} call #t~ret13 := main(); {701#true} is VALID [2018-11-14 18:41:25,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {701#true} is VALID [2018-11-14 18:41:25,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {701#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {701#true} is VALID [2018-11-14 18:41:25,391 INFO L273 TraceCheckUtils]: 7: Hoare triple {701#true} ~i~0 := 2; {703#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:25,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {703#(<= main_~i~0 2)} assume true; {703#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:25,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {703#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {703#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:25,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {703#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {703#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:25,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {703#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {704#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:25,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {704#(<= main_~i~0 3)} assume true; {704#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:25,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {704#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {704#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:25,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {704#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {704#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:25,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {704#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {705#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:25,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {705#(<= main_~i~0 4)} assume true; {705#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:25,404 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#(<= main_~i~0 4)} assume !(~i~0 < 100000); {702#false} is VALID [2018-11-14 18:41:25,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {702#false} havoc ~x~0;~x~0 := 0; {702#false} is VALID [2018-11-14 18:41:25,405 INFO L273 TraceCheckUtils]: 19: Hoare triple {702#false} assume true; {702#false} is VALID [2018-11-14 18:41:25,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {702#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {702#false} is VALID [2018-11-14 18:41:25,405 INFO L256 TraceCheckUtils]: 21: Hoare triple {702#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {702#false} is VALID [2018-11-14 18:41:25,405 INFO L273 TraceCheckUtils]: 22: Hoare triple {702#false} ~cond := #in~cond; {702#false} is VALID [2018-11-14 18:41:25,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {702#false} assume ~cond == 0; {702#false} is VALID [2018-11-14 18:41:25,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-14 18:41:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:25,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:25,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:41:25,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:41:25,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:41:25,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:25,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:25,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-14 18:41:25,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {701#true} is VALID [2018-11-14 18:41:25,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-14 18:41:25,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #91#return; {701#true} is VALID [2018-11-14 18:41:25,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {701#true} call #t~ret13 := main(); {701#true} is VALID [2018-11-14 18:41:25,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {701#true} is VALID [2018-11-14 18:41:25,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {701#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {701#true} is VALID [2018-11-14 18:41:25,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {701#true} ~i~0 := 2; {703#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:25,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {703#(<= main_~i~0 2)} assume true; {703#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:25,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {703#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {703#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:25,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {703#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {703#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:25,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {703#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {704#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:25,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {704#(<= main_~i~0 3)} assume true; {704#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:25,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {704#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {704#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:25,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {704#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {704#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:25,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {704#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {705#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:25,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {705#(<= main_~i~0 4)} assume true; {705#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:25,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#(<= main_~i~0 4)} assume !(~i~0 < 100000); {702#false} is VALID [2018-11-14 18:41:25,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {702#false} havoc ~x~0;~x~0 := 0; {702#false} is VALID [2018-11-14 18:41:25,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {702#false} assume true; {702#false} is VALID [2018-11-14 18:41:25,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {702#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {702#false} is VALID [2018-11-14 18:41:25,571 INFO L256 TraceCheckUtils]: 21: Hoare triple {702#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {702#false} is VALID [2018-11-14 18:41:25,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {702#false} ~cond := #in~cond; {702#false} is VALID [2018-11-14 18:41:25,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {702#false} assume ~cond == 0; {702#false} is VALID [2018-11-14 18:41:25,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-14 18:41:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:25,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:25,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-14 18:41:25,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 18:41:25,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:25,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:41:25,651 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-14 18:41:25,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:41:25,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:41:25,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:41:25,652 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 5 states. [2018-11-14 18:41:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:25,916 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2018-11-14 18:41:25,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:41:25,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 18:41:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:41:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2018-11-14 18:41:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:41:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2018-11-14 18:41:25,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 83 transitions. [2018-11-14 18:41:26,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:26,086 INFO L225 Difference]: With dead ends: 66 [2018-11-14 18:41:26,086 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 18:41:26,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-14 18:41:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 18:41:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-14 18:41:26,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:26,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 44 states. [2018-11-14 18:41:26,118 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 44 states. [2018-11-14 18:41:26,118 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 44 states. [2018-11-14 18:41:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:26,121 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-11-14 18:41:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-14 18:41:26,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:26,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:26,122 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 47 states. [2018-11-14 18:41:26,122 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 47 states. [2018-11-14 18:41:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:26,125 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-11-14 18:41:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-14 18:41:26,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:26,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:26,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:26,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:41:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-14 18:41:26,129 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 25 [2018-11-14 18:41:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:26,129 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-14 18:41:26,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:41:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-11-14 18:41:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:41:26,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:26,131 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:26,131 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:26,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:26,132 INFO L82 PathProgramCache]: Analyzing trace with hash -662773726, now seen corresponding path program 3 times [2018-11-14 18:41:26,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:26,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:26,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:26,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {1015#true} call ULTIMATE.init(); {1015#true} is VALID [2018-11-14 18:41:26,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {1015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1015#true} is VALID [2018-11-14 18:41:26,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {1015#true} assume true; {1015#true} is VALID [2018-11-14 18:41:26,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1015#true} {1015#true} #91#return; {1015#true} is VALID [2018-11-14 18:41:26,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {1015#true} call #t~ret13 := main(); {1015#true} is VALID [2018-11-14 18:41:26,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {1015#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1015#true} is VALID [2018-11-14 18:41:26,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {1015#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1015#true} is VALID [2018-11-14 18:41:26,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {1015#true} ~i~0 := 2; {1017#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:26,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {1017#(<= main_~i~0 2)} assume true; {1017#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:26,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {1017#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1017#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:26,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {1017#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1017#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:26,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {1017#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1018#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:26,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {1018#(<= main_~i~0 3)} assume true; {1018#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:26,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {1018#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1018#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:26,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {1018#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1018#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:26,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {1018#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1019#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:26,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {1019#(<= main_~i~0 4)} assume true; {1019#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:26,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {1019#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1019#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:26,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {1019#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1019#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:26,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {1019#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1020#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:26,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {1020#(<= main_~i~0 5)} assume true; {1020#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:26,285 INFO L273 TraceCheckUtils]: 21: Hoare triple {1020#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1016#false} is VALID [2018-11-14 18:41:26,285 INFO L273 TraceCheckUtils]: 22: Hoare triple {1016#false} havoc ~x~0;~x~0 := 0; {1016#false} is VALID [2018-11-14 18:41:26,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {1016#false} assume true; {1016#false} is VALID [2018-11-14 18:41:26,286 INFO L273 TraceCheckUtils]: 24: Hoare triple {1016#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {1016#false} is VALID [2018-11-14 18:41:26,286 INFO L256 TraceCheckUtils]: 25: Hoare triple {1016#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1016#false} is VALID [2018-11-14 18:41:26,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {1016#false} ~cond := #in~cond; {1016#false} is VALID [2018-11-14 18:41:26,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {1016#false} assume ~cond == 0; {1016#false} is VALID [2018-11-14 18:41:26,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {1016#false} assume !false; {1016#false} is VALID [2018-11-14 18:41:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:26,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:26,289 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-14 18:41:26,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:41:26,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:41:26,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:26,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:26,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {1015#true} call ULTIMATE.init(); {1015#true} is VALID [2018-11-14 18:41:26,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {1015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1015#true} is VALID [2018-11-14 18:41:26,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {1015#true} assume true; {1015#true} is VALID [2018-11-14 18:41:26,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1015#true} {1015#true} #91#return; {1015#true} is VALID [2018-11-14 18:41:26,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {1015#true} call #t~ret13 := main(); {1015#true} is VALID [2018-11-14 18:41:26,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {1015#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1015#true} is VALID [2018-11-14 18:41:26,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {1015#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1015#true} is VALID [2018-11-14 18:41:26,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {1015#true} ~i~0 := 2; {1017#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:26,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {1017#(<= main_~i~0 2)} assume true; {1017#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:26,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {1017#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1017#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:26,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {1017#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1017#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:26,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {1017#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1018#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:26,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {1018#(<= main_~i~0 3)} assume true; {1018#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:26,487 INFO L273 TraceCheckUtils]: 13: Hoare triple {1018#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1018#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:26,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {1018#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1018#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:26,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {1018#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1019#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:26,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {1019#(<= main_~i~0 4)} assume true; {1019#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:26,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {1019#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1019#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:26,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {1019#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1019#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:26,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {1019#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1020#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:26,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {1020#(<= main_~i~0 5)} assume true; {1020#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:26,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {1020#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1016#false} is VALID [2018-11-14 18:41:26,494 INFO L273 TraceCheckUtils]: 22: Hoare triple {1016#false} havoc ~x~0;~x~0 := 0; {1016#false} is VALID [2018-11-14 18:41:26,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {1016#false} assume true; {1016#false} is VALID [2018-11-14 18:41:26,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {1016#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {1016#false} is VALID [2018-11-14 18:41:26,495 INFO L256 TraceCheckUtils]: 25: Hoare triple {1016#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1016#false} is VALID [2018-11-14 18:41:26,495 INFO L273 TraceCheckUtils]: 26: Hoare triple {1016#false} ~cond := #in~cond; {1016#false} is VALID [2018-11-14 18:41:26,495 INFO L273 TraceCheckUtils]: 27: Hoare triple {1016#false} assume ~cond == 0; {1016#false} is VALID [2018-11-14 18:41:26,496 INFO L273 TraceCheckUtils]: 28: Hoare triple {1016#false} assume !false; {1016#false} is VALID [2018-11-14 18:41:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:26,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:26,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-14 18:41:26,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-14 18:41:26,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:26,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:41:26,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:26,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:41:26,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:41:26,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:41:26,565 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 6 states. [2018-11-14 18:41:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:26,893 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-14 18:41:26,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:41:26,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-14 18:41:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:41:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-14 18:41:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:41:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-14 18:41:26,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2018-11-14 18:41:27,047 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-14 18:41:27,049 INFO L225 Difference]: With dead ends: 71 [2018-11-14 18:41:27,049 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 18:41:27,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-14 18:41:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 18:41:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-14 18:41:27,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:27,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2018-11-14 18:41:27,068 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2018-11-14 18:41:27,068 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2018-11-14 18:41:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:27,071 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-14 18:41:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2018-11-14 18:41:27,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:27,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:27,073 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2018-11-14 18:41:27,073 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2018-11-14 18:41:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:27,076 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-14 18:41:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2018-11-14 18:41:27,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:27,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:27,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:27,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 18:41:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2018-11-14 18:41:27,080 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 29 [2018-11-14 18:41:27,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:27,080 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2018-11-14 18:41:27,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:41:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2018-11-14 18:41:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 18:41:27,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:27,082 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:27,082 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:27,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:27,082 INFO L82 PathProgramCache]: Analyzing trace with hash -658273260, now seen corresponding path program 4 times [2018-11-14 18:41:27,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:27,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:27,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:27,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:27,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:27,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {1364#true} call ULTIMATE.init(); {1364#true} is VALID [2018-11-14 18:41:27,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {1364#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1364#true} is VALID [2018-11-14 18:41:27,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {1364#true} assume true; {1364#true} is VALID [2018-11-14 18:41:27,274 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1364#true} {1364#true} #91#return; {1364#true} is VALID [2018-11-14 18:41:27,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {1364#true} call #t~ret13 := main(); {1364#true} is VALID [2018-11-14 18:41:27,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {1364#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1364#true} is VALID [2018-11-14 18:41:27,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {1364#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1364#true} is VALID [2018-11-14 18:41:27,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {1364#true} ~i~0 := 2; {1366#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:27,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {1366#(<= main_~i~0 2)} assume true; {1366#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:27,278 INFO L273 TraceCheckUtils]: 9: Hoare triple {1366#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1366#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:27,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {1366#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1366#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:27,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {1366#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1367#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:27,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {1367#(<= main_~i~0 3)} assume true; {1367#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:27,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {1367#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1367#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:27,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {1367#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1367#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:27,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {1367#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1368#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:27,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {1368#(<= main_~i~0 4)} assume true; {1368#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:27,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {1368#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1368#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:27,284 INFO L273 TraceCheckUtils]: 18: Hoare triple {1368#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1368#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:27,285 INFO L273 TraceCheckUtils]: 19: Hoare triple {1368#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1369#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:27,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {1369#(<= main_~i~0 5)} assume true; {1369#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:27,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {1369#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1369#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:27,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {1369#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1369#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:27,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {1369#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1370#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:27,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {1370#(<= main_~i~0 6)} assume true; {1370#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:27,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {1370#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1365#false} is VALID [2018-11-14 18:41:27,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {1365#false} havoc ~x~0;~x~0 := 0; {1365#false} is VALID [2018-11-14 18:41:27,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-14 18:41:27,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {1365#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {1365#false} is VALID [2018-11-14 18:41:27,333 INFO L256 TraceCheckUtils]: 29: Hoare triple {1365#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1365#false} is VALID [2018-11-14 18:41:27,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {1365#false} ~cond := #in~cond; {1365#false} is VALID [2018-11-14 18:41:27,333 INFO L273 TraceCheckUtils]: 31: Hoare triple {1365#false} assume ~cond == 0; {1365#false} is VALID [2018-11-14 18:41:27,334 INFO L273 TraceCheckUtils]: 32: Hoare triple {1365#false} assume !false; {1365#false} is VALID [2018-11-14 18:41:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:27,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:27,336 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-14 18:41:27,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:41:27,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:41:27,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:27,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:27,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {1364#true} call ULTIMATE.init(); {1364#true} is VALID [2018-11-14 18:41:27,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {1364#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1364#true} is VALID [2018-11-14 18:41:27,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {1364#true} assume true; {1364#true} is VALID [2018-11-14 18:41:27,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1364#true} {1364#true} #91#return; {1364#true} is VALID [2018-11-14 18:41:27,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {1364#true} call #t~ret13 := main(); {1364#true} is VALID [2018-11-14 18:41:27,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {1364#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1364#true} is VALID [2018-11-14 18:41:27,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {1364#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1364#true} is VALID [2018-11-14 18:41:27,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {1364#true} ~i~0 := 2; {1366#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:27,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {1366#(<= main_~i~0 2)} assume true; {1366#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:27,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {1366#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1366#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:27,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {1366#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1366#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:27,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {1366#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1367#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:27,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {1367#(<= main_~i~0 3)} assume true; {1367#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:27,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {1367#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1367#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:27,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {1367#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1367#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:27,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {1367#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1368#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:27,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {1368#(<= main_~i~0 4)} assume true; {1368#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:27,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {1368#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1368#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:27,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {1368#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1368#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:27,582 INFO L273 TraceCheckUtils]: 19: Hoare triple {1368#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1369#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:27,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {1369#(<= main_~i~0 5)} assume true; {1369#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:27,583 INFO L273 TraceCheckUtils]: 21: Hoare triple {1369#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1369#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:27,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {1369#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1369#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:27,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {1369#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1370#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:27,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {1370#(<= main_~i~0 6)} assume true; {1370#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:27,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {1370#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1365#false} is VALID [2018-11-14 18:41:27,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {1365#false} havoc ~x~0;~x~0 := 0; {1365#false} is VALID [2018-11-14 18:41:27,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-14 18:41:27,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {1365#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {1365#false} is VALID [2018-11-14 18:41:27,587 INFO L256 TraceCheckUtils]: 29: Hoare triple {1365#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1365#false} is VALID [2018-11-14 18:41:27,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {1365#false} ~cond := #in~cond; {1365#false} is VALID [2018-11-14 18:41:27,588 INFO L273 TraceCheckUtils]: 31: Hoare triple {1365#false} assume ~cond == 0; {1365#false} is VALID [2018-11-14 18:41:27,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {1365#false} assume !false; {1365#false} is VALID [2018-11-14 18:41:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:27,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:27,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-14 18:41:27,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-14 18:41:27,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:27,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:41:27,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:27,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:41:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:41:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:41:27,665 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand 7 states. [2018-11-14 18:41:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:28,128 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2018-11-14 18:41:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:41:28,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-14 18:41:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:41:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2018-11-14 18:41:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:41:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2018-11-14 18:41:28,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2018-11-14 18:41:28,243 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-14 18:41:28,245 INFO L225 Difference]: With dead ends: 76 [2018-11-14 18:41:28,245 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 18:41:28,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-14 18:41:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 18:41:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-11-14 18:41:28,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:28,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 54 states. [2018-11-14 18:41:28,282 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 54 states. [2018-11-14 18:41:28,282 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 54 states. [2018-11-14 18:41:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:28,285 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2018-11-14 18:41:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2018-11-14 18:41:28,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:28,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:28,286 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 57 states. [2018-11-14 18:41:28,286 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 57 states. [2018-11-14 18:41:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:28,288 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2018-11-14 18:41:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2018-11-14 18:41:28,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:28,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:28,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:28,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 18:41:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2018-11-14 18:41:28,291 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 33 [2018-11-14 18:41:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:28,292 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-11-14 18:41:28,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:41:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2018-11-14 18:41:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 18:41:28,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:28,293 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:28,293 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:28,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1911755002, now seen corresponding path program 5 times [2018-11-14 18:41:28,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:28,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:28,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {1748#true} call ULTIMATE.init(); {1748#true} is VALID [2018-11-14 18:41:28,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {1748#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1748#true} is VALID [2018-11-14 18:41:28,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {1748#true} assume true; {1748#true} is VALID [2018-11-14 18:41:28,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1748#true} {1748#true} #91#return; {1748#true} is VALID [2018-11-14 18:41:28,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {1748#true} call #t~ret13 := main(); {1748#true} is VALID [2018-11-14 18:41:28,428 INFO L273 TraceCheckUtils]: 5: Hoare triple {1748#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1748#true} is VALID [2018-11-14 18:41:28,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {1748#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1748#true} is VALID [2018-11-14 18:41:28,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {1748#true} ~i~0 := 2; {1750#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:28,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {1750#(<= main_~i~0 2)} assume true; {1750#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:28,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {1750#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1750#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:28,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {1750#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1750#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:28,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {1750#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1751#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:28,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {1751#(<= main_~i~0 3)} assume true; {1751#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:28,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {1751#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1751#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:28,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {1751#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1751#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:28,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {1751#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1752#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:28,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {1752#(<= main_~i~0 4)} assume true; {1752#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:28,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {1752#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1752#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:28,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {1752#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1752#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:28,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {1752#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1753#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:28,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {1753#(<= main_~i~0 5)} assume true; {1753#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:28,439 INFO L273 TraceCheckUtils]: 21: Hoare triple {1753#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1753#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:28,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {1753#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1753#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:28,440 INFO L273 TraceCheckUtils]: 23: Hoare triple {1753#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1754#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:28,441 INFO L273 TraceCheckUtils]: 24: Hoare triple {1754#(<= main_~i~0 6)} assume true; {1754#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:28,442 INFO L273 TraceCheckUtils]: 25: Hoare triple {1754#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1754#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:28,442 INFO L273 TraceCheckUtils]: 26: Hoare triple {1754#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1754#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:28,443 INFO L273 TraceCheckUtils]: 27: Hoare triple {1754#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1755#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:28,444 INFO L273 TraceCheckUtils]: 28: Hoare triple {1755#(<= main_~i~0 7)} assume true; {1755#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:28,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {1755#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1749#false} is VALID [2018-11-14 18:41:28,445 INFO L273 TraceCheckUtils]: 30: Hoare triple {1749#false} havoc ~x~0;~x~0 := 0; {1749#false} is VALID [2018-11-14 18:41:28,445 INFO L273 TraceCheckUtils]: 31: Hoare triple {1749#false} assume true; {1749#false} is VALID [2018-11-14 18:41:28,446 INFO L273 TraceCheckUtils]: 32: Hoare triple {1749#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {1749#false} is VALID [2018-11-14 18:41:28,446 INFO L256 TraceCheckUtils]: 33: Hoare triple {1749#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1749#false} is VALID [2018-11-14 18:41:28,446 INFO L273 TraceCheckUtils]: 34: Hoare triple {1749#false} ~cond := #in~cond; {1749#false} is VALID [2018-11-14 18:41:28,447 INFO L273 TraceCheckUtils]: 35: Hoare triple {1749#false} assume ~cond == 0; {1749#false} is VALID [2018-11-14 18:41:28,447 INFO L273 TraceCheckUtils]: 36: Hoare triple {1749#false} assume !false; {1749#false} is VALID [2018-11-14 18:41:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:28,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:28,449 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-14 18:41:28,459 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:41:28,526 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:41:28,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:28,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:28,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {1748#true} call ULTIMATE.init(); {1748#true} is VALID [2018-11-14 18:41:28,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {1748#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1748#true} is VALID [2018-11-14 18:41:28,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {1748#true} assume true; {1748#true} is VALID [2018-11-14 18:41:28,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1748#true} {1748#true} #91#return; {1748#true} is VALID [2018-11-14 18:41:28,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {1748#true} call #t~ret13 := main(); {1748#true} is VALID [2018-11-14 18:41:28,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {1748#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1748#true} is VALID [2018-11-14 18:41:28,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {1748#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1748#true} is VALID [2018-11-14 18:41:28,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {1748#true} ~i~0 := 2; {1750#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:28,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {1750#(<= main_~i~0 2)} assume true; {1750#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:28,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {1750#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1750#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:28,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {1750#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1750#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:28,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {1750#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1751#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:28,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {1751#(<= main_~i~0 3)} assume true; {1751#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:28,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {1751#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1751#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:28,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {1751#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1751#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:28,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {1751#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1752#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:28,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {1752#(<= main_~i~0 4)} assume true; {1752#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:28,638 INFO L273 TraceCheckUtils]: 17: Hoare triple {1752#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1752#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:28,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {1752#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1752#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:28,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {1752#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1753#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:28,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {1753#(<= main_~i~0 5)} assume true; {1753#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:28,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {1753#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1753#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:28,641 INFO L273 TraceCheckUtils]: 22: Hoare triple {1753#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1753#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:28,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {1753#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1754#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:28,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {1754#(<= main_~i~0 6)} assume true; {1754#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:28,643 INFO L273 TraceCheckUtils]: 25: Hoare triple {1754#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {1754#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:28,652 INFO L273 TraceCheckUtils]: 26: Hoare triple {1754#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1754#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:28,652 INFO L273 TraceCheckUtils]: 27: Hoare triple {1754#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1755#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:28,656 INFO L273 TraceCheckUtils]: 28: Hoare triple {1755#(<= main_~i~0 7)} assume true; {1755#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:28,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {1755#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1749#false} is VALID [2018-11-14 18:41:28,657 INFO L273 TraceCheckUtils]: 30: Hoare triple {1749#false} havoc ~x~0;~x~0 := 0; {1749#false} is VALID [2018-11-14 18:41:28,657 INFO L273 TraceCheckUtils]: 31: Hoare triple {1749#false} assume true; {1749#false} is VALID [2018-11-14 18:41:28,657 INFO L273 TraceCheckUtils]: 32: Hoare triple {1749#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {1749#false} is VALID [2018-11-14 18:41:28,657 INFO L256 TraceCheckUtils]: 33: Hoare triple {1749#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1749#false} is VALID [2018-11-14 18:41:28,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {1749#false} ~cond := #in~cond; {1749#false} is VALID [2018-11-14 18:41:28,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {1749#false} assume ~cond == 0; {1749#false} is VALID [2018-11-14 18:41:28,658 INFO L273 TraceCheckUtils]: 36: Hoare triple {1749#false} assume !false; {1749#false} is VALID [2018-11-14 18:41:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:28,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:28,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-14 18:41:28,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-14 18:41:28,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:28,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:41:28,724 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-14 18:41:28,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:41:28,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:41:28,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:41:28,725 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 8 states. [2018-11-14 18:41:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:29,309 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2018-11-14 18:41:29,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:41:29,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-14 18:41:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:41:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-14 18:41:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:41:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-14 18:41:29,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 104 transitions. [2018-11-14 18:41:29,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:29,617 INFO L225 Difference]: With dead ends: 81 [2018-11-14 18:41:29,618 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 18:41:29,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 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-14 18:41:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 18:41:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-11-14 18:41:29,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:29,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 59 states. [2018-11-14 18:41:29,641 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 59 states. [2018-11-14 18:41:29,642 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 59 states. [2018-11-14 18:41:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:29,644 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-14 18:41:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2018-11-14 18:41:29,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:29,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:29,645 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 62 states. [2018-11-14 18:41:29,645 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 62 states. [2018-11-14 18:41:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:29,648 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-14 18:41:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2018-11-14 18:41:29,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:29,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:29,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:29,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:41:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2018-11-14 18:41:29,652 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 37 [2018-11-14 18:41:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:29,653 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2018-11-14 18:41:29,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:41:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2018-11-14 18:41:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 18:41:29,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:29,654 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:29,654 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:29,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:29,655 INFO L82 PathProgramCache]: Analyzing trace with hash -383285000, now seen corresponding path program 6 times [2018-11-14 18:41:29,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:29,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:29,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:29,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:29,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:30,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {2167#true} call ULTIMATE.init(); {2167#true} is VALID [2018-11-14 18:41:30,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {2167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2167#true} is VALID [2018-11-14 18:41:30,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {2167#true} assume true; {2167#true} is VALID [2018-11-14 18:41:30,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2167#true} {2167#true} #91#return; {2167#true} is VALID [2018-11-14 18:41:30,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {2167#true} call #t~ret13 := main(); {2167#true} is VALID [2018-11-14 18:41:30,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {2167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {2167#true} is VALID [2018-11-14 18:41:30,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {2167#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {2167#true} is VALID [2018-11-14 18:41:30,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {2167#true} ~i~0 := 2; {2169#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:30,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {2169#(<= main_~i~0 2)} assume true; {2169#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:30,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {2169#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2169#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:30,052 INFO L273 TraceCheckUtils]: 10: Hoare triple {2169#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2169#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:30,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {2169#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2170#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:30,054 INFO L273 TraceCheckUtils]: 12: Hoare triple {2170#(<= main_~i~0 3)} assume true; {2170#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:30,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {2170#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2170#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:30,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {2170#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2170#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:30,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {2170#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2171#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:30,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {2171#(<= main_~i~0 4)} assume true; {2171#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:30,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {2171#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2171#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:30,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {2171#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2171#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:30,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {2171#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2172#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:30,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {2172#(<= main_~i~0 5)} assume true; {2172#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:30,062 INFO L273 TraceCheckUtils]: 21: Hoare triple {2172#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2172#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:30,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {2172#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2172#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:30,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {2172#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2173#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:30,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {2173#(<= main_~i~0 6)} assume true; {2173#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:30,065 INFO L273 TraceCheckUtils]: 25: Hoare triple {2173#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2173#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:30,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {2173#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2173#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:30,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {2173#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2174#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:30,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {2174#(<= main_~i~0 7)} assume true; {2174#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:30,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {2174#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2174#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:30,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {2174#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2174#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:30,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {2174#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2175#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:30,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {2175#(<= main_~i~0 8)} assume true; {2175#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:30,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {2175#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2168#false} is VALID [2018-11-14 18:41:30,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {2168#false} havoc ~x~0;~x~0 := 0; {2168#false} is VALID [2018-11-14 18:41:30,077 INFO L273 TraceCheckUtils]: 35: Hoare triple {2168#false} assume true; {2168#false} is VALID [2018-11-14 18:41:30,077 INFO L273 TraceCheckUtils]: 36: Hoare triple {2168#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {2168#false} is VALID [2018-11-14 18:41:30,078 INFO L256 TraceCheckUtils]: 37: Hoare triple {2168#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {2168#false} is VALID [2018-11-14 18:41:30,078 INFO L273 TraceCheckUtils]: 38: Hoare triple {2168#false} ~cond := #in~cond; {2168#false} is VALID [2018-11-14 18:41:30,078 INFO L273 TraceCheckUtils]: 39: Hoare triple {2168#false} assume ~cond == 0; {2168#false} is VALID [2018-11-14 18:41:30,078 INFO L273 TraceCheckUtils]: 40: Hoare triple {2168#false} assume !false; {2168#false} is VALID [2018-11-14 18:41:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:30,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:30,081 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-14 18:41:30,090 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:41:30,210 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:41:30,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:30,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:30,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {2167#true} call ULTIMATE.init(); {2167#true} is VALID [2018-11-14 18:41:30,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {2167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2167#true} is VALID [2018-11-14 18:41:30,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {2167#true} assume true; {2167#true} is VALID [2018-11-14 18:41:30,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2167#true} {2167#true} #91#return; {2167#true} is VALID [2018-11-14 18:41:30,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {2167#true} call #t~ret13 := main(); {2167#true} is VALID [2018-11-14 18:41:30,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {2167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {2167#true} is VALID [2018-11-14 18:41:30,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {2167#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {2167#true} is VALID [2018-11-14 18:41:30,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {2167#true} ~i~0 := 2; {2169#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:30,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {2169#(<= main_~i~0 2)} assume true; {2169#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:30,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {2169#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2169#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:30,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {2169#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2169#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:30,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {2169#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2170#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:30,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {2170#(<= main_~i~0 3)} assume true; {2170#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:30,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {2170#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2170#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:30,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {2170#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2170#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:30,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {2170#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2171#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:30,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {2171#(<= main_~i~0 4)} assume true; {2171#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:30,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {2171#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2171#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:30,867 INFO L273 TraceCheckUtils]: 18: Hoare triple {2171#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2171#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:30,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {2171#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2172#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:30,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {2172#(<= main_~i~0 5)} assume true; {2172#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:30,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {2172#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2172#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:30,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {2172#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2172#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:30,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {2172#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2173#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:30,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {2173#(<= main_~i~0 6)} assume true; {2173#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:30,881 INFO L273 TraceCheckUtils]: 25: Hoare triple {2173#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2173#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:30,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {2173#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2173#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:30,882 INFO L273 TraceCheckUtils]: 27: Hoare triple {2173#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2174#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:30,882 INFO L273 TraceCheckUtils]: 28: Hoare triple {2174#(<= main_~i~0 7)} assume true; {2174#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:30,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {2174#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2174#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:30,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {2174#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2174#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:30,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {2174#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2175#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:30,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {2175#(<= main_~i~0 8)} assume true; {2175#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:30,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {2175#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2168#false} is VALID [2018-11-14 18:41:30,885 INFO L273 TraceCheckUtils]: 34: Hoare triple {2168#false} havoc ~x~0;~x~0 := 0; {2168#false} is VALID [2018-11-14 18:41:30,885 INFO L273 TraceCheckUtils]: 35: Hoare triple {2168#false} assume true; {2168#false} is VALID [2018-11-14 18:41:30,885 INFO L273 TraceCheckUtils]: 36: Hoare triple {2168#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {2168#false} is VALID [2018-11-14 18:41:30,886 INFO L256 TraceCheckUtils]: 37: Hoare triple {2168#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {2168#false} is VALID [2018-11-14 18:41:30,886 INFO L273 TraceCheckUtils]: 38: Hoare triple {2168#false} ~cond := #in~cond; {2168#false} is VALID [2018-11-14 18:41:30,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {2168#false} assume ~cond == 0; {2168#false} is VALID [2018-11-14 18:41:30,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {2168#false} assume !false; {2168#false} is VALID [2018-11-14 18:41:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:30,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:30,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-14 18:41:30,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-14 18:41:30,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:30,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:41:30,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:30,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:41:30,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:41:30,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:41:30,949 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand 9 states. [2018-11-14 18:41:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:31,694 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2018-11-14 18:41:31,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:41:31,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-14 18:41:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:41:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2018-11-14 18:41:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:41:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2018-11-14 18:41:31,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 111 transitions. [2018-11-14 18:41:31,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:31,887 INFO L225 Difference]: With dead ends: 86 [2018-11-14 18:41:31,887 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 18:41:31,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:41:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 18:41:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-14 18:41:32,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:32,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 64 states. [2018-11-14 18:41:32,012 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 64 states. [2018-11-14 18:41:32,013 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 64 states. [2018-11-14 18:41:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:32,016 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2018-11-14 18:41:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2018-11-14 18:41:32,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:32,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:32,016 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 67 states. [2018-11-14 18:41:32,017 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 67 states. [2018-11-14 18:41:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:32,019 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2018-11-14 18:41:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2018-11-14 18:41:32,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:32,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:32,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:32,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 18:41:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2018-11-14 18:41:32,022 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 41 [2018-11-14 18:41:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:32,022 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-11-14 18:41:32,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:41:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2018-11-14 18:41:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 18:41:32,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:32,023 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:32,023 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:32,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1600136726, now seen corresponding path program 7 times [2018-11-14 18:41:32,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:32,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:32,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:32,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {2621#true} call ULTIMATE.init(); {2621#true} is VALID [2018-11-14 18:41:32,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {2621#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2621#true} is VALID [2018-11-14 18:41:32,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {2621#true} assume true; {2621#true} is VALID [2018-11-14 18:41:32,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2621#true} {2621#true} #91#return; {2621#true} is VALID [2018-11-14 18:41:32,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {2621#true} call #t~ret13 := main(); {2621#true} is VALID [2018-11-14 18:41:32,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {2621#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {2621#true} is VALID [2018-11-14 18:41:32,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {2621#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {2621#true} is VALID [2018-11-14 18:41:32,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {2621#true} ~i~0 := 2; {2623#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:32,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {2623#(<= main_~i~0 2)} assume true; {2623#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:32,278 INFO L273 TraceCheckUtils]: 9: Hoare triple {2623#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2623#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:32,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {2623#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2623#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:32,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {2623#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2624#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:32,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {2624#(<= main_~i~0 3)} assume true; {2624#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:32,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {2624#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2624#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:32,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {2624#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2624#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:32,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {2624#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2625#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:32,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {2625#(<= main_~i~0 4)} assume true; {2625#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:32,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {2625#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2625#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:32,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {2625#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2625#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:32,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {2625#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2626#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:32,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {2626#(<= main_~i~0 5)} assume true; {2626#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:32,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {2626#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2626#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:32,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {2626#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2626#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:32,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {2626#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2627#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:32,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {2627#(<= main_~i~0 6)} assume true; {2627#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:32,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {2627#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2627#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:32,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {2627#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2627#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:32,292 INFO L273 TraceCheckUtils]: 27: Hoare triple {2627#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2628#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:32,293 INFO L273 TraceCheckUtils]: 28: Hoare triple {2628#(<= main_~i~0 7)} assume true; {2628#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:32,293 INFO L273 TraceCheckUtils]: 29: Hoare triple {2628#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2628#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:32,294 INFO L273 TraceCheckUtils]: 30: Hoare triple {2628#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2628#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:32,294 INFO L273 TraceCheckUtils]: 31: Hoare triple {2628#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2629#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:32,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {2629#(<= main_~i~0 8)} assume true; {2629#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:32,296 INFO L273 TraceCheckUtils]: 33: Hoare triple {2629#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2629#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:32,296 INFO L273 TraceCheckUtils]: 34: Hoare triple {2629#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2629#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:32,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {2629#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2630#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:32,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {2630#(<= main_~i~0 9)} assume true; {2630#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:32,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {2630#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2622#false} is VALID [2018-11-14 18:41:32,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {2622#false} havoc ~x~0;~x~0 := 0; {2622#false} is VALID [2018-11-14 18:41:32,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 18:41:32,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {2622#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {2622#false} is VALID [2018-11-14 18:41:32,299 INFO L256 TraceCheckUtils]: 41: Hoare triple {2622#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {2622#false} is VALID [2018-11-14 18:41:32,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {2622#false} ~cond := #in~cond; {2622#false} is VALID [2018-11-14 18:41:32,300 INFO L273 TraceCheckUtils]: 43: Hoare triple {2622#false} assume ~cond == 0; {2622#false} is VALID [2018-11-14 18:41:32,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {2622#false} assume !false; {2622#false} is VALID [2018-11-14 18:41:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:32,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:32,302 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-14 18:41:32,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:32,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:32,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {2621#true} call ULTIMATE.init(); {2621#true} is VALID [2018-11-14 18:41:32,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {2621#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2621#true} is VALID [2018-11-14 18:41:32,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {2621#true} assume true; {2621#true} is VALID [2018-11-14 18:41:32,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2621#true} {2621#true} #91#return; {2621#true} is VALID [2018-11-14 18:41:32,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {2621#true} call #t~ret13 := main(); {2621#true} is VALID [2018-11-14 18:41:32,497 INFO L273 TraceCheckUtils]: 5: Hoare triple {2621#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {2621#true} is VALID [2018-11-14 18:41:32,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {2621#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {2621#true} is VALID [2018-11-14 18:41:32,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {2621#true} ~i~0 := 2; {2623#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:32,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {2623#(<= main_~i~0 2)} assume true; {2623#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:32,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {2623#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2623#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:32,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {2623#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2623#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:32,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {2623#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2624#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:32,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {2624#(<= main_~i~0 3)} assume true; {2624#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:32,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {2624#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2624#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:32,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {2624#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2624#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:32,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {2624#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2625#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:32,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {2625#(<= main_~i~0 4)} assume true; {2625#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:32,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {2625#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2625#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:32,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {2625#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2625#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:32,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {2625#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2626#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:32,504 INFO L273 TraceCheckUtils]: 20: Hoare triple {2626#(<= main_~i~0 5)} assume true; {2626#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:32,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {2626#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2626#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:32,505 INFO L273 TraceCheckUtils]: 22: Hoare triple {2626#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2626#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:32,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {2626#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2627#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:32,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {2627#(<= main_~i~0 6)} assume true; {2627#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:32,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {2627#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2627#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:32,508 INFO L273 TraceCheckUtils]: 26: Hoare triple {2627#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2627#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:32,508 INFO L273 TraceCheckUtils]: 27: Hoare triple {2627#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2628#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:32,513 INFO L273 TraceCheckUtils]: 28: Hoare triple {2628#(<= main_~i~0 7)} assume true; {2628#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:32,514 INFO L273 TraceCheckUtils]: 29: Hoare triple {2628#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2628#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:32,514 INFO L273 TraceCheckUtils]: 30: Hoare triple {2628#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2628#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:32,515 INFO L273 TraceCheckUtils]: 31: Hoare triple {2628#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2629#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:32,515 INFO L273 TraceCheckUtils]: 32: Hoare triple {2629#(<= main_~i~0 8)} assume true; {2629#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:32,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {2629#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {2629#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:32,516 INFO L273 TraceCheckUtils]: 34: Hoare triple {2629#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2629#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:32,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {2629#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2630#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:32,516 INFO L273 TraceCheckUtils]: 36: Hoare triple {2630#(<= main_~i~0 9)} assume true; {2630#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:32,517 INFO L273 TraceCheckUtils]: 37: Hoare triple {2630#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2622#false} is VALID [2018-11-14 18:41:32,517 INFO L273 TraceCheckUtils]: 38: Hoare triple {2622#false} havoc ~x~0;~x~0 := 0; {2622#false} is VALID [2018-11-14 18:41:32,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 18:41:32,518 INFO L273 TraceCheckUtils]: 40: Hoare triple {2622#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {2622#false} is VALID [2018-11-14 18:41:32,518 INFO L256 TraceCheckUtils]: 41: Hoare triple {2622#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {2622#false} is VALID [2018-11-14 18:41:32,518 INFO L273 TraceCheckUtils]: 42: Hoare triple {2622#false} ~cond := #in~cond; {2622#false} is VALID [2018-11-14 18:41:32,519 INFO L273 TraceCheckUtils]: 43: Hoare triple {2622#false} assume ~cond == 0; {2622#false} is VALID [2018-11-14 18:41:32,519 INFO L273 TraceCheckUtils]: 44: Hoare triple {2622#false} assume !false; {2622#false} is VALID [2018-11-14 18:41:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:32,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:32,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-14 18:41:32,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-14 18:41:32,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:32,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:41:32,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:32,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:41:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:41:32,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:41:32,585 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 10 states. [2018-11-14 18:41:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:32,928 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2018-11-14 18:41:32,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:41:32,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-14 18:41:32,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:41:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2018-11-14 18:41:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:41:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2018-11-14 18:41:32,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 118 transitions. [2018-11-14 18:41:33,107 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-14 18:41:33,109 INFO L225 Difference]: With dead ends: 91 [2018-11-14 18:41:33,109 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 18:41:33,110 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:41:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 18:41:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-11-14 18:41:33,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:33,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 69 states. [2018-11-14 18:41:33,130 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 69 states. [2018-11-14 18:41:33,130 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 69 states. [2018-11-14 18:41:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:33,133 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-14 18:41:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-11-14 18:41:33,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:33,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:33,134 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 72 states. [2018-11-14 18:41:33,134 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 72 states. [2018-11-14 18:41:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:33,137 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-14 18:41:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-11-14 18:41:33,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:33,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:33,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:33,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 18:41:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2018-11-14 18:41:33,144 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 45 [2018-11-14 18:41:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:33,145 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2018-11-14 18:41:33,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:41:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2018-11-14 18:41:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 18:41:33,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:33,146 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:33,146 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:33,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:33,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1354916316, now seen corresponding path program 8 times [2018-11-14 18:41:33,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:33,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:33,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:33,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:33,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:33,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {3110#true} call ULTIMATE.init(); {3110#true} is VALID [2018-11-14 18:41:33,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {3110#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3110#true} is VALID [2018-11-14 18:41:33,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {3110#true} assume true; {3110#true} is VALID [2018-11-14 18:41:33,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3110#true} {3110#true} #91#return; {3110#true} is VALID [2018-11-14 18:41:33,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {3110#true} call #t~ret13 := main(); {3110#true} is VALID [2018-11-14 18:41:33,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {3110#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {3110#true} is VALID [2018-11-14 18:41:33,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {3110#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {3110#true} is VALID [2018-11-14 18:41:33,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {3110#true} ~i~0 := 2; {3112#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:33,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {3112#(<= main_~i~0 2)} assume true; {3112#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:33,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {3112#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3112#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:33,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {3112#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3112#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:33,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {3112#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3113#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:33,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {3113#(<= main_~i~0 3)} assume true; {3113#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:33,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {3113#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3113#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:33,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {3113#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3113#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:33,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {3113#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3114#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:33,331 INFO L273 TraceCheckUtils]: 16: Hoare triple {3114#(<= main_~i~0 4)} assume true; {3114#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:33,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {3114#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3114#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:33,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {3114#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3114#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:33,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {3114#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3115#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:33,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {3115#(<= main_~i~0 5)} assume true; {3115#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:33,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {3115#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3115#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:33,349 INFO L273 TraceCheckUtils]: 22: Hoare triple {3115#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3115#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:33,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {3115#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3116#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:33,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {3116#(<= main_~i~0 6)} assume true; {3116#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:33,350 INFO L273 TraceCheckUtils]: 25: Hoare triple {3116#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3116#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:33,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {3116#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3116#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:33,351 INFO L273 TraceCheckUtils]: 27: Hoare triple {3116#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3117#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:33,351 INFO L273 TraceCheckUtils]: 28: Hoare triple {3117#(<= main_~i~0 7)} assume true; {3117#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:33,351 INFO L273 TraceCheckUtils]: 29: Hoare triple {3117#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3117#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:33,352 INFO L273 TraceCheckUtils]: 30: Hoare triple {3117#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3117#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:33,353 INFO L273 TraceCheckUtils]: 31: Hoare triple {3117#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3118#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:33,353 INFO L273 TraceCheckUtils]: 32: Hoare triple {3118#(<= main_~i~0 8)} assume true; {3118#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:33,354 INFO L273 TraceCheckUtils]: 33: Hoare triple {3118#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3118#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:33,354 INFO L273 TraceCheckUtils]: 34: Hoare triple {3118#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3118#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:33,355 INFO L273 TraceCheckUtils]: 35: Hoare triple {3118#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3119#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:33,356 INFO L273 TraceCheckUtils]: 36: Hoare triple {3119#(<= main_~i~0 9)} assume true; {3119#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:33,356 INFO L273 TraceCheckUtils]: 37: Hoare triple {3119#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3119#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:33,357 INFO L273 TraceCheckUtils]: 38: Hoare triple {3119#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3119#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:33,357 INFO L273 TraceCheckUtils]: 39: Hoare triple {3119#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3120#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:33,358 INFO L273 TraceCheckUtils]: 40: Hoare triple {3120#(<= main_~i~0 10)} assume true; {3120#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:33,359 INFO L273 TraceCheckUtils]: 41: Hoare triple {3120#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3111#false} is VALID [2018-11-14 18:41:33,359 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#false} havoc ~x~0;~x~0 := 0; {3111#false} is VALID [2018-11-14 18:41:33,359 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#false} assume true; {3111#false} is VALID [2018-11-14 18:41:33,359 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {3111#false} is VALID [2018-11-14 18:41:33,360 INFO L256 TraceCheckUtils]: 45: Hoare triple {3111#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {3111#false} is VALID [2018-11-14 18:41:33,360 INFO L273 TraceCheckUtils]: 46: Hoare triple {3111#false} ~cond := #in~cond; {3111#false} is VALID [2018-11-14 18:41:33,360 INFO L273 TraceCheckUtils]: 47: Hoare triple {3111#false} assume ~cond == 0; {3111#false} is VALID [2018-11-14 18:41:33,360 INFO L273 TraceCheckUtils]: 48: Hoare triple {3111#false} assume !false; {3111#false} is VALID [2018-11-14 18:41:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:33,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:33,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:41:33,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:41:33,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:41:33,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:33,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:33,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {3110#true} call ULTIMATE.init(); {3110#true} is VALID [2018-11-14 18:41:33,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {3110#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3110#true} is VALID [2018-11-14 18:41:33,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {3110#true} assume true; {3110#true} is VALID [2018-11-14 18:41:33,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3110#true} {3110#true} #91#return; {3110#true} is VALID [2018-11-14 18:41:33,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {3110#true} call #t~ret13 := main(); {3110#true} is VALID [2018-11-14 18:41:33,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {3110#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {3110#true} is VALID [2018-11-14 18:41:33,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {3110#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {3110#true} is VALID [2018-11-14 18:41:33,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {3110#true} ~i~0 := 2; {3112#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:33,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {3112#(<= main_~i~0 2)} assume true; {3112#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:33,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {3112#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3112#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:33,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {3112#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3112#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:33,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {3112#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3113#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:33,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {3113#(<= main_~i~0 3)} assume true; {3113#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:33,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {3113#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3113#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:33,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {3113#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3113#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:33,719 INFO L273 TraceCheckUtils]: 15: Hoare triple {3113#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3114#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:33,720 INFO L273 TraceCheckUtils]: 16: Hoare triple {3114#(<= main_~i~0 4)} assume true; {3114#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:33,720 INFO L273 TraceCheckUtils]: 17: Hoare triple {3114#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3114#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:33,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {3114#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3114#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:33,721 INFO L273 TraceCheckUtils]: 19: Hoare triple {3114#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3115#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:33,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {3115#(<= main_~i~0 5)} assume true; {3115#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:33,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {3115#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3115#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:33,723 INFO L273 TraceCheckUtils]: 22: Hoare triple {3115#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3115#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:33,724 INFO L273 TraceCheckUtils]: 23: Hoare triple {3115#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3116#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:33,724 INFO L273 TraceCheckUtils]: 24: Hoare triple {3116#(<= main_~i~0 6)} assume true; {3116#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:33,725 INFO L273 TraceCheckUtils]: 25: Hoare triple {3116#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3116#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:33,725 INFO L273 TraceCheckUtils]: 26: Hoare triple {3116#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3116#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:33,726 INFO L273 TraceCheckUtils]: 27: Hoare triple {3116#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3117#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:33,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {3117#(<= main_~i~0 7)} assume true; {3117#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:33,727 INFO L273 TraceCheckUtils]: 29: Hoare triple {3117#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3117#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:33,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {3117#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3117#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:33,728 INFO L273 TraceCheckUtils]: 31: Hoare triple {3117#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3118#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:33,729 INFO L273 TraceCheckUtils]: 32: Hoare triple {3118#(<= main_~i~0 8)} assume true; {3118#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:33,730 INFO L273 TraceCheckUtils]: 33: Hoare triple {3118#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3118#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:33,730 INFO L273 TraceCheckUtils]: 34: Hoare triple {3118#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3118#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:33,731 INFO L273 TraceCheckUtils]: 35: Hoare triple {3118#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3119#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:33,731 INFO L273 TraceCheckUtils]: 36: Hoare triple {3119#(<= main_~i~0 9)} assume true; {3119#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:33,732 INFO L273 TraceCheckUtils]: 37: Hoare triple {3119#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3119#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:33,733 INFO L273 TraceCheckUtils]: 38: Hoare triple {3119#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3119#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:33,733 INFO L273 TraceCheckUtils]: 39: Hoare triple {3119#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3120#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:33,734 INFO L273 TraceCheckUtils]: 40: Hoare triple {3120#(<= main_~i~0 10)} assume true; {3120#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:33,735 INFO L273 TraceCheckUtils]: 41: Hoare triple {3120#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3111#false} is VALID [2018-11-14 18:41:33,735 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#false} havoc ~x~0;~x~0 := 0; {3111#false} is VALID [2018-11-14 18:41:33,735 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#false} assume true; {3111#false} is VALID [2018-11-14 18:41:33,735 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {3111#false} is VALID [2018-11-14 18:41:33,735 INFO L256 TraceCheckUtils]: 45: Hoare triple {3111#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {3111#false} is VALID [2018-11-14 18:41:33,736 INFO L273 TraceCheckUtils]: 46: Hoare triple {3111#false} ~cond := #in~cond; {3111#false} is VALID [2018-11-14 18:41:33,736 INFO L273 TraceCheckUtils]: 47: Hoare triple {3111#false} assume ~cond == 0; {3111#false} is VALID [2018-11-14 18:41:33,736 INFO L273 TraceCheckUtils]: 48: Hoare triple {3111#false} assume !false; {3111#false} is VALID [2018-11-14 18:41:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:33,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:33,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-14 18:41:33,761 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-14 18:41:33,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:33,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:41:33,804 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-14 18:41:33,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:41:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:41:33,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:41:33,805 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand 11 states. [2018-11-14 18:41:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:34,034 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2018-11-14 18:41:34,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:41:34,034 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-14 18:41:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:41:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2018-11-14 18:41:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:41:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2018-11-14 18:41:34,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 125 transitions. [2018-11-14 18:41:34,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:34,218 INFO L225 Difference]: With dead ends: 96 [2018-11-14 18:41:34,218 INFO L226 Difference]: Without dead ends: 77 [2018-11-14 18:41:34,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:41:34,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-14 18:41:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-11-14 18:41:34,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:34,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 74 states. [2018-11-14 18:41:34,292 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 74 states. [2018-11-14 18:41:34,292 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 74 states. [2018-11-14 18:41:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:34,294 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2018-11-14 18:41:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2018-11-14 18:41:34,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:34,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:34,295 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 77 states. [2018-11-14 18:41:34,295 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 77 states. [2018-11-14 18:41:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:34,296 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2018-11-14 18:41:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2018-11-14 18:41:34,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:34,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:34,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:34,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 18:41:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2018-11-14 18:41:34,299 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 49 [2018-11-14 18:41:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:34,299 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2018-11-14 18:41:34,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:41:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2018-11-14 18:41:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 18:41:34,300 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:34,301 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:34,301 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:34,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:34,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1684299570, now seen corresponding path program 9 times [2018-11-14 18:41:34,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:34,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:34,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:34,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:34,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:34,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {3634#true} call ULTIMATE.init(); {3634#true} is VALID [2018-11-14 18:41:34,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {3634#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3634#true} is VALID [2018-11-14 18:41:34,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {3634#true} assume true; {3634#true} is VALID [2018-11-14 18:41:34,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3634#true} {3634#true} #91#return; {3634#true} is VALID [2018-11-14 18:41:34,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {3634#true} call #t~ret13 := main(); {3634#true} is VALID [2018-11-14 18:41:34,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {3634#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {3634#true} is VALID [2018-11-14 18:41:34,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {3634#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {3634#true} is VALID [2018-11-14 18:41:34,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {3634#true} ~i~0 := 2; {3636#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:34,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {3636#(<= main_~i~0 2)} assume true; {3636#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:34,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {3636#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3636#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:34,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {3636#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3636#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:34,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {3636#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3637#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:34,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {3637#(<= main_~i~0 3)} assume true; {3637#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:34,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {3637#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3637#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:34,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {3637#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3637#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:34,567 INFO L273 TraceCheckUtils]: 15: Hoare triple {3637#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3638#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:34,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {3638#(<= main_~i~0 4)} assume true; {3638#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:34,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {3638#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3638#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:34,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {3638#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3638#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:34,569 INFO L273 TraceCheckUtils]: 19: Hoare triple {3638#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3639#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:34,570 INFO L273 TraceCheckUtils]: 20: Hoare triple {3639#(<= main_~i~0 5)} assume true; {3639#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:34,570 INFO L273 TraceCheckUtils]: 21: Hoare triple {3639#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3639#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:34,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {3639#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3639#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:34,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {3639#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3640#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:34,573 INFO L273 TraceCheckUtils]: 24: Hoare triple {3640#(<= main_~i~0 6)} assume true; {3640#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:34,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {3640#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3640#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:34,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {3640#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3640#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:34,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {3640#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3641#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:34,575 INFO L273 TraceCheckUtils]: 28: Hoare triple {3641#(<= main_~i~0 7)} assume true; {3641#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:34,575 INFO L273 TraceCheckUtils]: 29: Hoare triple {3641#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3641#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:34,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {3641#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3641#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:34,576 INFO L273 TraceCheckUtils]: 31: Hoare triple {3641#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3642#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:34,577 INFO L273 TraceCheckUtils]: 32: Hoare triple {3642#(<= main_~i~0 8)} assume true; {3642#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:34,578 INFO L273 TraceCheckUtils]: 33: Hoare triple {3642#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3642#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:34,579 INFO L273 TraceCheckUtils]: 34: Hoare triple {3642#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3642#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:34,579 INFO L273 TraceCheckUtils]: 35: Hoare triple {3642#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3643#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:34,580 INFO L273 TraceCheckUtils]: 36: Hoare triple {3643#(<= main_~i~0 9)} assume true; {3643#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:34,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {3643#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3643#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:34,580 INFO L273 TraceCheckUtils]: 38: Hoare triple {3643#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3643#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:34,581 INFO L273 TraceCheckUtils]: 39: Hoare triple {3643#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3644#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:34,581 INFO L273 TraceCheckUtils]: 40: Hoare triple {3644#(<= main_~i~0 10)} assume true; {3644#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:34,581 INFO L273 TraceCheckUtils]: 41: Hoare triple {3644#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3644#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:34,582 INFO L273 TraceCheckUtils]: 42: Hoare triple {3644#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3644#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:34,582 INFO L273 TraceCheckUtils]: 43: Hoare triple {3644#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3645#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:34,583 INFO L273 TraceCheckUtils]: 44: Hoare triple {3645#(<= main_~i~0 11)} assume true; {3645#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:34,583 INFO L273 TraceCheckUtils]: 45: Hoare triple {3645#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3635#false} is VALID [2018-11-14 18:41:34,584 INFO L273 TraceCheckUtils]: 46: Hoare triple {3635#false} havoc ~x~0;~x~0 := 0; {3635#false} is VALID [2018-11-14 18:41:34,584 INFO L273 TraceCheckUtils]: 47: Hoare triple {3635#false} assume true; {3635#false} is VALID [2018-11-14 18:41:34,584 INFO L273 TraceCheckUtils]: 48: Hoare triple {3635#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {3635#false} is VALID [2018-11-14 18:41:34,584 INFO L256 TraceCheckUtils]: 49: Hoare triple {3635#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {3635#false} is VALID [2018-11-14 18:41:34,584 INFO L273 TraceCheckUtils]: 50: Hoare triple {3635#false} ~cond := #in~cond; {3635#false} is VALID [2018-11-14 18:41:34,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {3635#false} assume ~cond == 0; {3635#false} is VALID [2018-11-14 18:41:34,585 INFO L273 TraceCheckUtils]: 52: Hoare triple {3635#false} assume !false; {3635#false} is VALID [2018-11-14 18:41:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:34,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:34,588 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-14 18:41:34,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:41:34,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 18:41:34,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:34,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:34,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {3634#true} call ULTIMATE.init(); {3634#true} is VALID [2018-11-14 18:41:34,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {3634#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3634#true} is VALID [2018-11-14 18:41:34,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {3634#true} assume true; {3634#true} is VALID [2018-11-14 18:41:34,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3634#true} {3634#true} #91#return; {3634#true} is VALID [2018-11-14 18:41:34,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {3634#true} call #t~ret13 := main(); {3634#true} is VALID [2018-11-14 18:41:34,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {3634#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {3634#true} is VALID [2018-11-14 18:41:34,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {3634#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {3634#true} is VALID [2018-11-14 18:41:34,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {3634#true} ~i~0 := 2; {3636#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:34,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {3636#(<= main_~i~0 2)} assume true; {3636#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:34,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {3636#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3636#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:34,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {3636#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3636#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:34,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {3636#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3637#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:34,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {3637#(<= main_~i~0 3)} assume true; {3637#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:34,819 INFO L273 TraceCheckUtils]: 13: Hoare triple {3637#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3637#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:34,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {3637#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3637#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:34,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {3637#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3638#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:34,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {3638#(<= main_~i~0 4)} assume true; {3638#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:34,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {3638#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3638#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:34,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {3638#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3638#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:34,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {3638#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3639#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:34,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {3639#(<= main_~i~0 5)} assume true; {3639#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:34,824 INFO L273 TraceCheckUtils]: 21: Hoare triple {3639#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3639#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:34,824 INFO L273 TraceCheckUtils]: 22: Hoare triple {3639#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3639#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:34,825 INFO L273 TraceCheckUtils]: 23: Hoare triple {3639#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3640#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:34,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {3640#(<= main_~i~0 6)} assume true; {3640#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:34,826 INFO L273 TraceCheckUtils]: 25: Hoare triple {3640#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3640#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:34,827 INFO L273 TraceCheckUtils]: 26: Hoare triple {3640#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3640#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:34,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {3640#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3641#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:34,828 INFO L273 TraceCheckUtils]: 28: Hoare triple {3641#(<= main_~i~0 7)} assume true; {3641#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:34,828 INFO L273 TraceCheckUtils]: 29: Hoare triple {3641#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3641#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:34,829 INFO L273 TraceCheckUtils]: 30: Hoare triple {3641#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3641#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:34,830 INFO L273 TraceCheckUtils]: 31: Hoare triple {3641#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3642#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:34,830 INFO L273 TraceCheckUtils]: 32: Hoare triple {3642#(<= main_~i~0 8)} assume true; {3642#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:34,831 INFO L273 TraceCheckUtils]: 33: Hoare triple {3642#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3642#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:34,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {3642#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3642#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:34,832 INFO L273 TraceCheckUtils]: 35: Hoare triple {3642#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3643#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:34,833 INFO L273 TraceCheckUtils]: 36: Hoare triple {3643#(<= main_~i~0 9)} assume true; {3643#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:34,833 INFO L273 TraceCheckUtils]: 37: Hoare triple {3643#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3643#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:34,834 INFO L273 TraceCheckUtils]: 38: Hoare triple {3643#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3643#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:34,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {3643#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3644#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:34,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {3644#(<= main_~i~0 10)} assume true; {3644#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:34,836 INFO L273 TraceCheckUtils]: 41: Hoare triple {3644#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {3644#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:34,854 INFO L273 TraceCheckUtils]: 42: Hoare triple {3644#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3644#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:34,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {3644#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3645#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:34,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {3645#(<= main_~i~0 11)} assume true; {3645#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:34,861 INFO L273 TraceCheckUtils]: 45: Hoare triple {3645#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3635#false} is VALID [2018-11-14 18:41:34,861 INFO L273 TraceCheckUtils]: 46: Hoare triple {3635#false} havoc ~x~0;~x~0 := 0; {3635#false} is VALID [2018-11-14 18:41:34,861 INFO L273 TraceCheckUtils]: 47: Hoare triple {3635#false} assume true; {3635#false} is VALID [2018-11-14 18:41:34,861 INFO L273 TraceCheckUtils]: 48: Hoare triple {3635#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {3635#false} is VALID [2018-11-14 18:41:34,861 INFO L256 TraceCheckUtils]: 49: Hoare triple {3635#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {3635#false} is VALID [2018-11-14 18:41:34,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {3635#false} ~cond := #in~cond; {3635#false} is VALID [2018-11-14 18:41:34,861 INFO L273 TraceCheckUtils]: 51: Hoare triple {3635#false} assume ~cond == 0; {3635#false} is VALID [2018-11-14 18:41:34,862 INFO L273 TraceCheckUtils]: 52: Hoare triple {3635#false} assume !false; {3635#false} is VALID [2018-11-14 18:41:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:34,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:34,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-14 18:41:34,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-14 18:41:34,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:34,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:41:34,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:34,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:41:34,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:41:34,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:41:34,932 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand 12 states. [2018-11-14 18:41:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:35,373 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2018-11-14 18:41:35,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:41:35,373 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-14 18:41:35,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:41:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2018-11-14 18:41:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:41:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2018-11-14 18:41:35,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 132 transitions. [2018-11-14 18:41:36,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:36,071 INFO L225 Difference]: With dead ends: 101 [2018-11-14 18:41:36,071 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 18:41:36,072 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 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-14 18:41:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 18:41:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2018-11-14 18:41:36,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:36,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 79 states. [2018-11-14 18:41:36,087 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 79 states. [2018-11-14 18:41:36,087 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 79 states. [2018-11-14 18:41:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:36,090 INFO L93 Difference]: Finished difference Result 82 states and 109 transitions. [2018-11-14 18:41:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2018-11-14 18:41:36,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:36,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:36,090 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 82 states. [2018-11-14 18:41:36,090 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 82 states. [2018-11-14 18:41:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:36,092 INFO L93 Difference]: Finished difference Result 82 states and 109 transitions. [2018-11-14 18:41:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2018-11-14 18:41:36,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:36,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:36,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:36,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-14 18:41:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2018-11-14 18:41:36,095 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 53 [2018-11-14 18:41:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:36,095 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2018-11-14 18:41:36,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:41:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2018-11-14 18:41:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 18:41:36,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:36,097 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:36,097 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:36,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:36,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1224218304, now seen corresponding path program 10 times [2018-11-14 18:41:36,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:36,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:36,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:36,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:36,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:36,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {4193#true} call ULTIMATE.init(); {4193#true} is VALID [2018-11-14 18:41:36,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {4193#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4193#true} is VALID [2018-11-14 18:41:36,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {4193#true} assume true; {4193#true} is VALID [2018-11-14 18:41:36,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4193#true} {4193#true} #91#return; {4193#true} is VALID [2018-11-14 18:41:36,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {4193#true} call #t~ret13 := main(); {4193#true} is VALID [2018-11-14 18:41:36,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {4193#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {4193#true} is VALID [2018-11-14 18:41:36,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {4193#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {4193#true} is VALID [2018-11-14 18:41:36,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {4193#true} ~i~0 := 2; {4195#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:36,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {4195#(<= main_~i~0 2)} assume true; {4195#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:36,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {4195#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4195#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:36,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {4195#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4195#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:36,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {4195#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4196#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:36,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {4196#(<= main_~i~0 3)} assume true; {4196#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:36,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {4196#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4196#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:36,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {4196#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4196#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:36,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {4196#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4197#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:36,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {4197#(<= main_~i~0 4)} assume true; {4197#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:36,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {4197#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4197#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:36,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {4197#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4197#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:36,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {4197#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4198#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:36,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {4198#(<= main_~i~0 5)} assume true; {4198#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:36,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {4198#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4198#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:36,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {4198#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4198#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:36,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {4198#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4199#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:36,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {4199#(<= main_~i~0 6)} assume true; {4199#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:36,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {4199#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4199#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:36,742 INFO L273 TraceCheckUtils]: 26: Hoare triple {4199#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4199#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:36,743 INFO L273 TraceCheckUtils]: 27: Hoare triple {4199#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4200#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:36,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {4200#(<= main_~i~0 7)} assume true; {4200#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:36,744 INFO L273 TraceCheckUtils]: 29: Hoare triple {4200#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4200#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:36,744 INFO L273 TraceCheckUtils]: 30: Hoare triple {4200#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4200#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:36,745 INFO L273 TraceCheckUtils]: 31: Hoare triple {4200#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4201#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:36,745 INFO L273 TraceCheckUtils]: 32: Hoare triple {4201#(<= main_~i~0 8)} assume true; {4201#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:36,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {4201#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4201#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:36,747 INFO L273 TraceCheckUtils]: 34: Hoare triple {4201#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4201#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:36,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {4201#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4202#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:36,748 INFO L273 TraceCheckUtils]: 36: Hoare triple {4202#(<= main_~i~0 9)} assume true; {4202#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:36,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {4202#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4202#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:36,749 INFO L273 TraceCheckUtils]: 38: Hoare triple {4202#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4202#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:36,760 INFO L273 TraceCheckUtils]: 39: Hoare triple {4202#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4203#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:36,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {4203#(<= main_~i~0 10)} assume true; {4203#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:36,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {4203#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4203#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:36,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {4203#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4203#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:36,762 INFO L273 TraceCheckUtils]: 43: Hoare triple {4203#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4204#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:36,762 INFO L273 TraceCheckUtils]: 44: Hoare triple {4204#(<= main_~i~0 11)} assume true; {4204#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:36,762 INFO L273 TraceCheckUtils]: 45: Hoare triple {4204#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4204#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:36,763 INFO L273 TraceCheckUtils]: 46: Hoare triple {4204#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4204#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:36,763 INFO L273 TraceCheckUtils]: 47: Hoare triple {4204#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4205#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:36,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {4205#(<= main_~i~0 12)} assume true; {4205#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:36,764 INFO L273 TraceCheckUtils]: 49: Hoare triple {4205#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4194#false} is VALID [2018-11-14 18:41:36,764 INFO L273 TraceCheckUtils]: 50: Hoare triple {4194#false} havoc ~x~0;~x~0 := 0; {4194#false} is VALID [2018-11-14 18:41:36,764 INFO L273 TraceCheckUtils]: 51: Hoare triple {4194#false} assume true; {4194#false} is VALID [2018-11-14 18:41:36,764 INFO L273 TraceCheckUtils]: 52: Hoare triple {4194#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {4194#false} is VALID [2018-11-14 18:41:36,764 INFO L256 TraceCheckUtils]: 53: Hoare triple {4194#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {4194#false} is VALID [2018-11-14 18:41:36,765 INFO L273 TraceCheckUtils]: 54: Hoare triple {4194#false} ~cond := #in~cond; {4194#false} is VALID [2018-11-14 18:41:36,765 INFO L273 TraceCheckUtils]: 55: Hoare triple {4194#false} assume ~cond == 0; {4194#false} is VALID [2018-11-14 18:41:36,765 INFO L273 TraceCheckUtils]: 56: Hoare triple {4194#false} assume !false; {4194#false} is VALID [2018-11-14 18:41:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:36,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:36,768 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-14 18:41:36,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:41:36,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:41:36,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:36,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:37,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {4193#true} call ULTIMATE.init(); {4193#true} is VALID [2018-11-14 18:41:37,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {4193#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4193#true} is VALID [2018-11-14 18:41:37,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {4193#true} assume true; {4193#true} is VALID [2018-11-14 18:41:37,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4193#true} {4193#true} #91#return; {4193#true} is VALID [2018-11-14 18:41:37,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {4193#true} call #t~ret13 := main(); {4193#true} is VALID [2018-11-14 18:41:37,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {4193#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {4193#true} is VALID [2018-11-14 18:41:37,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {4193#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {4193#true} is VALID [2018-11-14 18:41:37,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {4193#true} ~i~0 := 2; {4195#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:37,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {4195#(<= main_~i~0 2)} assume true; {4195#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:37,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {4195#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4195#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:37,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {4195#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4195#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:37,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {4195#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4196#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:37,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {4196#(<= main_~i~0 3)} assume true; {4196#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:37,102 INFO L273 TraceCheckUtils]: 13: Hoare triple {4196#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4196#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:37,102 INFO L273 TraceCheckUtils]: 14: Hoare triple {4196#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4196#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:37,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {4196#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4197#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:37,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {4197#(<= main_~i~0 4)} assume true; {4197#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:37,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {4197#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4197#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:37,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {4197#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4197#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:37,109 INFO L273 TraceCheckUtils]: 19: Hoare triple {4197#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4198#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:37,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {4198#(<= main_~i~0 5)} assume true; {4198#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:37,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {4198#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4198#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:37,132 INFO L273 TraceCheckUtils]: 22: Hoare triple {4198#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4198#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:37,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {4198#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4199#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:37,158 INFO L273 TraceCheckUtils]: 24: Hoare triple {4199#(<= main_~i~0 6)} assume true; {4199#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:37,171 INFO L273 TraceCheckUtils]: 25: Hoare triple {4199#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4199#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:37,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {4199#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4199#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:37,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {4199#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4200#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:37,188 INFO L273 TraceCheckUtils]: 28: Hoare triple {4200#(<= main_~i~0 7)} assume true; {4200#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:37,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {4200#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4200#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:37,220 INFO L273 TraceCheckUtils]: 30: Hoare triple {4200#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4200#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:37,223 INFO L273 TraceCheckUtils]: 31: Hoare triple {4200#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4201#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:37,224 INFO L273 TraceCheckUtils]: 32: Hoare triple {4201#(<= main_~i~0 8)} assume true; {4201#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:37,224 INFO L273 TraceCheckUtils]: 33: Hoare triple {4201#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4201#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:37,225 INFO L273 TraceCheckUtils]: 34: Hoare triple {4201#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4201#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:37,225 INFO L273 TraceCheckUtils]: 35: Hoare triple {4201#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4202#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:37,226 INFO L273 TraceCheckUtils]: 36: Hoare triple {4202#(<= main_~i~0 9)} assume true; {4202#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:37,226 INFO L273 TraceCheckUtils]: 37: Hoare triple {4202#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4202#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:37,226 INFO L273 TraceCheckUtils]: 38: Hoare triple {4202#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4202#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:37,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {4202#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4203#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:37,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {4203#(<= main_~i~0 10)} assume true; {4203#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:37,228 INFO L273 TraceCheckUtils]: 41: Hoare triple {4203#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4203#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:37,228 INFO L273 TraceCheckUtils]: 42: Hoare triple {4203#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4203#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:37,229 INFO L273 TraceCheckUtils]: 43: Hoare triple {4203#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4204#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:37,229 INFO L273 TraceCheckUtils]: 44: Hoare triple {4204#(<= main_~i~0 11)} assume true; {4204#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:37,230 INFO L273 TraceCheckUtils]: 45: Hoare triple {4204#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4204#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:37,231 INFO L273 TraceCheckUtils]: 46: Hoare triple {4204#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4204#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:37,231 INFO L273 TraceCheckUtils]: 47: Hoare triple {4204#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4205#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:37,232 INFO L273 TraceCheckUtils]: 48: Hoare triple {4205#(<= main_~i~0 12)} assume true; {4205#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:37,233 INFO L273 TraceCheckUtils]: 49: Hoare triple {4205#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4194#false} is VALID [2018-11-14 18:41:37,233 INFO L273 TraceCheckUtils]: 50: Hoare triple {4194#false} havoc ~x~0;~x~0 := 0; {4194#false} is VALID [2018-11-14 18:41:37,233 INFO L273 TraceCheckUtils]: 51: Hoare triple {4194#false} assume true; {4194#false} is VALID [2018-11-14 18:41:37,234 INFO L273 TraceCheckUtils]: 52: Hoare triple {4194#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {4194#false} is VALID [2018-11-14 18:41:37,234 INFO L256 TraceCheckUtils]: 53: Hoare triple {4194#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {4194#false} is VALID [2018-11-14 18:41:37,234 INFO L273 TraceCheckUtils]: 54: Hoare triple {4194#false} ~cond := #in~cond; {4194#false} is VALID [2018-11-14 18:41:37,234 INFO L273 TraceCheckUtils]: 55: Hoare triple {4194#false} assume ~cond == 0; {4194#false} is VALID [2018-11-14 18:41:37,235 INFO L273 TraceCheckUtils]: 56: Hoare triple {4194#false} assume !false; {4194#false} is VALID [2018-11-14 18:41:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:37,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:37,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-14 18:41:37,260 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-11-14 18:41:37,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:37,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:41:37,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:37,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:41:37,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:41:37,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:41:37,324 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand 13 states. [2018-11-14 18:41:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:38,239 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2018-11-14 18:41:38,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:41:38,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-11-14 18:41:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:41:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2018-11-14 18:41:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:41:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2018-11-14 18:41:38,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 139 transitions. [2018-11-14 18:41:38,395 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-14 18:41:38,397 INFO L225 Difference]: With dead ends: 106 [2018-11-14 18:41:38,397 INFO L226 Difference]: Without dead ends: 87 [2018-11-14 18:41:38,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:41:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-14 18:41:38,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-11-14 18:41:38,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:38,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 84 states. [2018-11-14 18:41:38,523 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 84 states. [2018-11-14 18:41:38,524 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 84 states. [2018-11-14 18:41:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:38,526 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2018-11-14 18:41:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2018-11-14 18:41:38,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:38,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:38,527 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 87 states. [2018-11-14 18:41:38,527 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 87 states. [2018-11-14 18:41:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:38,529 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2018-11-14 18:41:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2018-11-14 18:41:38,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:38,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:38,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:38,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:38,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-14 18:41:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2018-11-14 18:41:38,532 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 57 [2018-11-14 18:41:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:38,533 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2018-11-14 18:41:38,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:41:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2018-11-14 18:41:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 18:41:38,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:38,534 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:38,534 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:38,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:38,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1717846962, now seen corresponding path program 11 times [2018-11-14 18:41:38,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:38,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:38,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:39,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {4787#true} call ULTIMATE.init(); {4787#true} is VALID [2018-11-14 18:41:39,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {4787#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4787#true} is VALID [2018-11-14 18:41:39,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {4787#true} assume true; {4787#true} is VALID [2018-11-14 18:41:39,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4787#true} {4787#true} #91#return; {4787#true} is VALID [2018-11-14 18:41:39,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {4787#true} call #t~ret13 := main(); {4787#true} is VALID [2018-11-14 18:41:39,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {4787#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {4787#true} is VALID [2018-11-14 18:41:39,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {4787#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {4787#true} is VALID [2018-11-14 18:41:39,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {4787#true} ~i~0 := 2; {4789#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:39,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {4789#(<= main_~i~0 2)} assume true; {4789#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:39,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {4789#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4789#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:39,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {4789#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4789#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:39,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {4789#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4790#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:39,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {4790#(<= main_~i~0 3)} assume true; {4790#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:39,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {4790#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4790#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:39,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {4790#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4790#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:39,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {4790#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4791#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:39,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {4791#(<= main_~i~0 4)} assume true; {4791#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:39,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {4791#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4791#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:39,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {4791#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4791#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:39,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {4791#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4792#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:39,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {4792#(<= main_~i~0 5)} assume true; {4792#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:39,144 INFO L273 TraceCheckUtils]: 21: Hoare triple {4792#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4792#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:39,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {4792#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4792#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:39,146 INFO L273 TraceCheckUtils]: 23: Hoare triple {4792#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4793#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:39,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {4793#(<= main_~i~0 6)} assume true; {4793#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:39,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {4793#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4793#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:39,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {4793#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4793#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:39,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {4793#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4794#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:39,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {4794#(<= main_~i~0 7)} assume true; {4794#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:39,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {4794#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4794#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:39,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {4794#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4794#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:39,150 INFO L273 TraceCheckUtils]: 31: Hoare triple {4794#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4795#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:39,151 INFO L273 TraceCheckUtils]: 32: Hoare triple {4795#(<= main_~i~0 8)} assume true; {4795#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:39,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {4795#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4795#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:39,152 INFO L273 TraceCheckUtils]: 34: Hoare triple {4795#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4795#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:39,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {4795#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4796#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:39,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {4796#(<= main_~i~0 9)} assume true; {4796#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:39,154 INFO L273 TraceCheckUtils]: 37: Hoare triple {4796#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4796#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:39,154 INFO L273 TraceCheckUtils]: 38: Hoare triple {4796#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4796#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:39,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {4796#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4797#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:39,156 INFO L273 TraceCheckUtils]: 40: Hoare triple {4797#(<= main_~i~0 10)} assume true; {4797#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:39,156 INFO L273 TraceCheckUtils]: 41: Hoare triple {4797#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4797#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:39,157 INFO L273 TraceCheckUtils]: 42: Hoare triple {4797#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4797#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:39,158 INFO L273 TraceCheckUtils]: 43: Hoare triple {4797#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4798#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:39,158 INFO L273 TraceCheckUtils]: 44: Hoare triple {4798#(<= main_~i~0 11)} assume true; {4798#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:39,159 INFO L273 TraceCheckUtils]: 45: Hoare triple {4798#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4798#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:39,162 INFO L273 TraceCheckUtils]: 46: Hoare triple {4798#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4798#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:39,163 INFO L273 TraceCheckUtils]: 47: Hoare triple {4798#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4799#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:39,164 INFO L273 TraceCheckUtils]: 48: Hoare triple {4799#(<= main_~i~0 12)} assume true; {4799#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:39,164 INFO L273 TraceCheckUtils]: 49: Hoare triple {4799#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4799#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:39,164 INFO L273 TraceCheckUtils]: 50: Hoare triple {4799#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4799#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:39,165 INFO L273 TraceCheckUtils]: 51: Hoare triple {4799#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4800#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:39,165 INFO L273 TraceCheckUtils]: 52: Hoare triple {4800#(<= main_~i~0 13)} assume true; {4800#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:39,166 INFO L273 TraceCheckUtils]: 53: Hoare triple {4800#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4788#false} is VALID [2018-11-14 18:41:39,166 INFO L273 TraceCheckUtils]: 54: Hoare triple {4788#false} havoc ~x~0;~x~0 := 0; {4788#false} is VALID [2018-11-14 18:41:39,166 INFO L273 TraceCheckUtils]: 55: Hoare triple {4788#false} assume true; {4788#false} is VALID [2018-11-14 18:41:39,166 INFO L273 TraceCheckUtils]: 56: Hoare triple {4788#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {4788#false} is VALID [2018-11-14 18:41:39,166 INFO L256 TraceCheckUtils]: 57: Hoare triple {4788#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {4788#false} is VALID [2018-11-14 18:41:39,166 INFO L273 TraceCheckUtils]: 58: Hoare triple {4788#false} ~cond := #in~cond; {4788#false} is VALID [2018-11-14 18:41:39,166 INFO L273 TraceCheckUtils]: 59: Hoare triple {4788#false} assume ~cond == 0; {4788#false} is VALID [2018-11-14 18:41:39,167 INFO L273 TraceCheckUtils]: 60: Hoare triple {4788#false} assume !false; {4788#false} is VALID [2018-11-14 18:41:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:39,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:39,170 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-14 18:41:39,187 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:41:39,276 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 18:41:39,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:39,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:39,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {4787#true} call ULTIMATE.init(); {4787#true} is VALID [2018-11-14 18:41:39,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {4787#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4787#true} is VALID [2018-11-14 18:41:39,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {4787#true} assume true; {4787#true} is VALID [2018-11-14 18:41:39,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4787#true} {4787#true} #91#return; {4787#true} is VALID [2018-11-14 18:41:39,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {4787#true} call #t~ret13 := main(); {4787#true} is VALID [2018-11-14 18:41:39,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {4787#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {4787#true} is VALID [2018-11-14 18:41:39,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {4787#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {4787#true} is VALID [2018-11-14 18:41:39,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {4787#true} ~i~0 := 2; {4789#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:39,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {4789#(<= main_~i~0 2)} assume true; {4789#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:39,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {4789#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4789#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:39,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {4789#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4789#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:39,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {4789#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4790#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:39,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {4790#(<= main_~i~0 3)} assume true; {4790#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:39,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {4790#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4790#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:39,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {4790#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4790#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:39,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {4790#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4791#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:39,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {4791#(<= main_~i~0 4)} assume true; {4791#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:39,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {4791#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4791#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:39,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {4791#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4791#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:39,422 INFO L273 TraceCheckUtils]: 19: Hoare triple {4791#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4792#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:39,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {4792#(<= main_~i~0 5)} assume true; {4792#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:39,423 INFO L273 TraceCheckUtils]: 21: Hoare triple {4792#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4792#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:39,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {4792#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4792#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:39,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {4792#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4793#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:39,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {4793#(<= main_~i~0 6)} assume true; {4793#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:39,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {4793#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4793#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:39,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {4793#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4793#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:39,427 INFO L273 TraceCheckUtils]: 27: Hoare triple {4793#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4794#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:39,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {4794#(<= main_~i~0 7)} assume true; {4794#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:39,428 INFO L273 TraceCheckUtils]: 29: Hoare triple {4794#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4794#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:39,428 INFO L273 TraceCheckUtils]: 30: Hoare triple {4794#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4794#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:39,429 INFO L273 TraceCheckUtils]: 31: Hoare triple {4794#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4795#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:39,429 INFO L273 TraceCheckUtils]: 32: Hoare triple {4795#(<= main_~i~0 8)} assume true; {4795#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:39,430 INFO L273 TraceCheckUtils]: 33: Hoare triple {4795#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4795#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:39,430 INFO L273 TraceCheckUtils]: 34: Hoare triple {4795#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4795#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:39,431 INFO L273 TraceCheckUtils]: 35: Hoare triple {4795#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4796#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:39,432 INFO L273 TraceCheckUtils]: 36: Hoare triple {4796#(<= main_~i~0 9)} assume true; {4796#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:39,432 INFO L273 TraceCheckUtils]: 37: Hoare triple {4796#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4796#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:39,433 INFO L273 TraceCheckUtils]: 38: Hoare triple {4796#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4796#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:39,434 INFO L273 TraceCheckUtils]: 39: Hoare triple {4796#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4797#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:39,434 INFO L273 TraceCheckUtils]: 40: Hoare triple {4797#(<= main_~i~0 10)} assume true; {4797#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:39,435 INFO L273 TraceCheckUtils]: 41: Hoare triple {4797#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4797#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:39,435 INFO L273 TraceCheckUtils]: 42: Hoare triple {4797#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4797#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:39,436 INFO L273 TraceCheckUtils]: 43: Hoare triple {4797#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4798#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:39,436 INFO L273 TraceCheckUtils]: 44: Hoare triple {4798#(<= main_~i~0 11)} assume true; {4798#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:39,437 INFO L273 TraceCheckUtils]: 45: Hoare triple {4798#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4798#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:39,437 INFO L273 TraceCheckUtils]: 46: Hoare triple {4798#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4798#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:39,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {4798#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4799#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:39,439 INFO L273 TraceCheckUtils]: 48: Hoare triple {4799#(<= main_~i~0 12)} assume true; {4799#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:39,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {4799#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {4799#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:39,440 INFO L273 TraceCheckUtils]: 50: Hoare triple {4799#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4799#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:39,441 INFO L273 TraceCheckUtils]: 51: Hoare triple {4799#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4800#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:39,441 INFO L273 TraceCheckUtils]: 52: Hoare triple {4800#(<= main_~i~0 13)} assume true; {4800#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:39,442 INFO L273 TraceCheckUtils]: 53: Hoare triple {4800#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4788#false} is VALID [2018-11-14 18:41:39,442 INFO L273 TraceCheckUtils]: 54: Hoare triple {4788#false} havoc ~x~0;~x~0 := 0; {4788#false} is VALID [2018-11-14 18:41:39,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {4788#false} assume true; {4788#false} is VALID [2018-11-14 18:41:39,442 INFO L273 TraceCheckUtils]: 56: Hoare triple {4788#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {4788#false} is VALID [2018-11-14 18:41:39,443 INFO L256 TraceCheckUtils]: 57: Hoare triple {4788#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {4788#false} is VALID [2018-11-14 18:41:39,443 INFO L273 TraceCheckUtils]: 58: Hoare triple {4788#false} ~cond := #in~cond; {4788#false} is VALID [2018-11-14 18:41:39,443 INFO L273 TraceCheckUtils]: 59: Hoare triple {4788#false} assume ~cond == 0; {4788#false} is VALID [2018-11-14 18:41:39,443 INFO L273 TraceCheckUtils]: 60: Hoare triple {4788#false} assume !false; {4788#false} is VALID [2018-11-14 18:41:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:39,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:39,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-14 18:41:39,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-11-14 18:41:39,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:39,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:41:39,523 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-14 18:41:39,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:41:39,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:41:39,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:41:39,524 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand 14 states. [2018-11-14 18:41:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:39,786 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2018-11-14 18:41:39,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:41:39,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-11-14 18:41:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:41:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 146 transitions. [2018-11-14 18:41:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:41:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 146 transitions. [2018-11-14 18:41:39,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 146 transitions. [2018-11-14 18:41:39,929 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-14 18:41:39,931 INFO L225 Difference]: With dead ends: 111 [2018-11-14 18:41:39,931 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 18:41:39,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:41:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 18:41:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-11-14 18:41:39,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:39,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 89 states. [2018-11-14 18:41:39,946 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 89 states. [2018-11-14 18:41:39,946 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 89 states. [2018-11-14 18:41:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:39,949 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2018-11-14 18:41:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2018-11-14 18:41:39,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:39,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:39,950 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 92 states. [2018-11-14 18:41:39,950 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 92 states. [2018-11-14 18:41:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:39,952 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2018-11-14 18:41:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2018-11-14 18:41:39,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:39,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:39,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:39,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 18:41:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2018-11-14 18:41:39,956 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 61 [2018-11-14 18:41:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:39,956 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2018-11-14 18:41:39,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:41:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2018-11-14 18:41:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-14 18:41:39,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:39,957 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:39,957 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:39,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:39,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1730979748, now seen corresponding path program 12 times [2018-11-14 18:41:39,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:39,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:39,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:39,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:39,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:40,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {5416#true} call ULTIMATE.init(); {5416#true} is VALID [2018-11-14 18:41:40,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {5416#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5416#true} is VALID [2018-11-14 18:41:40,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {5416#true} assume true; {5416#true} is VALID [2018-11-14 18:41:40,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5416#true} {5416#true} #91#return; {5416#true} is VALID [2018-11-14 18:41:40,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {5416#true} call #t~ret13 := main(); {5416#true} is VALID [2018-11-14 18:41:40,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {5416#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {5416#true} is VALID [2018-11-14 18:41:40,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {5416#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {5416#true} is VALID [2018-11-14 18:41:40,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {5416#true} ~i~0 := 2; {5418#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:40,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {5418#(<= main_~i~0 2)} assume true; {5418#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:40,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {5418#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5418#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:40,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {5418#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5418#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:40,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {5418#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5419#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:40,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {5419#(<= main_~i~0 3)} assume true; {5419#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:40,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {5419#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5419#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:40,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {5419#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5419#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:40,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {5419#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5420#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:40,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {5420#(<= main_~i~0 4)} assume true; {5420#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:40,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {5420#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5420#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:40,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {5420#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5420#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:40,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {5420#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5421#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:40,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {5421#(<= main_~i~0 5)} assume true; {5421#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:40,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {5421#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5421#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:40,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {5421#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5421#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:40,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {5421#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5422#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:40,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {5422#(<= main_~i~0 6)} assume true; {5422#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:40,591 INFO L273 TraceCheckUtils]: 25: Hoare triple {5422#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5422#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:40,591 INFO L273 TraceCheckUtils]: 26: Hoare triple {5422#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5422#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:40,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {5422#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5423#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:40,592 INFO L273 TraceCheckUtils]: 28: Hoare triple {5423#(<= main_~i~0 7)} assume true; {5423#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:40,593 INFO L273 TraceCheckUtils]: 29: Hoare triple {5423#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5423#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:40,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {5423#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5423#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:40,594 INFO L273 TraceCheckUtils]: 31: Hoare triple {5423#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5424#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:40,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {5424#(<= main_~i~0 8)} assume true; {5424#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:40,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {5424#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5424#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:40,596 INFO L273 TraceCheckUtils]: 34: Hoare triple {5424#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5424#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:40,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {5424#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5425#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:40,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {5425#(<= main_~i~0 9)} assume true; {5425#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:40,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {5425#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5425#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:40,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {5425#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5425#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:40,599 INFO L273 TraceCheckUtils]: 39: Hoare triple {5425#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5426#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:40,599 INFO L273 TraceCheckUtils]: 40: Hoare triple {5426#(<= main_~i~0 10)} assume true; {5426#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:40,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {5426#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5426#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:40,600 INFO L273 TraceCheckUtils]: 42: Hoare triple {5426#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5426#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:40,601 INFO L273 TraceCheckUtils]: 43: Hoare triple {5426#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5427#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:40,602 INFO L273 TraceCheckUtils]: 44: Hoare triple {5427#(<= main_~i~0 11)} assume true; {5427#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:40,602 INFO L273 TraceCheckUtils]: 45: Hoare triple {5427#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5427#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:40,603 INFO L273 TraceCheckUtils]: 46: Hoare triple {5427#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5427#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:40,604 INFO L273 TraceCheckUtils]: 47: Hoare triple {5427#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5428#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:40,604 INFO L273 TraceCheckUtils]: 48: Hoare triple {5428#(<= main_~i~0 12)} assume true; {5428#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:40,605 INFO L273 TraceCheckUtils]: 49: Hoare triple {5428#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5428#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:40,605 INFO L273 TraceCheckUtils]: 50: Hoare triple {5428#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5428#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:40,606 INFO L273 TraceCheckUtils]: 51: Hoare triple {5428#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5429#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:40,606 INFO L273 TraceCheckUtils]: 52: Hoare triple {5429#(<= main_~i~0 13)} assume true; {5429#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:40,607 INFO L273 TraceCheckUtils]: 53: Hoare triple {5429#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5429#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:40,607 INFO L273 TraceCheckUtils]: 54: Hoare triple {5429#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5429#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:40,608 INFO L273 TraceCheckUtils]: 55: Hoare triple {5429#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5430#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:40,608 INFO L273 TraceCheckUtils]: 56: Hoare triple {5430#(<= main_~i~0 14)} assume true; {5430#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:40,609 INFO L273 TraceCheckUtils]: 57: Hoare triple {5430#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5417#false} is VALID [2018-11-14 18:41:40,609 INFO L273 TraceCheckUtils]: 58: Hoare triple {5417#false} havoc ~x~0;~x~0 := 0; {5417#false} is VALID [2018-11-14 18:41:40,610 INFO L273 TraceCheckUtils]: 59: Hoare triple {5417#false} assume true; {5417#false} is VALID [2018-11-14 18:41:40,610 INFO L273 TraceCheckUtils]: 60: Hoare triple {5417#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {5417#false} is VALID [2018-11-14 18:41:40,610 INFO L256 TraceCheckUtils]: 61: Hoare triple {5417#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {5417#false} is VALID [2018-11-14 18:41:40,610 INFO L273 TraceCheckUtils]: 62: Hoare triple {5417#false} ~cond := #in~cond; {5417#false} is VALID [2018-11-14 18:41:40,610 INFO L273 TraceCheckUtils]: 63: Hoare triple {5417#false} assume ~cond == 0; {5417#false} is VALID [2018-11-14 18:41:40,611 INFO L273 TraceCheckUtils]: 64: Hoare triple {5417#false} assume !false; {5417#false} is VALID [2018-11-14 18:41:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:40,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:40,615 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-14 18:41:40,623 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:41:40,666 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 18:41:40,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:40,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:40,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {5416#true} call ULTIMATE.init(); {5416#true} is VALID [2018-11-14 18:41:40,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {5416#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5416#true} is VALID [2018-11-14 18:41:40,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {5416#true} assume true; {5416#true} is VALID [2018-11-14 18:41:40,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5416#true} {5416#true} #91#return; {5416#true} is VALID [2018-11-14 18:41:40,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {5416#true} call #t~ret13 := main(); {5416#true} is VALID [2018-11-14 18:41:40,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {5416#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {5416#true} is VALID [2018-11-14 18:41:40,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {5416#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {5416#true} is VALID [2018-11-14 18:41:40,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {5416#true} ~i~0 := 2; {5418#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:40,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {5418#(<= main_~i~0 2)} assume true; {5418#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:40,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {5418#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5418#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:40,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {5418#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5418#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:40,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {5418#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5419#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:40,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {5419#(<= main_~i~0 3)} assume true; {5419#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:40,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {5419#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5419#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:40,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {5419#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5419#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:40,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {5419#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5420#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:40,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {5420#(<= main_~i~0 4)} assume true; {5420#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:40,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {5420#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5420#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:40,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {5420#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5420#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:40,808 INFO L273 TraceCheckUtils]: 19: Hoare triple {5420#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5421#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:40,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {5421#(<= main_~i~0 5)} assume true; {5421#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:40,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {5421#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5421#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:40,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {5421#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5421#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:40,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {5421#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5422#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:40,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {5422#(<= main_~i~0 6)} assume true; {5422#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:40,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {5422#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5422#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:40,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {5422#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5422#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:40,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {5422#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5423#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:40,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {5423#(<= main_~i~0 7)} assume true; {5423#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:40,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {5423#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5423#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:40,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {5423#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5423#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:40,815 INFO L273 TraceCheckUtils]: 31: Hoare triple {5423#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5424#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:40,816 INFO L273 TraceCheckUtils]: 32: Hoare triple {5424#(<= main_~i~0 8)} assume true; {5424#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:40,816 INFO L273 TraceCheckUtils]: 33: Hoare triple {5424#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5424#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:40,817 INFO L273 TraceCheckUtils]: 34: Hoare triple {5424#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5424#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:40,818 INFO L273 TraceCheckUtils]: 35: Hoare triple {5424#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5425#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:40,818 INFO L273 TraceCheckUtils]: 36: Hoare triple {5425#(<= main_~i~0 9)} assume true; {5425#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:40,819 INFO L273 TraceCheckUtils]: 37: Hoare triple {5425#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5425#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:40,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {5425#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5425#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:40,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {5425#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5426#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:40,821 INFO L273 TraceCheckUtils]: 40: Hoare triple {5426#(<= main_~i~0 10)} assume true; {5426#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:40,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {5426#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5426#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:40,822 INFO L273 TraceCheckUtils]: 42: Hoare triple {5426#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5426#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:40,822 INFO L273 TraceCheckUtils]: 43: Hoare triple {5426#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5427#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:40,823 INFO L273 TraceCheckUtils]: 44: Hoare triple {5427#(<= main_~i~0 11)} assume true; {5427#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:40,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {5427#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5427#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:40,824 INFO L273 TraceCheckUtils]: 46: Hoare triple {5427#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5427#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:40,825 INFO L273 TraceCheckUtils]: 47: Hoare triple {5427#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5428#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:40,826 INFO L273 TraceCheckUtils]: 48: Hoare triple {5428#(<= main_~i~0 12)} assume true; {5428#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:40,827 INFO L273 TraceCheckUtils]: 49: Hoare triple {5428#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5428#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:40,827 INFO L273 TraceCheckUtils]: 50: Hoare triple {5428#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5428#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:40,828 INFO L273 TraceCheckUtils]: 51: Hoare triple {5428#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5429#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:40,829 INFO L273 TraceCheckUtils]: 52: Hoare triple {5429#(<= main_~i~0 13)} assume true; {5429#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:40,829 INFO L273 TraceCheckUtils]: 53: Hoare triple {5429#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {5429#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:40,830 INFO L273 TraceCheckUtils]: 54: Hoare triple {5429#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5429#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:40,831 INFO L273 TraceCheckUtils]: 55: Hoare triple {5429#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5430#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:40,831 INFO L273 TraceCheckUtils]: 56: Hoare triple {5430#(<= main_~i~0 14)} assume true; {5430#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:40,832 INFO L273 TraceCheckUtils]: 57: Hoare triple {5430#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5417#false} is VALID [2018-11-14 18:41:40,832 INFO L273 TraceCheckUtils]: 58: Hoare triple {5417#false} havoc ~x~0;~x~0 := 0; {5417#false} is VALID [2018-11-14 18:41:40,833 INFO L273 TraceCheckUtils]: 59: Hoare triple {5417#false} assume true; {5417#false} is VALID [2018-11-14 18:41:40,833 INFO L273 TraceCheckUtils]: 60: Hoare triple {5417#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {5417#false} is VALID [2018-11-14 18:41:40,833 INFO L256 TraceCheckUtils]: 61: Hoare triple {5417#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {5417#false} is VALID [2018-11-14 18:41:40,833 INFO L273 TraceCheckUtils]: 62: Hoare triple {5417#false} ~cond := #in~cond; {5417#false} is VALID [2018-11-14 18:41:40,834 INFO L273 TraceCheckUtils]: 63: Hoare triple {5417#false} assume ~cond == 0; {5417#false} is VALID [2018-11-14 18:41:40,834 INFO L273 TraceCheckUtils]: 64: Hoare triple {5417#false} assume !false; {5417#false} is VALID [2018-11-14 18:41:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:40,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:40,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-14 18:41:40,859 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-11-14 18:41:40,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:40,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 18:41:40,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:40,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 18:41:40,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 18:41:40,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:41:40,922 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 15 states. [2018-11-14 18:41:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:41,462 INFO L93 Difference]: Finished difference Result 116 states and 153 transitions. [2018-11-14 18:41:41,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 18:41:41,463 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-11-14 18:41:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:41:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 153 transitions. [2018-11-14 18:41:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:41:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 153 transitions. [2018-11-14 18:41:41,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 153 transitions. [2018-11-14 18:41:42,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:42,059 INFO L225 Difference]: With dead ends: 116 [2018-11-14 18:41:42,060 INFO L226 Difference]: Without dead ends: 97 [2018-11-14 18:41:42,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:41:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-14 18:41:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-14 18:41:42,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:42,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 94 states. [2018-11-14 18:41:42,142 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 94 states. [2018-11-14 18:41:42,142 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 94 states. [2018-11-14 18:41:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:42,145 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2018-11-14 18:41:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2018-11-14 18:41:42,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:42,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:42,146 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 97 states. [2018-11-14 18:41:42,146 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 97 states. [2018-11-14 18:41:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:42,147 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2018-11-14 18:41:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2018-11-14 18:41:42,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:42,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:42,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:42,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 18:41:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2018-11-14 18:41:42,150 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 65 [2018-11-14 18:41:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:42,150 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-14 18:41:42,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 18:41:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2018-11-14 18:41:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 18:41:42,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:42,151 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:42,151 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:42,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:42,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1146995350, now seen corresponding path program 13 times [2018-11-14 18:41:42,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:42,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:42,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:42,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:42,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:42,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {6080#true} call ULTIMATE.init(); {6080#true} is VALID [2018-11-14 18:41:42,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {6080#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6080#true} is VALID [2018-11-14 18:41:42,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {6080#true} assume true; {6080#true} is VALID [2018-11-14 18:41:42,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6080#true} {6080#true} #91#return; {6080#true} is VALID [2018-11-14 18:41:42,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {6080#true} call #t~ret13 := main(); {6080#true} is VALID [2018-11-14 18:41:42,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {6080#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {6080#true} is VALID [2018-11-14 18:41:42,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {6080#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {6080#true} is VALID [2018-11-14 18:41:42,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {6080#true} ~i~0 := 2; {6082#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:42,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {6082#(<= main_~i~0 2)} assume true; {6082#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:42,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {6082#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6082#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:42,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {6082#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6082#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:42,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {6082#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6083#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:42,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {6083#(<= main_~i~0 3)} assume true; {6083#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:42,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {6083#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6083#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:42,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {6083#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6083#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:42,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {6083#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6084#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:42,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {6084#(<= main_~i~0 4)} assume true; {6084#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:42,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {6084#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6084#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:42,451 INFO L273 TraceCheckUtils]: 18: Hoare triple {6084#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6084#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:42,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {6084#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6085#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:42,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {6085#(<= main_~i~0 5)} assume true; {6085#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:42,453 INFO L273 TraceCheckUtils]: 21: Hoare triple {6085#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6085#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:42,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {6085#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6085#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:42,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {6085#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6086#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:42,454 INFO L273 TraceCheckUtils]: 24: Hoare triple {6086#(<= main_~i~0 6)} assume true; {6086#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:42,455 INFO L273 TraceCheckUtils]: 25: Hoare triple {6086#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6086#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:42,455 INFO L273 TraceCheckUtils]: 26: Hoare triple {6086#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6086#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:42,456 INFO L273 TraceCheckUtils]: 27: Hoare triple {6086#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6087#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:42,457 INFO L273 TraceCheckUtils]: 28: Hoare triple {6087#(<= main_~i~0 7)} assume true; {6087#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:42,457 INFO L273 TraceCheckUtils]: 29: Hoare triple {6087#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6087#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:42,458 INFO L273 TraceCheckUtils]: 30: Hoare triple {6087#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6087#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:42,459 INFO L273 TraceCheckUtils]: 31: Hoare triple {6087#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6088#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:42,459 INFO L273 TraceCheckUtils]: 32: Hoare triple {6088#(<= main_~i~0 8)} assume true; {6088#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:42,460 INFO L273 TraceCheckUtils]: 33: Hoare triple {6088#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6088#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:42,460 INFO L273 TraceCheckUtils]: 34: Hoare triple {6088#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6088#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:42,461 INFO L273 TraceCheckUtils]: 35: Hoare triple {6088#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6089#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:42,461 INFO L273 TraceCheckUtils]: 36: Hoare triple {6089#(<= main_~i~0 9)} assume true; {6089#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:42,462 INFO L273 TraceCheckUtils]: 37: Hoare triple {6089#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6089#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:42,463 INFO L273 TraceCheckUtils]: 38: Hoare triple {6089#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6089#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:42,463 INFO L273 TraceCheckUtils]: 39: Hoare triple {6089#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6090#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:42,464 INFO L273 TraceCheckUtils]: 40: Hoare triple {6090#(<= main_~i~0 10)} assume true; {6090#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:42,464 INFO L273 TraceCheckUtils]: 41: Hoare triple {6090#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6090#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:42,465 INFO L273 TraceCheckUtils]: 42: Hoare triple {6090#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6090#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:42,466 INFO L273 TraceCheckUtils]: 43: Hoare triple {6090#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6091#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:42,466 INFO L273 TraceCheckUtils]: 44: Hoare triple {6091#(<= main_~i~0 11)} assume true; {6091#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:42,467 INFO L273 TraceCheckUtils]: 45: Hoare triple {6091#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6091#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:42,467 INFO L273 TraceCheckUtils]: 46: Hoare triple {6091#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6091#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:42,468 INFO L273 TraceCheckUtils]: 47: Hoare triple {6091#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6092#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:42,469 INFO L273 TraceCheckUtils]: 48: Hoare triple {6092#(<= main_~i~0 12)} assume true; {6092#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:42,469 INFO L273 TraceCheckUtils]: 49: Hoare triple {6092#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6092#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:42,470 INFO L273 TraceCheckUtils]: 50: Hoare triple {6092#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6092#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:42,470 INFO L273 TraceCheckUtils]: 51: Hoare triple {6092#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6093#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:42,471 INFO L273 TraceCheckUtils]: 52: Hoare triple {6093#(<= main_~i~0 13)} assume true; {6093#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:42,471 INFO L273 TraceCheckUtils]: 53: Hoare triple {6093#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6093#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:42,472 INFO L273 TraceCheckUtils]: 54: Hoare triple {6093#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6093#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:42,473 INFO L273 TraceCheckUtils]: 55: Hoare triple {6093#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6094#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:42,473 INFO L273 TraceCheckUtils]: 56: Hoare triple {6094#(<= main_~i~0 14)} assume true; {6094#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:42,474 INFO L273 TraceCheckUtils]: 57: Hoare triple {6094#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6094#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:42,474 INFO L273 TraceCheckUtils]: 58: Hoare triple {6094#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6094#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:42,475 INFO L273 TraceCheckUtils]: 59: Hoare triple {6094#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6095#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:42,476 INFO L273 TraceCheckUtils]: 60: Hoare triple {6095#(<= main_~i~0 15)} assume true; {6095#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:42,476 INFO L273 TraceCheckUtils]: 61: Hoare triple {6095#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6081#false} is VALID [2018-11-14 18:41:42,476 INFO L273 TraceCheckUtils]: 62: Hoare triple {6081#false} havoc ~x~0;~x~0 := 0; {6081#false} is VALID [2018-11-14 18:41:42,477 INFO L273 TraceCheckUtils]: 63: Hoare triple {6081#false} assume true; {6081#false} is VALID [2018-11-14 18:41:42,477 INFO L273 TraceCheckUtils]: 64: Hoare triple {6081#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {6081#false} is VALID [2018-11-14 18:41:42,477 INFO L256 TraceCheckUtils]: 65: Hoare triple {6081#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {6081#false} is VALID [2018-11-14 18:41:42,477 INFO L273 TraceCheckUtils]: 66: Hoare triple {6081#false} ~cond := #in~cond; {6081#false} is VALID [2018-11-14 18:41:42,478 INFO L273 TraceCheckUtils]: 67: Hoare triple {6081#false} assume ~cond == 0; {6081#false} is VALID [2018-11-14 18:41:42,478 INFO L273 TraceCheckUtils]: 68: Hoare triple {6081#false} assume !false; {6081#false} is VALID [2018-11-14 18:41:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:42,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:42,481 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-14 18:41:42,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:42,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:42,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {6080#true} call ULTIMATE.init(); {6080#true} is VALID [2018-11-14 18:41:42,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {6080#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6080#true} is VALID [2018-11-14 18:41:42,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {6080#true} assume true; {6080#true} is VALID [2018-11-14 18:41:42,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6080#true} {6080#true} #91#return; {6080#true} is VALID [2018-11-14 18:41:42,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {6080#true} call #t~ret13 := main(); {6080#true} is VALID [2018-11-14 18:41:42,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {6080#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {6080#true} is VALID [2018-11-14 18:41:42,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {6080#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {6080#true} is VALID [2018-11-14 18:41:42,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {6080#true} ~i~0 := 2; {6082#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:42,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {6082#(<= main_~i~0 2)} assume true; {6082#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:42,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {6082#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6082#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:42,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {6082#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6082#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:42,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {6082#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6083#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:42,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {6083#(<= main_~i~0 3)} assume true; {6083#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:42,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {6083#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6083#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:42,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {6083#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6083#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:42,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {6083#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6084#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:42,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {6084#(<= main_~i~0 4)} assume true; {6084#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:42,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {6084#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6084#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:42,677 INFO L273 TraceCheckUtils]: 18: Hoare triple {6084#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6084#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:42,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {6084#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6085#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:42,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {6085#(<= main_~i~0 5)} assume true; {6085#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:42,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {6085#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6085#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:42,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {6085#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6085#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:42,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {6085#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6086#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:42,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {6086#(<= main_~i~0 6)} assume true; {6086#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:42,681 INFO L273 TraceCheckUtils]: 25: Hoare triple {6086#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6086#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:42,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {6086#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6086#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:42,682 INFO L273 TraceCheckUtils]: 27: Hoare triple {6086#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6087#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:42,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {6087#(<= main_~i~0 7)} assume true; {6087#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:42,683 INFO L273 TraceCheckUtils]: 29: Hoare triple {6087#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6087#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:42,684 INFO L273 TraceCheckUtils]: 30: Hoare triple {6087#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6087#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:42,685 INFO L273 TraceCheckUtils]: 31: Hoare triple {6087#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6088#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:42,685 INFO L273 TraceCheckUtils]: 32: Hoare triple {6088#(<= main_~i~0 8)} assume true; {6088#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:42,686 INFO L273 TraceCheckUtils]: 33: Hoare triple {6088#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6088#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:42,686 INFO L273 TraceCheckUtils]: 34: Hoare triple {6088#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6088#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:42,687 INFO L273 TraceCheckUtils]: 35: Hoare triple {6088#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6089#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:42,688 INFO L273 TraceCheckUtils]: 36: Hoare triple {6089#(<= main_~i~0 9)} assume true; {6089#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:42,688 INFO L273 TraceCheckUtils]: 37: Hoare triple {6089#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6089#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:42,689 INFO L273 TraceCheckUtils]: 38: Hoare triple {6089#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6089#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:42,689 INFO L273 TraceCheckUtils]: 39: Hoare triple {6089#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6090#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:42,690 INFO L273 TraceCheckUtils]: 40: Hoare triple {6090#(<= main_~i~0 10)} assume true; {6090#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:42,690 INFO L273 TraceCheckUtils]: 41: Hoare triple {6090#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6090#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:42,691 INFO L273 TraceCheckUtils]: 42: Hoare triple {6090#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6090#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:42,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {6090#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6091#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:42,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {6091#(<= main_~i~0 11)} assume true; {6091#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:42,693 INFO L273 TraceCheckUtils]: 45: Hoare triple {6091#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6091#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:42,693 INFO L273 TraceCheckUtils]: 46: Hoare triple {6091#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6091#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:42,694 INFO L273 TraceCheckUtils]: 47: Hoare triple {6091#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6092#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:42,695 INFO L273 TraceCheckUtils]: 48: Hoare triple {6092#(<= main_~i~0 12)} assume true; {6092#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:42,695 INFO L273 TraceCheckUtils]: 49: Hoare triple {6092#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6092#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:42,696 INFO L273 TraceCheckUtils]: 50: Hoare triple {6092#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6092#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:42,696 INFO L273 TraceCheckUtils]: 51: Hoare triple {6092#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6093#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:42,697 INFO L273 TraceCheckUtils]: 52: Hoare triple {6093#(<= main_~i~0 13)} assume true; {6093#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:42,697 INFO L273 TraceCheckUtils]: 53: Hoare triple {6093#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6093#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:42,698 INFO L273 TraceCheckUtils]: 54: Hoare triple {6093#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6093#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:42,699 INFO L273 TraceCheckUtils]: 55: Hoare triple {6093#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6094#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:42,699 INFO L273 TraceCheckUtils]: 56: Hoare triple {6094#(<= main_~i~0 14)} assume true; {6094#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:42,700 INFO L273 TraceCheckUtils]: 57: Hoare triple {6094#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6094#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:42,700 INFO L273 TraceCheckUtils]: 58: Hoare triple {6094#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6094#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:42,701 INFO L273 TraceCheckUtils]: 59: Hoare triple {6094#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6095#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:42,702 INFO L273 TraceCheckUtils]: 60: Hoare triple {6095#(<= main_~i~0 15)} assume true; {6095#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:42,702 INFO L273 TraceCheckUtils]: 61: Hoare triple {6095#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6081#false} is VALID [2018-11-14 18:41:42,703 INFO L273 TraceCheckUtils]: 62: Hoare triple {6081#false} havoc ~x~0;~x~0 := 0; {6081#false} is VALID [2018-11-14 18:41:42,703 INFO L273 TraceCheckUtils]: 63: Hoare triple {6081#false} assume true; {6081#false} is VALID [2018-11-14 18:41:42,703 INFO L273 TraceCheckUtils]: 64: Hoare triple {6081#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {6081#false} is VALID [2018-11-14 18:41:42,703 INFO L256 TraceCheckUtils]: 65: Hoare triple {6081#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {6081#false} is VALID [2018-11-14 18:41:42,703 INFO L273 TraceCheckUtils]: 66: Hoare triple {6081#false} ~cond := #in~cond; {6081#false} is VALID [2018-11-14 18:41:42,704 INFO L273 TraceCheckUtils]: 67: Hoare triple {6081#false} assume ~cond == 0; {6081#false} is VALID [2018-11-14 18:41:42,704 INFO L273 TraceCheckUtils]: 68: Hoare triple {6081#false} assume !false; {6081#false} is VALID [2018-11-14 18:41:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:42,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:42,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-14 18:41:42,729 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2018-11-14 18:41:42,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:42,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:41:42,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:42,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:41:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:41:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:41:42,794 INFO L87 Difference]: Start difference. First operand 94 states and 125 transitions. Second operand 16 states. [2018-11-14 18:41:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:43,919 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2018-11-14 18:41:43,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:41:43,919 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2018-11-14 18:41:43,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:41:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 160 transitions. [2018-11-14 18:41:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:41:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 160 transitions. [2018-11-14 18:41:43,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 160 transitions. [2018-11-14 18:41:44,083 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-14 18:41:44,085 INFO L225 Difference]: With dead ends: 121 [2018-11-14 18:41:44,085 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 18:41:44,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:41:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 18:41:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-11-14 18:41:44,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:44,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 99 states. [2018-11-14 18:41:44,108 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 99 states. [2018-11-14 18:41:44,108 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 99 states. [2018-11-14 18:41:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:44,110 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2018-11-14 18:41:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2018-11-14 18:41:44,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:44,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:44,111 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 102 states. [2018-11-14 18:41:44,111 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 102 states. [2018-11-14 18:41:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:44,113 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2018-11-14 18:41:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2018-11-14 18:41:44,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:44,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:44,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:44,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-14 18:41:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2018-11-14 18:41:44,116 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 132 transitions. Word has length 69 [2018-11-14 18:41:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:44,116 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-11-14 18:41:44,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:41:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 132 transitions. [2018-11-14 18:41:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 18:41:44,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:44,118 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:44,118 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:44,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:44,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1664871288, now seen corresponding path program 14 times [2018-11-14 18:41:44,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:44,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:44,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:44,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:44,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:44,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {6779#true} call ULTIMATE.init(); {6779#true} is VALID [2018-11-14 18:41:44,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {6779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6779#true} is VALID [2018-11-14 18:41:44,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {6779#true} assume true; {6779#true} is VALID [2018-11-14 18:41:44,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6779#true} {6779#true} #91#return; {6779#true} is VALID [2018-11-14 18:41:44,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {6779#true} call #t~ret13 := main(); {6779#true} is VALID [2018-11-14 18:41:44,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {6779#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {6779#true} is VALID [2018-11-14 18:41:44,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {6779#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {6779#true} is VALID [2018-11-14 18:41:44,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {6779#true} ~i~0 := 2; {6781#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:44,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {6781#(<= main_~i~0 2)} assume true; {6781#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:44,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {6781#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6781#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:44,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {6781#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6781#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:44,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {6781#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6782#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:44,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {6782#(<= main_~i~0 3)} assume true; {6782#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:44,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {6782#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6782#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:44,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {6782#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6782#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:44,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {6782#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6783#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:44,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {6783#(<= main_~i~0 4)} assume true; {6783#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:44,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {6783#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6783#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:44,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {6783#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6783#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:44,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {6783#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6784#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:44,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {6784#(<= main_~i~0 5)} assume true; {6784#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:44,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {6784#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6784#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:44,442 INFO L273 TraceCheckUtils]: 22: Hoare triple {6784#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6784#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:44,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {6784#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6785#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:44,443 INFO L273 TraceCheckUtils]: 24: Hoare triple {6785#(<= main_~i~0 6)} assume true; {6785#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:44,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {6785#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6785#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:44,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {6785#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6785#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:44,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {6785#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6786#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:44,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {6786#(<= main_~i~0 7)} assume true; {6786#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:44,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {6786#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6786#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:44,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {6786#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6786#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:44,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {6786#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6787#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:44,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {6787#(<= main_~i~0 8)} assume true; {6787#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:44,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {6787#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6787#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:44,449 INFO L273 TraceCheckUtils]: 34: Hoare triple {6787#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6787#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:44,449 INFO L273 TraceCheckUtils]: 35: Hoare triple {6787#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6788#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:44,450 INFO L273 TraceCheckUtils]: 36: Hoare triple {6788#(<= main_~i~0 9)} assume true; {6788#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:44,450 INFO L273 TraceCheckUtils]: 37: Hoare triple {6788#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6788#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:44,451 INFO L273 TraceCheckUtils]: 38: Hoare triple {6788#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6788#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:44,452 INFO L273 TraceCheckUtils]: 39: Hoare triple {6788#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6789#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:44,452 INFO L273 TraceCheckUtils]: 40: Hoare triple {6789#(<= main_~i~0 10)} assume true; {6789#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:44,453 INFO L273 TraceCheckUtils]: 41: Hoare triple {6789#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6789#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:44,453 INFO L273 TraceCheckUtils]: 42: Hoare triple {6789#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6789#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:44,454 INFO L273 TraceCheckUtils]: 43: Hoare triple {6789#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6790#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:44,455 INFO L273 TraceCheckUtils]: 44: Hoare triple {6790#(<= main_~i~0 11)} assume true; {6790#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:44,455 INFO L273 TraceCheckUtils]: 45: Hoare triple {6790#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6790#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:44,456 INFO L273 TraceCheckUtils]: 46: Hoare triple {6790#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6790#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:44,456 INFO L273 TraceCheckUtils]: 47: Hoare triple {6790#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6791#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:44,457 INFO L273 TraceCheckUtils]: 48: Hoare triple {6791#(<= main_~i~0 12)} assume true; {6791#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:44,457 INFO L273 TraceCheckUtils]: 49: Hoare triple {6791#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6791#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:44,458 INFO L273 TraceCheckUtils]: 50: Hoare triple {6791#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6791#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:44,459 INFO L273 TraceCheckUtils]: 51: Hoare triple {6791#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6792#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:44,459 INFO L273 TraceCheckUtils]: 52: Hoare triple {6792#(<= main_~i~0 13)} assume true; {6792#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:44,460 INFO L273 TraceCheckUtils]: 53: Hoare triple {6792#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6792#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:44,460 INFO L273 TraceCheckUtils]: 54: Hoare triple {6792#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6792#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:44,461 INFO L273 TraceCheckUtils]: 55: Hoare triple {6792#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6793#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:44,462 INFO L273 TraceCheckUtils]: 56: Hoare triple {6793#(<= main_~i~0 14)} assume true; {6793#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:44,462 INFO L273 TraceCheckUtils]: 57: Hoare triple {6793#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6793#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:44,463 INFO L273 TraceCheckUtils]: 58: Hoare triple {6793#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6793#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:44,463 INFO L273 TraceCheckUtils]: 59: Hoare triple {6793#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6794#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:44,464 INFO L273 TraceCheckUtils]: 60: Hoare triple {6794#(<= main_~i~0 15)} assume true; {6794#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:44,464 INFO L273 TraceCheckUtils]: 61: Hoare triple {6794#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6794#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:44,465 INFO L273 TraceCheckUtils]: 62: Hoare triple {6794#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6794#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:44,466 INFO L273 TraceCheckUtils]: 63: Hoare triple {6794#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6795#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:44,466 INFO L273 TraceCheckUtils]: 64: Hoare triple {6795#(<= main_~i~0 16)} assume true; {6795#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:44,467 INFO L273 TraceCheckUtils]: 65: Hoare triple {6795#(<= main_~i~0 16)} assume !(~i~0 < 100000); {6780#false} is VALID [2018-11-14 18:41:44,467 INFO L273 TraceCheckUtils]: 66: Hoare triple {6780#false} havoc ~x~0;~x~0 := 0; {6780#false} is VALID [2018-11-14 18:41:44,467 INFO L273 TraceCheckUtils]: 67: Hoare triple {6780#false} assume true; {6780#false} is VALID [2018-11-14 18:41:44,468 INFO L273 TraceCheckUtils]: 68: Hoare triple {6780#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {6780#false} is VALID [2018-11-14 18:41:44,468 INFO L256 TraceCheckUtils]: 69: Hoare triple {6780#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {6780#false} is VALID [2018-11-14 18:41:44,468 INFO L273 TraceCheckUtils]: 70: Hoare triple {6780#false} ~cond := #in~cond; {6780#false} is VALID [2018-11-14 18:41:44,468 INFO L273 TraceCheckUtils]: 71: Hoare triple {6780#false} assume ~cond == 0; {6780#false} is VALID [2018-11-14 18:41:44,468 INFO L273 TraceCheckUtils]: 72: Hoare triple {6780#false} assume !false; {6780#false} is VALID [2018-11-14 18:41:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:44,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:44,473 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-14 18:41:44,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:41:44,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:41:44,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:44,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:44,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {6779#true} call ULTIMATE.init(); {6779#true} is VALID [2018-11-14 18:41:44,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {6779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6779#true} is VALID [2018-11-14 18:41:44,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {6779#true} assume true; {6779#true} is VALID [2018-11-14 18:41:44,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6779#true} {6779#true} #91#return; {6779#true} is VALID [2018-11-14 18:41:44,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {6779#true} call #t~ret13 := main(); {6779#true} is VALID [2018-11-14 18:41:44,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {6779#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {6779#true} is VALID [2018-11-14 18:41:44,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {6779#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {6779#true} is VALID [2018-11-14 18:41:44,714 INFO L273 TraceCheckUtils]: 7: Hoare triple {6779#true} ~i~0 := 2; {6781#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:44,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {6781#(<= main_~i~0 2)} assume true; {6781#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:44,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {6781#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6781#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:44,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {6781#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6781#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:44,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {6781#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6782#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:44,716 INFO L273 TraceCheckUtils]: 12: Hoare triple {6782#(<= main_~i~0 3)} assume true; {6782#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:44,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {6782#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6782#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:44,717 INFO L273 TraceCheckUtils]: 14: Hoare triple {6782#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6782#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:44,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {6782#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6783#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:44,719 INFO L273 TraceCheckUtils]: 16: Hoare triple {6783#(<= main_~i~0 4)} assume true; {6783#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:44,719 INFO L273 TraceCheckUtils]: 17: Hoare triple {6783#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6783#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:44,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {6783#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6783#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:44,721 INFO L273 TraceCheckUtils]: 19: Hoare triple {6783#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6784#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:44,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {6784#(<= main_~i~0 5)} assume true; {6784#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:44,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {6784#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6784#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:44,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {6784#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6784#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:44,744 INFO L273 TraceCheckUtils]: 23: Hoare triple {6784#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6785#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:44,745 INFO L273 TraceCheckUtils]: 24: Hoare triple {6785#(<= main_~i~0 6)} assume true; {6785#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:44,745 INFO L273 TraceCheckUtils]: 25: Hoare triple {6785#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6785#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:44,747 INFO L273 TraceCheckUtils]: 26: Hoare triple {6785#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6785#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:44,747 INFO L273 TraceCheckUtils]: 27: Hoare triple {6785#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6786#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:44,750 INFO L273 TraceCheckUtils]: 28: Hoare triple {6786#(<= main_~i~0 7)} assume true; {6786#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:44,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {6786#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6786#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:44,750 INFO L273 TraceCheckUtils]: 30: Hoare triple {6786#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6786#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:44,751 INFO L273 TraceCheckUtils]: 31: Hoare triple {6786#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6787#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:44,751 INFO L273 TraceCheckUtils]: 32: Hoare triple {6787#(<= main_~i~0 8)} assume true; {6787#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:44,752 INFO L273 TraceCheckUtils]: 33: Hoare triple {6787#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6787#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:44,753 INFO L273 TraceCheckUtils]: 34: Hoare triple {6787#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6787#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:44,753 INFO L273 TraceCheckUtils]: 35: Hoare triple {6787#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6788#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:44,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {6788#(<= main_~i~0 9)} assume true; {6788#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:44,754 INFO L273 TraceCheckUtils]: 37: Hoare triple {6788#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6788#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:44,754 INFO L273 TraceCheckUtils]: 38: Hoare triple {6788#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6788#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:44,755 INFO L273 TraceCheckUtils]: 39: Hoare triple {6788#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6789#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:44,755 INFO L273 TraceCheckUtils]: 40: Hoare triple {6789#(<= main_~i~0 10)} assume true; {6789#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:44,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {6789#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6789#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:44,757 INFO L273 TraceCheckUtils]: 42: Hoare triple {6789#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6789#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:44,757 INFO L273 TraceCheckUtils]: 43: Hoare triple {6789#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6790#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:44,758 INFO L273 TraceCheckUtils]: 44: Hoare triple {6790#(<= main_~i~0 11)} assume true; {6790#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:44,759 INFO L273 TraceCheckUtils]: 45: Hoare triple {6790#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6790#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:44,759 INFO L273 TraceCheckUtils]: 46: Hoare triple {6790#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6790#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:44,760 INFO L273 TraceCheckUtils]: 47: Hoare triple {6790#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6791#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:44,761 INFO L273 TraceCheckUtils]: 48: Hoare triple {6791#(<= main_~i~0 12)} assume true; {6791#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:44,761 INFO L273 TraceCheckUtils]: 49: Hoare triple {6791#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6791#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:44,762 INFO L273 TraceCheckUtils]: 50: Hoare triple {6791#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6791#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:44,763 INFO L273 TraceCheckUtils]: 51: Hoare triple {6791#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6792#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:44,763 INFO L273 TraceCheckUtils]: 52: Hoare triple {6792#(<= main_~i~0 13)} assume true; {6792#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:44,764 INFO L273 TraceCheckUtils]: 53: Hoare triple {6792#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6792#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:44,764 INFO L273 TraceCheckUtils]: 54: Hoare triple {6792#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6792#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:44,765 INFO L273 TraceCheckUtils]: 55: Hoare triple {6792#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6793#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:44,766 INFO L273 TraceCheckUtils]: 56: Hoare triple {6793#(<= main_~i~0 14)} assume true; {6793#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:44,766 INFO L273 TraceCheckUtils]: 57: Hoare triple {6793#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6793#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:44,767 INFO L273 TraceCheckUtils]: 58: Hoare triple {6793#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6793#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:44,768 INFO L273 TraceCheckUtils]: 59: Hoare triple {6793#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6794#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:44,768 INFO L273 TraceCheckUtils]: 60: Hoare triple {6794#(<= main_~i~0 15)} assume true; {6794#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:44,769 INFO L273 TraceCheckUtils]: 61: Hoare triple {6794#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {6794#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:44,769 INFO L273 TraceCheckUtils]: 62: Hoare triple {6794#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6794#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:44,770 INFO L273 TraceCheckUtils]: 63: Hoare triple {6794#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6795#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:44,771 INFO L273 TraceCheckUtils]: 64: Hoare triple {6795#(<= main_~i~0 16)} assume true; {6795#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:44,772 INFO L273 TraceCheckUtils]: 65: Hoare triple {6795#(<= main_~i~0 16)} assume !(~i~0 < 100000); {6780#false} is VALID [2018-11-14 18:41:44,772 INFO L273 TraceCheckUtils]: 66: Hoare triple {6780#false} havoc ~x~0;~x~0 := 0; {6780#false} is VALID [2018-11-14 18:41:44,772 INFO L273 TraceCheckUtils]: 67: Hoare triple {6780#false} assume true; {6780#false} is VALID [2018-11-14 18:41:44,773 INFO L273 TraceCheckUtils]: 68: Hoare triple {6780#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {6780#false} is VALID [2018-11-14 18:41:44,773 INFO L256 TraceCheckUtils]: 69: Hoare triple {6780#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {6780#false} is VALID [2018-11-14 18:41:44,773 INFO L273 TraceCheckUtils]: 70: Hoare triple {6780#false} ~cond := #in~cond; {6780#false} is VALID [2018-11-14 18:41:44,774 INFO L273 TraceCheckUtils]: 71: Hoare triple {6780#false} assume ~cond == 0; {6780#false} is VALID [2018-11-14 18:41:44,774 INFO L273 TraceCheckUtils]: 72: Hoare triple {6780#false} assume !false; {6780#false} is VALID [2018-11-14 18:41:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:44,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:44,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-14 18:41:44,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-11-14 18:41:44,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:44,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:41:44,883 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-14 18:41:44,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:41:44,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:41:44,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:41:44,884 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. Second operand 17 states. [2018-11-14 18:41:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:45,822 INFO L93 Difference]: Finished difference Result 126 states and 167 transitions. [2018-11-14 18:41:45,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:41:45,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-11-14 18:41:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:41:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 167 transitions. [2018-11-14 18:41:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:41:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 167 transitions. [2018-11-14 18:41:45,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 167 transitions. [2018-11-14 18:41:45,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:45,976 INFO L225 Difference]: With dead ends: 126 [2018-11-14 18:41:45,976 INFO L226 Difference]: Without dead ends: 107 [2018-11-14 18:41:45,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:41:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-14 18:41:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-11-14 18:41:46,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:46,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 104 states. [2018-11-14 18:41:46,005 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 104 states. [2018-11-14 18:41:46,006 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 104 states. [2018-11-14 18:41:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:46,008 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2018-11-14 18:41:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 144 transitions. [2018-11-14 18:41:46,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:46,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:46,009 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 107 states. [2018-11-14 18:41:46,009 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 107 states. [2018-11-14 18:41:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:46,011 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2018-11-14 18:41:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 144 transitions. [2018-11-14 18:41:46,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:46,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:46,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:46,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 18:41:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 139 transitions. [2018-11-14 18:41:46,014 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 139 transitions. Word has length 73 [2018-11-14 18:41:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:46,014 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 139 transitions. [2018-11-14 18:41:46,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:41:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 139 transitions. [2018-11-14 18:41:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-14 18:41:46,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:46,015 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:46,015 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:46,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash -722723462, now seen corresponding path program 15 times [2018-11-14 18:41:46,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:46,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:46,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:46,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {7513#true} call ULTIMATE.init(); {7513#true} is VALID [2018-11-14 18:41:46,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {7513#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7513#true} is VALID [2018-11-14 18:41:46,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {7513#true} assume true; {7513#true} is VALID [2018-11-14 18:41:46,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7513#true} {7513#true} #91#return; {7513#true} is VALID [2018-11-14 18:41:46,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {7513#true} call #t~ret13 := main(); {7513#true} is VALID [2018-11-14 18:41:46,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {7513#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {7513#true} is VALID [2018-11-14 18:41:46,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {7513#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {7513#true} is VALID [2018-11-14 18:41:46,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {7513#true} ~i~0 := 2; {7515#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:46,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {7515#(<= main_~i~0 2)} assume true; {7515#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:46,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {7515#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7515#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:46,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {7515#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7515#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:46,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {7515#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7516#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:46,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {7516#(<= main_~i~0 3)} assume true; {7516#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:46,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {7516#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7516#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:46,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {7516#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7516#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:46,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {7516#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7517#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:46,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {7517#(<= main_~i~0 4)} assume true; {7517#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:46,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {7517#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7517#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:46,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {7517#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7517#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:46,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {7517#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7518#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:46,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {7518#(<= main_~i~0 5)} assume true; {7518#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:46,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {7518#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7518#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:46,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {7518#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7518#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:46,973 INFO L273 TraceCheckUtils]: 23: Hoare triple {7518#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7519#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:46,987 INFO L273 TraceCheckUtils]: 24: Hoare triple {7519#(<= main_~i~0 6)} assume true; {7519#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:46,995 INFO L273 TraceCheckUtils]: 25: Hoare triple {7519#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7519#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:47,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {7519#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7519#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:47,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {7519#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7520#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:47,007 INFO L273 TraceCheckUtils]: 28: Hoare triple {7520#(<= main_~i~0 7)} assume true; {7520#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:47,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {7520#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7520#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:47,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {7520#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7520#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:47,008 INFO L273 TraceCheckUtils]: 31: Hoare triple {7520#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7521#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:47,009 INFO L273 TraceCheckUtils]: 32: Hoare triple {7521#(<= main_~i~0 8)} assume true; {7521#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:47,009 INFO L273 TraceCheckUtils]: 33: Hoare triple {7521#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7521#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:47,009 INFO L273 TraceCheckUtils]: 34: Hoare triple {7521#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7521#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:47,010 INFO L273 TraceCheckUtils]: 35: Hoare triple {7521#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7522#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:47,010 INFO L273 TraceCheckUtils]: 36: Hoare triple {7522#(<= main_~i~0 9)} assume true; {7522#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:47,011 INFO L273 TraceCheckUtils]: 37: Hoare triple {7522#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7522#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:47,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {7522#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7522#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:47,012 INFO L273 TraceCheckUtils]: 39: Hoare triple {7522#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7523#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:47,012 INFO L273 TraceCheckUtils]: 40: Hoare triple {7523#(<= main_~i~0 10)} assume true; {7523#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:47,013 INFO L273 TraceCheckUtils]: 41: Hoare triple {7523#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7523#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:47,013 INFO L273 TraceCheckUtils]: 42: Hoare triple {7523#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7523#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:47,014 INFO L273 TraceCheckUtils]: 43: Hoare triple {7523#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7524#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:47,014 INFO L273 TraceCheckUtils]: 44: Hoare triple {7524#(<= main_~i~0 11)} assume true; {7524#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:47,015 INFO L273 TraceCheckUtils]: 45: Hoare triple {7524#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7524#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:47,015 INFO L273 TraceCheckUtils]: 46: Hoare triple {7524#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7524#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:47,016 INFO L273 TraceCheckUtils]: 47: Hoare triple {7524#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7525#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:47,017 INFO L273 TraceCheckUtils]: 48: Hoare triple {7525#(<= main_~i~0 12)} assume true; {7525#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:47,017 INFO L273 TraceCheckUtils]: 49: Hoare triple {7525#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7525#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:47,018 INFO L273 TraceCheckUtils]: 50: Hoare triple {7525#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7525#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:47,018 INFO L273 TraceCheckUtils]: 51: Hoare triple {7525#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7526#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:47,019 INFO L273 TraceCheckUtils]: 52: Hoare triple {7526#(<= main_~i~0 13)} assume true; {7526#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:47,019 INFO L273 TraceCheckUtils]: 53: Hoare triple {7526#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7526#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:47,020 INFO L273 TraceCheckUtils]: 54: Hoare triple {7526#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7526#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:47,020 INFO L273 TraceCheckUtils]: 55: Hoare triple {7526#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7527#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:47,021 INFO L273 TraceCheckUtils]: 56: Hoare triple {7527#(<= main_~i~0 14)} assume true; {7527#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:47,021 INFO L273 TraceCheckUtils]: 57: Hoare triple {7527#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7527#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:47,022 INFO L273 TraceCheckUtils]: 58: Hoare triple {7527#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7527#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:47,023 INFO L273 TraceCheckUtils]: 59: Hoare triple {7527#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7528#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:47,023 INFO L273 TraceCheckUtils]: 60: Hoare triple {7528#(<= main_~i~0 15)} assume true; {7528#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:47,024 INFO L273 TraceCheckUtils]: 61: Hoare triple {7528#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7528#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:47,024 INFO L273 TraceCheckUtils]: 62: Hoare triple {7528#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7528#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:47,025 INFO L273 TraceCheckUtils]: 63: Hoare triple {7528#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7529#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:47,026 INFO L273 TraceCheckUtils]: 64: Hoare triple {7529#(<= main_~i~0 16)} assume true; {7529#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:47,026 INFO L273 TraceCheckUtils]: 65: Hoare triple {7529#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7529#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:47,027 INFO L273 TraceCheckUtils]: 66: Hoare triple {7529#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7529#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:47,027 INFO L273 TraceCheckUtils]: 67: Hoare triple {7529#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7530#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:47,028 INFO L273 TraceCheckUtils]: 68: Hoare triple {7530#(<= main_~i~0 17)} assume true; {7530#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:47,028 INFO L273 TraceCheckUtils]: 69: Hoare triple {7530#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7514#false} is VALID [2018-11-14 18:41:47,029 INFO L273 TraceCheckUtils]: 70: Hoare triple {7514#false} havoc ~x~0;~x~0 := 0; {7514#false} is VALID [2018-11-14 18:41:47,029 INFO L273 TraceCheckUtils]: 71: Hoare triple {7514#false} assume true; {7514#false} is VALID [2018-11-14 18:41:47,029 INFO L273 TraceCheckUtils]: 72: Hoare triple {7514#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {7514#false} is VALID [2018-11-14 18:41:47,029 INFO L256 TraceCheckUtils]: 73: Hoare triple {7514#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {7514#false} is VALID [2018-11-14 18:41:47,029 INFO L273 TraceCheckUtils]: 74: Hoare triple {7514#false} ~cond := #in~cond; {7514#false} is VALID [2018-11-14 18:41:47,030 INFO L273 TraceCheckUtils]: 75: Hoare triple {7514#false} assume ~cond == 0; {7514#false} is VALID [2018-11-14 18:41:47,030 INFO L273 TraceCheckUtils]: 76: Hoare triple {7514#false} assume !false; {7514#false} is VALID [2018-11-14 18:41:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:47,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:47,034 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-14 18:41:47,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:41:47,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 18:41:47,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:47,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:47,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {7513#true} call ULTIMATE.init(); {7513#true} is VALID [2018-11-14 18:41:47,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {7513#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7513#true} is VALID [2018-11-14 18:41:47,423 INFO L273 TraceCheckUtils]: 2: Hoare triple {7513#true} assume true; {7513#true} is VALID [2018-11-14 18:41:47,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7513#true} {7513#true} #91#return; {7513#true} is VALID [2018-11-14 18:41:47,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {7513#true} call #t~ret13 := main(); {7513#true} is VALID [2018-11-14 18:41:47,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {7513#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {7513#true} is VALID [2018-11-14 18:41:47,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {7513#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {7513#true} is VALID [2018-11-14 18:41:47,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {7513#true} ~i~0 := 2; {7515#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:47,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {7515#(<= main_~i~0 2)} assume true; {7515#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:47,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {7515#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7515#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:47,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {7515#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7515#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:47,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {7515#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7516#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:47,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {7516#(<= main_~i~0 3)} assume true; {7516#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:47,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {7516#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7516#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:47,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {7516#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7516#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:47,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {7516#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7517#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:47,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {7517#(<= main_~i~0 4)} assume true; {7517#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:47,429 INFO L273 TraceCheckUtils]: 17: Hoare triple {7517#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7517#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:47,430 INFO L273 TraceCheckUtils]: 18: Hoare triple {7517#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7517#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:47,430 INFO L273 TraceCheckUtils]: 19: Hoare triple {7517#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7518#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:47,431 INFO L273 TraceCheckUtils]: 20: Hoare triple {7518#(<= main_~i~0 5)} assume true; {7518#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:47,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {7518#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7518#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:47,431 INFO L273 TraceCheckUtils]: 22: Hoare triple {7518#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7518#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:47,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {7518#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7519#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:47,432 INFO L273 TraceCheckUtils]: 24: Hoare triple {7519#(<= main_~i~0 6)} assume true; {7519#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:47,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {7519#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7519#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:47,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {7519#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7519#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:47,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {7519#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7520#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:47,433 INFO L273 TraceCheckUtils]: 28: Hoare triple {7520#(<= main_~i~0 7)} assume true; {7520#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:47,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {7520#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7520#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:47,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {7520#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7520#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:47,435 INFO L273 TraceCheckUtils]: 31: Hoare triple {7520#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7521#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:47,436 INFO L273 TraceCheckUtils]: 32: Hoare triple {7521#(<= main_~i~0 8)} assume true; {7521#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:47,436 INFO L273 TraceCheckUtils]: 33: Hoare triple {7521#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7521#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:47,437 INFO L273 TraceCheckUtils]: 34: Hoare triple {7521#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7521#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:47,437 INFO L273 TraceCheckUtils]: 35: Hoare triple {7521#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7522#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:47,438 INFO L273 TraceCheckUtils]: 36: Hoare triple {7522#(<= main_~i~0 9)} assume true; {7522#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:47,438 INFO L273 TraceCheckUtils]: 37: Hoare triple {7522#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7522#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:47,439 INFO L273 TraceCheckUtils]: 38: Hoare triple {7522#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7522#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:47,440 INFO L273 TraceCheckUtils]: 39: Hoare triple {7522#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7523#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:47,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {7523#(<= main_~i~0 10)} assume true; {7523#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:47,441 INFO L273 TraceCheckUtils]: 41: Hoare triple {7523#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7523#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:47,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {7523#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7523#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:47,442 INFO L273 TraceCheckUtils]: 43: Hoare triple {7523#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7524#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:47,442 INFO L273 TraceCheckUtils]: 44: Hoare triple {7524#(<= main_~i~0 11)} assume true; {7524#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:47,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {7524#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7524#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:47,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {7524#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7524#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:47,444 INFO L273 TraceCheckUtils]: 47: Hoare triple {7524#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7525#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:47,444 INFO L273 TraceCheckUtils]: 48: Hoare triple {7525#(<= main_~i~0 12)} assume true; {7525#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:47,445 INFO L273 TraceCheckUtils]: 49: Hoare triple {7525#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7525#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:47,445 INFO L273 TraceCheckUtils]: 50: Hoare triple {7525#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7525#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:47,446 INFO L273 TraceCheckUtils]: 51: Hoare triple {7525#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7526#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:47,447 INFO L273 TraceCheckUtils]: 52: Hoare triple {7526#(<= main_~i~0 13)} assume true; {7526#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:47,447 INFO L273 TraceCheckUtils]: 53: Hoare triple {7526#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7526#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:47,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {7526#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7526#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:47,448 INFO L273 TraceCheckUtils]: 55: Hoare triple {7526#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7527#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:47,449 INFO L273 TraceCheckUtils]: 56: Hoare triple {7527#(<= main_~i~0 14)} assume true; {7527#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:47,449 INFO L273 TraceCheckUtils]: 57: Hoare triple {7527#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7527#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:47,450 INFO L273 TraceCheckUtils]: 58: Hoare triple {7527#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7527#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:47,450 INFO L273 TraceCheckUtils]: 59: Hoare triple {7527#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7528#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:47,451 INFO L273 TraceCheckUtils]: 60: Hoare triple {7528#(<= main_~i~0 15)} assume true; {7528#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:47,451 INFO L273 TraceCheckUtils]: 61: Hoare triple {7528#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7528#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:47,452 INFO L273 TraceCheckUtils]: 62: Hoare triple {7528#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7528#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:47,453 INFO L273 TraceCheckUtils]: 63: Hoare triple {7528#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7529#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:47,453 INFO L273 TraceCheckUtils]: 64: Hoare triple {7529#(<= main_~i~0 16)} assume true; {7529#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:47,453 INFO L273 TraceCheckUtils]: 65: Hoare triple {7529#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {7529#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:47,454 INFO L273 TraceCheckUtils]: 66: Hoare triple {7529#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7529#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:47,455 INFO L273 TraceCheckUtils]: 67: Hoare triple {7529#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7530#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:47,455 INFO L273 TraceCheckUtils]: 68: Hoare triple {7530#(<= main_~i~0 17)} assume true; {7530#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:47,456 INFO L273 TraceCheckUtils]: 69: Hoare triple {7530#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7514#false} is VALID [2018-11-14 18:41:47,456 INFO L273 TraceCheckUtils]: 70: Hoare triple {7514#false} havoc ~x~0;~x~0 := 0; {7514#false} is VALID [2018-11-14 18:41:47,456 INFO L273 TraceCheckUtils]: 71: Hoare triple {7514#false} assume true; {7514#false} is VALID [2018-11-14 18:41:47,456 INFO L273 TraceCheckUtils]: 72: Hoare triple {7514#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {7514#false} is VALID [2018-11-14 18:41:47,457 INFO L256 TraceCheckUtils]: 73: Hoare triple {7514#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {7514#false} is VALID [2018-11-14 18:41:47,457 INFO L273 TraceCheckUtils]: 74: Hoare triple {7514#false} ~cond := #in~cond; {7514#false} is VALID [2018-11-14 18:41:47,457 INFO L273 TraceCheckUtils]: 75: Hoare triple {7514#false} assume ~cond == 0; {7514#false} is VALID [2018-11-14 18:41:47,457 INFO L273 TraceCheckUtils]: 76: Hoare triple {7514#false} assume !false; {7514#false} is VALID [2018-11-14 18:41:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:47,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:47,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-14 18:41:47,483 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-14 18:41:47,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:47,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:41:47,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:47,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:41:47,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:41:47,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:41:47,550 INFO L87 Difference]: Start difference. First operand 104 states and 139 transitions. Second operand 18 states. [2018-11-14 18:41:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:48,277 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2018-11-14 18:41:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:41:48,277 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-14 18:41:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:41:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 174 transitions. [2018-11-14 18:41:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:41:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 174 transitions. [2018-11-14 18:41:48,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 174 transitions. [2018-11-14 18:41:48,440 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-14 18:41:48,443 INFO L225 Difference]: With dead ends: 131 [2018-11-14 18:41:48,443 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 18:41:48,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:41:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 18:41:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-11-14 18:41:48,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:48,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 109 states. [2018-11-14 18:41:48,464 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 109 states. [2018-11-14 18:41:48,464 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 109 states. [2018-11-14 18:41:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:48,467 INFO L93 Difference]: Finished difference Result 112 states and 151 transitions. [2018-11-14 18:41:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2018-11-14 18:41:48,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:48,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:48,468 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 112 states. [2018-11-14 18:41:48,468 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 112 states. [2018-11-14 18:41:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:48,470 INFO L93 Difference]: Finished difference Result 112 states and 151 transitions. [2018-11-14 18:41:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2018-11-14 18:41:48,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:48,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:48,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:48,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-14 18:41:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 146 transitions. [2018-11-14 18:41:48,473 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 146 transitions. Word has length 77 [2018-11-14 18:41:48,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:48,474 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 146 transitions. [2018-11-14 18:41:48,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:41:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 146 transitions. [2018-11-14 18:41:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-14 18:41:48,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:48,475 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:48,475 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:48,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:48,475 INFO L82 PathProgramCache]: Analyzing trace with hash 924999020, now seen corresponding path program 16 times [2018-11-14 18:41:48,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:48,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:48,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:48,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:48,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:48,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {8282#true} call ULTIMATE.init(); {8282#true} is VALID [2018-11-14 18:41:48,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {8282#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8282#true} is VALID [2018-11-14 18:41:48,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {8282#true} assume true; {8282#true} is VALID [2018-11-14 18:41:48,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8282#true} {8282#true} #91#return; {8282#true} is VALID [2018-11-14 18:41:48,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {8282#true} call #t~ret13 := main(); {8282#true} is VALID [2018-11-14 18:41:48,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {8282#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {8282#true} is VALID [2018-11-14 18:41:48,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {8282#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {8282#true} is VALID [2018-11-14 18:41:48,795 INFO L273 TraceCheckUtils]: 7: Hoare triple {8282#true} ~i~0 := 2; {8284#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:48,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {8284#(<= main_~i~0 2)} assume true; {8284#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:48,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {8284#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8284#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:48,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {8284#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8284#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:48,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {8284#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8285#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:48,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {8285#(<= main_~i~0 3)} assume true; {8285#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:48,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {8285#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8285#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:48,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {8285#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8285#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:48,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {8285#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8286#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:48,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {8286#(<= main_~i~0 4)} assume true; {8286#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:48,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {8286#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8286#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:48,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {8286#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8286#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:48,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {8286#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8287#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:48,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {8287#(<= main_~i~0 5)} assume true; {8287#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:48,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {8287#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8287#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:48,801 INFO L273 TraceCheckUtils]: 22: Hoare triple {8287#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8287#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:48,802 INFO L273 TraceCheckUtils]: 23: Hoare triple {8287#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8288#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:48,802 INFO L273 TraceCheckUtils]: 24: Hoare triple {8288#(<= main_~i~0 6)} assume true; {8288#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:48,803 INFO L273 TraceCheckUtils]: 25: Hoare triple {8288#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8288#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:48,803 INFO L273 TraceCheckUtils]: 26: Hoare triple {8288#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8288#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:48,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {8288#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8289#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:48,805 INFO L273 TraceCheckUtils]: 28: Hoare triple {8289#(<= main_~i~0 7)} assume true; {8289#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:48,805 INFO L273 TraceCheckUtils]: 29: Hoare triple {8289#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8289#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:48,806 INFO L273 TraceCheckUtils]: 30: Hoare triple {8289#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8289#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:48,806 INFO L273 TraceCheckUtils]: 31: Hoare triple {8289#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8290#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:48,807 INFO L273 TraceCheckUtils]: 32: Hoare triple {8290#(<= main_~i~0 8)} assume true; {8290#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:48,807 INFO L273 TraceCheckUtils]: 33: Hoare triple {8290#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8290#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:48,808 INFO L273 TraceCheckUtils]: 34: Hoare triple {8290#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8290#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:48,809 INFO L273 TraceCheckUtils]: 35: Hoare triple {8290#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8291#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:48,809 INFO L273 TraceCheckUtils]: 36: Hoare triple {8291#(<= main_~i~0 9)} assume true; {8291#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:48,810 INFO L273 TraceCheckUtils]: 37: Hoare triple {8291#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8291#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:48,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {8291#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8291#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:48,811 INFO L273 TraceCheckUtils]: 39: Hoare triple {8291#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8292#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:48,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {8292#(<= main_~i~0 10)} assume true; {8292#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:48,812 INFO L273 TraceCheckUtils]: 41: Hoare triple {8292#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8292#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:48,812 INFO L273 TraceCheckUtils]: 42: Hoare triple {8292#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8292#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:48,813 INFO L273 TraceCheckUtils]: 43: Hoare triple {8292#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8293#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:48,814 INFO L273 TraceCheckUtils]: 44: Hoare triple {8293#(<= main_~i~0 11)} assume true; {8293#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:48,814 INFO L273 TraceCheckUtils]: 45: Hoare triple {8293#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8293#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:48,815 INFO L273 TraceCheckUtils]: 46: Hoare triple {8293#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8293#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:48,815 INFO L273 TraceCheckUtils]: 47: Hoare triple {8293#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8294#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:48,816 INFO L273 TraceCheckUtils]: 48: Hoare triple {8294#(<= main_~i~0 12)} assume true; {8294#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:48,817 INFO L273 TraceCheckUtils]: 49: Hoare triple {8294#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8294#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:48,817 INFO L273 TraceCheckUtils]: 50: Hoare triple {8294#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8294#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:48,818 INFO L273 TraceCheckUtils]: 51: Hoare triple {8294#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8295#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:48,818 INFO L273 TraceCheckUtils]: 52: Hoare triple {8295#(<= main_~i~0 13)} assume true; {8295#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:48,819 INFO L273 TraceCheckUtils]: 53: Hoare triple {8295#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8295#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:48,819 INFO L273 TraceCheckUtils]: 54: Hoare triple {8295#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8295#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:48,820 INFO L273 TraceCheckUtils]: 55: Hoare triple {8295#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8296#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:48,821 INFO L273 TraceCheckUtils]: 56: Hoare triple {8296#(<= main_~i~0 14)} assume true; {8296#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:48,821 INFO L273 TraceCheckUtils]: 57: Hoare triple {8296#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8296#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:48,822 INFO L273 TraceCheckUtils]: 58: Hoare triple {8296#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8296#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:48,822 INFO L273 TraceCheckUtils]: 59: Hoare triple {8296#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8297#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:48,823 INFO L273 TraceCheckUtils]: 60: Hoare triple {8297#(<= main_~i~0 15)} assume true; {8297#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:48,823 INFO L273 TraceCheckUtils]: 61: Hoare triple {8297#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8297#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:48,824 INFO L273 TraceCheckUtils]: 62: Hoare triple {8297#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8297#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:48,825 INFO L273 TraceCheckUtils]: 63: Hoare triple {8297#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8298#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:48,825 INFO L273 TraceCheckUtils]: 64: Hoare triple {8298#(<= main_~i~0 16)} assume true; {8298#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:48,826 INFO L273 TraceCheckUtils]: 65: Hoare triple {8298#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8298#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:48,826 INFO L273 TraceCheckUtils]: 66: Hoare triple {8298#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8298#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:48,827 INFO L273 TraceCheckUtils]: 67: Hoare triple {8298#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8299#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:48,827 INFO L273 TraceCheckUtils]: 68: Hoare triple {8299#(<= main_~i~0 17)} assume true; {8299#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:48,828 INFO L273 TraceCheckUtils]: 69: Hoare triple {8299#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8299#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:48,828 INFO L273 TraceCheckUtils]: 70: Hoare triple {8299#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8299#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:48,829 INFO L273 TraceCheckUtils]: 71: Hoare triple {8299#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8300#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:48,830 INFO L273 TraceCheckUtils]: 72: Hoare triple {8300#(<= main_~i~0 18)} assume true; {8300#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:48,830 INFO L273 TraceCheckUtils]: 73: Hoare triple {8300#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8283#false} is VALID [2018-11-14 18:41:48,831 INFO L273 TraceCheckUtils]: 74: Hoare triple {8283#false} havoc ~x~0;~x~0 := 0; {8283#false} is VALID [2018-11-14 18:41:48,831 INFO L273 TraceCheckUtils]: 75: Hoare triple {8283#false} assume true; {8283#false} is VALID [2018-11-14 18:41:48,831 INFO L273 TraceCheckUtils]: 76: Hoare triple {8283#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {8283#false} is VALID [2018-11-14 18:41:48,831 INFO L256 TraceCheckUtils]: 77: Hoare triple {8283#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {8283#false} is VALID [2018-11-14 18:41:48,831 INFO L273 TraceCheckUtils]: 78: Hoare triple {8283#false} ~cond := #in~cond; {8283#false} is VALID [2018-11-14 18:41:48,831 INFO L273 TraceCheckUtils]: 79: Hoare triple {8283#false} assume ~cond == 0; {8283#false} is VALID [2018-11-14 18:41:48,832 INFO L273 TraceCheckUtils]: 80: Hoare triple {8283#false} assume !false; {8283#false} is VALID [2018-11-14 18:41:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:48,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:48,836 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-14 18:41:48,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:41:48,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:41:48,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:48,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:49,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {8282#true} call ULTIMATE.init(); {8282#true} is VALID [2018-11-14 18:41:49,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {8282#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8282#true} is VALID [2018-11-14 18:41:49,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {8282#true} assume true; {8282#true} is VALID [2018-11-14 18:41:49,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8282#true} {8282#true} #91#return; {8282#true} is VALID [2018-11-14 18:41:49,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {8282#true} call #t~ret13 := main(); {8282#true} is VALID [2018-11-14 18:41:49,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {8282#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {8282#true} is VALID [2018-11-14 18:41:49,153 INFO L273 TraceCheckUtils]: 6: Hoare triple {8282#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {8282#true} is VALID [2018-11-14 18:41:49,153 INFO L273 TraceCheckUtils]: 7: Hoare triple {8282#true} ~i~0 := 2; {8284#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:49,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {8284#(<= main_~i~0 2)} assume true; {8284#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:49,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {8284#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8284#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:49,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {8284#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8284#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:49,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {8284#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8285#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:49,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {8285#(<= main_~i~0 3)} assume true; {8285#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:49,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {8285#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8285#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:49,158 INFO L273 TraceCheckUtils]: 14: Hoare triple {8285#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8285#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:49,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {8285#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8286#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:49,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {8286#(<= main_~i~0 4)} assume true; {8286#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:49,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {8286#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8286#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:49,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {8286#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8286#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:49,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {8286#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8287#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:49,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {8287#(<= main_~i~0 5)} assume true; {8287#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:49,160 INFO L273 TraceCheckUtils]: 21: Hoare triple {8287#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8287#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:49,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {8287#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8287#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:49,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {8287#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8288#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:49,162 INFO L273 TraceCheckUtils]: 24: Hoare triple {8288#(<= main_~i~0 6)} assume true; {8288#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:49,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {8288#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8288#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:49,163 INFO L273 TraceCheckUtils]: 26: Hoare triple {8288#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8288#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:49,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {8288#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8289#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:49,164 INFO L273 TraceCheckUtils]: 28: Hoare triple {8289#(<= main_~i~0 7)} assume true; {8289#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:49,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {8289#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8289#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:49,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {8289#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8289#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:49,166 INFO L273 TraceCheckUtils]: 31: Hoare triple {8289#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8290#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:49,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {8290#(<= main_~i~0 8)} assume true; {8290#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:49,167 INFO L273 TraceCheckUtils]: 33: Hoare triple {8290#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8290#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:49,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {8290#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8290#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:49,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {8290#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8291#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:49,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {8291#(<= main_~i~0 9)} assume true; {8291#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:49,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {8291#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8291#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:49,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {8291#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8291#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:49,170 INFO L273 TraceCheckUtils]: 39: Hoare triple {8291#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8292#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:49,171 INFO L273 TraceCheckUtils]: 40: Hoare triple {8292#(<= main_~i~0 10)} assume true; {8292#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:49,171 INFO L273 TraceCheckUtils]: 41: Hoare triple {8292#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8292#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:49,172 INFO L273 TraceCheckUtils]: 42: Hoare triple {8292#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8292#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:49,172 INFO L273 TraceCheckUtils]: 43: Hoare triple {8292#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8293#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:49,173 INFO L273 TraceCheckUtils]: 44: Hoare triple {8293#(<= main_~i~0 11)} assume true; {8293#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:49,173 INFO L273 TraceCheckUtils]: 45: Hoare triple {8293#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8293#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:49,174 INFO L273 TraceCheckUtils]: 46: Hoare triple {8293#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8293#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:49,175 INFO L273 TraceCheckUtils]: 47: Hoare triple {8293#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8294#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:49,175 INFO L273 TraceCheckUtils]: 48: Hoare triple {8294#(<= main_~i~0 12)} assume true; {8294#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:49,176 INFO L273 TraceCheckUtils]: 49: Hoare triple {8294#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8294#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:49,176 INFO L273 TraceCheckUtils]: 50: Hoare triple {8294#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8294#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:49,177 INFO L273 TraceCheckUtils]: 51: Hoare triple {8294#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8295#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:49,177 INFO L273 TraceCheckUtils]: 52: Hoare triple {8295#(<= main_~i~0 13)} assume true; {8295#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:49,178 INFO L273 TraceCheckUtils]: 53: Hoare triple {8295#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8295#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:49,178 INFO L273 TraceCheckUtils]: 54: Hoare triple {8295#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8295#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:49,179 INFO L273 TraceCheckUtils]: 55: Hoare triple {8295#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8296#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:49,180 INFO L273 TraceCheckUtils]: 56: Hoare triple {8296#(<= main_~i~0 14)} assume true; {8296#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:49,180 INFO L273 TraceCheckUtils]: 57: Hoare triple {8296#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8296#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:49,181 INFO L273 TraceCheckUtils]: 58: Hoare triple {8296#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8296#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:49,181 INFO L273 TraceCheckUtils]: 59: Hoare triple {8296#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8297#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:49,182 INFO L273 TraceCheckUtils]: 60: Hoare triple {8297#(<= main_~i~0 15)} assume true; {8297#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:49,182 INFO L273 TraceCheckUtils]: 61: Hoare triple {8297#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8297#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:49,183 INFO L273 TraceCheckUtils]: 62: Hoare triple {8297#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8297#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:49,184 INFO L273 TraceCheckUtils]: 63: Hoare triple {8297#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8298#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:49,184 INFO L273 TraceCheckUtils]: 64: Hoare triple {8298#(<= main_~i~0 16)} assume true; {8298#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:49,185 INFO L273 TraceCheckUtils]: 65: Hoare triple {8298#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8298#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:49,185 INFO L273 TraceCheckUtils]: 66: Hoare triple {8298#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8298#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:49,186 INFO L273 TraceCheckUtils]: 67: Hoare triple {8298#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8299#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:49,186 INFO L273 TraceCheckUtils]: 68: Hoare triple {8299#(<= main_~i~0 17)} assume true; {8299#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:49,187 INFO L273 TraceCheckUtils]: 69: Hoare triple {8299#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {8299#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:49,187 INFO L273 TraceCheckUtils]: 70: Hoare triple {8299#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8299#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:49,188 INFO L273 TraceCheckUtils]: 71: Hoare triple {8299#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8300#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:49,189 INFO L273 TraceCheckUtils]: 72: Hoare triple {8300#(<= main_~i~0 18)} assume true; {8300#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:49,189 INFO L273 TraceCheckUtils]: 73: Hoare triple {8300#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8283#false} is VALID [2018-11-14 18:41:49,190 INFO L273 TraceCheckUtils]: 74: Hoare triple {8283#false} havoc ~x~0;~x~0 := 0; {8283#false} is VALID [2018-11-14 18:41:49,190 INFO L273 TraceCheckUtils]: 75: Hoare triple {8283#false} assume true; {8283#false} is VALID [2018-11-14 18:41:49,190 INFO L273 TraceCheckUtils]: 76: Hoare triple {8283#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {8283#false} is VALID [2018-11-14 18:41:49,190 INFO L256 TraceCheckUtils]: 77: Hoare triple {8283#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {8283#false} is VALID [2018-11-14 18:41:49,190 INFO L273 TraceCheckUtils]: 78: Hoare triple {8283#false} ~cond := #in~cond; {8283#false} is VALID [2018-11-14 18:41:49,191 INFO L273 TraceCheckUtils]: 79: Hoare triple {8283#false} assume ~cond == 0; {8283#false} is VALID [2018-11-14 18:41:49,191 INFO L273 TraceCheckUtils]: 80: Hoare triple {8283#false} assume !false; {8283#false} is VALID [2018-11-14 18:41:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:49,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:49,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-14 18:41:49,216 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2018-11-14 18:41:49,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:49,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:41:49,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:49,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:41:49,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:41:49,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:41:49,288 INFO L87 Difference]: Start difference. First operand 109 states and 146 transitions. Second operand 19 states. [2018-11-14 18:41:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:49,887 INFO L93 Difference]: Finished difference Result 136 states and 181 transitions. [2018-11-14 18:41:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:41:49,887 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2018-11-14 18:41:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:41:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 181 transitions. [2018-11-14 18:41:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:41:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 181 transitions. [2018-11-14 18:41:49,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 181 transitions. [2018-11-14 18:41:50,056 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-14 18:41:50,059 INFO L225 Difference]: With dead ends: 136 [2018-11-14 18:41:50,059 INFO L226 Difference]: Without dead ends: 117 [2018-11-14 18:41:50,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:41:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-14 18:41:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2018-11-14 18:41:50,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:50,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 114 states. [2018-11-14 18:41:50,079 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 114 states. [2018-11-14 18:41:50,080 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 114 states. [2018-11-14 18:41:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:50,081 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2018-11-14 18:41:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2018-11-14 18:41:50,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:50,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:50,082 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 117 states. [2018-11-14 18:41:50,082 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 117 states. [2018-11-14 18:41:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:50,084 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2018-11-14 18:41:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2018-11-14 18:41:50,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:50,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:50,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:50,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-14 18:41:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 153 transitions. [2018-11-14 18:41:50,086 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 153 transitions. Word has length 81 [2018-11-14 18:41:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:50,086 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 153 transitions. [2018-11-14 18:41:50,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:41:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 153 transitions. [2018-11-14 18:41:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 18:41:50,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:50,088 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:50,088 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:50,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash 326325342, now seen corresponding path program 17 times [2018-11-14 18:41:50,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:50,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:50,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:50,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:50,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:50,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {9086#true} call ULTIMATE.init(); {9086#true} is VALID [2018-11-14 18:41:50,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {9086#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9086#true} is VALID [2018-11-14 18:41:50,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {9086#true} assume true; {9086#true} is VALID [2018-11-14 18:41:50,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9086#true} {9086#true} #91#return; {9086#true} is VALID [2018-11-14 18:41:50,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {9086#true} call #t~ret13 := main(); {9086#true} is VALID [2018-11-14 18:41:50,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {9086#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {9086#true} is VALID [2018-11-14 18:41:50,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {9086#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {9086#true} is VALID [2018-11-14 18:41:50,866 INFO L273 TraceCheckUtils]: 7: Hoare triple {9086#true} ~i~0 := 2; {9088#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:50,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {9088#(<= main_~i~0 2)} assume true; {9088#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:50,867 INFO L273 TraceCheckUtils]: 9: Hoare triple {9088#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9088#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:50,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {9088#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9088#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:50,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {9088#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9089#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:50,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {9089#(<= main_~i~0 3)} assume true; {9089#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:50,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {9089#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9089#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:50,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {9089#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9089#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:50,869 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9090#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:50,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {9090#(<= main_~i~0 4)} assume true; {9090#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:50,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {9090#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9090#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:50,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9090#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:50,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {9090#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9091#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:50,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {9091#(<= main_~i~0 5)} assume true; {9091#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:50,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9091#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:50,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {9091#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9091#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:50,886 INFO L273 TraceCheckUtils]: 23: Hoare triple {9091#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9092#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:50,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~0 6)} assume true; {9092#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:50,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {9092#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9092#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:50,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {9092#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9092#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:50,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {9092#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9093#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:50,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {9093#(<= main_~i~0 7)} assume true; {9093#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:50,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {9093#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9093#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:50,890 INFO L273 TraceCheckUtils]: 30: Hoare triple {9093#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9093#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:50,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {9093#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9094#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:50,891 INFO L273 TraceCheckUtils]: 32: Hoare triple {9094#(<= main_~i~0 8)} assume true; {9094#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:50,892 INFO L273 TraceCheckUtils]: 33: Hoare triple {9094#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9094#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:50,892 INFO L273 TraceCheckUtils]: 34: Hoare triple {9094#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9094#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:50,893 INFO L273 TraceCheckUtils]: 35: Hoare triple {9094#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9095#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:50,894 INFO L273 TraceCheckUtils]: 36: Hoare triple {9095#(<= main_~i~0 9)} assume true; {9095#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:50,894 INFO L273 TraceCheckUtils]: 37: Hoare triple {9095#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9095#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:50,895 INFO L273 TraceCheckUtils]: 38: Hoare triple {9095#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9095#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:50,895 INFO L273 TraceCheckUtils]: 39: Hoare triple {9095#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9096#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:50,896 INFO L273 TraceCheckUtils]: 40: Hoare triple {9096#(<= main_~i~0 10)} assume true; {9096#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:50,896 INFO L273 TraceCheckUtils]: 41: Hoare triple {9096#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9096#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:50,897 INFO L273 TraceCheckUtils]: 42: Hoare triple {9096#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9096#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:50,898 INFO L273 TraceCheckUtils]: 43: Hoare triple {9096#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9097#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:50,898 INFO L273 TraceCheckUtils]: 44: Hoare triple {9097#(<= main_~i~0 11)} assume true; {9097#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:50,899 INFO L273 TraceCheckUtils]: 45: Hoare triple {9097#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9097#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:50,899 INFO L273 TraceCheckUtils]: 46: Hoare triple {9097#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9097#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:50,900 INFO L273 TraceCheckUtils]: 47: Hoare triple {9097#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9098#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:50,900 INFO L273 TraceCheckUtils]: 48: Hoare triple {9098#(<= main_~i~0 12)} assume true; {9098#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:50,901 INFO L273 TraceCheckUtils]: 49: Hoare triple {9098#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9098#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:50,901 INFO L273 TraceCheckUtils]: 50: Hoare triple {9098#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9098#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:50,902 INFO L273 TraceCheckUtils]: 51: Hoare triple {9098#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9099#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:50,903 INFO L273 TraceCheckUtils]: 52: Hoare triple {9099#(<= main_~i~0 13)} assume true; {9099#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:50,903 INFO L273 TraceCheckUtils]: 53: Hoare triple {9099#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9099#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:50,904 INFO L273 TraceCheckUtils]: 54: Hoare triple {9099#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9099#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:50,905 INFO L273 TraceCheckUtils]: 55: Hoare triple {9099#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9100#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:50,905 INFO L273 TraceCheckUtils]: 56: Hoare triple {9100#(<= main_~i~0 14)} assume true; {9100#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:50,906 INFO L273 TraceCheckUtils]: 57: Hoare triple {9100#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9100#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:50,906 INFO L273 TraceCheckUtils]: 58: Hoare triple {9100#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9100#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:50,907 INFO L273 TraceCheckUtils]: 59: Hoare triple {9100#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9101#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:50,907 INFO L273 TraceCheckUtils]: 60: Hoare triple {9101#(<= main_~i~0 15)} assume true; {9101#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:50,908 INFO L273 TraceCheckUtils]: 61: Hoare triple {9101#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9101#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:50,908 INFO L273 TraceCheckUtils]: 62: Hoare triple {9101#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9101#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:50,909 INFO L273 TraceCheckUtils]: 63: Hoare triple {9101#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9102#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:50,910 INFO L273 TraceCheckUtils]: 64: Hoare triple {9102#(<= main_~i~0 16)} assume true; {9102#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:50,910 INFO L273 TraceCheckUtils]: 65: Hoare triple {9102#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9102#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:50,911 INFO L273 TraceCheckUtils]: 66: Hoare triple {9102#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9102#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:50,912 INFO L273 TraceCheckUtils]: 67: Hoare triple {9102#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9103#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:50,912 INFO L273 TraceCheckUtils]: 68: Hoare triple {9103#(<= main_~i~0 17)} assume true; {9103#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:50,913 INFO L273 TraceCheckUtils]: 69: Hoare triple {9103#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9103#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:50,913 INFO L273 TraceCheckUtils]: 70: Hoare triple {9103#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9103#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:50,914 INFO L273 TraceCheckUtils]: 71: Hoare triple {9103#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9104#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:50,914 INFO L273 TraceCheckUtils]: 72: Hoare triple {9104#(<= main_~i~0 18)} assume true; {9104#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:50,915 INFO L273 TraceCheckUtils]: 73: Hoare triple {9104#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9104#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:50,915 INFO L273 TraceCheckUtils]: 74: Hoare triple {9104#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9104#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:50,916 INFO L273 TraceCheckUtils]: 75: Hoare triple {9104#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9105#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:50,917 INFO L273 TraceCheckUtils]: 76: Hoare triple {9105#(<= main_~i~0 19)} assume true; {9105#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:50,917 INFO L273 TraceCheckUtils]: 77: Hoare triple {9105#(<= main_~i~0 19)} assume !(~i~0 < 100000); {9087#false} is VALID [2018-11-14 18:41:50,918 INFO L273 TraceCheckUtils]: 78: Hoare triple {9087#false} havoc ~x~0;~x~0 := 0; {9087#false} is VALID [2018-11-14 18:41:50,918 INFO L273 TraceCheckUtils]: 79: Hoare triple {9087#false} assume true; {9087#false} is VALID [2018-11-14 18:41:50,918 INFO L273 TraceCheckUtils]: 80: Hoare triple {9087#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {9087#false} is VALID [2018-11-14 18:41:50,918 INFO L256 TraceCheckUtils]: 81: Hoare triple {9087#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {9087#false} is VALID [2018-11-14 18:41:50,918 INFO L273 TraceCheckUtils]: 82: Hoare triple {9087#false} ~cond := #in~cond; {9087#false} is VALID [2018-11-14 18:41:50,919 INFO L273 TraceCheckUtils]: 83: Hoare triple {9087#false} assume ~cond == 0; {9087#false} is VALID [2018-11-14 18:41:50,919 INFO L273 TraceCheckUtils]: 84: Hoare triple {9087#false} assume !false; {9087#false} is VALID [2018-11-14 18:41:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:50,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:50,925 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-14 18:41:50,934 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:41:50,986 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-14 18:41:50,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:51,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:51,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {9086#true} call ULTIMATE.init(); {9086#true} is VALID [2018-11-14 18:41:51,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {9086#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9086#true} is VALID [2018-11-14 18:41:51,406 INFO L273 TraceCheckUtils]: 2: Hoare triple {9086#true} assume true; {9086#true} is VALID [2018-11-14 18:41:51,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9086#true} {9086#true} #91#return; {9086#true} is VALID [2018-11-14 18:41:51,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {9086#true} call #t~ret13 := main(); {9086#true} is VALID [2018-11-14 18:41:51,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {9086#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {9086#true} is VALID [2018-11-14 18:41:51,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {9086#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {9086#true} is VALID [2018-11-14 18:41:51,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {9086#true} ~i~0 := 2; {9088#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:51,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {9088#(<= main_~i~0 2)} assume true; {9088#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:51,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {9088#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9088#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:51,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {9088#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9088#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:51,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {9088#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9089#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:51,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {9089#(<= main_~i~0 3)} assume true; {9089#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:51,410 INFO L273 TraceCheckUtils]: 13: Hoare triple {9089#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9089#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:51,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {9089#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9089#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:51,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9090#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:51,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {9090#(<= main_~i~0 4)} assume true; {9090#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:51,411 INFO L273 TraceCheckUtils]: 17: Hoare triple {9090#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9090#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:51,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9090#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:51,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {9090#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9091#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:51,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {9091#(<= main_~i~0 5)} assume true; {9091#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:51,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9091#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:51,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {9091#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9091#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:51,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {9091#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9092#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:51,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~0 6)} assume true; {9092#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:51,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {9092#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9092#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:51,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {9092#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9092#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:51,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {9092#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9093#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:51,417 INFO L273 TraceCheckUtils]: 28: Hoare triple {9093#(<= main_~i~0 7)} assume true; {9093#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:51,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {9093#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9093#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:51,418 INFO L273 TraceCheckUtils]: 30: Hoare triple {9093#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9093#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:51,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {9093#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9094#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:51,419 INFO L273 TraceCheckUtils]: 32: Hoare triple {9094#(<= main_~i~0 8)} assume true; {9094#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:51,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {9094#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9094#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:51,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {9094#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9094#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:51,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {9094#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9095#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:51,421 INFO L273 TraceCheckUtils]: 36: Hoare triple {9095#(<= main_~i~0 9)} assume true; {9095#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:51,422 INFO L273 TraceCheckUtils]: 37: Hoare triple {9095#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9095#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:51,422 INFO L273 TraceCheckUtils]: 38: Hoare triple {9095#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9095#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:51,423 INFO L273 TraceCheckUtils]: 39: Hoare triple {9095#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9096#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:51,423 INFO L273 TraceCheckUtils]: 40: Hoare triple {9096#(<= main_~i~0 10)} assume true; {9096#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:51,424 INFO L273 TraceCheckUtils]: 41: Hoare triple {9096#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9096#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:51,424 INFO L273 TraceCheckUtils]: 42: Hoare triple {9096#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9096#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:51,425 INFO L273 TraceCheckUtils]: 43: Hoare triple {9096#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9097#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:51,426 INFO L273 TraceCheckUtils]: 44: Hoare triple {9097#(<= main_~i~0 11)} assume true; {9097#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:51,426 INFO L273 TraceCheckUtils]: 45: Hoare triple {9097#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9097#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:51,427 INFO L273 TraceCheckUtils]: 46: Hoare triple {9097#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9097#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:51,427 INFO L273 TraceCheckUtils]: 47: Hoare triple {9097#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9098#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:51,428 INFO L273 TraceCheckUtils]: 48: Hoare triple {9098#(<= main_~i~0 12)} assume true; {9098#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:51,428 INFO L273 TraceCheckUtils]: 49: Hoare triple {9098#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9098#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:51,429 INFO L273 TraceCheckUtils]: 50: Hoare triple {9098#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9098#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:51,430 INFO L273 TraceCheckUtils]: 51: Hoare triple {9098#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9099#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:51,430 INFO L273 TraceCheckUtils]: 52: Hoare triple {9099#(<= main_~i~0 13)} assume true; {9099#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:51,431 INFO L273 TraceCheckUtils]: 53: Hoare triple {9099#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9099#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:51,431 INFO L273 TraceCheckUtils]: 54: Hoare triple {9099#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9099#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:51,432 INFO L273 TraceCheckUtils]: 55: Hoare triple {9099#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9100#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:51,432 INFO L273 TraceCheckUtils]: 56: Hoare triple {9100#(<= main_~i~0 14)} assume true; {9100#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:51,433 INFO L273 TraceCheckUtils]: 57: Hoare triple {9100#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9100#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:51,433 INFO L273 TraceCheckUtils]: 58: Hoare triple {9100#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9100#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:51,434 INFO L273 TraceCheckUtils]: 59: Hoare triple {9100#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9101#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:51,435 INFO L273 TraceCheckUtils]: 60: Hoare triple {9101#(<= main_~i~0 15)} assume true; {9101#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:51,435 INFO L273 TraceCheckUtils]: 61: Hoare triple {9101#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9101#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:51,436 INFO L273 TraceCheckUtils]: 62: Hoare triple {9101#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9101#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:51,436 INFO L273 TraceCheckUtils]: 63: Hoare triple {9101#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9102#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:51,437 INFO L273 TraceCheckUtils]: 64: Hoare triple {9102#(<= main_~i~0 16)} assume true; {9102#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:51,437 INFO L273 TraceCheckUtils]: 65: Hoare triple {9102#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9102#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:51,438 INFO L273 TraceCheckUtils]: 66: Hoare triple {9102#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9102#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:51,439 INFO L273 TraceCheckUtils]: 67: Hoare triple {9102#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9103#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:51,439 INFO L273 TraceCheckUtils]: 68: Hoare triple {9103#(<= main_~i~0 17)} assume true; {9103#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:51,440 INFO L273 TraceCheckUtils]: 69: Hoare triple {9103#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9103#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:51,440 INFO L273 TraceCheckUtils]: 70: Hoare triple {9103#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9103#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:51,441 INFO L273 TraceCheckUtils]: 71: Hoare triple {9103#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9104#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:51,441 INFO L273 TraceCheckUtils]: 72: Hoare triple {9104#(<= main_~i~0 18)} assume true; {9104#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:51,442 INFO L273 TraceCheckUtils]: 73: Hoare triple {9104#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9104#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:51,442 INFO L273 TraceCheckUtils]: 74: Hoare triple {9104#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9104#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:51,443 INFO L273 TraceCheckUtils]: 75: Hoare triple {9104#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9105#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:51,443 INFO L273 TraceCheckUtils]: 76: Hoare triple {9105#(<= main_~i~0 19)} assume true; {9105#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:51,444 INFO L273 TraceCheckUtils]: 77: Hoare triple {9105#(<= main_~i~0 19)} assume !(~i~0 < 100000); {9087#false} is VALID [2018-11-14 18:41:51,444 INFO L273 TraceCheckUtils]: 78: Hoare triple {9087#false} havoc ~x~0;~x~0 := 0; {9087#false} is VALID [2018-11-14 18:41:51,444 INFO L273 TraceCheckUtils]: 79: Hoare triple {9087#false} assume true; {9087#false} is VALID [2018-11-14 18:41:51,445 INFO L273 TraceCheckUtils]: 80: Hoare triple {9087#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {9087#false} is VALID [2018-11-14 18:41:51,445 INFO L256 TraceCheckUtils]: 81: Hoare triple {9087#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {9087#false} is VALID [2018-11-14 18:41:51,445 INFO L273 TraceCheckUtils]: 82: Hoare triple {9087#false} ~cond := #in~cond; {9087#false} is VALID [2018-11-14 18:41:51,445 INFO L273 TraceCheckUtils]: 83: Hoare triple {9087#false} assume ~cond == 0; {9087#false} is VALID [2018-11-14 18:41:51,445 INFO L273 TraceCheckUtils]: 84: Hoare triple {9087#false} assume !false; {9087#false} is VALID [2018-11-14 18:41:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:51,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:51,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-14 18:41:51,472 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 85 [2018-11-14 18:41:51,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:51,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:41:51,549 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-14 18:41:51,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:41:51,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:41:51,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:41:51,550 INFO L87 Difference]: Start difference. First operand 114 states and 153 transitions. Second operand 20 states. [2018-11-14 18:41:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:52,294 INFO L93 Difference]: Finished difference Result 141 states and 188 transitions. [2018-11-14 18:41:52,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:41:52,294 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 85 [2018-11-14 18:41:52,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:41:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 188 transitions. [2018-11-14 18:41:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:41:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 188 transitions. [2018-11-14 18:41:52,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 188 transitions. [2018-11-14 18:41:52,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:52,539 INFO L225 Difference]: With dead ends: 141 [2018-11-14 18:41:52,539 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 18:41:52,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:41:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 18:41:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-11-14 18:41:52,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:52,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 119 states. [2018-11-14 18:41:52,613 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 119 states. [2018-11-14 18:41:52,613 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 119 states. [2018-11-14 18:41:52,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:52,615 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2018-11-14 18:41:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2018-11-14 18:41:52,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:52,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:52,616 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 122 states. [2018-11-14 18:41:52,616 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 122 states. [2018-11-14 18:41:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:52,617 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2018-11-14 18:41:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2018-11-14 18:41:52,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:52,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:52,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:52,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-14 18:41:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2018-11-14 18:41:52,620 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 85 [2018-11-14 18:41:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:52,620 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2018-11-14 18:41:52,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:41:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2018-11-14 18:41:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-14 18:41:52,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:52,622 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:52,622 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:52,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:52,622 INFO L82 PathProgramCache]: Analyzing trace with hash -542408112, now seen corresponding path program 18 times [2018-11-14 18:41:52,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:52,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:52,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:53,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {9925#true} call ULTIMATE.init(); {9925#true} is VALID [2018-11-14 18:41:53,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {9925#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9925#true} is VALID [2018-11-14 18:41:53,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {9925#true} assume true; {9925#true} is VALID [2018-11-14 18:41:53,031 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9925#true} {9925#true} #91#return; {9925#true} is VALID [2018-11-14 18:41:53,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {9925#true} call #t~ret13 := main(); {9925#true} is VALID [2018-11-14 18:41:53,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {9925#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {9925#true} is VALID [2018-11-14 18:41:53,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {9925#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {9925#true} is VALID [2018-11-14 18:41:53,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {9925#true} ~i~0 := 2; {9927#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:53,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {9927#(<= main_~i~0 2)} assume true; {9927#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:53,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {9927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9927#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:53,033 INFO L273 TraceCheckUtils]: 10: Hoare triple {9927#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9927#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:53,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {9927#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9928#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:53,034 INFO L273 TraceCheckUtils]: 12: Hoare triple {9928#(<= main_~i~0 3)} assume true; {9928#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:53,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {9928#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9928#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:53,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {9928#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9928#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:53,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {9928#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9929#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:53,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {9929#(<= main_~i~0 4)} assume true; {9929#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:53,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {9929#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9929#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:53,037 INFO L273 TraceCheckUtils]: 18: Hoare triple {9929#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9929#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:53,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {9929#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9930#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:53,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {9930#(<= main_~i~0 5)} assume true; {9930#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:53,038 INFO L273 TraceCheckUtils]: 21: Hoare triple {9930#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9930#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:53,039 INFO L273 TraceCheckUtils]: 22: Hoare triple {9930#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9930#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:53,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {9930#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9931#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:53,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {9931#(<= main_~i~0 6)} assume true; {9931#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:53,041 INFO L273 TraceCheckUtils]: 25: Hoare triple {9931#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9931#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:53,041 INFO L273 TraceCheckUtils]: 26: Hoare triple {9931#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9931#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:53,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {9931#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9932#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:53,042 INFO L273 TraceCheckUtils]: 28: Hoare triple {9932#(<= main_~i~0 7)} assume true; {9932#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:53,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {9932#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9932#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:53,043 INFO L273 TraceCheckUtils]: 30: Hoare triple {9932#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9932#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:53,044 INFO L273 TraceCheckUtils]: 31: Hoare triple {9932#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9933#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:53,045 INFO L273 TraceCheckUtils]: 32: Hoare triple {9933#(<= main_~i~0 8)} assume true; {9933#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:53,045 INFO L273 TraceCheckUtils]: 33: Hoare triple {9933#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9933#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:53,046 INFO L273 TraceCheckUtils]: 34: Hoare triple {9933#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9933#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:53,047 INFO L273 TraceCheckUtils]: 35: Hoare triple {9933#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9934#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:53,047 INFO L273 TraceCheckUtils]: 36: Hoare triple {9934#(<= main_~i~0 9)} assume true; {9934#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:53,048 INFO L273 TraceCheckUtils]: 37: Hoare triple {9934#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9934#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:53,048 INFO L273 TraceCheckUtils]: 38: Hoare triple {9934#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9934#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:53,049 INFO L273 TraceCheckUtils]: 39: Hoare triple {9934#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9935#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:53,049 INFO L273 TraceCheckUtils]: 40: Hoare triple {9935#(<= main_~i~0 10)} assume true; {9935#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:53,050 INFO L273 TraceCheckUtils]: 41: Hoare triple {9935#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9935#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:53,050 INFO L273 TraceCheckUtils]: 42: Hoare triple {9935#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9935#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:53,051 INFO L273 TraceCheckUtils]: 43: Hoare triple {9935#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9936#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:53,051 INFO L273 TraceCheckUtils]: 44: Hoare triple {9936#(<= main_~i~0 11)} assume true; {9936#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:53,052 INFO L273 TraceCheckUtils]: 45: Hoare triple {9936#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9936#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:53,052 INFO L273 TraceCheckUtils]: 46: Hoare triple {9936#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9936#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:53,053 INFO L273 TraceCheckUtils]: 47: Hoare triple {9936#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9937#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:53,054 INFO L273 TraceCheckUtils]: 48: Hoare triple {9937#(<= main_~i~0 12)} assume true; {9937#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:53,054 INFO L273 TraceCheckUtils]: 49: Hoare triple {9937#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9937#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:53,055 INFO L273 TraceCheckUtils]: 50: Hoare triple {9937#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9937#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:53,055 INFO L273 TraceCheckUtils]: 51: Hoare triple {9937#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9938#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:53,056 INFO L273 TraceCheckUtils]: 52: Hoare triple {9938#(<= main_~i~0 13)} assume true; {9938#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:53,056 INFO L273 TraceCheckUtils]: 53: Hoare triple {9938#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9938#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:53,057 INFO L273 TraceCheckUtils]: 54: Hoare triple {9938#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9938#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:53,057 INFO L273 TraceCheckUtils]: 55: Hoare triple {9938#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9939#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:53,058 INFO L273 TraceCheckUtils]: 56: Hoare triple {9939#(<= main_~i~0 14)} assume true; {9939#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:53,058 INFO L273 TraceCheckUtils]: 57: Hoare triple {9939#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9939#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:53,059 INFO L273 TraceCheckUtils]: 58: Hoare triple {9939#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9939#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:53,060 INFO L273 TraceCheckUtils]: 59: Hoare triple {9939#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9940#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:53,060 INFO L273 TraceCheckUtils]: 60: Hoare triple {9940#(<= main_~i~0 15)} assume true; {9940#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:53,061 INFO L273 TraceCheckUtils]: 61: Hoare triple {9940#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9940#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:53,061 INFO L273 TraceCheckUtils]: 62: Hoare triple {9940#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9940#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:53,062 INFO L273 TraceCheckUtils]: 63: Hoare triple {9940#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9941#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:53,062 INFO L273 TraceCheckUtils]: 64: Hoare triple {9941#(<= main_~i~0 16)} assume true; {9941#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:53,063 INFO L273 TraceCheckUtils]: 65: Hoare triple {9941#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9941#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:53,063 INFO L273 TraceCheckUtils]: 66: Hoare triple {9941#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9941#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:53,064 INFO L273 TraceCheckUtils]: 67: Hoare triple {9941#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9942#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:53,065 INFO L273 TraceCheckUtils]: 68: Hoare triple {9942#(<= main_~i~0 17)} assume true; {9942#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:53,065 INFO L273 TraceCheckUtils]: 69: Hoare triple {9942#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9942#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:53,066 INFO L273 TraceCheckUtils]: 70: Hoare triple {9942#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9942#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:53,066 INFO L273 TraceCheckUtils]: 71: Hoare triple {9942#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9943#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:53,067 INFO L273 TraceCheckUtils]: 72: Hoare triple {9943#(<= main_~i~0 18)} assume true; {9943#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:53,067 INFO L273 TraceCheckUtils]: 73: Hoare triple {9943#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9943#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:53,068 INFO L273 TraceCheckUtils]: 74: Hoare triple {9943#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9943#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:53,069 INFO L273 TraceCheckUtils]: 75: Hoare triple {9943#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9944#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:53,069 INFO L273 TraceCheckUtils]: 76: Hoare triple {9944#(<= main_~i~0 19)} assume true; {9944#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:53,070 INFO L273 TraceCheckUtils]: 77: Hoare triple {9944#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9944#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:53,070 INFO L273 TraceCheckUtils]: 78: Hoare triple {9944#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9944#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:53,071 INFO L273 TraceCheckUtils]: 79: Hoare triple {9944#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9945#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:53,072 INFO L273 TraceCheckUtils]: 80: Hoare triple {9945#(<= main_~i~0 20)} assume true; {9945#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:53,072 INFO L273 TraceCheckUtils]: 81: Hoare triple {9945#(<= main_~i~0 20)} assume !(~i~0 < 100000); {9926#false} is VALID [2018-11-14 18:41:53,072 INFO L273 TraceCheckUtils]: 82: Hoare triple {9926#false} havoc ~x~0;~x~0 := 0; {9926#false} is VALID [2018-11-14 18:41:53,073 INFO L273 TraceCheckUtils]: 83: Hoare triple {9926#false} assume true; {9926#false} is VALID [2018-11-14 18:41:53,073 INFO L273 TraceCheckUtils]: 84: Hoare triple {9926#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {9926#false} is VALID [2018-11-14 18:41:53,073 INFO L256 TraceCheckUtils]: 85: Hoare triple {9926#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {9926#false} is VALID [2018-11-14 18:41:53,073 INFO L273 TraceCheckUtils]: 86: Hoare triple {9926#false} ~cond := #in~cond; {9926#false} is VALID [2018-11-14 18:41:53,073 INFO L273 TraceCheckUtils]: 87: Hoare triple {9926#false} assume ~cond == 0; {9926#false} is VALID [2018-11-14 18:41:53,074 INFO L273 TraceCheckUtils]: 88: Hoare triple {9926#false} assume !false; {9926#false} is VALID [2018-11-14 18:41:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:53,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:53,080 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-14 18:41:53,089 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:41:53,179 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-14 18:41:53,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:53,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:53,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {9925#true} call ULTIMATE.init(); {9925#true} is VALID [2018-11-14 18:41:53,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {9925#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9925#true} is VALID [2018-11-14 18:41:53,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {9925#true} assume true; {9925#true} is VALID [2018-11-14 18:41:53,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9925#true} {9925#true} #91#return; {9925#true} is VALID [2018-11-14 18:41:53,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {9925#true} call #t~ret13 := main(); {9925#true} is VALID [2018-11-14 18:41:53,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {9925#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {9925#true} is VALID [2018-11-14 18:41:53,456 INFO L273 TraceCheckUtils]: 6: Hoare triple {9925#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {9925#true} is VALID [2018-11-14 18:41:53,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {9925#true} ~i~0 := 2; {9927#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:53,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {9927#(<= main_~i~0 2)} assume true; {9927#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:53,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {9927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9927#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:53,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {9927#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9927#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:53,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {9927#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9928#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:53,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {9928#(<= main_~i~0 3)} assume true; {9928#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:53,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {9928#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9928#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:53,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {9928#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9928#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:53,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {9928#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9929#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:53,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {9929#(<= main_~i~0 4)} assume true; {9929#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:53,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {9929#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9929#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:53,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {9929#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9929#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:53,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {9929#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9930#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:53,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {9930#(<= main_~i~0 5)} assume true; {9930#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:53,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {9930#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9930#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:53,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {9930#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9930#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:53,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {9930#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9931#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:53,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {9931#(<= main_~i~0 6)} assume true; {9931#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:53,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {9931#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9931#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:53,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {9931#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9931#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:53,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {9931#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9932#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:53,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {9932#(<= main_~i~0 7)} assume true; {9932#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:53,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {9932#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9932#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:53,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {9932#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9932#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:53,469 INFO L273 TraceCheckUtils]: 31: Hoare triple {9932#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9933#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:53,470 INFO L273 TraceCheckUtils]: 32: Hoare triple {9933#(<= main_~i~0 8)} assume true; {9933#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:53,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {9933#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9933#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:53,471 INFO L273 TraceCheckUtils]: 34: Hoare triple {9933#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9933#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:53,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {9933#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9934#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:53,472 INFO L273 TraceCheckUtils]: 36: Hoare triple {9934#(<= main_~i~0 9)} assume true; {9934#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:53,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {9934#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9934#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:53,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {9934#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9934#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:53,474 INFO L273 TraceCheckUtils]: 39: Hoare triple {9934#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9935#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:53,474 INFO L273 TraceCheckUtils]: 40: Hoare triple {9935#(<= main_~i~0 10)} assume true; {9935#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:53,475 INFO L273 TraceCheckUtils]: 41: Hoare triple {9935#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9935#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:53,475 INFO L273 TraceCheckUtils]: 42: Hoare triple {9935#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9935#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:53,476 INFO L273 TraceCheckUtils]: 43: Hoare triple {9935#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9936#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:53,476 INFO L273 TraceCheckUtils]: 44: Hoare triple {9936#(<= main_~i~0 11)} assume true; {9936#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:53,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {9936#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9936#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:53,477 INFO L273 TraceCheckUtils]: 46: Hoare triple {9936#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9936#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:53,478 INFO L273 TraceCheckUtils]: 47: Hoare triple {9936#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9937#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:53,479 INFO L273 TraceCheckUtils]: 48: Hoare triple {9937#(<= main_~i~0 12)} assume true; {9937#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:53,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {9937#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9937#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:53,480 INFO L273 TraceCheckUtils]: 50: Hoare triple {9937#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9937#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:53,480 INFO L273 TraceCheckUtils]: 51: Hoare triple {9937#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9938#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:53,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {9938#(<= main_~i~0 13)} assume true; {9938#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:53,481 INFO L273 TraceCheckUtils]: 53: Hoare triple {9938#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9938#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:53,482 INFO L273 TraceCheckUtils]: 54: Hoare triple {9938#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9938#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:53,483 INFO L273 TraceCheckUtils]: 55: Hoare triple {9938#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9939#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:53,483 INFO L273 TraceCheckUtils]: 56: Hoare triple {9939#(<= main_~i~0 14)} assume true; {9939#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:53,484 INFO L273 TraceCheckUtils]: 57: Hoare triple {9939#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9939#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:53,484 INFO L273 TraceCheckUtils]: 58: Hoare triple {9939#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9939#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:53,485 INFO L273 TraceCheckUtils]: 59: Hoare triple {9939#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9940#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:53,485 INFO L273 TraceCheckUtils]: 60: Hoare triple {9940#(<= main_~i~0 15)} assume true; {9940#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:53,486 INFO L273 TraceCheckUtils]: 61: Hoare triple {9940#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9940#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:53,486 INFO L273 TraceCheckUtils]: 62: Hoare triple {9940#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9940#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:53,487 INFO L273 TraceCheckUtils]: 63: Hoare triple {9940#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9941#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:53,488 INFO L273 TraceCheckUtils]: 64: Hoare triple {9941#(<= main_~i~0 16)} assume true; {9941#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:53,488 INFO L273 TraceCheckUtils]: 65: Hoare triple {9941#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9941#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:53,489 INFO L273 TraceCheckUtils]: 66: Hoare triple {9941#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9941#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:53,489 INFO L273 TraceCheckUtils]: 67: Hoare triple {9941#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9942#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:53,490 INFO L273 TraceCheckUtils]: 68: Hoare triple {9942#(<= main_~i~0 17)} assume true; {9942#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:53,491 INFO L273 TraceCheckUtils]: 69: Hoare triple {9942#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9942#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:53,491 INFO L273 TraceCheckUtils]: 70: Hoare triple {9942#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9942#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:53,492 INFO L273 TraceCheckUtils]: 71: Hoare triple {9942#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9943#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:53,492 INFO L273 TraceCheckUtils]: 72: Hoare triple {9943#(<= main_~i~0 18)} assume true; {9943#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:53,493 INFO L273 TraceCheckUtils]: 73: Hoare triple {9943#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9943#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:53,493 INFO L273 TraceCheckUtils]: 74: Hoare triple {9943#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9943#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:53,494 INFO L273 TraceCheckUtils]: 75: Hoare triple {9943#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9944#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:53,495 INFO L273 TraceCheckUtils]: 76: Hoare triple {9944#(<= main_~i~0 19)} assume true; {9944#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:53,495 INFO L273 TraceCheckUtils]: 77: Hoare triple {9944#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {9944#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:53,496 INFO L273 TraceCheckUtils]: 78: Hoare triple {9944#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9944#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:53,496 INFO L273 TraceCheckUtils]: 79: Hoare triple {9944#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9945#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:53,497 INFO L273 TraceCheckUtils]: 80: Hoare triple {9945#(<= main_~i~0 20)} assume true; {9945#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:53,497 INFO L273 TraceCheckUtils]: 81: Hoare triple {9945#(<= main_~i~0 20)} assume !(~i~0 < 100000); {9926#false} is VALID [2018-11-14 18:41:53,498 INFO L273 TraceCheckUtils]: 82: Hoare triple {9926#false} havoc ~x~0;~x~0 := 0; {9926#false} is VALID [2018-11-14 18:41:53,498 INFO L273 TraceCheckUtils]: 83: Hoare triple {9926#false} assume true; {9926#false} is VALID [2018-11-14 18:41:53,498 INFO L273 TraceCheckUtils]: 84: Hoare triple {9926#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {9926#false} is VALID [2018-11-14 18:41:53,498 INFO L256 TraceCheckUtils]: 85: Hoare triple {9926#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {9926#false} is VALID [2018-11-14 18:41:53,498 INFO L273 TraceCheckUtils]: 86: Hoare triple {9926#false} ~cond := #in~cond; {9926#false} is VALID [2018-11-14 18:41:53,499 INFO L273 TraceCheckUtils]: 87: Hoare triple {9926#false} assume ~cond == 0; {9926#false} is VALID [2018-11-14 18:41:53,499 INFO L273 TraceCheckUtils]: 88: Hoare triple {9926#false} assume !false; {9926#false} is VALID [2018-11-14 18:41:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:53,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:53,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-14 18:41:53,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-11-14 18:41:53,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:53,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 18:41:53,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:53,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 18:41:53,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 18:41:53,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:41:53,606 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand 21 states. [2018-11-14 18:41:54,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:54,299 INFO L93 Difference]: Finished difference Result 146 states and 195 transitions. [2018-11-14 18:41:54,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 18:41:54,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-11-14 18:41:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:41:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 195 transitions. [2018-11-14 18:41:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:41:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 195 transitions. [2018-11-14 18:41:54,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 195 transitions. [2018-11-14 18:41:54,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:54,490 INFO L225 Difference]: With dead ends: 146 [2018-11-14 18:41:54,490 INFO L226 Difference]: Without dead ends: 127 [2018-11-14 18:41:54,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:41:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-14 18:41:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-11-14 18:41:54,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:54,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 124 states. [2018-11-14 18:41:54,524 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 124 states. [2018-11-14 18:41:54,524 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 124 states. [2018-11-14 18:41:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:54,528 INFO L93 Difference]: Finished difference Result 127 states and 172 transitions. [2018-11-14 18:41:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 172 transitions. [2018-11-14 18:41:54,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:54,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:54,529 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 127 states. [2018-11-14 18:41:54,529 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 127 states. [2018-11-14 18:41:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:54,531 INFO L93 Difference]: Finished difference Result 127 states and 172 transitions. [2018-11-14 18:41:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 172 transitions. [2018-11-14 18:41:54,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:54,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:54,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:54,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-14 18:41:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 167 transitions. [2018-11-14 18:41:54,535 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 167 transitions. Word has length 89 [2018-11-14 18:41:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:54,535 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 167 transitions. [2018-11-14 18:41:54,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 18:41:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 167 transitions. [2018-11-14 18:41:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-14 18:41:54,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:54,536 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:54,537 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:54,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:54,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1465345858, now seen corresponding path program 19 times [2018-11-14 18:41:54,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:54,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:54,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:55,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {10799#true} call ULTIMATE.init(); {10799#true} is VALID [2018-11-14 18:41:55,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {10799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10799#true} is VALID [2018-11-14 18:41:55,194 INFO L273 TraceCheckUtils]: 2: Hoare triple {10799#true} assume true; {10799#true} is VALID [2018-11-14 18:41:55,194 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10799#true} {10799#true} #91#return; {10799#true} is VALID [2018-11-14 18:41:55,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {10799#true} call #t~ret13 := main(); {10799#true} is VALID [2018-11-14 18:41:55,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {10799#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {10799#true} is VALID [2018-11-14 18:41:55,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {10799#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {10799#true} is VALID [2018-11-14 18:41:55,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {10799#true} ~i~0 := 2; {10801#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:55,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {10801#(<= main_~i~0 2)} assume true; {10801#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:55,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {10801#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10801#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:55,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {10801#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10801#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:55,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {10801#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10802#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:55,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {10802#(<= main_~i~0 3)} assume true; {10802#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:55,198 INFO L273 TraceCheckUtils]: 13: Hoare triple {10802#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10802#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:55,198 INFO L273 TraceCheckUtils]: 14: Hoare triple {10802#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10802#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:55,199 INFO L273 TraceCheckUtils]: 15: Hoare triple {10802#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10803#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:55,199 INFO L273 TraceCheckUtils]: 16: Hoare triple {10803#(<= main_~i~0 4)} assume true; {10803#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:55,200 INFO L273 TraceCheckUtils]: 17: Hoare triple {10803#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10803#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:55,200 INFO L273 TraceCheckUtils]: 18: Hoare triple {10803#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10803#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:55,201 INFO L273 TraceCheckUtils]: 19: Hoare triple {10803#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10804#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:55,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {10804#(<= main_~i~0 5)} assume true; {10804#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:55,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {10804#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10804#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:55,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {10804#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10804#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:55,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {10804#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10805#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:55,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {10805#(<= main_~i~0 6)} assume true; {10805#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:55,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {10805#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10805#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:55,205 INFO L273 TraceCheckUtils]: 26: Hoare triple {10805#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10805#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:55,205 INFO L273 TraceCheckUtils]: 27: Hoare triple {10805#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10806#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:55,206 INFO L273 TraceCheckUtils]: 28: Hoare triple {10806#(<= main_~i~0 7)} assume true; {10806#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:55,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {10806#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10806#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:55,207 INFO L273 TraceCheckUtils]: 30: Hoare triple {10806#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10806#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:55,208 INFO L273 TraceCheckUtils]: 31: Hoare triple {10806#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10807#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:55,208 INFO L273 TraceCheckUtils]: 32: Hoare triple {10807#(<= main_~i~0 8)} assume true; {10807#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:55,209 INFO L273 TraceCheckUtils]: 33: Hoare triple {10807#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10807#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:55,209 INFO L273 TraceCheckUtils]: 34: Hoare triple {10807#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10807#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:55,210 INFO L273 TraceCheckUtils]: 35: Hoare triple {10807#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10808#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:55,211 INFO L273 TraceCheckUtils]: 36: Hoare triple {10808#(<= main_~i~0 9)} assume true; {10808#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:55,211 INFO L273 TraceCheckUtils]: 37: Hoare triple {10808#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10808#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:55,212 INFO L273 TraceCheckUtils]: 38: Hoare triple {10808#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10808#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:55,212 INFO L273 TraceCheckUtils]: 39: Hoare triple {10808#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10809#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:55,213 INFO L273 TraceCheckUtils]: 40: Hoare triple {10809#(<= main_~i~0 10)} assume true; {10809#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:55,213 INFO L273 TraceCheckUtils]: 41: Hoare triple {10809#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10809#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:55,214 INFO L273 TraceCheckUtils]: 42: Hoare triple {10809#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10809#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:55,215 INFO L273 TraceCheckUtils]: 43: Hoare triple {10809#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10810#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:55,215 INFO L273 TraceCheckUtils]: 44: Hoare triple {10810#(<= main_~i~0 11)} assume true; {10810#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:55,216 INFO L273 TraceCheckUtils]: 45: Hoare triple {10810#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10810#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:55,216 INFO L273 TraceCheckUtils]: 46: Hoare triple {10810#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10810#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:55,217 INFO L273 TraceCheckUtils]: 47: Hoare triple {10810#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10811#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:55,217 INFO L273 TraceCheckUtils]: 48: Hoare triple {10811#(<= main_~i~0 12)} assume true; {10811#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:55,218 INFO L273 TraceCheckUtils]: 49: Hoare triple {10811#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10811#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:55,218 INFO L273 TraceCheckUtils]: 50: Hoare triple {10811#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10811#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:55,219 INFO L273 TraceCheckUtils]: 51: Hoare triple {10811#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10812#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:55,220 INFO L273 TraceCheckUtils]: 52: Hoare triple {10812#(<= main_~i~0 13)} assume true; {10812#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:55,220 INFO L273 TraceCheckUtils]: 53: Hoare triple {10812#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10812#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:55,221 INFO L273 TraceCheckUtils]: 54: Hoare triple {10812#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10812#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:55,221 INFO L273 TraceCheckUtils]: 55: Hoare triple {10812#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10813#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:55,222 INFO L273 TraceCheckUtils]: 56: Hoare triple {10813#(<= main_~i~0 14)} assume true; {10813#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:55,222 INFO L273 TraceCheckUtils]: 57: Hoare triple {10813#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10813#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:55,223 INFO L273 TraceCheckUtils]: 58: Hoare triple {10813#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10813#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:55,224 INFO L273 TraceCheckUtils]: 59: Hoare triple {10813#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10814#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:55,224 INFO L273 TraceCheckUtils]: 60: Hoare triple {10814#(<= main_~i~0 15)} assume true; {10814#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:55,225 INFO L273 TraceCheckUtils]: 61: Hoare triple {10814#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10814#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:55,225 INFO L273 TraceCheckUtils]: 62: Hoare triple {10814#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10814#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:55,226 INFO L273 TraceCheckUtils]: 63: Hoare triple {10814#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10815#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:55,226 INFO L273 TraceCheckUtils]: 64: Hoare triple {10815#(<= main_~i~0 16)} assume true; {10815#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:55,227 INFO L273 TraceCheckUtils]: 65: Hoare triple {10815#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10815#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:55,227 INFO L273 TraceCheckUtils]: 66: Hoare triple {10815#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10815#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:55,228 INFO L273 TraceCheckUtils]: 67: Hoare triple {10815#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10816#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:55,229 INFO L273 TraceCheckUtils]: 68: Hoare triple {10816#(<= main_~i~0 17)} assume true; {10816#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:55,229 INFO L273 TraceCheckUtils]: 69: Hoare triple {10816#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10816#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:55,230 INFO L273 TraceCheckUtils]: 70: Hoare triple {10816#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10816#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:55,230 INFO L273 TraceCheckUtils]: 71: Hoare triple {10816#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10817#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:55,231 INFO L273 TraceCheckUtils]: 72: Hoare triple {10817#(<= main_~i~0 18)} assume true; {10817#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:55,232 INFO L273 TraceCheckUtils]: 73: Hoare triple {10817#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10817#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:55,232 INFO L273 TraceCheckUtils]: 74: Hoare triple {10817#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10817#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:55,233 INFO L273 TraceCheckUtils]: 75: Hoare triple {10817#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10818#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:55,233 INFO L273 TraceCheckUtils]: 76: Hoare triple {10818#(<= main_~i~0 19)} assume true; {10818#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:55,234 INFO L273 TraceCheckUtils]: 77: Hoare triple {10818#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10818#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:55,234 INFO L273 TraceCheckUtils]: 78: Hoare triple {10818#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10818#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:55,235 INFO L273 TraceCheckUtils]: 79: Hoare triple {10818#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10819#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:55,236 INFO L273 TraceCheckUtils]: 80: Hoare triple {10819#(<= main_~i~0 20)} assume true; {10819#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:55,236 INFO L273 TraceCheckUtils]: 81: Hoare triple {10819#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10819#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:55,237 INFO L273 TraceCheckUtils]: 82: Hoare triple {10819#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10819#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:55,237 INFO L273 TraceCheckUtils]: 83: Hoare triple {10819#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10820#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:55,238 INFO L273 TraceCheckUtils]: 84: Hoare triple {10820#(<= main_~i~0 21)} assume true; {10820#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:55,239 INFO L273 TraceCheckUtils]: 85: Hoare triple {10820#(<= main_~i~0 21)} assume !(~i~0 < 100000); {10800#false} is VALID [2018-11-14 18:41:55,239 INFO L273 TraceCheckUtils]: 86: Hoare triple {10800#false} havoc ~x~0;~x~0 := 0; {10800#false} is VALID [2018-11-14 18:41:55,239 INFO L273 TraceCheckUtils]: 87: Hoare triple {10800#false} assume true; {10800#false} is VALID [2018-11-14 18:41:55,239 INFO L273 TraceCheckUtils]: 88: Hoare triple {10800#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {10800#false} is VALID [2018-11-14 18:41:55,239 INFO L256 TraceCheckUtils]: 89: Hoare triple {10800#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {10800#false} is VALID [2018-11-14 18:41:55,240 INFO L273 TraceCheckUtils]: 90: Hoare triple {10800#false} ~cond := #in~cond; {10800#false} is VALID [2018-11-14 18:41:55,240 INFO L273 TraceCheckUtils]: 91: Hoare triple {10800#false} assume ~cond == 0; {10800#false} is VALID [2018-11-14 18:41:55,240 INFO L273 TraceCheckUtils]: 92: Hoare triple {10800#false} assume !false; {10800#false} is VALID [2018-11-14 18:41:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:55,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:55,248 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-14 18:41:55,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:55,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:55,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {10799#true} call ULTIMATE.init(); {10799#true} is VALID [2018-11-14 18:41:55,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {10799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10799#true} is VALID [2018-11-14 18:41:55,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {10799#true} assume true; {10799#true} is VALID [2018-11-14 18:41:55,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10799#true} {10799#true} #91#return; {10799#true} is VALID [2018-11-14 18:41:55,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {10799#true} call #t~ret13 := main(); {10799#true} is VALID [2018-11-14 18:41:55,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {10799#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {10799#true} is VALID [2018-11-14 18:41:55,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {10799#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {10799#true} is VALID [2018-11-14 18:41:55,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {10799#true} ~i~0 := 2; {10801#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:55,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {10801#(<= main_~i~0 2)} assume true; {10801#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:55,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {10801#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10801#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:55,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {10801#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10801#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:55,523 INFO L273 TraceCheckUtils]: 11: Hoare triple {10801#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10802#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:55,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {10802#(<= main_~i~0 3)} assume true; {10802#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:55,524 INFO L273 TraceCheckUtils]: 13: Hoare triple {10802#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10802#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:55,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {10802#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10802#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:55,525 INFO L273 TraceCheckUtils]: 15: Hoare triple {10802#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10803#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:55,525 INFO L273 TraceCheckUtils]: 16: Hoare triple {10803#(<= main_~i~0 4)} assume true; {10803#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:55,526 INFO L273 TraceCheckUtils]: 17: Hoare triple {10803#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10803#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:55,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {10803#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10803#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:55,527 INFO L273 TraceCheckUtils]: 19: Hoare triple {10803#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10804#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:55,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {10804#(<= main_~i~0 5)} assume true; {10804#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:55,528 INFO L273 TraceCheckUtils]: 21: Hoare triple {10804#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10804#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:55,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {10804#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10804#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:55,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {10804#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10805#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:55,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {10805#(<= main_~i~0 6)} assume true; {10805#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:55,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {10805#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10805#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:55,531 INFO L273 TraceCheckUtils]: 26: Hoare triple {10805#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10805#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:55,532 INFO L273 TraceCheckUtils]: 27: Hoare triple {10805#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10806#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:55,532 INFO L273 TraceCheckUtils]: 28: Hoare triple {10806#(<= main_~i~0 7)} assume true; {10806#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:55,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {10806#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10806#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:55,533 INFO L273 TraceCheckUtils]: 30: Hoare triple {10806#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10806#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:55,534 INFO L273 TraceCheckUtils]: 31: Hoare triple {10806#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10807#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:55,534 INFO L273 TraceCheckUtils]: 32: Hoare triple {10807#(<= main_~i~0 8)} assume true; {10807#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:55,535 INFO L273 TraceCheckUtils]: 33: Hoare triple {10807#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10807#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:55,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {10807#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10807#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:55,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {10807#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10808#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:55,537 INFO L273 TraceCheckUtils]: 36: Hoare triple {10808#(<= main_~i~0 9)} assume true; {10808#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:55,537 INFO L273 TraceCheckUtils]: 37: Hoare triple {10808#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10808#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:55,538 INFO L273 TraceCheckUtils]: 38: Hoare triple {10808#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10808#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:55,538 INFO L273 TraceCheckUtils]: 39: Hoare triple {10808#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10809#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:55,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {10809#(<= main_~i~0 10)} assume true; {10809#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:55,539 INFO L273 TraceCheckUtils]: 41: Hoare triple {10809#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10809#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:55,540 INFO L273 TraceCheckUtils]: 42: Hoare triple {10809#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10809#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:55,541 INFO L273 TraceCheckUtils]: 43: Hoare triple {10809#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10810#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:55,541 INFO L273 TraceCheckUtils]: 44: Hoare triple {10810#(<= main_~i~0 11)} assume true; {10810#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:55,542 INFO L273 TraceCheckUtils]: 45: Hoare triple {10810#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10810#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:55,542 INFO L273 TraceCheckUtils]: 46: Hoare triple {10810#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10810#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:55,543 INFO L273 TraceCheckUtils]: 47: Hoare triple {10810#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10811#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:55,543 INFO L273 TraceCheckUtils]: 48: Hoare triple {10811#(<= main_~i~0 12)} assume true; {10811#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:55,544 INFO L273 TraceCheckUtils]: 49: Hoare triple {10811#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10811#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:55,544 INFO L273 TraceCheckUtils]: 50: Hoare triple {10811#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10811#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:55,545 INFO L273 TraceCheckUtils]: 51: Hoare triple {10811#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10812#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:55,546 INFO L273 TraceCheckUtils]: 52: Hoare triple {10812#(<= main_~i~0 13)} assume true; {10812#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:55,546 INFO L273 TraceCheckUtils]: 53: Hoare triple {10812#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10812#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:55,547 INFO L273 TraceCheckUtils]: 54: Hoare triple {10812#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10812#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:55,547 INFO L273 TraceCheckUtils]: 55: Hoare triple {10812#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10813#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:55,548 INFO L273 TraceCheckUtils]: 56: Hoare triple {10813#(<= main_~i~0 14)} assume true; {10813#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:55,548 INFO L273 TraceCheckUtils]: 57: Hoare triple {10813#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10813#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:55,549 INFO L273 TraceCheckUtils]: 58: Hoare triple {10813#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10813#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:55,550 INFO L273 TraceCheckUtils]: 59: Hoare triple {10813#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10814#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:55,550 INFO L273 TraceCheckUtils]: 60: Hoare triple {10814#(<= main_~i~0 15)} assume true; {10814#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:55,551 INFO L273 TraceCheckUtils]: 61: Hoare triple {10814#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10814#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:55,551 INFO L273 TraceCheckUtils]: 62: Hoare triple {10814#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10814#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:55,552 INFO L273 TraceCheckUtils]: 63: Hoare triple {10814#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10815#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:55,553 INFO L273 TraceCheckUtils]: 64: Hoare triple {10815#(<= main_~i~0 16)} assume true; {10815#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:55,553 INFO L273 TraceCheckUtils]: 65: Hoare triple {10815#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10815#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:55,554 INFO L273 TraceCheckUtils]: 66: Hoare triple {10815#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10815#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:55,554 INFO L273 TraceCheckUtils]: 67: Hoare triple {10815#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10816#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:55,555 INFO L273 TraceCheckUtils]: 68: Hoare triple {10816#(<= main_~i~0 17)} assume true; {10816#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:55,555 INFO L273 TraceCheckUtils]: 69: Hoare triple {10816#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10816#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:55,556 INFO L273 TraceCheckUtils]: 70: Hoare triple {10816#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10816#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:55,557 INFO L273 TraceCheckUtils]: 71: Hoare triple {10816#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10817#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:55,557 INFO L273 TraceCheckUtils]: 72: Hoare triple {10817#(<= main_~i~0 18)} assume true; {10817#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:55,558 INFO L273 TraceCheckUtils]: 73: Hoare triple {10817#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10817#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:55,558 INFO L273 TraceCheckUtils]: 74: Hoare triple {10817#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10817#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:55,559 INFO L273 TraceCheckUtils]: 75: Hoare triple {10817#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10818#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:55,559 INFO L273 TraceCheckUtils]: 76: Hoare triple {10818#(<= main_~i~0 19)} assume true; {10818#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:55,560 INFO L273 TraceCheckUtils]: 77: Hoare triple {10818#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10818#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:55,560 INFO L273 TraceCheckUtils]: 78: Hoare triple {10818#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10818#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:55,561 INFO L273 TraceCheckUtils]: 79: Hoare triple {10818#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10819#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:55,562 INFO L273 TraceCheckUtils]: 80: Hoare triple {10819#(<= main_~i~0 20)} assume true; {10819#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:55,562 INFO L273 TraceCheckUtils]: 81: Hoare triple {10819#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {10819#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:55,563 INFO L273 TraceCheckUtils]: 82: Hoare triple {10819#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10819#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:55,563 INFO L273 TraceCheckUtils]: 83: Hoare triple {10819#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10820#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:55,564 INFO L273 TraceCheckUtils]: 84: Hoare triple {10820#(<= main_~i~0 21)} assume true; {10820#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:55,565 INFO L273 TraceCheckUtils]: 85: Hoare triple {10820#(<= main_~i~0 21)} assume !(~i~0 < 100000); {10800#false} is VALID [2018-11-14 18:41:55,565 INFO L273 TraceCheckUtils]: 86: Hoare triple {10800#false} havoc ~x~0;~x~0 := 0; {10800#false} is VALID [2018-11-14 18:41:55,565 INFO L273 TraceCheckUtils]: 87: Hoare triple {10800#false} assume true; {10800#false} is VALID [2018-11-14 18:41:55,565 INFO L273 TraceCheckUtils]: 88: Hoare triple {10800#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {10800#false} is VALID [2018-11-14 18:41:55,565 INFO L256 TraceCheckUtils]: 89: Hoare triple {10800#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {10800#false} is VALID [2018-11-14 18:41:55,566 INFO L273 TraceCheckUtils]: 90: Hoare triple {10800#false} ~cond := #in~cond; {10800#false} is VALID [2018-11-14 18:41:55,566 INFO L273 TraceCheckUtils]: 91: Hoare triple {10800#false} assume ~cond == 0; {10800#false} is VALID [2018-11-14 18:41:55,566 INFO L273 TraceCheckUtils]: 92: Hoare triple {10800#false} assume !false; {10800#false} is VALID [2018-11-14 18:41:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:55,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:55,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-11-14 18:41:55,594 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-11-14 18:41:55,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:55,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:41:55,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:55,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:41:55,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:41:55,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:41:55,690 INFO L87 Difference]: Start difference. First operand 124 states and 167 transitions. Second operand 22 states. [2018-11-14 18:41:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:56,205 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2018-11-14 18:41:56,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:41:56,205 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-11-14 18:41:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:41:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 202 transitions. [2018-11-14 18:41:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:41:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 202 transitions. [2018-11-14 18:41:56,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 202 transitions. [2018-11-14 18:41:56,771 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-14 18:41:56,773 INFO L225 Difference]: With dead ends: 151 [2018-11-14 18:41:56,773 INFO L226 Difference]: Without dead ends: 132 [2018-11-14 18:41:56,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:41:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-14 18:41:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2018-11-14 18:41:56,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:56,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 129 states. [2018-11-14 18:41:56,819 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 129 states. [2018-11-14 18:41:56,819 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 129 states. [2018-11-14 18:41:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:56,822 INFO L93 Difference]: Finished difference Result 132 states and 179 transitions. [2018-11-14 18:41:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 179 transitions. [2018-11-14 18:41:56,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:56,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:56,822 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 132 states. [2018-11-14 18:41:56,823 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 132 states. [2018-11-14 18:41:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:56,825 INFO L93 Difference]: Finished difference Result 132 states and 179 transitions. [2018-11-14 18:41:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 179 transitions. [2018-11-14 18:41:56,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:56,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:56,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:56,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-14 18:41:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 174 transitions. [2018-11-14 18:41:56,828 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 174 transitions. Word has length 93 [2018-11-14 18:41:56,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:56,829 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 174 transitions. [2018-11-14 18:41:56,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:41:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 174 transitions. [2018-11-14 18:41:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-14 18:41:56,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:56,830 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:56,830 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:56,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1681685708, now seen corresponding path program 20 times [2018-11-14 18:41:56,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:56,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:56,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:57,513 INFO L256 TraceCheckUtils]: 0: Hoare triple {11708#true} call ULTIMATE.init(); {11708#true} is VALID [2018-11-14 18:41:57,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {11708#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11708#true} is VALID [2018-11-14 18:41:57,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {11708#true} assume true; {11708#true} is VALID [2018-11-14 18:41:57,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11708#true} {11708#true} #91#return; {11708#true} is VALID [2018-11-14 18:41:57,514 INFO L256 TraceCheckUtils]: 4: Hoare triple {11708#true} call #t~ret13 := main(); {11708#true} is VALID [2018-11-14 18:41:57,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {11708#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {11708#true} is VALID [2018-11-14 18:41:57,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {11708#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {11708#true} is VALID [2018-11-14 18:41:57,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {11708#true} ~i~0 := 2; {11710#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:57,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {11710#(<= main_~i~0 2)} assume true; {11710#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:57,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {11710#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11710#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:57,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {11710#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11710#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:57,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {11710#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11711#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:57,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {11711#(<= main_~i~0 3)} assume true; {11711#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:57,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {11711#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11711#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:57,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {11711#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11711#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:57,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {11711#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11712#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:57,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {11712#(<= main_~i~0 4)} assume true; {11712#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:57,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {11712#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11712#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:57,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {11712#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11712#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:57,533 INFO L273 TraceCheckUtils]: 19: Hoare triple {11712#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11713#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:57,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {11713#(<= main_~i~0 5)} assume true; {11713#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:57,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {11713#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11713#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:57,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {11713#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11713#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:57,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {11713#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11714#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:57,537 INFO L273 TraceCheckUtils]: 24: Hoare triple {11714#(<= main_~i~0 6)} assume true; {11714#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:57,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {11714#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11714#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:57,539 INFO L273 TraceCheckUtils]: 26: Hoare triple {11714#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11714#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:57,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {11714#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11715#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:57,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {11715#(<= main_~i~0 7)} assume true; {11715#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:57,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {11715#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11715#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:57,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {11715#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11715#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:57,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {11715#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11716#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:57,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {11716#(<= main_~i~0 8)} assume true; {11716#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:57,547 INFO L273 TraceCheckUtils]: 33: Hoare triple {11716#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11716#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:57,547 INFO L273 TraceCheckUtils]: 34: Hoare triple {11716#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11716#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:57,549 INFO L273 TraceCheckUtils]: 35: Hoare triple {11716#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11717#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:57,549 INFO L273 TraceCheckUtils]: 36: Hoare triple {11717#(<= main_~i~0 9)} assume true; {11717#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:57,551 INFO L273 TraceCheckUtils]: 37: Hoare triple {11717#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11717#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:57,551 INFO L273 TraceCheckUtils]: 38: Hoare triple {11717#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11717#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:57,554 INFO L273 TraceCheckUtils]: 39: Hoare triple {11717#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11718#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:57,554 INFO L273 TraceCheckUtils]: 40: Hoare triple {11718#(<= main_~i~0 10)} assume true; {11718#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:57,556 INFO L273 TraceCheckUtils]: 41: Hoare triple {11718#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11718#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:57,556 INFO L273 TraceCheckUtils]: 42: Hoare triple {11718#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11718#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:57,559 INFO L273 TraceCheckUtils]: 43: Hoare triple {11718#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11719#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:57,559 INFO L273 TraceCheckUtils]: 44: Hoare triple {11719#(<= main_~i~0 11)} assume true; {11719#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:57,561 INFO L273 TraceCheckUtils]: 45: Hoare triple {11719#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11719#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:57,561 INFO L273 TraceCheckUtils]: 46: Hoare triple {11719#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11719#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:57,563 INFO L273 TraceCheckUtils]: 47: Hoare triple {11719#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11720#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:57,563 INFO L273 TraceCheckUtils]: 48: Hoare triple {11720#(<= main_~i~0 12)} assume true; {11720#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:57,566 INFO L273 TraceCheckUtils]: 49: Hoare triple {11720#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11720#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:57,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {11720#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11720#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:57,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {11720#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11721#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:57,568 INFO L273 TraceCheckUtils]: 52: Hoare triple {11721#(<= main_~i~0 13)} assume true; {11721#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:57,571 INFO L273 TraceCheckUtils]: 53: Hoare triple {11721#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11721#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:57,571 INFO L273 TraceCheckUtils]: 54: Hoare triple {11721#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11721#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:57,573 INFO L273 TraceCheckUtils]: 55: Hoare triple {11721#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11722#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:57,573 INFO L273 TraceCheckUtils]: 56: Hoare triple {11722#(<= main_~i~0 14)} assume true; {11722#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:57,575 INFO L273 TraceCheckUtils]: 57: Hoare triple {11722#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11722#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:57,575 INFO L273 TraceCheckUtils]: 58: Hoare triple {11722#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11722#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:57,577 INFO L273 TraceCheckUtils]: 59: Hoare triple {11722#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11723#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:57,577 INFO L273 TraceCheckUtils]: 60: Hoare triple {11723#(<= main_~i~0 15)} assume true; {11723#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:57,579 INFO L273 TraceCheckUtils]: 61: Hoare triple {11723#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11723#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:57,579 INFO L273 TraceCheckUtils]: 62: Hoare triple {11723#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11723#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:57,579 INFO L273 TraceCheckUtils]: 63: Hoare triple {11723#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11724#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:57,581 INFO L273 TraceCheckUtils]: 64: Hoare triple {11724#(<= main_~i~0 16)} assume true; {11724#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:57,581 INFO L273 TraceCheckUtils]: 65: Hoare triple {11724#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11724#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:57,581 INFO L273 TraceCheckUtils]: 66: Hoare triple {11724#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11724#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:57,582 INFO L273 TraceCheckUtils]: 67: Hoare triple {11724#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11725#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:57,583 INFO L273 TraceCheckUtils]: 68: Hoare triple {11725#(<= main_~i~0 17)} assume true; {11725#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:57,583 INFO L273 TraceCheckUtils]: 69: Hoare triple {11725#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11725#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:57,585 INFO L273 TraceCheckUtils]: 70: Hoare triple {11725#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11725#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:57,585 INFO L273 TraceCheckUtils]: 71: Hoare triple {11725#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11726#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:57,586 INFO L273 TraceCheckUtils]: 72: Hoare triple {11726#(<= main_~i~0 18)} assume true; {11726#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:57,587 INFO L273 TraceCheckUtils]: 73: Hoare triple {11726#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11726#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:57,587 INFO L273 TraceCheckUtils]: 74: Hoare triple {11726#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11726#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:57,589 INFO L273 TraceCheckUtils]: 75: Hoare triple {11726#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11727#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:57,589 INFO L273 TraceCheckUtils]: 76: Hoare triple {11727#(<= main_~i~0 19)} assume true; {11727#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:57,591 INFO L273 TraceCheckUtils]: 77: Hoare triple {11727#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11727#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:57,591 INFO L273 TraceCheckUtils]: 78: Hoare triple {11727#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11727#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:57,593 INFO L273 TraceCheckUtils]: 79: Hoare triple {11727#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11728#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:57,593 INFO L273 TraceCheckUtils]: 80: Hoare triple {11728#(<= main_~i~0 20)} assume true; {11728#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:57,596 INFO L273 TraceCheckUtils]: 81: Hoare triple {11728#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11728#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:57,596 INFO L273 TraceCheckUtils]: 82: Hoare triple {11728#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11728#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:57,598 INFO L273 TraceCheckUtils]: 83: Hoare triple {11728#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11729#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:57,598 INFO L273 TraceCheckUtils]: 84: Hoare triple {11729#(<= main_~i~0 21)} assume true; {11729#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:57,601 INFO L273 TraceCheckUtils]: 85: Hoare triple {11729#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11729#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:57,601 INFO L273 TraceCheckUtils]: 86: Hoare triple {11729#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11729#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:57,603 INFO L273 TraceCheckUtils]: 87: Hoare triple {11729#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11730#(<= main_~i~0 22)} is VALID [2018-11-14 18:41:57,603 INFO L273 TraceCheckUtils]: 88: Hoare triple {11730#(<= main_~i~0 22)} assume true; {11730#(<= main_~i~0 22)} is VALID [2018-11-14 18:41:57,605 INFO L273 TraceCheckUtils]: 89: Hoare triple {11730#(<= main_~i~0 22)} assume !(~i~0 < 100000); {11709#false} is VALID [2018-11-14 18:41:57,605 INFO L273 TraceCheckUtils]: 90: Hoare triple {11709#false} havoc ~x~0;~x~0 := 0; {11709#false} is VALID [2018-11-14 18:41:57,605 INFO L273 TraceCheckUtils]: 91: Hoare triple {11709#false} assume true; {11709#false} is VALID [2018-11-14 18:41:57,605 INFO L273 TraceCheckUtils]: 92: Hoare triple {11709#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {11709#false} is VALID [2018-11-14 18:41:57,605 INFO L256 TraceCheckUtils]: 93: Hoare triple {11709#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {11709#false} is VALID [2018-11-14 18:41:57,605 INFO L273 TraceCheckUtils]: 94: Hoare triple {11709#false} ~cond := #in~cond; {11709#false} is VALID [2018-11-14 18:41:57,605 INFO L273 TraceCheckUtils]: 95: Hoare triple {11709#false} assume ~cond == 0; {11709#false} is VALID [2018-11-14 18:41:57,605 INFO L273 TraceCheckUtils]: 96: Hoare triple {11709#false} assume !false; {11709#false} is VALID [2018-11-14 18:41:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:57,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:57,612 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-14 18:41:57,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:41:57,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:41:57,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:57,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:57,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {11708#true} call ULTIMATE.init(); {11708#true} is VALID [2018-11-14 18:41:57,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {11708#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11708#true} is VALID [2018-11-14 18:41:57,942 INFO L273 TraceCheckUtils]: 2: Hoare triple {11708#true} assume true; {11708#true} is VALID [2018-11-14 18:41:57,942 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11708#true} {11708#true} #91#return; {11708#true} is VALID [2018-11-14 18:41:57,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {11708#true} call #t~ret13 := main(); {11708#true} is VALID [2018-11-14 18:41:57,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {11708#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {11708#true} is VALID [2018-11-14 18:41:57,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {11708#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {11708#true} is VALID [2018-11-14 18:41:57,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {11708#true} ~i~0 := 2; {11710#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:57,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {11710#(<= main_~i~0 2)} assume true; {11710#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:57,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {11710#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11710#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:57,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {11710#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11710#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:57,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {11710#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11711#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:57,946 INFO L273 TraceCheckUtils]: 12: Hoare triple {11711#(<= main_~i~0 3)} assume true; {11711#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:57,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {11711#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11711#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:57,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {11711#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11711#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:57,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {11711#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11712#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:57,947 INFO L273 TraceCheckUtils]: 16: Hoare triple {11712#(<= main_~i~0 4)} assume true; {11712#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:57,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {11712#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11712#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:57,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {11712#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11712#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:57,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {11712#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11713#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:57,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {11713#(<= main_~i~0 5)} assume true; {11713#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:57,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {11713#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11713#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:57,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {11713#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11713#(<= main_~i~0 5)} is VALID [2018-11-14 18:41:57,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {11713#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11714#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:57,952 INFO L273 TraceCheckUtils]: 24: Hoare triple {11714#(<= main_~i~0 6)} assume true; {11714#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:57,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {11714#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11714#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:57,953 INFO L273 TraceCheckUtils]: 26: Hoare triple {11714#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11714#(<= main_~i~0 6)} is VALID [2018-11-14 18:41:57,954 INFO L273 TraceCheckUtils]: 27: Hoare triple {11714#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11715#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:57,954 INFO L273 TraceCheckUtils]: 28: Hoare triple {11715#(<= main_~i~0 7)} assume true; {11715#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:57,955 INFO L273 TraceCheckUtils]: 29: Hoare triple {11715#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11715#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:57,955 INFO L273 TraceCheckUtils]: 30: Hoare triple {11715#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11715#(<= main_~i~0 7)} is VALID [2018-11-14 18:41:57,956 INFO L273 TraceCheckUtils]: 31: Hoare triple {11715#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11716#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:57,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {11716#(<= main_~i~0 8)} assume true; {11716#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:57,957 INFO L273 TraceCheckUtils]: 33: Hoare triple {11716#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11716#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:57,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {11716#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11716#(<= main_~i~0 8)} is VALID [2018-11-14 18:41:57,958 INFO L273 TraceCheckUtils]: 35: Hoare triple {11716#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11717#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:57,959 INFO L273 TraceCheckUtils]: 36: Hoare triple {11717#(<= main_~i~0 9)} assume true; {11717#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:57,959 INFO L273 TraceCheckUtils]: 37: Hoare triple {11717#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11717#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:57,960 INFO L273 TraceCheckUtils]: 38: Hoare triple {11717#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11717#(<= main_~i~0 9)} is VALID [2018-11-14 18:41:57,960 INFO L273 TraceCheckUtils]: 39: Hoare triple {11717#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11718#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:57,961 INFO L273 TraceCheckUtils]: 40: Hoare triple {11718#(<= main_~i~0 10)} assume true; {11718#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:57,961 INFO L273 TraceCheckUtils]: 41: Hoare triple {11718#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11718#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:57,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {11718#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11718#(<= main_~i~0 10)} is VALID [2018-11-14 18:41:57,963 INFO L273 TraceCheckUtils]: 43: Hoare triple {11718#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11719#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:57,963 INFO L273 TraceCheckUtils]: 44: Hoare triple {11719#(<= main_~i~0 11)} assume true; {11719#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:57,964 INFO L273 TraceCheckUtils]: 45: Hoare triple {11719#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11719#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:57,964 INFO L273 TraceCheckUtils]: 46: Hoare triple {11719#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11719#(<= main_~i~0 11)} is VALID [2018-11-14 18:41:57,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {11719#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11720#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:57,965 INFO L273 TraceCheckUtils]: 48: Hoare triple {11720#(<= main_~i~0 12)} assume true; {11720#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:57,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {11720#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11720#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:57,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {11720#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11720#(<= main_~i~0 12)} is VALID [2018-11-14 18:41:57,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {11720#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11721#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:57,968 INFO L273 TraceCheckUtils]: 52: Hoare triple {11721#(<= main_~i~0 13)} assume true; {11721#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:57,968 INFO L273 TraceCheckUtils]: 53: Hoare triple {11721#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11721#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:57,969 INFO L273 TraceCheckUtils]: 54: Hoare triple {11721#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11721#(<= main_~i~0 13)} is VALID [2018-11-14 18:41:57,969 INFO L273 TraceCheckUtils]: 55: Hoare triple {11721#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11722#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:57,970 INFO L273 TraceCheckUtils]: 56: Hoare triple {11722#(<= main_~i~0 14)} assume true; {11722#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:57,970 INFO L273 TraceCheckUtils]: 57: Hoare triple {11722#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11722#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:57,971 INFO L273 TraceCheckUtils]: 58: Hoare triple {11722#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11722#(<= main_~i~0 14)} is VALID [2018-11-14 18:41:57,972 INFO L273 TraceCheckUtils]: 59: Hoare triple {11722#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11723#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:57,972 INFO L273 TraceCheckUtils]: 60: Hoare triple {11723#(<= main_~i~0 15)} assume true; {11723#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:57,973 INFO L273 TraceCheckUtils]: 61: Hoare triple {11723#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11723#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:57,973 INFO L273 TraceCheckUtils]: 62: Hoare triple {11723#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11723#(<= main_~i~0 15)} is VALID [2018-11-14 18:41:57,974 INFO L273 TraceCheckUtils]: 63: Hoare triple {11723#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11724#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:57,975 INFO L273 TraceCheckUtils]: 64: Hoare triple {11724#(<= main_~i~0 16)} assume true; {11724#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:57,975 INFO L273 TraceCheckUtils]: 65: Hoare triple {11724#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11724#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:57,976 INFO L273 TraceCheckUtils]: 66: Hoare triple {11724#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11724#(<= main_~i~0 16)} is VALID [2018-11-14 18:41:57,976 INFO L273 TraceCheckUtils]: 67: Hoare triple {11724#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11725#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:57,977 INFO L273 TraceCheckUtils]: 68: Hoare triple {11725#(<= main_~i~0 17)} assume true; {11725#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:57,977 INFO L273 TraceCheckUtils]: 69: Hoare triple {11725#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11725#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:57,978 INFO L273 TraceCheckUtils]: 70: Hoare triple {11725#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11725#(<= main_~i~0 17)} is VALID [2018-11-14 18:41:57,979 INFO L273 TraceCheckUtils]: 71: Hoare triple {11725#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11726#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:57,979 INFO L273 TraceCheckUtils]: 72: Hoare triple {11726#(<= main_~i~0 18)} assume true; {11726#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:57,980 INFO L273 TraceCheckUtils]: 73: Hoare triple {11726#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11726#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:57,980 INFO L273 TraceCheckUtils]: 74: Hoare triple {11726#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11726#(<= main_~i~0 18)} is VALID [2018-11-14 18:41:57,981 INFO L273 TraceCheckUtils]: 75: Hoare triple {11726#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11727#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:57,981 INFO L273 TraceCheckUtils]: 76: Hoare triple {11727#(<= main_~i~0 19)} assume true; {11727#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:57,982 INFO L273 TraceCheckUtils]: 77: Hoare triple {11727#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11727#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:57,982 INFO L273 TraceCheckUtils]: 78: Hoare triple {11727#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11727#(<= main_~i~0 19)} is VALID [2018-11-14 18:41:57,983 INFO L273 TraceCheckUtils]: 79: Hoare triple {11727#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11728#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:57,984 INFO L273 TraceCheckUtils]: 80: Hoare triple {11728#(<= main_~i~0 20)} assume true; {11728#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:57,984 INFO L273 TraceCheckUtils]: 81: Hoare triple {11728#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11728#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:57,985 INFO L273 TraceCheckUtils]: 82: Hoare triple {11728#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11728#(<= main_~i~0 20)} is VALID [2018-11-14 18:41:57,985 INFO L273 TraceCheckUtils]: 83: Hoare triple {11728#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11729#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:57,986 INFO L273 TraceCheckUtils]: 84: Hoare triple {11729#(<= main_~i~0 21)} assume true; {11729#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:57,986 INFO L273 TraceCheckUtils]: 85: Hoare triple {11729#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {11729#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:57,987 INFO L273 TraceCheckUtils]: 86: Hoare triple {11729#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11729#(<= main_~i~0 21)} is VALID [2018-11-14 18:41:57,988 INFO L273 TraceCheckUtils]: 87: Hoare triple {11729#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11730#(<= main_~i~0 22)} is VALID [2018-11-14 18:41:57,988 INFO L273 TraceCheckUtils]: 88: Hoare triple {11730#(<= main_~i~0 22)} assume true; {11730#(<= main_~i~0 22)} is VALID [2018-11-14 18:41:57,989 INFO L273 TraceCheckUtils]: 89: Hoare triple {11730#(<= main_~i~0 22)} assume !(~i~0 < 100000); {11709#false} is VALID [2018-11-14 18:41:57,989 INFO L273 TraceCheckUtils]: 90: Hoare triple {11709#false} havoc ~x~0;~x~0 := 0; {11709#false} is VALID [2018-11-14 18:41:57,989 INFO L273 TraceCheckUtils]: 91: Hoare triple {11709#false} assume true; {11709#false} is VALID [2018-11-14 18:41:57,989 INFO L273 TraceCheckUtils]: 92: Hoare triple {11709#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {11709#false} is VALID [2018-11-14 18:41:57,990 INFO L256 TraceCheckUtils]: 93: Hoare triple {11709#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {11709#false} is VALID [2018-11-14 18:41:57,990 INFO L273 TraceCheckUtils]: 94: Hoare triple {11709#false} ~cond := #in~cond; {11709#false} is VALID [2018-11-14 18:41:57,990 INFO L273 TraceCheckUtils]: 95: Hoare triple {11709#false} assume ~cond == 0; {11709#false} is VALID [2018-11-14 18:41:57,990 INFO L273 TraceCheckUtils]: 96: Hoare triple {11709#false} assume !false; {11709#false} is VALID [2018-11-14 18:41:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:58,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:58,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-14 18:41:58,019 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2018-11-14 18:41:58,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:58,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 18:41:58,138 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-14 18:41:58,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 18:41:58,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 18:41:58,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:41:58,140 INFO L87 Difference]: Start difference. First operand 129 states and 174 transitions. Second operand 23 states. [2018-11-14 18:41:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:59,107 INFO L93 Difference]: Finished difference Result 156 states and 209 transitions. [2018-11-14 18:41:59,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 18:41:59,107 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2018-11-14 18:41:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:41:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 209 transitions. [2018-11-14 18:41:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:41:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 209 transitions. [2018-11-14 18:41:59,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 209 transitions. [2018-11-14 18:41:59,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:59,781 INFO L225 Difference]: With dead ends: 156 [2018-11-14 18:41:59,781 INFO L226 Difference]: Without dead ends: 137 [2018-11-14 18:41:59,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:41:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-14 18:41:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-11-14 18:41:59,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:59,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 134 states. [2018-11-14 18:41:59,804 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 134 states. [2018-11-14 18:41:59,804 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 134 states. [2018-11-14 18:41:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:59,807 INFO L93 Difference]: Finished difference Result 137 states and 186 transitions. [2018-11-14 18:41:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2018-11-14 18:41:59,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:59,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:59,808 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 137 states. [2018-11-14 18:41:59,808 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 137 states. [2018-11-14 18:41:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:59,811 INFO L93 Difference]: Finished difference Result 137 states and 186 transitions. [2018-11-14 18:41:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2018-11-14 18:41:59,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:59,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:59,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:59,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 18:41:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 181 transitions. [2018-11-14 18:41:59,814 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 181 transitions. Word has length 97 [2018-11-14 18:41:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:59,814 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 181 transitions. [2018-11-14 18:41:59,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 18:41:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 181 transitions. [2018-11-14 18:41:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-14 18:41:59,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:59,815 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:59,816 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:59,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:59,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1409046054, now seen corresponding path program 21 times [2018-11-14 18:41:59,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:59,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:59,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:59,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:59,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:00,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {12652#true} call ULTIMATE.init(); {12652#true} is VALID [2018-11-14 18:42:00,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {12652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12652#true} is VALID [2018-11-14 18:42:00,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {12652#true} assume true; {12652#true} is VALID [2018-11-14 18:42:00,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12652#true} {12652#true} #91#return; {12652#true} is VALID [2018-11-14 18:42:00,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {12652#true} call #t~ret13 := main(); {12652#true} is VALID [2018-11-14 18:42:00,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {12652#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {12652#true} is VALID [2018-11-14 18:42:00,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {12652#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {12652#true} is VALID [2018-11-14 18:42:00,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {12652#true} ~i~0 := 2; {12654#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:00,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {12654#(<= main_~i~0 2)} assume true; {12654#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:00,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {12654#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12654#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:00,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {12654#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12654#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:00,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {12654#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12655#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:00,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {12655#(<= main_~i~0 3)} assume true; {12655#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:00,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {12655#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12655#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:00,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {12655#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12655#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:00,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {12655#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12656#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:00,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {12656#(<= main_~i~0 4)} assume true; {12656#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:00,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {12656#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12656#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:00,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {12656#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12656#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:00,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {12656#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12657#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:00,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {12657#(<= main_~i~0 5)} assume true; {12657#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:00,306 INFO L273 TraceCheckUtils]: 21: Hoare triple {12657#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12657#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:00,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {12657#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12657#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:00,307 INFO L273 TraceCheckUtils]: 23: Hoare triple {12657#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12658#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:00,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {12658#(<= main_~i~0 6)} assume true; {12658#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:00,308 INFO L273 TraceCheckUtils]: 25: Hoare triple {12658#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12658#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:00,308 INFO L273 TraceCheckUtils]: 26: Hoare triple {12658#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12658#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:00,309 INFO L273 TraceCheckUtils]: 27: Hoare triple {12658#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12659#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:00,310 INFO L273 TraceCheckUtils]: 28: Hoare triple {12659#(<= main_~i~0 7)} assume true; {12659#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:00,310 INFO L273 TraceCheckUtils]: 29: Hoare triple {12659#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12659#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:00,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {12659#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12659#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:00,311 INFO L273 TraceCheckUtils]: 31: Hoare triple {12659#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12660#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:00,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {12660#(<= main_~i~0 8)} assume true; {12660#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:00,312 INFO L273 TraceCheckUtils]: 33: Hoare triple {12660#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12660#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:00,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {12660#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12660#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:00,314 INFO L273 TraceCheckUtils]: 35: Hoare triple {12660#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12661#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:00,314 INFO L273 TraceCheckUtils]: 36: Hoare triple {12661#(<= main_~i~0 9)} assume true; {12661#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:00,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {12661#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12661#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:00,315 INFO L273 TraceCheckUtils]: 38: Hoare triple {12661#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12661#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:00,316 INFO L273 TraceCheckUtils]: 39: Hoare triple {12661#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12662#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:00,316 INFO L273 TraceCheckUtils]: 40: Hoare triple {12662#(<= main_~i~0 10)} assume true; {12662#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:00,317 INFO L273 TraceCheckUtils]: 41: Hoare triple {12662#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12662#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:00,317 INFO L273 TraceCheckUtils]: 42: Hoare triple {12662#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12662#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:00,318 INFO L273 TraceCheckUtils]: 43: Hoare triple {12662#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12663#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:00,319 INFO L273 TraceCheckUtils]: 44: Hoare triple {12663#(<= main_~i~0 11)} assume true; {12663#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:00,319 INFO L273 TraceCheckUtils]: 45: Hoare triple {12663#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12663#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:00,320 INFO L273 TraceCheckUtils]: 46: Hoare triple {12663#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12663#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:00,320 INFO L273 TraceCheckUtils]: 47: Hoare triple {12663#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12664#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:00,321 INFO L273 TraceCheckUtils]: 48: Hoare triple {12664#(<= main_~i~0 12)} assume true; {12664#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:00,322 INFO L273 TraceCheckUtils]: 49: Hoare triple {12664#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12664#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:00,322 INFO L273 TraceCheckUtils]: 50: Hoare triple {12664#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12664#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:00,323 INFO L273 TraceCheckUtils]: 51: Hoare triple {12664#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12665#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:00,323 INFO L273 TraceCheckUtils]: 52: Hoare triple {12665#(<= main_~i~0 13)} assume true; {12665#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:00,324 INFO L273 TraceCheckUtils]: 53: Hoare triple {12665#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12665#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:00,324 INFO L273 TraceCheckUtils]: 54: Hoare triple {12665#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12665#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:00,325 INFO L273 TraceCheckUtils]: 55: Hoare triple {12665#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12666#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:00,326 INFO L273 TraceCheckUtils]: 56: Hoare triple {12666#(<= main_~i~0 14)} assume true; {12666#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:00,326 INFO L273 TraceCheckUtils]: 57: Hoare triple {12666#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12666#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:00,327 INFO L273 TraceCheckUtils]: 58: Hoare triple {12666#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12666#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:00,327 INFO L273 TraceCheckUtils]: 59: Hoare triple {12666#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12667#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:00,328 INFO L273 TraceCheckUtils]: 60: Hoare triple {12667#(<= main_~i~0 15)} assume true; {12667#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:00,328 INFO L273 TraceCheckUtils]: 61: Hoare triple {12667#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12667#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:00,329 INFO L273 TraceCheckUtils]: 62: Hoare triple {12667#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12667#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:00,330 INFO L273 TraceCheckUtils]: 63: Hoare triple {12667#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12668#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:00,330 INFO L273 TraceCheckUtils]: 64: Hoare triple {12668#(<= main_~i~0 16)} assume true; {12668#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:00,331 INFO L273 TraceCheckUtils]: 65: Hoare triple {12668#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12668#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:00,331 INFO L273 TraceCheckUtils]: 66: Hoare triple {12668#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12668#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:00,332 INFO L273 TraceCheckUtils]: 67: Hoare triple {12668#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12669#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:00,332 INFO L273 TraceCheckUtils]: 68: Hoare triple {12669#(<= main_~i~0 17)} assume true; {12669#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:00,333 INFO L273 TraceCheckUtils]: 69: Hoare triple {12669#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12669#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:00,333 INFO L273 TraceCheckUtils]: 70: Hoare triple {12669#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12669#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:00,334 INFO L273 TraceCheckUtils]: 71: Hoare triple {12669#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12670#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:00,335 INFO L273 TraceCheckUtils]: 72: Hoare triple {12670#(<= main_~i~0 18)} assume true; {12670#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:00,335 INFO L273 TraceCheckUtils]: 73: Hoare triple {12670#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12670#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:00,336 INFO L273 TraceCheckUtils]: 74: Hoare triple {12670#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12670#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:00,336 INFO L273 TraceCheckUtils]: 75: Hoare triple {12670#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12671#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:00,337 INFO L273 TraceCheckUtils]: 76: Hoare triple {12671#(<= main_~i~0 19)} assume true; {12671#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:00,337 INFO L273 TraceCheckUtils]: 77: Hoare triple {12671#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12671#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:00,338 INFO L273 TraceCheckUtils]: 78: Hoare triple {12671#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12671#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:00,339 INFO L273 TraceCheckUtils]: 79: Hoare triple {12671#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12672#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:00,339 INFO L273 TraceCheckUtils]: 80: Hoare triple {12672#(<= main_~i~0 20)} assume true; {12672#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:00,340 INFO L273 TraceCheckUtils]: 81: Hoare triple {12672#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12672#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:00,340 INFO L273 TraceCheckUtils]: 82: Hoare triple {12672#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12672#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:00,341 INFO L273 TraceCheckUtils]: 83: Hoare triple {12672#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12673#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:00,341 INFO L273 TraceCheckUtils]: 84: Hoare triple {12673#(<= main_~i~0 21)} assume true; {12673#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:00,342 INFO L273 TraceCheckUtils]: 85: Hoare triple {12673#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12673#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:00,342 INFO L273 TraceCheckUtils]: 86: Hoare triple {12673#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12673#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:00,343 INFO L273 TraceCheckUtils]: 87: Hoare triple {12673#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12674#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:00,344 INFO L273 TraceCheckUtils]: 88: Hoare triple {12674#(<= main_~i~0 22)} assume true; {12674#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:00,344 INFO L273 TraceCheckUtils]: 89: Hoare triple {12674#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12674#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:00,345 INFO L273 TraceCheckUtils]: 90: Hoare triple {12674#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12674#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:00,345 INFO L273 TraceCheckUtils]: 91: Hoare triple {12674#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12675#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:00,346 INFO L273 TraceCheckUtils]: 92: Hoare triple {12675#(<= main_~i~0 23)} assume true; {12675#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:00,347 INFO L273 TraceCheckUtils]: 93: Hoare triple {12675#(<= main_~i~0 23)} assume !(~i~0 < 100000); {12653#false} is VALID [2018-11-14 18:42:00,347 INFO L273 TraceCheckUtils]: 94: Hoare triple {12653#false} havoc ~x~0;~x~0 := 0; {12653#false} is VALID [2018-11-14 18:42:00,347 INFO L273 TraceCheckUtils]: 95: Hoare triple {12653#false} assume true; {12653#false} is VALID [2018-11-14 18:42:00,347 INFO L273 TraceCheckUtils]: 96: Hoare triple {12653#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {12653#false} is VALID [2018-11-14 18:42:00,347 INFO L256 TraceCheckUtils]: 97: Hoare triple {12653#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {12653#false} is VALID [2018-11-14 18:42:00,348 INFO L273 TraceCheckUtils]: 98: Hoare triple {12653#false} ~cond := #in~cond; {12653#false} is VALID [2018-11-14 18:42:00,348 INFO L273 TraceCheckUtils]: 99: Hoare triple {12653#false} assume ~cond == 0; {12653#false} is VALID [2018-11-14 18:42:00,348 INFO L273 TraceCheckUtils]: 100: Hoare triple {12653#false} assume !false; {12653#false} is VALID [2018-11-14 18:42:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:00,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:00,356 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-14 18:42:00,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:42:00,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-14 18:42:00,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:00,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:00,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {12652#true} call ULTIMATE.init(); {12652#true} is VALID [2018-11-14 18:42:00,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {12652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12652#true} is VALID [2018-11-14 18:42:00,659 INFO L273 TraceCheckUtils]: 2: Hoare triple {12652#true} assume true; {12652#true} is VALID [2018-11-14 18:42:00,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12652#true} {12652#true} #91#return; {12652#true} is VALID [2018-11-14 18:42:00,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {12652#true} call #t~ret13 := main(); {12652#true} is VALID [2018-11-14 18:42:00,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {12652#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {12652#true} is VALID [2018-11-14 18:42:00,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {12652#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {12652#true} is VALID [2018-11-14 18:42:00,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {12652#true} ~i~0 := 2; {12654#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:00,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {12654#(<= main_~i~0 2)} assume true; {12654#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:00,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {12654#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12654#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:00,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {12654#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12654#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:00,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {12654#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12655#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:00,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {12655#(<= main_~i~0 3)} assume true; {12655#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:00,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {12655#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12655#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:00,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {12655#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12655#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:00,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {12655#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12656#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:00,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {12656#(<= main_~i~0 4)} assume true; {12656#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:00,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {12656#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12656#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:00,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {12656#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12656#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:00,666 INFO L273 TraceCheckUtils]: 19: Hoare triple {12656#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12657#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:00,667 INFO L273 TraceCheckUtils]: 20: Hoare triple {12657#(<= main_~i~0 5)} assume true; {12657#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:00,667 INFO L273 TraceCheckUtils]: 21: Hoare triple {12657#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12657#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:00,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {12657#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12657#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:00,668 INFO L273 TraceCheckUtils]: 23: Hoare triple {12657#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12658#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:00,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {12658#(<= main_~i~0 6)} assume true; {12658#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:00,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {12658#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12658#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:00,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {12658#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12658#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:00,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {12658#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12659#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:00,671 INFO L273 TraceCheckUtils]: 28: Hoare triple {12659#(<= main_~i~0 7)} assume true; {12659#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:00,672 INFO L273 TraceCheckUtils]: 29: Hoare triple {12659#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12659#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:00,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {12659#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12659#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:00,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {12659#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12660#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:00,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {12660#(<= main_~i~0 8)} assume true; {12660#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:00,674 INFO L273 TraceCheckUtils]: 33: Hoare triple {12660#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12660#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:00,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {12660#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12660#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:00,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {12660#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12661#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:00,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {12661#(<= main_~i~0 9)} assume true; {12661#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:00,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {12661#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12661#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:00,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {12661#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12661#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:00,678 INFO L273 TraceCheckUtils]: 39: Hoare triple {12661#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12662#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:00,678 INFO L273 TraceCheckUtils]: 40: Hoare triple {12662#(<= main_~i~0 10)} assume true; {12662#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:00,679 INFO L273 TraceCheckUtils]: 41: Hoare triple {12662#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12662#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:00,679 INFO L273 TraceCheckUtils]: 42: Hoare triple {12662#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12662#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:00,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {12662#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12663#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:00,680 INFO L273 TraceCheckUtils]: 44: Hoare triple {12663#(<= main_~i~0 11)} assume true; {12663#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:00,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {12663#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12663#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:00,681 INFO L273 TraceCheckUtils]: 46: Hoare triple {12663#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12663#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:00,682 INFO L273 TraceCheckUtils]: 47: Hoare triple {12663#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12664#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:00,683 INFO L273 TraceCheckUtils]: 48: Hoare triple {12664#(<= main_~i~0 12)} assume true; {12664#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:00,683 INFO L273 TraceCheckUtils]: 49: Hoare triple {12664#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12664#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:00,684 INFO L273 TraceCheckUtils]: 50: Hoare triple {12664#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12664#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:00,684 INFO L273 TraceCheckUtils]: 51: Hoare triple {12664#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12665#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:00,685 INFO L273 TraceCheckUtils]: 52: Hoare triple {12665#(<= main_~i~0 13)} assume true; {12665#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:00,685 INFO L273 TraceCheckUtils]: 53: Hoare triple {12665#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12665#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:00,686 INFO L273 TraceCheckUtils]: 54: Hoare triple {12665#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12665#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:00,687 INFO L273 TraceCheckUtils]: 55: Hoare triple {12665#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12666#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:00,687 INFO L273 TraceCheckUtils]: 56: Hoare triple {12666#(<= main_~i~0 14)} assume true; {12666#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:00,688 INFO L273 TraceCheckUtils]: 57: Hoare triple {12666#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12666#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:00,688 INFO L273 TraceCheckUtils]: 58: Hoare triple {12666#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12666#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:00,689 INFO L273 TraceCheckUtils]: 59: Hoare triple {12666#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12667#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:00,689 INFO L273 TraceCheckUtils]: 60: Hoare triple {12667#(<= main_~i~0 15)} assume true; {12667#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:00,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {12667#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12667#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:00,690 INFO L273 TraceCheckUtils]: 62: Hoare triple {12667#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12667#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:00,691 INFO L273 TraceCheckUtils]: 63: Hoare triple {12667#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12668#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:00,692 INFO L273 TraceCheckUtils]: 64: Hoare triple {12668#(<= main_~i~0 16)} assume true; {12668#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:00,692 INFO L273 TraceCheckUtils]: 65: Hoare triple {12668#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12668#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:00,693 INFO L273 TraceCheckUtils]: 66: Hoare triple {12668#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12668#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:00,693 INFO L273 TraceCheckUtils]: 67: Hoare triple {12668#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12669#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:00,694 INFO L273 TraceCheckUtils]: 68: Hoare triple {12669#(<= main_~i~0 17)} assume true; {12669#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:00,694 INFO L273 TraceCheckUtils]: 69: Hoare triple {12669#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12669#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:00,695 INFO L273 TraceCheckUtils]: 70: Hoare triple {12669#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12669#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:00,696 INFO L273 TraceCheckUtils]: 71: Hoare triple {12669#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12670#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:00,696 INFO L273 TraceCheckUtils]: 72: Hoare triple {12670#(<= main_~i~0 18)} assume true; {12670#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:00,697 INFO L273 TraceCheckUtils]: 73: Hoare triple {12670#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12670#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:00,697 INFO L273 TraceCheckUtils]: 74: Hoare triple {12670#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12670#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:00,698 INFO L273 TraceCheckUtils]: 75: Hoare triple {12670#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12671#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:00,698 INFO L273 TraceCheckUtils]: 76: Hoare triple {12671#(<= main_~i~0 19)} assume true; {12671#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:00,699 INFO L273 TraceCheckUtils]: 77: Hoare triple {12671#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12671#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:00,700 INFO L273 TraceCheckUtils]: 78: Hoare triple {12671#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12671#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:00,700 INFO L273 TraceCheckUtils]: 79: Hoare triple {12671#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12672#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:00,701 INFO L273 TraceCheckUtils]: 80: Hoare triple {12672#(<= main_~i~0 20)} assume true; {12672#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:00,701 INFO L273 TraceCheckUtils]: 81: Hoare triple {12672#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12672#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:00,702 INFO L273 TraceCheckUtils]: 82: Hoare triple {12672#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12672#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:00,703 INFO L273 TraceCheckUtils]: 83: Hoare triple {12672#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12673#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:00,703 INFO L273 TraceCheckUtils]: 84: Hoare triple {12673#(<= main_~i~0 21)} assume true; {12673#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:00,704 INFO L273 TraceCheckUtils]: 85: Hoare triple {12673#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12673#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:00,704 INFO L273 TraceCheckUtils]: 86: Hoare triple {12673#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12673#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:00,705 INFO L273 TraceCheckUtils]: 87: Hoare triple {12673#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12674#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:00,705 INFO L273 TraceCheckUtils]: 88: Hoare triple {12674#(<= main_~i~0 22)} assume true; {12674#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:00,706 INFO L273 TraceCheckUtils]: 89: Hoare triple {12674#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {12674#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:00,706 INFO L273 TraceCheckUtils]: 90: Hoare triple {12674#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12674#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:00,707 INFO L273 TraceCheckUtils]: 91: Hoare triple {12674#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12675#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:00,708 INFO L273 TraceCheckUtils]: 92: Hoare triple {12675#(<= main_~i~0 23)} assume true; {12675#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:00,708 INFO L273 TraceCheckUtils]: 93: Hoare triple {12675#(<= main_~i~0 23)} assume !(~i~0 < 100000); {12653#false} is VALID [2018-11-14 18:42:00,708 INFO L273 TraceCheckUtils]: 94: Hoare triple {12653#false} havoc ~x~0;~x~0 := 0; {12653#false} is VALID [2018-11-14 18:42:00,709 INFO L273 TraceCheckUtils]: 95: Hoare triple {12653#false} assume true; {12653#false} is VALID [2018-11-14 18:42:00,709 INFO L273 TraceCheckUtils]: 96: Hoare triple {12653#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {12653#false} is VALID [2018-11-14 18:42:00,709 INFO L256 TraceCheckUtils]: 97: Hoare triple {12653#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {12653#false} is VALID [2018-11-14 18:42:00,709 INFO L273 TraceCheckUtils]: 98: Hoare triple {12653#false} ~cond := #in~cond; {12653#false} is VALID [2018-11-14 18:42:00,709 INFO L273 TraceCheckUtils]: 99: Hoare triple {12653#false} assume ~cond == 0; {12653#false} is VALID [2018-11-14 18:42:00,710 INFO L273 TraceCheckUtils]: 100: Hoare triple {12653#false} assume !false; {12653#false} is VALID [2018-11-14 18:42:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:00,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:00,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-11-14 18:42:00,737 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-11-14 18:42:00,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:00,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:42:00,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:00,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:42:00,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:42:00,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:42:00,829 INFO L87 Difference]: Start difference. First operand 134 states and 181 transitions. Second operand 24 states. [2018-11-14 18:42:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:01,347 INFO L93 Difference]: Finished difference Result 161 states and 216 transitions. [2018-11-14 18:42:01,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 18:42:01,348 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-11-14 18:42:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:42:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 216 transitions. [2018-11-14 18:42:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:42:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 216 transitions. [2018-11-14 18:42:01,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 216 transitions. [2018-11-14 18:42:01,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:01,543 INFO L225 Difference]: With dead ends: 161 [2018-11-14 18:42:01,544 INFO L226 Difference]: Without dead ends: 142 [2018-11-14 18:42:01,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:42:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-14 18:42:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2018-11-14 18:42:01,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:01,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 139 states. [2018-11-14 18:42:01,600 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 139 states. [2018-11-14 18:42:01,600 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 139 states. [2018-11-14 18:42:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:01,602 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2018-11-14 18:42:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 193 transitions. [2018-11-14 18:42:01,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:01,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:01,603 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 142 states. [2018-11-14 18:42:01,604 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 142 states. [2018-11-14 18:42:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:01,606 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2018-11-14 18:42:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 193 transitions. [2018-11-14 18:42:01,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:01,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:01,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:01,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-14 18:42:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2018-11-14 18:42:01,610 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 101 [2018-11-14 18:42:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:01,610 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2018-11-14 18:42:01,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:42:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2018-11-14 18:42:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-14 18:42:01,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:01,611 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:01,612 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:01,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:01,612 INFO L82 PathProgramCache]: Analyzing trace with hash -858890216, now seen corresponding path program 22 times [2018-11-14 18:42:01,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:01,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:01,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:01,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:01,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:02,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {13631#true} call ULTIMATE.init(); {13631#true} is VALID [2018-11-14 18:42:02,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {13631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13631#true} is VALID [2018-11-14 18:42:02,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {13631#true} assume true; {13631#true} is VALID [2018-11-14 18:42:02,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13631#true} {13631#true} #91#return; {13631#true} is VALID [2018-11-14 18:42:02,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {13631#true} call #t~ret13 := main(); {13631#true} is VALID [2018-11-14 18:42:02,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {13631#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {13631#true} is VALID [2018-11-14 18:42:02,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {13631#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {13631#true} is VALID [2018-11-14 18:42:02,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {13631#true} ~i~0 := 2; {13633#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:02,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {13633#(<= main_~i~0 2)} assume true; {13633#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:02,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {13633#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13633#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:02,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {13633#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13633#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:02,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {13633#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13634#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:02,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {13634#(<= main_~i~0 3)} assume true; {13634#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:02,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {13634#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13634#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:02,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {13634#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13634#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:02,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {13634#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13635#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:02,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {13635#(<= main_~i~0 4)} assume true; {13635#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:02,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {13635#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13635#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:02,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {13635#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13635#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:02,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {13635#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13636#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:02,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {13636#(<= main_~i~0 5)} assume true; {13636#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:02,093 INFO L273 TraceCheckUtils]: 21: Hoare triple {13636#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13636#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:02,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {13636#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13636#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:02,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {13636#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13637#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:02,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {13637#(<= main_~i~0 6)} assume true; {13637#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:02,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {13637#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13637#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:02,096 INFO L273 TraceCheckUtils]: 26: Hoare triple {13637#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13637#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:02,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {13637#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13638#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:02,097 INFO L273 TraceCheckUtils]: 28: Hoare triple {13638#(<= main_~i~0 7)} assume true; {13638#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:02,098 INFO L273 TraceCheckUtils]: 29: Hoare triple {13638#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13638#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:02,098 INFO L273 TraceCheckUtils]: 30: Hoare triple {13638#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13638#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:02,099 INFO L273 TraceCheckUtils]: 31: Hoare triple {13638#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13639#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:02,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {13639#(<= main_~i~0 8)} assume true; {13639#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:02,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {13639#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13639#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:02,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {13639#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13639#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:02,101 INFO L273 TraceCheckUtils]: 35: Hoare triple {13639#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13640#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:02,102 INFO L273 TraceCheckUtils]: 36: Hoare triple {13640#(<= main_~i~0 9)} assume true; {13640#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:02,102 INFO L273 TraceCheckUtils]: 37: Hoare triple {13640#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13640#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:02,103 INFO L273 TraceCheckUtils]: 38: Hoare triple {13640#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13640#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:02,110 INFO L273 TraceCheckUtils]: 39: Hoare triple {13640#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13641#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:02,110 INFO L273 TraceCheckUtils]: 40: Hoare triple {13641#(<= main_~i~0 10)} assume true; {13641#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:02,111 INFO L273 TraceCheckUtils]: 41: Hoare triple {13641#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13641#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:02,111 INFO L273 TraceCheckUtils]: 42: Hoare triple {13641#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13641#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:02,112 INFO L273 TraceCheckUtils]: 43: Hoare triple {13641#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13642#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:02,112 INFO L273 TraceCheckUtils]: 44: Hoare triple {13642#(<= main_~i~0 11)} assume true; {13642#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:02,112 INFO L273 TraceCheckUtils]: 45: Hoare triple {13642#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13642#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:02,112 INFO L273 TraceCheckUtils]: 46: Hoare triple {13642#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13642#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:02,113 INFO L273 TraceCheckUtils]: 47: Hoare triple {13642#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13643#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:02,113 INFO L273 TraceCheckUtils]: 48: Hoare triple {13643#(<= main_~i~0 12)} assume true; {13643#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:02,114 INFO L273 TraceCheckUtils]: 49: Hoare triple {13643#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13643#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:02,114 INFO L273 TraceCheckUtils]: 50: Hoare triple {13643#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13643#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:02,114 INFO L273 TraceCheckUtils]: 51: Hoare triple {13643#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13644#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:02,115 INFO L273 TraceCheckUtils]: 52: Hoare triple {13644#(<= main_~i~0 13)} assume true; {13644#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:02,115 INFO L273 TraceCheckUtils]: 53: Hoare triple {13644#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13644#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:02,116 INFO L273 TraceCheckUtils]: 54: Hoare triple {13644#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13644#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:02,116 INFO L273 TraceCheckUtils]: 55: Hoare triple {13644#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13645#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:02,117 INFO L273 TraceCheckUtils]: 56: Hoare triple {13645#(<= main_~i~0 14)} assume true; {13645#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:02,117 INFO L273 TraceCheckUtils]: 57: Hoare triple {13645#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13645#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:02,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {13645#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13645#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:02,119 INFO L273 TraceCheckUtils]: 59: Hoare triple {13645#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13646#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:02,119 INFO L273 TraceCheckUtils]: 60: Hoare triple {13646#(<= main_~i~0 15)} assume true; {13646#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:02,120 INFO L273 TraceCheckUtils]: 61: Hoare triple {13646#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13646#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:02,120 INFO L273 TraceCheckUtils]: 62: Hoare triple {13646#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13646#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:02,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {13646#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13647#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:02,122 INFO L273 TraceCheckUtils]: 64: Hoare triple {13647#(<= main_~i~0 16)} assume true; {13647#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:02,122 INFO L273 TraceCheckUtils]: 65: Hoare triple {13647#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13647#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:02,123 INFO L273 TraceCheckUtils]: 66: Hoare triple {13647#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13647#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:02,123 INFO L273 TraceCheckUtils]: 67: Hoare triple {13647#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13648#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:02,124 INFO L273 TraceCheckUtils]: 68: Hoare triple {13648#(<= main_~i~0 17)} assume true; {13648#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:02,124 INFO L273 TraceCheckUtils]: 69: Hoare triple {13648#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13648#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:02,125 INFO L273 TraceCheckUtils]: 70: Hoare triple {13648#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13648#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:02,146 INFO L273 TraceCheckUtils]: 71: Hoare triple {13648#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13649#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:02,153 INFO L273 TraceCheckUtils]: 72: Hoare triple {13649#(<= main_~i~0 18)} assume true; {13649#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:02,153 INFO L273 TraceCheckUtils]: 73: Hoare triple {13649#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13649#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:02,153 INFO L273 TraceCheckUtils]: 74: Hoare triple {13649#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13649#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:02,154 INFO L273 TraceCheckUtils]: 75: Hoare triple {13649#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13650#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:02,154 INFO L273 TraceCheckUtils]: 76: Hoare triple {13650#(<= main_~i~0 19)} assume true; {13650#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:02,154 INFO L273 TraceCheckUtils]: 77: Hoare triple {13650#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13650#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:02,155 INFO L273 TraceCheckUtils]: 78: Hoare triple {13650#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13650#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:02,155 INFO L273 TraceCheckUtils]: 79: Hoare triple {13650#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13651#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:02,155 INFO L273 TraceCheckUtils]: 80: Hoare triple {13651#(<= main_~i~0 20)} assume true; {13651#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:02,156 INFO L273 TraceCheckUtils]: 81: Hoare triple {13651#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13651#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:02,156 INFO L273 TraceCheckUtils]: 82: Hoare triple {13651#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13651#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:02,156 INFO L273 TraceCheckUtils]: 83: Hoare triple {13651#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13652#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:02,157 INFO L273 TraceCheckUtils]: 84: Hoare triple {13652#(<= main_~i~0 21)} assume true; {13652#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:02,158 INFO L273 TraceCheckUtils]: 85: Hoare triple {13652#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13652#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:02,158 INFO L273 TraceCheckUtils]: 86: Hoare triple {13652#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13652#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:02,159 INFO L273 TraceCheckUtils]: 87: Hoare triple {13652#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13653#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:02,159 INFO L273 TraceCheckUtils]: 88: Hoare triple {13653#(<= main_~i~0 22)} assume true; {13653#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:02,160 INFO L273 TraceCheckUtils]: 89: Hoare triple {13653#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13653#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:02,160 INFO L273 TraceCheckUtils]: 90: Hoare triple {13653#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13653#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:02,161 INFO L273 TraceCheckUtils]: 91: Hoare triple {13653#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13654#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:02,162 INFO L273 TraceCheckUtils]: 92: Hoare triple {13654#(<= main_~i~0 23)} assume true; {13654#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:02,164 INFO L273 TraceCheckUtils]: 93: Hoare triple {13654#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13654#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:02,165 INFO L273 TraceCheckUtils]: 94: Hoare triple {13654#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13654#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:02,166 INFO L273 TraceCheckUtils]: 95: Hoare triple {13654#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13655#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:02,166 INFO L273 TraceCheckUtils]: 96: Hoare triple {13655#(<= main_~i~0 24)} assume true; {13655#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:02,167 INFO L273 TraceCheckUtils]: 97: Hoare triple {13655#(<= main_~i~0 24)} assume !(~i~0 < 100000); {13632#false} is VALID [2018-11-14 18:42:02,167 INFO L273 TraceCheckUtils]: 98: Hoare triple {13632#false} havoc ~x~0;~x~0 := 0; {13632#false} is VALID [2018-11-14 18:42:02,167 INFO L273 TraceCheckUtils]: 99: Hoare triple {13632#false} assume true; {13632#false} is VALID [2018-11-14 18:42:02,167 INFO L273 TraceCheckUtils]: 100: Hoare triple {13632#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {13632#false} is VALID [2018-11-14 18:42:02,167 INFO L256 TraceCheckUtils]: 101: Hoare triple {13632#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {13632#false} is VALID [2018-11-14 18:42:02,167 INFO L273 TraceCheckUtils]: 102: Hoare triple {13632#false} ~cond := #in~cond; {13632#false} is VALID [2018-11-14 18:42:02,167 INFO L273 TraceCheckUtils]: 103: Hoare triple {13632#false} assume ~cond == 0; {13632#false} is VALID [2018-11-14 18:42:02,167 INFO L273 TraceCheckUtils]: 104: Hoare triple {13632#false} assume !false; {13632#false} is VALID [2018-11-14 18:42:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:02,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:02,175 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-14 18:42:02,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:42:02,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:42:02,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:02,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:02,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {13631#true} call ULTIMATE.init(); {13631#true} is VALID [2018-11-14 18:42:02,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {13631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13631#true} is VALID [2018-11-14 18:42:02,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {13631#true} assume true; {13631#true} is VALID [2018-11-14 18:42:02,699 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13631#true} {13631#true} #91#return; {13631#true} is VALID [2018-11-14 18:42:02,699 INFO L256 TraceCheckUtils]: 4: Hoare triple {13631#true} call #t~ret13 := main(); {13631#true} is VALID [2018-11-14 18:42:02,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {13631#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {13631#true} is VALID [2018-11-14 18:42:02,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {13631#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {13631#true} is VALID [2018-11-14 18:42:02,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {13631#true} ~i~0 := 2; {13633#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:02,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {13633#(<= main_~i~0 2)} assume true; {13633#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:02,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {13633#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13633#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:02,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {13633#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13633#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:02,704 INFO L273 TraceCheckUtils]: 11: Hoare triple {13633#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13634#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:02,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {13634#(<= main_~i~0 3)} assume true; {13634#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:02,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {13634#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13634#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:02,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {13634#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13634#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:02,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {13634#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13635#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:02,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {13635#(<= main_~i~0 4)} assume true; {13635#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:02,710 INFO L273 TraceCheckUtils]: 17: Hoare triple {13635#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13635#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:02,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {13635#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13635#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:02,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {13635#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13636#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:02,715 INFO L273 TraceCheckUtils]: 20: Hoare triple {13636#(<= main_~i~0 5)} assume true; {13636#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:02,715 INFO L273 TraceCheckUtils]: 21: Hoare triple {13636#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13636#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:02,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {13636#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13636#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:02,717 INFO L273 TraceCheckUtils]: 23: Hoare triple {13636#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13637#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:02,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {13637#(<= main_~i~0 6)} assume true; {13637#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:02,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {13637#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13637#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:02,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {13637#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13637#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:02,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {13637#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13638#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:02,724 INFO L273 TraceCheckUtils]: 28: Hoare triple {13638#(<= main_~i~0 7)} assume true; {13638#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:02,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {13638#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13638#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:02,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {13638#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13638#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:02,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {13638#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13639#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:02,730 INFO L273 TraceCheckUtils]: 32: Hoare triple {13639#(<= main_~i~0 8)} assume true; {13639#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:02,730 INFO L273 TraceCheckUtils]: 33: Hoare triple {13639#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13639#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:02,732 INFO L273 TraceCheckUtils]: 34: Hoare triple {13639#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13639#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:02,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {13639#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13640#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:02,734 INFO L273 TraceCheckUtils]: 36: Hoare triple {13640#(<= main_~i~0 9)} assume true; {13640#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:02,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {13640#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13640#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:02,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {13640#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13640#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:02,736 INFO L273 TraceCheckUtils]: 39: Hoare triple {13640#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13641#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:02,738 INFO L273 TraceCheckUtils]: 40: Hoare triple {13641#(<= main_~i~0 10)} assume true; {13641#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:02,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {13641#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13641#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:02,741 INFO L273 TraceCheckUtils]: 42: Hoare triple {13641#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13641#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:02,741 INFO L273 TraceCheckUtils]: 43: Hoare triple {13641#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13642#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:02,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {13642#(<= main_~i~0 11)} assume true; {13642#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:02,744 INFO L273 TraceCheckUtils]: 45: Hoare triple {13642#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13642#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:02,746 INFO L273 TraceCheckUtils]: 46: Hoare triple {13642#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13642#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:02,746 INFO L273 TraceCheckUtils]: 47: Hoare triple {13642#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13643#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:02,749 INFO L273 TraceCheckUtils]: 48: Hoare triple {13643#(<= main_~i~0 12)} assume true; {13643#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:02,749 INFO L273 TraceCheckUtils]: 49: Hoare triple {13643#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13643#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:02,751 INFO L273 TraceCheckUtils]: 50: Hoare triple {13643#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13643#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:02,751 INFO L273 TraceCheckUtils]: 51: Hoare triple {13643#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13644#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:02,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {13644#(<= main_~i~0 13)} assume true; {13644#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:02,757 INFO L273 TraceCheckUtils]: 53: Hoare triple {13644#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13644#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:02,759 INFO L273 TraceCheckUtils]: 54: Hoare triple {13644#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13644#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:02,759 INFO L273 TraceCheckUtils]: 55: Hoare triple {13644#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13645#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:02,761 INFO L273 TraceCheckUtils]: 56: Hoare triple {13645#(<= main_~i~0 14)} assume true; {13645#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:02,761 INFO L273 TraceCheckUtils]: 57: Hoare triple {13645#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13645#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:02,764 INFO L273 TraceCheckUtils]: 58: Hoare triple {13645#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13645#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:02,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {13645#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13646#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:02,766 INFO L273 TraceCheckUtils]: 60: Hoare triple {13646#(<= main_~i~0 15)} assume true; {13646#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:02,766 INFO L273 TraceCheckUtils]: 61: Hoare triple {13646#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13646#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:02,768 INFO L273 TraceCheckUtils]: 62: Hoare triple {13646#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13646#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:02,768 INFO L273 TraceCheckUtils]: 63: Hoare triple {13646#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13647#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:02,771 INFO L273 TraceCheckUtils]: 64: Hoare triple {13647#(<= main_~i~0 16)} assume true; {13647#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:02,771 INFO L273 TraceCheckUtils]: 65: Hoare triple {13647#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13647#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:02,773 INFO L273 TraceCheckUtils]: 66: Hoare triple {13647#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13647#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:02,773 INFO L273 TraceCheckUtils]: 67: Hoare triple {13647#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13648#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:02,776 INFO L273 TraceCheckUtils]: 68: Hoare triple {13648#(<= main_~i~0 17)} assume true; {13648#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:02,776 INFO L273 TraceCheckUtils]: 69: Hoare triple {13648#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13648#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:02,779 INFO L273 TraceCheckUtils]: 70: Hoare triple {13648#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13648#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:02,779 INFO L273 TraceCheckUtils]: 71: Hoare triple {13648#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13649#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:02,781 INFO L273 TraceCheckUtils]: 72: Hoare triple {13649#(<= main_~i~0 18)} assume true; {13649#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:02,781 INFO L273 TraceCheckUtils]: 73: Hoare triple {13649#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13649#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:02,783 INFO L273 TraceCheckUtils]: 74: Hoare triple {13649#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13649#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:02,783 INFO L273 TraceCheckUtils]: 75: Hoare triple {13649#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13650#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:02,786 INFO L273 TraceCheckUtils]: 76: Hoare triple {13650#(<= main_~i~0 19)} assume true; {13650#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:02,786 INFO L273 TraceCheckUtils]: 77: Hoare triple {13650#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13650#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:02,788 INFO L273 TraceCheckUtils]: 78: Hoare triple {13650#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13650#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:02,788 INFO L273 TraceCheckUtils]: 79: Hoare triple {13650#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13651#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:02,791 INFO L273 TraceCheckUtils]: 80: Hoare triple {13651#(<= main_~i~0 20)} assume true; {13651#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:02,791 INFO L273 TraceCheckUtils]: 81: Hoare triple {13651#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13651#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:02,794 INFO L273 TraceCheckUtils]: 82: Hoare triple {13651#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13651#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:02,794 INFO L273 TraceCheckUtils]: 83: Hoare triple {13651#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13652#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:02,797 INFO L273 TraceCheckUtils]: 84: Hoare triple {13652#(<= main_~i~0 21)} assume true; {13652#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:02,797 INFO L273 TraceCheckUtils]: 85: Hoare triple {13652#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13652#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:02,799 INFO L273 TraceCheckUtils]: 86: Hoare triple {13652#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13652#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:02,799 INFO L273 TraceCheckUtils]: 87: Hoare triple {13652#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13653#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:02,802 INFO L273 TraceCheckUtils]: 88: Hoare triple {13653#(<= main_~i~0 22)} assume true; {13653#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:02,802 INFO L273 TraceCheckUtils]: 89: Hoare triple {13653#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13653#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:02,805 INFO L273 TraceCheckUtils]: 90: Hoare triple {13653#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13653#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:02,805 INFO L273 TraceCheckUtils]: 91: Hoare triple {13653#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13654#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:02,807 INFO L273 TraceCheckUtils]: 92: Hoare triple {13654#(<= main_~i~0 23)} assume true; {13654#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:02,807 INFO L273 TraceCheckUtils]: 93: Hoare triple {13654#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {13654#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:02,809 INFO L273 TraceCheckUtils]: 94: Hoare triple {13654#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13654#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:02,809 INFO L273 TraceCheckUtils]: 95: Hoare triple {13654#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13655#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:02,812 INFO L273 TraceCheckUtils]: 96: Hoare triple {13655#(<= main_~i~0 24)} assume true; {13655#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:02,812 INFO L273 TraceCheckUtils]: 97: Hoare triple {13655#(<= main_~i~0 24)} assume !(~i~0 < 100000); {13632#false} is VALID [2018-11-14 18:42:02,812 INFO L273 TraceCheckUtils]: 98: Hoare triple {13632#false} havoc ~x~0;~x~0 := 0; {13632#false} is VALID [2018-11-14 18:42:02,812 INFO L273 TraceCheckUtils]: 99: Hoare triple {13632#false} assume true; {13632#false} is VALID [2018-11-14 18:42:02,812 INFO L273 TraceCheckUtils]: 100: Hoare triple {13632#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {13632#false} is VALID [2018-11-14 18:42:02,812 INFO L256 TraceCheckUtils]: 101: Hoare triple {13632#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {13632#false} is VALID [2018-11-14 18:42:02,813 INFO L273 TraceCheckUtils]: 102: Hoare triple {13632#false} ~cond := #in~cond; {13632#false} is VALID [2018-11-14 18:42:02,813 INFO L273 TraceCheckUtils]: 103: Hoare triple {13632#false} assume ~cond == 0; {13632#false} is VALID [2018-11-14 18:42:02,813 INFO L273 TraceCheckUtils]: 104: Hoare triple {13632#false} assume !false; {13632#false} is VALID [2018-11-14 18:42:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:02,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:02,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-11-14 18:42:02,841 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2018-11-14 18:42:02,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:02,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 18:42:02,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:02,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 18:42:02,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 18:42:02,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:42:02,947 INFO L87 Difference]: Start difference. First operand 139 states and 188 transitions. Second operand 25 states. [2018-11-14 18:42:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:03,809 INFO L93 Difference]: Finished difference Result 166 states and 223 transitions. [2018-11-14 18:42:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 18:42:03,809 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2018-11-14 18:42:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:42:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 223 transitions. [2018-11-14 18:42:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:42:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 223 transitions. [2018-11-14 18:42:03,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 223 transitions. [2018-11-14 18:42:04,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:04,017 INFO L225 Difference]: With dead ends: 166 [2018-11-14 18:42:04,017 INFO L226 Difference]: Without dead ends: 147 [2018-11-14 18:42:04,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 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-14 18:42:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-14 18:42:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2018-11-14 18:42:04,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:04,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 144 states. [2018-11-14 18:42:04,040 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 144 states. [2018-11-14 18:42:04,040 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 144 states. [2018-11-14 18:42:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:04,043 INFO L93 Difference]: Finished difference Result 147 states and 200 transitions. [2018-11-14 18:42:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2018-11-14 18:42:04,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:04,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:04,043 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 147 states. [2018-11-14 18:42:04,043 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 147 states. [2018-11-14 18:42:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:04,045 INFO L93 Difference]: Finished difference Result 147 states and 200 transitions. [2018-11-14 18:42:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2018-11-14 18:42:04,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:04,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:04,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:04,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-14 18:42:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 195 transitions. [2018-11-14 18:42:04,048 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 195 transitions. Word has length 105 [2018-11-14 18:42:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:04,048 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 195 transitions. [2018-11-14 18:42:04,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 18:42:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2018-11-14 18:42:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 18:42:04,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:04,049 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:04,050 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:04,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash 415637770, now seen corresponding path program 23 times [2018-11-14 18:42:04,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:04,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:04,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:04,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:04,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:04,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {14645#true} call ULTIMATE.init(); {14645#true} is VALID [2018-11-14 18:42:04,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {14645#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14645#true} is VALID [2018-11-14 18:42:04,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {14645#true} assume true; {14645#true} is VALID [2018-11-14 18:42:04,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14645#true} {14645#true} #91#return; {14645#true} is VALID [2018-11-14 18:42:04,587 INFO L256 TraceCheckUtils]: 4: Hoare triple {14645#true} call #t~ret13 := main(); {14645#true} is VALID [2018-11-14 18:42:04,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {14645#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {14645#true} is VALID [2018-11-14 18:42:04,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {14645#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {14645#true} is VALID [2018-11-14 18:42:04,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {14645#true} ~i~0 := 2; {14647#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:04,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {14647#(<= main_~i~0 2)} assume true; {14647#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:04,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {14647#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14647#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:04,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {14647#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14647#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:04,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {14647#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14648#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:04,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {14648#(<= main_~i~0 3)} assume true; {14648#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:04,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {14648#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14648#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:04,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {14648#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14648#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:04,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {14648#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14649#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:04,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {14649#(<= main_~i~0 4)} assume true; {14649#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:04,591 INFO L273 TraceCheckUtils]: 17: Hoare triple {14649#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14649#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:04,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {14649#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14649#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:04,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {14649#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14650#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:04,593 INFO L273 TraceCheckUtils]: 20: Hoare triple {14650#(<= main_~i~0 5)} assume true; {14650#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:04,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {14650#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14650#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:04,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {14650#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14650#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:04,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {14650#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14651#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:04,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {14651#(<= main_~i~0 6)} assume true; {14651#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:04,596 INFO L273 TraceCheckUtils]: 25: Hoare triple {14651#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14651#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:04,596 INFO L273 TraceCheckUtils]: 26: Hoare triple {14651#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14651#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:04,597 INFO L273 TraceCheckUtils]: 27: Hoare triple {14651#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14652#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:04,598 INFO L273 TraceCheckUtils]: 28: Hoare triple {14652#(<= main_~i~0 7)} assume true; {14652#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:04,598 INFO L273 TraceCheckUtils]: 29: Hoare triple {14652#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14652#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:04,599 INFO L273 TraceCheckUtils]: 30: Hoare triple {14652#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14652#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:04,599 INFO L273 TraceCheckUtils]: 31: Hoare triple {14652#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14653#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:04,600 INFO L273 TraceCheckUtils]: 32: Hoare triple {14653#(<= main_~i~0 8)} assume true; {14653#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:04,600 INFO L273 TraceCheckUtils]: 33: Hoare triple {14653#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14653#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:04,601 INFO L273 TraceCheckUtils]: 34: Hoare triple {14653#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14653#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:04,602 INFO L273 TraceCheckUtils]: 35: Hoare triple {14653#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14654#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:04,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {14654#(<= main_~i~0 9)} assume true; {14654#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:04,603 INFO L273 TraceCheckUtils]: 37: Hoare triple {14654#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14654#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:04,603 INFO L273 TraceCheckUtils]: 38: Hoare triple {14654#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14654#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:04,604 INFO L273 TraceCheckUtils]: 39: Hoare triple {14654#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14655#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:04,604 INFO L273 TraceCheckUtils]: 40: Hoare triple {14655#(<= main_~i~0 10)} assume true; {14655#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:04,605 INFO L273 TraceCheckUtils]: 41: Hoare triple {14655#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14655#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:04,605 INFO L273 TraceCheckUtils]: 42: Hoare triple {14655#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14655#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:04,606 INFO L273 TraceCheckUtils]: 43: Hoare triple {14655#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14656#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:04,607 INFO L273 TraceCheckUtils]: 44: Hoare triple {14656#(<= main_~i~0 11)} assume true; {14656#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:04,607 INFO L273 TraceCheckUtils]: 45: Hoare triple {14656#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14656#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:04,608 INFO L273 TraceCheckUtils]: 46: Hoare triple {14656#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14656#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:04,608 INFO L273 TraceCheckUtils]: 47: Hoare triple {14656#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14657#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:04,609 INFO L273 TraceCheckUtils]: 48: Hoare triple {14657#(<= main_~i~0 12)} assume true; {14657#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:04,609 INFO L273 TraceCheckUtils]: 49: Hoare triple {14657#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14657#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:04,610 INFO L273 TraceCheckUtils]: 50: Hoare triple {14657#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14657#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:04,611 INFO L273 TraceCheckUtils]: 51: Hoare triple {14657#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14658#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:04,611 INFO L273 TraceCheckUtils]: 52: Hoare triple {14658#(<= main_~i~0 13)} assume true; {14658#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:04,612 INFO L273 TraceCheckUtils]: 53: Hoare triple {14658#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14658#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:04,612 INFO L273 TraceCheckUtils]: 54: Hoare triple {14658#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14658#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:04,613 INFO L273 TraceCheckUtils]: 55: Hoare triple {14658#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14659#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:04,613 INFO L273 TraceCheckUtils]: 56: Hoare triple {14659#(<= main_~i~0 14)} assume true; {14659#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:04,614 INFO L273 TraceCheckUtils]: 57: Hoare triple {14659#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14659#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:04,614 INFO L273 TraceCheckUtils]: 58: Hoare triple {14659#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14659#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:04,615 INFO L273 TraceCheckUtils]: 59: Hoare triple {14659#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14660#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:04,616 INFO L273 TraceCheckUtils]: 60: Hoare triple {14660#(<= main_~i~0 15)} assume true; {14660#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:04,616 INFO L273 TraceCheckUtils]: 61: Hoare triple {14660#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14660#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:04,617 INFO L273 TraceCheckUtils]: 62: Hoare triple {14660#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14660#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:04,617 INFO L273 TraceCheckUtils]: 63: Hoare triple {14660#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14661#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:04,618 INFO L273 TraceCheckUtils]: 64: Hoare triple {14661#(<= main_~i~0 16)} assume true; {14661#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:04,619 INFO L273 TraceCheckUtils]: 65: Hoare triple {14661#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14661#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:04,619 INFO L273 TraceCheckUtils]: 66: Hoare triple {14661#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14661#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:04,620 INFO L273 TraceCheckUtils]: 67: Hoare triple {14661#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14662#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:04,620 INFO L273 TraceCheckUtils]: 68: Hoare triple {14662#(<= main_~i~0 17)} assume true; {14662#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:04,621 INFO L273 TraceCheckUtils]: 69: Hoare triple {14662#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14662#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:04,621 INFO L273 TraceCheckUtils]: 70: Hoare triple {14662#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14662#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:04,622 INFO L273 TraceCheckUtils]: 71: Hoare triple {14662#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14663#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:04,623 INFO L273 TraceCheckUtils]: 72: Hoare triple {14663#(<= main_~i~0 18)} assume true; {14663#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:04,623 INFO L273 TraceCheckUtils]: 73: Hoare triple {14663#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14663#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:04,624 INFO L273 TraceCheckUtils]: 74: Hoare triple {14663#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14663#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:04,624 INFO L273 TraceCheckUtils]: 75: Hoare triple {14663#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14664#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:04,625 INFO L273 TraceCheckUtils]: 76: Hoare triple {14664#(<= main_~i~0 19)} assume true; {14664#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:04,625 INFO L273 TraceCheckUtils]: 77: Hoare triple {14664#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14664#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:04,626 INFO L273 TraceCheckUtils]: 78: Hoare triple {14664#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14664#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:04,627 INFO L273 TraceCheckUtils]: 79: Hoare triple {14664#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14665#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:04,627 INFO L273 TraceCheckUtils]: 80: Hoare triple {14665#(<= main_~i~0 20)} assume true; {14665#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:04,628 INFO L273 TraceCheckUtils]: 81: Hoare triple {14665#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14665#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:04,628 INFO L273 TraceCheckUtils]: 82: Hoare triple {14665#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14665#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:04,629 INFO L273 TraceCheckUtils]: 83: Hoare triple {14665#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14666#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:04,629 INFO L273 TraceCheckUtils]: 84: Hoare triple {14666#(<= main_~i~0 21)} assume true; {14666#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:04,630 INFO L273 TraceCheckUtils]: 85: Hoare triple {14666#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14666#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:04,630 INFO L273 TraceCheckUtils]: 86: Hoare triple {14666#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14666#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:04,631 INFO L273 TraceCheckUtils]: 87: Hoare triple {14666#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14667#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:04,632 INFO L273 TraceCheckUtils]: 88: Hoare triple {14667#(<= main_~i~0 22)} assume true; {14667#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:04,632 INFO L273 TraceCheckUtils]: 89: Hoare triple {14667#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14667#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:04,633 INFO L273 TraceCheckUtils]: 90: Hoare triple {14667#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14667#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:04,633 INFO L273 TraceCheckUtils]: 91: Hoare triple {14667#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14668#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:04,634 INFO L273 TraceCheckUtils]: 92: Hoare triple {14668#(<= main_~i~0 23)} assume true; {14668#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:04,634 INFO L273 TraceCheckUtils]: 93: Hoare triple {14668#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14668#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:04,635 INFO L273 TraceCheckUtils]: 94: Hoare triple {14668#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14668#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:04,636 INFO L273 TraceCheckUtils]: 95: Hoare triple {14668#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14669#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:04,636 INFO L273 TraceCheckUtils]: 96: Hoare triple {14669#(<= main_~i~0 24)} assume true; {14669#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:04,637 INFO L273 TraceCheckUtils]: 97: Hoare triple {14669#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14669#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:04,637 INFO L273 TraceCheckUtils]: 98: Hoare triple {14669#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14669#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:04,638 INFO L273 TraceCheckUtils]: 99: Hoare triple {14669#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14670#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:04,638 INFO L273 TraceCheckUtils]: 100: Hoare triple {14670#(<= main_~i~0 25)} assume true; {14670#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:04,639 INFO L273 TraceCheckUtils]: 101: Hoare triple {14670#(<= main_~i~0 25)} assume !(~i~0 < 100000); {14646#false} is VALID [2018-11-14 18:42:04,639 INFO L273 TraceCheckUtils]: 102: Hoare triple {14646#false} havoc ~x~0;~x~0 := 0; {14646#false} is VALID [2018-11-14 18:42:04,640 INFO L273 TraceCheckUtils]: 103: Hoare triple {14646#false} assume true; {14646#false} is VALID [2018-11-14 18:42:04,640 INFO L273 TraceCheckUtils]: 104: Hoare triple {14646#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {14646#false} is VALID [2018-11-14 18:42:04,640 INFO L256 TraceCheckUtils]: 105: Hoare triple {14646#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {14646#false} is VALID [2018-11-14 18:42:04,640 INFO L273 TraceCheckUtils]: 106: Hoare triple {14646#false} ~cond := #in~cond; {14646#false} is VALID [2018-11-14 18:42:04,640 INFO L273 TraceCheckUtils]: 107: Hoare triple {14646#false} assume ~cond == 0; {14646#false} is VALID [2018-11-14 18:42:04,640 INFO L273 TraceCheckUtils]: 108: Hoare triple {14646#false} assume !false; {14646#false} is VALID [2018-11-14 18:42:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:04,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:04,649 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-14 18:42:04,658 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:42:04,742 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 18:42:04,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:04,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:04,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {14645#true} call ULTIMATE.init(); {14645#true} is VALID [2018-11-14 18:42:04,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {14645#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14645#true} is VALID [2018-11-14 18:42:04,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {14645#true} assume true; {14645#true} is VALID [2018-11-14 18:42:04,962 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14645#true} {14645#true} #91#return; {14645#true} is VALID [2018-11-14 18:42:04,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {14645#true} call #t~ret13 := main(); {14645#true} is VALID [2018-11-14 18:42:04,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {14645#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {14645#true} is VALID [2018-11-14 18:42:04,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {14645#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {14645#true} is VALID [2018-11-14 18:42:04,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {14645#true} ~i~0 := 2; {14647#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:04,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {14647#(<= main_~i~0 2)} assume true; {14647#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:04,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {14647#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14647#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:04,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {14647#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14647#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:04,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {14647#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14648#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:04,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {14648#(<= main_~i~0 3)} assume true; {14648#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:04,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {14648#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14648#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:04,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {14648#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14648#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:04,966 INFO L273 TraceCheckUtils]: 15: Hoare triple {14648#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14649#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:04,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {14649#(<= main_~i~0 4)} assume true; {14649#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:04,967 INFO L273 TraceCheckUtils]: 17: Hoare triple {14649#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14649#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:04,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {14649#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14649#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:04,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {14649#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14650#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:04,969 INFO L273 TraceCheckUtils]: 20: Hoare triple {14650#(<= main_~i~0 5)} assume true; {14650#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:04,970 INFO L273 TraceCheckUtils]: 21: Hoare triple {14650#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14650#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:04,970 INFO L273 TraceCheckUtils]: 22: Hoare triple {14650#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14650#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:04,971 INFO L273 TraceCheckUtils]: 23: Hoare triple {14650#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14651#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:04,971 INFO L273 TraceCheckUtils]: 24: Hoare triple {14651#(<= main_~i~0 6)} assume true; {14651#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:04,972 INFO L273 TraceCheckUtils]: 25: Hoare triple {14651#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14651#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:04,972 INFO L273 TraceCheckUtils]: 26: Hoare triple {14651#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14651#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:04,973 INFO L273 TraceCheckUtils]: 27: Hoare triple {14651#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14652#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:04,974 INFO L273 TraceCheckUtils]: 28: Hoare triple {14652#(<= main_~i~0 7)} assume true; {14652#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:04,974 INFO L273 TraceCheckUtils]: 29: Hoare triple {14652#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14652#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:04,975 INFO L273 TraceCheckUtils]: 30: Hoare triple {14652#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14652#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:04,975 INFO L273 TraceCheckUtils]: 31: Hoare triple {14652#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14653#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:04,976 INFO L273 TraceCheckUtils]: 32: Hoare triple {14653#(<= main_~i~0 8)} assume true; {14653#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:04,976 INFO L273 TraceCheckUtils]: 33: Hoare triple {14653#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14653#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:04,977 INFO L273 TraceCheckUtils]: 34: Hoare triple {14653#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14653#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:04,978 INFO L273 TraceCheckUtils]: 35: Hoare triple {14653#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14654#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:04,978 INFO L273 TraceCheckUtils]: 36: Hoare triple {14654#(<= main_~i~0 9)} assume true; {14654#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:04,979 INFO L273 TraceCheckUtils]: 37: Hoare triple {14654#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14654#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:04,979 INFO L273 TraceCheckUtils]: 38: Hoare triple {14654#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14654#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:04,980 INFO L273 TraceCheckUtils]: 39: Hoare triple {14654#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14655#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:04,980 INFO L273 TraceCheckUtils]: 40: Hoare triple {14655#(<= main_~i~0 10)} assume true; {14655#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:04,981 INFO L273 TraceCheckUtils]: 41: Hoare triple {14655#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14655#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:04,981 INFO L273 TraceCheckUtils]: 42: Hoare triple {14655#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14655#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:04,982 INFO L273 TraceCheckUtils]: 43: Hoare triple {14655#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14656#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:04,983 INFO L273 TraceCheckUtils]: 44: Hoare triple {14656#(<= main_~i~0 11)} assume true; {14656#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:04,983 INFO L273 TraceCheckUtils]: 45: Hoare triple {14656#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14656#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:04,984 INFO L273 TraceCheckUtils]: 46: Hoare triple {14656#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14656#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:04,984 INFO L273 TraceCheckUtils]: 47: Hoare triple {14656#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14657#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:04,985 INFO L273 TraceCheckUtils]: 48: Hoare triple {14657#(<= main_~i~0 12)} assume true; {14657#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:04,985 INFO L273 TraceCheckUtils]: 49: Hoare triple {14657#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14657#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:04,986 INFO L273 TraceCheckUtils]: 50: Hoare triple {14657#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14657#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:04,987 INFO L273 TraceCheckUtils]: 51: Hoare triple {14657#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14658#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:04,987 INFO L273 TraceCheckUtils]: 52: Hoare triple {14658#(<= main_~i~0 13)} assume true; {14658#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:04,988 INFO L273 TraceCheckUtils]: 53: Hoare triple {14658#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14658#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:04,988 INFO L273 TraceCheckUtils]: 54: Hoare triple {14658#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14658#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:04,989 INFO L273 TraceCheckUtils]: 55: Hoare triple {14658#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14659#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:04,989 INFO L273 TraceCheckUtils]: 56: Hoare triple {14659#(<= main_~i~0 14)} assume true; {14659#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:04,990 INFO L273 TraceCheckUtils]: 57: Hoare triple {14659#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14659#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:04,990 INFO L273 TraceCheckUtils]: 58: Hoare triple {14659#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14659#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:04,991 INFO L273 TraceCheckUtils]: 59: Hoare triple {14659#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14660#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:04,992 INFO L273 TraceCheckUtils]: 60: Hoare triple {14660#(<= main_~i~0 15)} assume true; {14660#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:04,992 INFO L273 TraceCheckUtils]: 61: Hoare triple {14660#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14660#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:04,993 INFO L273 TraceCheckUtils]: 62: Hoare triple {14660#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14660#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:04,993 INFO L273 TraceCheckUtils]: 63: Hoare triple {14660#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14661#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:04,994 INFO L273 TraceCheckUtils]: 64: Hoare triple {14661#(<= main_~i~0 16)} assume true; {14661#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:04,994 INFO L273 TraceCheckUtils]: 65: Hoare triple {14661#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14661#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:04,995 INFO L273 TraceCheckUtils]: 66: Hoare triple {14661#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14661#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:04,995 INFO L273 TraceCheckUtils]: 67: Hoare triple {14661#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14662#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:04,996 INFO L273 TraceCheckUtils]: 68: Hoare triple {14662#(<= main_~i~0 17)} assume true; {14662#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:04,997 INFO L273 TraceCheckUtils]: 69: Hoare triple {14662#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14662#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:04,997 INFO L273 TraceCheckUtils]: 70: Hoare triple {14662#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14662#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:04,998 INFO L273 TraceCheckUtils]: 71: Hoare triple {14662#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14663#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:04,998 INFO L273 TraceCheckUtils]: 72: Hoare triple {14663#(<= main_~i~0 18)} assume true; {14663#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:04,999 INFO L273 TraceCheckUtils]: 73: Hoare triple {14663#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14663#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:04,999 INFO L273 TraceCheckUtils]: 74: Hoare triple {14663#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14663#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:05,000 INFO L273 TraceCheckUtils]: 75: Hoare triple {14663#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14664#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:05,001 INFO L273 TraceCheckUtils]: 76: Hoare triple {14664#(<= main_~i~0 19)} assume true; {14664#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:05,001 INFO L273 TraceCheckUtils]: 77: Hoare triple {14664#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14664#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:05,002 INFO L273 TraceCheckUtils]: 78: Hoare triple {14664#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14664#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:05,002 INFO L273 TraceCheckUtils]: 79: Hoare triple {14664#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14665#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:05,003 INFO L273 TraceCheckUtils]: 80: Hoare triple {14665#(<= main_~i~0 20)} assume true; {14665#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:05,003 INFO L273 TraceCheckUtils]: 81: Hoare triple {14665#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14665#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:05,004 INFO L273 TraceCheckUtils]: 82: Hoare triple {14665#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14665#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:05,005 INFO L273 TraceCheckUtils]: 83: Hoare triple {14665#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14666#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:05,005 INFO L273 TraceCheckUtils]: 84: Hoare triple {14666#(<= main_~i~0 21)} assume true; {14666#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:05,006 INFO L273 TraceCheckUtils]: 85: Hoare triple {14666#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14666#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:05,006 INFO L273 TraceCheckUtils]: 86: Hoare triple {14666#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14666#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:05,007 INFO L273 TraceCheckUtils]: 87: Hoare triple {14666#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14667#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:05,007 INFO L273 TraceCheckUtils]: 88: Hoare triple {14667#(<= main_~i~0 22)} assume true; {14667#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:05,008 INFO L273 TraceCheckUtils]: 89: Hoare triple {14667#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14667#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:05,008 INFO L273 TraceCheckUtils]: 90: Hoare triple {14667#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14667#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:05,009 INFO L273 TraceCheckUtils]: 91: Hoare triple {14667#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14668#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:05,010 INFO L273 TraceCheckUtils]: 92: Hoare triple {14668#(<= main_~i~0 23)} assume true; {14668#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:05,010 INFO L273 TraceCheckUtils]: 93: Hoare triple {14668#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14668#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:05,011 INFO L273 TraceCheckUtils]: 94: Hoare triple {14668#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14668#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:05,011 INFO L273 TraceCheckUtils]: 95: Hoare triple {14668#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14669#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:05,012 INFO L273 TraceCheckUtils]: 96: Hoare triple {14669#(<= main_~i~0 24)} assume true; {14669#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:05,012 INFO L273 TraceCheckUtils]: 97: Hoare triple {14669#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {14669#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:05,013 INFO L273 TraceCheckUtils]: 98: Hoare triple {14669#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14669#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:05,013 INFO L273 TraceCheckUtils]: 99: Hoare triple {14669#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14670#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:05,014 INFO L273 TraceCheckUtils]: 100: Hoare triple {14670#(<= main_~i~0 25)} assume true; {14670#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:05,015 INFO L273 TraceCheckUtils]: 101: Hoare triple {14670#(<= main_~i~0 25)} assume !(~i~0 < 100000); {14646#false} is VALID [2018-11-14 18:42:05,015 INFO L273 TraceCheckUtils]: 102: Hoare triple {14646#false} havoc ~x~0;~x~0 := 0; {14646#false} is VALID [2018-11-14 18:42:05,015 INFO L273 TraceCheckUtils]: 103: Hoare triple {14646#false} assume true; {14646#false} is VALID [2018-11-14 18:42:05,015 INFO L273 TraceCheckUtils]: 104: Hoare triple {14646#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {14646#false} is VALID [2018-11-14 18:42:05,015 INFO L256 TraceCheckUtils]: 105: Hoare triple {14646#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {14646#false} is VALID [2018-11-14 18:42:05,016 INFO L273 TraceCheckUtils]: 106: Hoare triple {14646#false} ~cond := #in~cond; {14646#false} is VALID [2018-11-14 18:42:05,016 INFO L273 TraceCheckUtils]: 107: Hoare triple {14646#false} assume ~cond == 0; {14646#false} is VALID [2018-11-14 18:42:05,016 INFO L273 TraceCheckUtils]: 108: Hoare triple {14646#false} assume !false; {14646#false} is VALID [2018-11-14 18:42:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:05,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:05,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-11-14 18:42:05,045 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-11-14 18:42:05,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:05,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:42:05,146 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-14 18:42:05,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:42:05,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:42:05,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:42:05,147 INFO L87 Difference]: Start difference. First operand 144 states and 195 transitions. Second operand 26 states. [2018-11-14 18:42:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:05,856 INFO L93 Difference]: Finished difference Result 171 states and 230 transitions. [2018-11-14 18:42:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 18:42:05,856 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-11-14 18:42:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:05,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:42:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 230 transitions. [2018-11-14 18:42:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:42:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 230 transitions. [2018-11-14 18:42:05,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 230 transitions. [2018-11-14 18:42:06,079 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-14 18:42:06,082 INFO L225 Difference]: With dead ends: 171 [2018-11-14 18:42:06,082 INFO L226 Difference]: Without dead ends: 152 [2018-11-14 18:42:06,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:42:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-14 18:42:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2018-11-14 18:42:06,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:06,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 149 states. [2018-11-14 18:42:06,110 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 149 states. [2018-11-14 18:42:06,110 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 149 states. [2018-11-14 18:42:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:06,113 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2018-11-14 18:42:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2018-11-14 18:42:06,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:06,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:06,114 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 152 states. [2018-11-14 18:42:06,114 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 152 states. [2018-11-14 18:42:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:06,117 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2018-11-14 18:42:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2018-11-14 18:42:06,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:06,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:06,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:06,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-14 18:42:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 202 transitions. [2018-11-14 18:42:06,120 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 202 transitions. Word has length 109 [2018-11-14 18:42:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:06,121 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 202 transitions. [2018-11-14 18:42:06,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:42:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 202 transitions. [2018-11-14 18:42:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-14 18:42:06,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:06,122 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:06,122 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:06,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:06,123 INFO L82 PathProgramCache]: Analyzing trace with hash 808458492, now seen corresponding path program 24 times [2018-11-14 18:42:06,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:06,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:06,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:06,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:06,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:07,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {15694#true} call ULTIMATE.init(); {15694#true} is VALID [2018-11-14 18:42:07,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {15694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15694#true} is VALID [2018-11-14 18:42:07,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {15694#true} assume true; {15694#true} is VALID [2018-11-14 18:42:07,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15694#true} {15694#true} #91#return; {15694#true} is VALID [2018-11-14 18:42:07,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {15694#true} call #t~ret13 := main(); {15694#true} is VALID [2018-11-14 18:42:07,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {15694#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {15694#true} is VALID [2018-11-14 18:42:07,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {15694#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {15694#true} is VALID [2018-11-14 18:42:07,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {15694#true} ~i~0 := 2; {15696#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:07,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {15696#(<= main_~i~0 2)} assume true; {15696#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:07,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {15696#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15696#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:07,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {15696#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15696#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:07,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {15696#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15697#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:07,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {15697#(<= main_~i~0 3)} assume true; {15697#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:07,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {15697#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15697#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:07,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {15697#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15697#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:07,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {15697#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15698#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:07,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {15698#(<= main_~i~0 4)} assume true; {15698#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:07,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {15698#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15698#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:07,070 INFO L273 TraceCheckUtils]: 18: Hoare triple {15698#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15698#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:07,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {15698#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15699#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:07,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {15699#(<= main_~i~0 5)} assume true; {15699#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:07,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {15699#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15699#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:07,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {15699#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15699#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:07,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {15699#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15700#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:07,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {15700#(<= main_~i~0 6)} assume true; {15700#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:07,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {15700#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15700#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:07,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {15700#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15700#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:07,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {15700#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15701#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:07,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {15701#(<= main_~i~0 7)} assume true; {15701#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:07,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {15701#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15701#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:07,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {15701#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15701#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:07,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {15701#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15702#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:07,078 INFO L273 TraceCheckUtils]: 32: Hoare triple {15702#(<= main_~i~0 8)} assume true; {15702#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:07,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {15702#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15702#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:07,079 INFO L273 TraceCheckUtils]: 34: Hoare triple {15702#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15702#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:07,080 INFO L273 TraceCheckUtils]: 35: Hoare triple {15702#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15703#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:07,080 INFO L273 TraceCheckUtils]: 36: Hoare triple {15703#(<= main_~i~0 9)} assume true; {15703#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:07,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {15703#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15703#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:07,081 INFO L273 TraceCheckUtils]: 38: Hoare triple {15703#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15703#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:07,082 INFO L273 TraceCheckUtils]: 39: Hoare triple {15703#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15704#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:07,082 INFO L273 TraceCheckUtils]: 40: Hoare triple {15704#(<= main_~i~0 10)} assume true; {15704#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:07,083 INFO L273 TraceCheckUtils]: 41: Hoare triple {15704#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15704#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:07,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {15704#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15704#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:07,084 INFO L273 TraceCheckUtils]: 43: Hoare triple {15704#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15705#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:07,085 INFO L273 TraceCheckUtils]: 44: Hoare triple {15705#(<= main_~i~0 11)} assume true; {15705#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:07,085 INFO L273 TraceCheckUtils]: 45: Hoare triple {15705#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15705#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:07,086 INFO L273 TraceCheckUtils]: 46: Hoare triple {15705#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15705#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:07,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {15705#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15706#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:07,087 INFO L273 TraceCheckUtils]: 48: Hoare triple {15706#(<= main_~i~0 12)} assume true; {15706#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:07,087 INFO L273 TraceCheckUtils]: 49: Hoare triple {15706#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15706#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:07,088 INFO L273 TraceCheckUtils]: 50: Hoare triple {15706#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15706#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:07,089 INFO L273 TraceCheckUtils]: 51: Hoare triple {15706#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15707#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:07,089 INFO L273 TraceCheckUtils]: 52: Hoare triple {15707#(<= main_~i~0 13)} assume true; {15707#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:07,090 INFO L273 TraceCheckUtils]: 53: Hoare triple {15707#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15707#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:07,090 INFO L273 TraceCheckUtils]: 54: Hoare triple {15707#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15707#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:07,091 INFO L273 TraceCheckUtils]: 55: Hoare triple {15707#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15708#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:07,091 INFO L273 TraceCheckUtils]: 56: Hoare triple {15708#(<= main_~i~0 14)} assume true; {15708#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:07,092 INFO L273 TraceCheckUtils]: 57: Hoare triple {15708#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15708#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:07,092 INFO L273 TraceCheckUtils]: 58: Hoare triple {15708#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15708#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:07,093 INFO L273 TraceCheckUtils]: 59: Hoare triple {15708#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15709#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:07,094 INFO L273 TraceCheckUtils]: 60: Hoare triple {15709#(<= main_~i~0 15)} assume true; {15709#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:07,094 INFO L273 TraceCheckUtils]: 61: Hoare triple {15709#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15709#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:07,095 INFO L273 TraceCheckUtils]: 62: Hoare triple {15709#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15709#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:07,095 INFO L273 TraceCheckUtils]: 63: Hoare triple {15709#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15710#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:07,096 INFO L273 TraceCheckUtils]: 64: Hoare triple {15710#(<= main_~i~0 16)} assume true; {15710#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:07,096 INFO L273 TraceCheckUtils]: 65: Hoare triple {15710#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15710#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:07,097 INFO L273 TraceCheckUtils]: 66: Hoare triple {15710#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15710#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:07,098 INFO L273 TraceCheckUtils]: 67: Hoare triple {15710#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15711#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:07,098 INFO L273 TraceCheckUtils]: 68: Hoare triple {15711#(<= main_~i~0 17)} assume true; {15711#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:07,099 INFO L273 TraceCheckUtils]: 69: Hoare triple {15711#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15711#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:07,099 INFO L273 TraceCheckUtils]: 70: Hoare triple {15711#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15711#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:07,100 INFO L273 TraceCheckUtils]: 71: Hoare triple {15711#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15712#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:07,100 INFO L273 TraceCheckUtils]: 72: Hoare triple {15712#(<= main_~i~0 18)} assume true; {15712#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:07,101 INFO L273 TraceCheckUtils]: 73: Hoare triple {15712#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15712#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:07,101 INFO L273 TraceCheckUtils]: 74: Hoare triple {15712#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15712#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:07,102 INFO L273 TraceCheckUtils]: 75: Hoare triple {15712#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15713#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:07,103 INFO L273 TraceCheckUtils]: 76: Hoare triple {15713#(<= main_~i~0 19)} assume true; {15713#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:07,103 INFO L273 TraceCheckUtils]: 77: Hoare triple {15713#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15713#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:07,104 INFO L273 TraceCheckUtils]: 78: Hoare triple {15713#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15713#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:07,104 INFO L273 TraceCheckUtils]: 79: Hoare triple {15713#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15714#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:07,105 INFO L273 TraceCheckUtils]: 80: Hoare triple {15714#(<= main_~i~0 20)} assume true; {15714#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:07,105 INFO L273 TraceCheckUtils]: 81: Hoare triple {15714#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15714#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:07,106 INFO L273 TraceCheckUtils]: 82: Hoare triple {15714#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15714#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:07,107 INFO L273 TraceCheckUtils]: 83: Hoare triple {15714#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15715#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:07,107 INFO L273 TraceCheckUtils]: 84: Hoare triple {15715#(<= main_~i~0 21)} assume true; {15715#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:07,108 INFO L273 TraceCheckUtils]: 85: Hoare triple {15715#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15715#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:07,108 INFO L273 TraceCheckUtils]: 86: Hoare triple {15715#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15715#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:07,109 INFO L273 TraceCheckUtils]: 87: Hoare triple {15715#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15716#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:07,109 INFO L273 TraceCheckUtils]: 88: Hoare triple {15716#(<= main_~i~0 22)} assume true; {15716#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:07,110 INFO L273 TraceCheckUtils]: 89: Hoare triple {15716#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15716#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:07,110 INFO L273 TraceCheckUtils]: 90: Hoare triple {15716#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15716#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:07,111 INFO L273 TraceCheckUtils]: 91: Hoare triple {15716#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15717#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:07,112 INFO L273 TraceCheckUtils]: 92: Hoare triple {15717#(<= main_~i~0 23)} assume true; {15717#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:07,112 INFO L273 TraceCheckUtils]: 93: Hoare triple {15717#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15717#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:07,113 INFO L273 TraceCheckUtils]: 94: Hoare triple {15717#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15717#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:07,113 INFO L273 TraceCheckUtils]: 95: Hoare triple {15717#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15718#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:07,114 INFO L273 TraceCheckUtils]: 96: Hoare triple {15718#(<= main_~i~0 24)} assume true; {15718#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:07,114 INFO L273 TraceCheckUtils]: 97: Hoare triple {15718#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15718#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:07,115 INFO L273 TraceCheckUtils]: 98: Hoare triple {15718#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15718#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:07,116 INFO L273 TraceCheckUtils]: 99: Hoare triple {15718#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15719#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:07,116 INFO L273 TraceCheckUtils]: 100: Hoare triple {15719#(<= main_~i~0 25)} assume true; {15719#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:07,117 INFO L273 TraceCheckUtils]: 101: Hoare triple {15719#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15719#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:07,117 INFO L273 TraceCheckUtils]: 102: Hoare triple {15719#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15719#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:07,118 INFO L273 TraceCheckUtils]: 103: Hoare triple {15719#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15720#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:07,119 INFO L273 TraceCheckUtils]: 104: Hoare triple {15720#(<= main_~i~0 26)} assume true; {15720#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:07,119 INFO L273 TraceCheckUtils]: 105: Hoare triple {15720#(<= main_~i~0 26)} assume !(~i~0 < 100000); {15695#false} is VALID [2018-11-14 18:42:07,119 INFO L273 TraceCheckUtils]: 106: Hoare triple {15695#false} havoc ~x~0;~x~0 := 0; {15695#false} is VALID [2018-11-14 18:42:07,120 INFO L273 TraceCheckUtils]: 107: Hoare triple {15695#false} assume true; {15695#false} is VALID [2018-11-14 18:42:07,120 INFO L273 TraceCheckUtils]: 108: Hoare triple {15695#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {15695#false} is VALID [2018-11-14 18:42:07,120 INFO L256 TraceCheckUtils]: 109: Hoare triple {15695#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {15695#false} is VALID [2018-11-14 18:42:07,120 INFO L273 TraceCheckUtils]: 110: Hoare triple {15695#false} ~cond := #in~cond; {15695#false} is VALID [2018-11-14 18:42:07,120 INFO L273 TraceCheckUtils]: 111: Hoare triple {15695#false} assume ~cond == 0; {15695#false} is VALID [2018-11-14 18:42:07,121 INFO L273 TraceCheckUtils]: 112: Hoare triple {15695#false} assume !false; {15695#false} is VALID [2018-11-14 18:42:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:07,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:07,129 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-14 18:42:07,137 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:42:07,212 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-14 18:42:07,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:07,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:07,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {15694#true} call ULTIMATE.init(); {15694#true} is VALID [2018-11-14 18:42:07,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {15694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15694#true} is VALID [2018-11-14 18:42:07,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {15694#true} assume true; {15694#true} is VALID [2018-11-14 18:42:07,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15694#true} {15694#true} #91#return; {15694#true} is VALID [2018-11-14 18:42:07,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {15694#true} call #t~ret13 := main(); {15694#true} is VALID [2018-11-14 18:42:07,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {15694#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {15694#true} is VALID [2018-11-14 18:42:07,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {15694#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {15694#true} is VALID [2018-11-14 18:42:07,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {15694#true} ~i~0 := 2; {15696#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:07,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {15696#(<= main_~i~0 2)} assume true; {15696#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:07,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {15696#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15696#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:07,445 INFO L273 TraceCheckUtils]: 10: Hoare triple {15696#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15696#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:07,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {15696#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15697#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:07,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {15697#(<= main_~i~0 3)} assume true; {15697#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:07,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {15697#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15697#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:07,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {15697#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15697#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:07,446 INFO L273 TraceCheckUtils]: 15: Hoare triple {15697#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15698#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:07,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {15698#(<= main_~i~0 4)} assume true; {15698#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:07,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {15698#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15698#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:07,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {15698#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15698#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:07,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {15698#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15699#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:07,449 INFO L273 TraceCheckUtils]: 20: Hoare triple {15699#(<= main_~i~0 5)} assume true; {15699#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:07,450 INFO L273 TraceCheckUtils]: 21: Hoare triple {15699#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15699#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:07,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {15699#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15699#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:07,451 INFO L273 TraceCheckUtils]: 23: Hoare triple {15699#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15700#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:07,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {15700#(<= main_~i~0 6)} assume true; {15700#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:07,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {15700#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15700#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:07,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {15700#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15700#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:07,453 INFO L273 TraceCheckUtils]: 27: Hoare triple {15700#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15701#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:07,454 INFO L273 TraceCheckUtils]: 28: Hoare triple {15701#(<= main_~i~0 7)} assume true; {15701#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:07,476 INFO L273 TraceCheckUtils]: 29: Hoare triple {15701#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15701#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:07,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {15701#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15701#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:07,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {15701#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15702#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:07,486 INFO L273 TraceCheckUtils]: 32: Hoare triple {15702#(<= main_~i~0 8)} assume true; {15702#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:07,486 INFO L273 TraceCheckUtils]: 33: Hoare triple {15702#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15702#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:07,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {15702#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15702#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:07,487 INFO L273 TraceCheckUtils]: 35: Hoare triple {15702#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15703#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:07,488 INFO L273 TraceCheckUtils]: 36: Hoare triple {15703#(<= main_~i~0 9)} assume true; {15703#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:07,488 INFO L273 TraceCheckUtils]: 37: Hoare triple {15703#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15703#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:07,491 INFO L273 TraceCheckUtils]: 38: Hoare triple {15703#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15703#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:07,491 INFO L273 TraceCheckUtils]: 39: Hoare triple {15703#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15704#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:07,491 INFO L273 TraceCheckUtils]: 40: Hoare triple {15704#(<= main_~i~0 10)} assume true; {15704#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:07,492 INFO L273 TraceCheckUtils]: 41: Hoare triple {15704#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15704#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:07,492 INFO L273 TraceCheckUtils]: 42: Hoare triple {15704#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15704#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:07,492 INFO L273 TraceCheckUtils]: 43: Hoare triple {15704#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15705#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:07,493 INFO L273 TraceCheckUtils]: 44: Hoare triple {15705#(<= main_~i~0 11)} assume true; {15705#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:07,493 INFO L273 TraceCheckUtils]: 45: Hoare triple {15705#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15705#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:07,493 INFO L273 TraceCheckUtils]: 46: Hoare triple {15705#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15705#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:07,494 INFO L273 TraceCheckUtils]: 47: Hoare triple {15705#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15706#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:07,494 INFO L273 TraceCheckUtils]: 48: Hoare triple {15706#(<= main_~i~0 12)} assume true; {15706#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:07,494 INFO L273 TraceCheckUtils]: 49: Hoare triple {15706#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15706#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:07,495 INFO L273 TraceCheckUtils]: 50: Hoare triple {15706#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15706#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:07,495 INFO L273 TraceCheckUtils]: 51: Hoare triple {15706#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15707#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:07,496 INFO L273 TraceCheckUtils]: 52: Hoare triple {15707#(<= main_~i~0 13)} assume true; {15707#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:07,496 INFO L273 TraceCheckUtils]: 53: Hoare triple {15707#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15707#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:07,497 INFO L273 TraceCheckUtils]: 54: Hoare triple {15707#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15707#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:07,498 INFO L273 TraceCheckUtils]: 55: Hoare triple {15707#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15708#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:07,498 INFO L273 TraceCheckUtils]: 56: Hoare triple {15708#(<= main_~i~0 14)} assume true; {15708#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:07,499 INFO L273 TraceCheckUtils]: 57: Hoare triple {15708#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15708#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:07,499 INFO L273 TraceCheckUtils]: 58: Hoare triple {15708#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15708#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:07,500 INFO L273 TraceCheckUtils]: 59: Hoare triple {15708#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15709#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:07,500 INFO L273 TraceCheckUtils]: 60: Hoare triple {15709#(<= main_~i~0 15)} assume true; {15709#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:07,501 INFO L273 TraceCheckUtils]: 61: Hoare triple {15709#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15709#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:07,501 INFO L273 TraceCheckUtils]: 62: Hoare triple {15709#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15709#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:07,502 INFO L273 TraceCheckUtils]: 63: Hoare triple {15709#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15710#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:07,503 INFO L273 TraceCheckUtils]: 64: Hoare triple {15710#(<= main_~i~0 16)} assume true; {15710#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:07,503 INFO L273 TraceCheckUtils]: 65: Hoare triple {15710#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15710#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:07,504 INFO L273 TraceCheckUtils]: 66: Hoare triple {15710#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15710#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:07,504 INFO L273 TraceCheckUtils]: 67: Hoare triple {15710#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15711#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:07,505 INFO L273 TraceCheckUtils]: 68: Hoare triple {15711#(<= main_~i~0 17)} assume true; {15711#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:07,506 INFO L273 TraceCheckUtils]: 69: Hoare triple {15711#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15711#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:07,506 INFO L273 TraceCheckUtils]: 70: Hoare triple {15711#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15711#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:07,507 INFO L273 TraceCheckUtils]: 71: Hoare triple {15711#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15712#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:07,507 INFO L273 TraceCheckUtils]: 72: Hoare triple {15712#(<= main_~i~0 18)} assume true; {15712#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:07,508 INFO L273 TraceCheckUtils]: 73: Hoare triple {15712#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15712#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:07,508 INFO L273 TraceCheckUtils]: 74: Hoare triple {15712#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15712#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:07,509 INFO L273 TraceCheckUtils]: 75: Hoare triple {15712#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15713#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:07,510 INFO L273 TraceCheckUtils]: 76: Hoare triple {15713#(<= main_~i~0 19)} assume true; {15713#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:07,510 INFO L273 TraceCheckUtils]: 77: Hoare triple {15713#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15713#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:07,511 INFO L273 TraceCheckUtils]: 78: Hoare triple {15713#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15713#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:07,511 INFO L273 TraceCheckUtils]: 79: Hoare triple {15713#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15714#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:07,512 INFO L273 TraceCheckUtils]: 80: Hoare triple {15714#(<= main_~i~0 20)} assume true; {15714#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:07,512 INFO L273 TraceCheckUtils]: 81: Hoare triple {15714#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15714#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:07,513 INFO L273 TraceCheckUtils]: 82: Hoare triple {15714#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15714#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:07,513 INFO L273 TraceCheckUtils]: 83: Hoare triple {15714#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15715#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:07,514 INFO L273 TraceCheckUtils]: 84: Hoare triple {15715#(<= main_~i~0 21)} assume true; {15715#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:07,515 INFO L273 TraceCheckUtils]: 85: Hoare triple {15715#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15715#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:07,515 INFO L273 TraceCheckUtils]: 86: Hoare triple {15715#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15715#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:07,516 INFO L273 TraceCheckUtils]: 87: Hoare triple {15715#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15716#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:07,516 INFO L273 TraceCheckUtils]: 88: Hoare triple {15716#(<= main_~i~0 22)} assume true; {15716#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:07,517 INFO L273 TraceCheckUtils]: 89: Hoare triple {15716#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15716#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:07,517 INFO L273 TraceCheckUtils]: 90: Hoare triple {15716#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15716#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:07,518 INFO L273 TraceCheckUtils]: 91: Hoare triple {15716#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15717#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:07,519 INFO L273 TraceCheckUtils]: 92: Hoare triple {15717#(<= main_~i~0 23)} assume true; {15717#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:07,519 INFO L273 TraceCheckUtils]: 93: Hoare triple {15717#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15717#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:07,520 INFO L273 TraceCheckUtils]: 94: Hoare triple {15717#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15717#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:07,520 INFO L273 TraceCheckUtils]: 95: Hoare triple {15717#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15718#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:07,521 INFO L273 TraceCheckUtils]: 96: Hoare triple {15718#(<= main_~i~0 24)} assume true; {15718#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:07,521 INFO L273 TraceCheckUtils]: 97: Hoare triple {15718#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15718#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:07,522 INFO L273 TraceCheckUtils]: 98: Hoare triple {15718#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15718#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:07,523 INFO L273 TraceCheckUtils]: 99: Hoare triple {15718#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15719#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:07,523 INFO L273 TraceCheckUtils]: 100: Hoare triple {15719#(<= main_~i~0 25)} assume true; {15719#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:07,524 INFO L273 TraceCheckUtils]: 101: Hoare triple {15719#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {15719#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:07,524 INFO L273 TraceCheckUtils]: 102: Hoare triple {15719#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15719#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:07,525 INFO L273 TraceCheckUtils]: 103: Hoare triple {15719#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15720#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:07,525 INFO L273 TraceCheckUtils]: 104: Hoare triple {15720#(<= main_~i~0 26)} assume true; {15720#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:07,526 INFO L273 TraceCheckUtils]: 105: Hoare triple {15720#(<= main_~i~0 26)} assume !(~i~0 < 100000); {15695#false} is VALID [2018-11-14 18:42:07,526 INFO L273 TraceCheckUtils]: 106: Hoare triple {15695#false} havoc ~x~0;~x~0 := 0; {15695#false} is VALID [2018-11-14 18:42:07,526 INFO L273 TraceCheckUtils]: 107: Hoare triple {15695#false} assume true; {15695#false} is VALID [2018-11-14 18:42:07,527 INFO L273 TraceCheckUtils]: 108: Hoare triple {15695#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {15695#false} is VALID [2018-11-14 18:42:07,527 INFO L256 TraceCheckUtils]: 109: Hoare triple {15695#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {15695#false} is VALID [2018-11-14 18:42:07,527 INFO L273 TraceCheckUtils]: 110: Hoare triple {15695#false} ~cond := #in~cond; {15695#false} is VALID [2018-11-14 18:42:07,527 INFO L273 TraceCheckUtils]: 111: Hoare triple {15695#false} assume ~cond == 0; {15695#false} is VALID [2018-11-14 18:42:07,527 INFO L273 TraceCheckUtils]: 112: Hoare triple {15695#false} assume !false; {15695#false} is VALID [2018-11-14 18:42:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:07,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:07,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-11-14 18:42:07,558 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 113 [2018-11-14 18:42:07,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:07,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 18:42:07,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:07,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 18:42:07,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 18:42:07,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:42:07,684 INFO L87 Difference]: Start difference. First operand 149 states and 202 transitions. Second operand 27 states. [2018-11-14 18:42:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:08,825 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2018-11-14 18:42:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 18:42:08,825 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 113 [2018-11-14 18:42:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:42:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 237 transitions. [2018-11-14 18:42:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:42:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 237 transitions. [2018-11-14 18:42:08,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 237 transitions. [2018-11-14 18:42:09,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:09,103 INFO L225 Difference]: With dead ends: 176 [2018-11-14 18:42:09,103 INFO L226 Difference]: Without dead ends: 157 [2018-11-14 18:42:09,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 114 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-14 18:42:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-14 18:42:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2018-11-14 18:42:09,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:09,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 154 states. [2018-11-14 18:42:09,128 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 154 states. [2018-11-14 18:42:09,128 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 154 states. [2018-11-14 18:42:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:09,131 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2018-11-14 18:42:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2018-11-14 18:42:09,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:09,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:09,132 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 157 states. [2018-11-14 18:42:09,132 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 157 states. [2018-11-14 18:42:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:09,135 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2018-11-14 18:42:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2018-11-14 18:42:09,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:09,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:09,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:09,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-14 18:42:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 209 transitions. [2018-11-14 18:42:09,138 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 209 transitions. Word has length 113 [2018-11-14 18:42:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:09,139 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 209 transitions. [2018-11-14 18:42:09,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 18:42:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 209 transitions. [2018-11-14 18:42:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 18:42:09,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:09,140 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:09,140 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:09,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:09,141 INFO L82 PathProgramCache]: Analyzing trace with hash 286836718, now seen corresponding path program 25 times [2018-11-14 18:42:09,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:09,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:09,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:09,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:09,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:09,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {16778#true} call ULTIMATE.init(); {16778#true} is VALID [2018-11-14 18:42:09,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {16778#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16778#true} is VALID [2018-11-14 18:42:09,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {16778#true} assume true; {16778#true} is VALID [2018-11-14 18:42:09,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16778#true} {16778#true} #91#return; {16778#true} is VALID [2018-11-14 18:42:09,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {16778#true} call #t~ret13 := main(); {16778#true} is VALID [2018-11-14 18:42:09,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {16778#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {16778#true} is VALID [2018-11-14 18:42:09,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {16778#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {16778#true} is VALID [2018-11-14 18:42:09,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {16778#true} ~i~0 := 2; {16780#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:09,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {16780#(<= main_~i~0 2)} assume true; {16780#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:09,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {16780#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16780#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:09,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {16780#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16780#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:09,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {16780#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16781#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:09,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {16781#(<= main_~i~0 3)} assume true; {16781#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:09,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {16781#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16781#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:09,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {16781#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16781#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:09,748 INFO L273 TraceCheckUtils]: 15: Hoare triple {16781#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16782#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:09,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {16782#(<= main_~i~0 4)} assume true; {16782#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:09,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {16782#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16782#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:09,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {16782#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16782#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:09,751 INFO L273 TraceCheckUtils]: 19: Hoare triple {16782#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16783#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:09,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {16783#(<= main_~i~0 5)} assume true; {16783#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:09,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {16783#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16783#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:09,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {16783#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16783#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:09,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {16783#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16784#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:09,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {16784#(<= main_~i~0 6)} assume true; {16784#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:09,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {16784#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16784#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:09,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {16784#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16784#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:09,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {16784#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16785#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:09,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {16785#(<= main_~i~0 7)} assume true; {16785#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:09,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {16785#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16785#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:09,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {16785#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16785#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:09,824 INFO L273 TraceCheckUtils]: 31: Hoare triple {16785#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16786#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:09,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {16786#(<= main_~i~0 8)} assume true; {16786#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:09,848 INFO L273 TraceCheckUtils]: 33: Hoare triple {16786#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16786#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:09,861 INFO L273 TraceCheckUtils]: 34: Hoare triple {16786#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16786#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:09,870 INFO L273 TraceCheckUtils]: 35: Hoare triple {16786#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16787#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:09,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {16787#(<= main_~i~0 9)} assume true; {16787#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:09,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {16787#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16787#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:09,904 INFO L273 TraceCheckUtils]: 38: Hoare triple {16787#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16787#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:09,918 INFO L273 TraceCheckUtils]: 39: Hoare triple {16787#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16788#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:09,927 INFO L273 TraceCheckUtils]: 40: Hoare triple {16788#(<= main_~i~0 10)} assume true; {16788#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:09,939 INFO L273 TraceCheckUtils]: 41: Hoare triple {16788#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16788#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:09,952 INFO L273 TraceCheckUtils]: 42: Hoare triple {16788#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16788#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:09,965 INFO L273 TraceCheckUtils]: 43: Hoare triple {16788#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16789#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:09,974 INFO L273 TraceCheckUtils]: 44: Hoare triple {16789#(<= main_~i~0 11)} assume true; {16789#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:09,989 INFO L273 TraceCheckUtils]: 45: Hoare triple {16789#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16789#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:09,997 INFO L273 TraceCheckUtils]: 46: Hoare triple {16789#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16789#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:10,007 INFO L273 TraceCheckUtils]: 47: Hoare triple {16789#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16790#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:10,009 INFO L273 TraceCheckUtils]: 48: Hoare triple {16790#(<= main_~i~0 12)} assume true; {16790#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:10,009 INFO L273 TraceCheckUtils]: 49: Hoare triple {16790#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16790#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:10,011 INFO L273 TraceCheckUtils]: 50: Hoare triple {16790#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16790#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:10,011 INFO L273 TraceCheckUtils]: 51: Hoare triple {16790#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16791#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:10,015 INFO L273 TraceCheckUtils]: 52: Hoare triple {16791#(<= main_~i~0 13)} assume true; {16791#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:10,015 INFO L273 TraceCheckUtils]: 53: Hoare triple {16791#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16791#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:10,019 INFO L273 TraceCheckUtils]: 54: Hoare triple {16791#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16791#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:10,019 INFO L273 TraceCheckUtils]: 55: Hoare triple {16791#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16792#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:10,019 INFO L273 TraceCheckUtils]: 56: Hoare triple {16792#(<= main_~i~0 14)} assume true; {16792#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:10,020 INFO L273 TraceCheckUtils]: 57: Hoare triple {16792#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16792#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:10,020 INFO L273 TraceCheckUtils]: 58: Hoare triple {16792#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16792#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:10,020 INFO L273 TraceCheckUtils]: 59: Hoare triple {16792#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16793#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:10,021 INFO L273 TraceCheckUtils]: 60: Hoare triple {16793#(<= main_~i~0 15)} assume true; {16793#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:10,021 INFO L273 TraceCheckUtils]: 61: Hoare triple {16793#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16793#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:10,021 INFO L273 TraceCheckUtils]: 62: Hoare triple {16793#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16793#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:10,022 INFO L273 TraceCheckUtils]: 63: Hoare triple {16793#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16794#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:10,022 INFO L273 TraceCheckUtils]: 64: Hoare triple {16794#(<= main_~i~0 16)} assume true; {16794#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:10,022 INFO L273 TraceCheckUtils]: 65: Hoare triple {16794#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16794#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:10,023 INFO L273 TraceCheckUtils]: 66: Hoare triple {16794#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16794#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:10,024 INFO L273 TraceCheckUtils]: 67: Hoare triple {16794#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16795#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:10,024 INFO L273 TraceCheckUtils]: 68: Hoare triple {16795#(<= main_~i~0 17)} assume true; {16795#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:10,025 INFO L273 TraceCheckUtils]: 69: Hoare triple {16795#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16795#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:10,025 INFO L273 TraceCheckUtils]: 70: Hoare triple {16795#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16795#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:10,026 INFO L273 TraceCheckUtils]: 71: Hoare triple {16795#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16796#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:10,026 INFO L273 TraceCheckUtils]: 72: Hoare triple {16796#(<= main_~i~0 18)} assume true; {16796#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:10,027 INFO L273 TraceCheckUtils]: 73: Hoare triple {16796#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16796#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:10,027 INFO L273 TraceCheckUtils]: 74: Hoare triple {16796#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16796#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:10,028 INFO L273 TraceCheckUtils]: 75: Hoare triple {16796#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16797#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:10,029 INFO L273 TraceCheckUtils]: 76: Hoare triple {16797#(<= main_~i~0 19)} assume true; {16797#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:10,029 INFO L273 TraceCheckUtils]: 77: Hoare triple {16797#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16797#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:10,030 INFO L273 TraceCheckUtils]: 78: Hoare triple {16797#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16797#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:10,030 INFO L273 TraceCheckUtils]: 79: Hoare triple {16797#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16798#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:10,031 INFO L273 TraceCheckUtils]: 80: Hoare triple {16798#(<= main_~i~0 20)} assume true; {16798#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:10,031 INFO L273 TraceCheckUtils]: 81: Hoare triple {16798#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16798#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:10,032 INFO L273 TraceCheckUtils]: 82: Hoare triple {16798#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16798#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:10,033 INFO L273 TraceCheckUtils]: 83: Hoare triple {16798#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16799#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:10,033 INFO L273 TraceCheckUtils]: 84: Hoare triple {16799#(<= main_~i~0 21)} assume true; {16799#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:10,034 INFO L273 TraceCheckUtils]: 85: Hoare triple {16799#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16799#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:10,034 INFO L273 TraceCheckUtils]: 86: Hoare triple {16799#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16799#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:10,035 INFO L273 TraceCheckUtils]: 87: Hoare triple {16799#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16800#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:10,035 INFO L273 TraceCheckUtils]: 88: Hoare triple {16800#(<= main_~i~0 22)} assume true; {16800#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:10,036 INFO L273 TraceCheckUtils]: 89: Hoare triple {16800#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16800#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:10,036 INFO L273 TraceCheckUtils]: 90: Hoare triple {16800#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16800#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:10,037 INFO L273 TraceCheckUtils]: 91: Hoare triple {16800#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16801#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:10,038 INFO L273 TraceCheckUtils]: 92: Hoare triple {16801#(<= main_~i~0 23)} assume true; {16801#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:10,038 INFO L273 TraceCheckUtils]: 93: Hoare triple {16801#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16801#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:10,039 INFO L273 TraceCheckUtils]: 94: Hoare triple {16801#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16801#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:10,039 INFO L273 TraceCheckUtils]: 95: Hoare triple {16801#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16802#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:10,040 INFO L273 TraceCheckUtils]: 96: Hoare triple {16802#(<= main_~i~0 24)} assume true; {16802#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:10,040 INFO L273 TraceCheckUtils]: 97: Hoare triple {16802#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16802#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:10,041 INFO L273 TraceCheckUtils]: 98: Hoare triple {16802#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16802#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:10,042 INFO L273 TraceCheckUtils]: 99: Hoare triple {16802#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16803#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:10,042 INFO L273 TraceCheckUtils]: 100: Hoare triple {16803#(<= main_~i~0 25)} assume true; {16803#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:10,043 INFO L273 TraceCheckUtils]: 101: Hoare triple {16803#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16803#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:10,043 INFO L273 TraceCheckUtils]: 102: Hoare triple {16803#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16803#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:10,044 INFO L273 TraceCheckUtils]: 103: Hoare triple {16803#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16804#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:10,044 INFO L273 TraceCheckUtils]: 104: Hoare triple {16804#(<= main_~i~0 26)} assume true; {16804#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:10,045 INFO L273 TraceCheckUtils]: 105: Hoare triple {16804#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16804#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:10,045 INFO L273 TraceCheckUtils]: 106: Hoare triple {16804#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16804#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:10,046 INFO L273 TraceCheckUtils]: 107: Hoare triple {16804#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16805#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:10,046 INFO L273 TraceCheckUtils]: 108: Hoare triple {16805#(<= main_~i~0 27)} assume true; {16805#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:10,047 INFO L273 TraceCheckUtils]: 109: Hoare triple {16805#(<= main_~i~0 27)} assume !(~i~0 < 100000); {16779#false} is VALID [2018-11-14 18:42:10,047 INFO L273 TraceCheckUtils]: 110: Hoare triple {16779#false} havoc ~x~0;~x~0 := 0; {16779#false} is VALID [2018-11-14 18:42:10,048 INFO L273 TraceCheckUtils]: 111: Hoare triple {16779#false} assume true; {16779#false} is VALID [2018-11-14 18:42:10,048 INFO L273 TraceCheckUtils]: 112: Hoare triple {16779#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {16779#false} is VALID [2018-11-14 18:42:10,048 INFO L256 TraceCheckUtils]: 113: Hoare triple {16779#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {16779#false} is VALID [2018-11-14 18:42:10,048 INFO L273 TraceCheckUtils]: 114: Hoare triple {16779#false} ~cond := #in~cond; {16779#false} is VALID [2018-11-14 18:42:10,048 INFO L273 TraceCheckUtils]: 115: Hoare triple {16779#false} assume ~cond == 0; {16779#false} is VALID [2018-11-14 18:42:10,049 INFO L273 TraceCheckUtils]: 116: Hoare triple {16779#false} assume !false; {16779#false} is VALID [2018-11-14 18:42:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:10,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:10,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:42:10,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:42:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:10,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:10,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {16778#true} call ULTIMATE.init(); {16778#true} is VALID [2018-11-14 18:42:10,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {16778#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16778#true} is VALID [2018-11-14 18:42:10,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {16778#true} assume true; {16778#true} is VALID [2018-11-14 18:42:10,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16778#true} {16778#true} #91#return; {16778#true} is VALID [2018-11-14 18:42:10,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {16778#true} call #t~ret13 := main(); {16778#true} is VALID [2018-11-14 18:42:10,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {16778#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {16778#true} is VALID [2018-11-14 18:42:10,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {16778#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {16778#true} is VALID [2018-11-14 18:42:10,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {16778#true} ~i~0 := 2; {16780#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:10,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {16780#(<= main_~i~0 2)} assume true; {16780#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:10,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {16780#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16780#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:10,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {16780#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16780#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:10,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {16780#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16781#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:10,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {16781#(<= main_~i~0 3)} assume true; {16781#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:10,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {16781#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16781#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:10,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {16781#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16781#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:10,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {16781#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16782#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:10,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {16782#(<= main_~i~0 4)} assume true; {16782#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:10,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {16782#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16782#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:10,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {16782#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16782#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:10,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {16782#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16783#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:10,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {16783#(<= main_~i~0 5)} assume true; {16783#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:10,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {16783#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16783#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:10,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {16783#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16783#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:10,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {16783#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16784#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:10,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {16784#(<= main_~i~0 6)} assume true; {16784#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:10,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {16784#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16784#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:10,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {16784#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16784#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:10,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {16784#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16785#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:10,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {16785#(<= main_~i~0 7)} assume true; {16785#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:10,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {16785#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16785#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:10,365 INFO L273 TraceCheckUtils]: 30: Hoare triple {16785#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16785#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:10,371 INFO L273 TraceCheckUtils]: 31: Hoare triple {16785#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16786#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:10,372 INFO L273 TraceCheckUtils]: 32: Hoare triple {16786#(<= main_~i~0 8)} assume true; {16786#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:10,372 INFO L273 TraceCheckUtils]: 33: Hoare triple {16786#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16786#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:10,373 INFO L273 TraceCheckUtils]: 34: Hoare triple {16786#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16786#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:10,374 INFO L273 TraceCheckUtils]: 35: Hoare triple {16786#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16787#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:10,374 INFO L273 TraceCheckUtils]: 36: Hoare triple {16787#(<= main_~i~0 9)} assume true; {16787#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:10,374 INFO L273 TraceCheckUtils]: 37: Hoare triple {16787#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16787#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:10,375 INFO L273 TraceCheckUtils]: 38: Hoare triple {16787#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16787#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:10,375 INFO L273 TraceCheckUtils]: 39: Hoare triple {16787#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16788#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:10,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {16788#(<= main_~i~0 10)} assume true; {16788#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:10,376 INFO L273 TraceCheckUtils]: 41: Hoare triple {16788#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16788#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:10,376 INFO L273 TraceCheckUtils]: 42: Hoare triple {16788#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16788#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:10,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {16788#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16789#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:10,377 INFO L273 TraceCheckUtils]: 44: Hoare triple {16789#(<= main_~i~0 11)} assume true; {16789#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:10,378 INFO L273 TraceCheckUtils]: 45: Hoare triple {16789#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16789#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:10,378 INFO L273 TraceCheckUtils]: 46: Hoare triple {16789#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16789#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:10,379 INFO L273 TraceCheckUtils]: 47: Hoare triple {16789#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16790#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:10,379 INFO L273 TraceCheckUtils]: 48: Hoare triple {16790#(<= main_~i~0 12)} assume true; {16790#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:10,380 INFO L273 TraceCheckUtils]: 49: Hoare triple {16790#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16790#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:10,380 INFO L273 TraceCheckUtils]: 50: Hoare triple {16790#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16790#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:10,381 INFO L273 TraceCheckUtils]: 51: Hoare triple {16790#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16791#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:10,382 INFO L273 TraceCheckUtils]: 52: Hoare triple {16791#(<= main_~i~0 13)} assume true; {16791#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:10,382 INFO L273 TraceCheckUtils]: 53: Hoare triple {16791#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16791#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:10,383 INFO L273 TraceCheckUtils]: 54: Hoare triple {16791#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16791#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:10,383 INFO L273 TraceCheckUtils]: 55: Hoare triple {16791#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16792#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:10,384 INFO L273 TraceCheckUtils]: 56: Hoare triple {16792#(<= main_~i~0 14)} assume true; {16792#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:10,384 INFO L273 TraceCheckUtils]: 57: Hoare triple {16792#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16792#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:10,385 INFO L273 TraceCheckUtils]: 58: Hoare triple {16792#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16792#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:10,386 INFO L273 TraceCheckUtils]: 59: Hoare triple {16792#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16793#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:10,386 INFO L273 TraceCheckUtils]: 60: Hoare triple {16793#(<= main_~i~0 15)} assume true; {16793#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:10,387 INFO L273 TraceCheckUtils]: 61: Hoare triple {16793#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16793#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:10,387 INFO L273 TraceCheckUtils]: 62: Hoare triple {16793#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16793#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:10,388 INFO L273 TraceCheckUtils]: 63: Hoare triple {16793#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16794#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:10,388 INFO L273 TraceCheckUtils]: 64: Hoare triple {16794#(<= main_~i~0 16)} assume true; {16794#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:10,389 INFO L273 TraceCheckUtils]: 65: Hoare triple {16794#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16794#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:10,389 INFO L273 TraceCheckUtils]: 66: Hoare triple {16794#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16794#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:10,390 INFO L273 TraceCheckUtils]: 67: Hoare triple {16794#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16795#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:10,391 INFO L273 TraceCheckUtils]: 68: Hoare triple {16795#(<= main_~i~0 17)} assume true; {16795#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:10,391 INFO L273 TraceCheckUtils]: 69: Hoare triple {16795#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16795#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:10,392 INFO L273 TraceCheckUtils]: 70: Hoare triple {16795#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16795#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:10,392 INFO L273 TraceCheckUtils]: 71: Hoare triple {16795#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16796#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:10,393 INFO L273 TraceCheckUtils]: 72: Hoare triple {16796#(<= main_~i~0 18)} assume true; {16796#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:10,393 INFO L273 TraceCheckUtils]: 73: Hoare triple {16796#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16796#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:10,394 INFO L273 TraceCheckUtils]: 74: Hoare triple {16796#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16796#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:10,395 INFO L273 TraceCheckUtils]: 75: Hoare triple {16796#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16797#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:10,395 INFO L273 TraceCheckUtils]: 76: Hoare triple {16797#(<= main_~i~0 19)} assume true; {16797#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:10,396 INFO L273 TraceCheckUtils]: 77: Hoare triple {16797#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16797#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:10,396 INFO L273 TraceCheckUtils]: 78: Hoare triple {16797#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16797#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:10,397 INFO L273 TraceCheckUtils]: 79: Hoare triple {16797#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16798#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:10,397 INFO L273 TraceCheckUtils]: 80: Hoare triple {16798#(<= main_~i~0 20)} assume true; {16798#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:10,398 INFO L273 TraceCheckUtils]: 81: Hoare triple {16798#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16798#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:10,398 INFO L273 TraceCheckUtils]: 82: Hoare triple {16798#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16798#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:10,399 INFO L273 TraceCheckUtils]: 83: Hoare triple {16798#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16799#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:10,400 INFO L273 TraceCheckUtils]: 84: Hoare triple {16799#(<= main_~i~0 21)} assume true; {16799#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:10,400 INFO L273 TraceCheckUtils]: 85: Hoare triple {16799#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16799#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:10,401 INFO L273 TraceCheckUtils]: 86: Hoare triple {16799#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16799#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:10,401 INFO L273 TraceCheckUtils]: 87: Hoare triple {16799#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16800#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:10,402 INFO L273 TraceCheckUtils]: 88: Hoare triple {16800#(<= main_~i~0 22)} assume true; {16800#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:10,402 INFO L273 TraceCheckUtils]: 89: Hoare triple {16800#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16800#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:10,403 INFO L273 TraceCheckUtils]: 90: Hoare triple {16800#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16800#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:10,404 INFO L273 TraceCheckUtils]: 91: Hoare triple {16800#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16801#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:10,404 INFO L273 TraceCheckUtils]: 92: Hoare triple {16801#(<= main_~i~0 23)} assume true; {16801#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:10,405 INFO L273 TraceCheckUtils]: 93: Hoare triple {16801#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16801#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:10,405 INFO L273 TraceCheckUtils]: 94: Hoare triple {16801#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16801#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:10,406 INFO L273 TraceCheckUtils]: 95: Hoare triple {16801#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16802#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:10,406 INFO L273 TraceCheckUtils]: 96: Hoare triple {16802#(<= main_~i~0 24)} assume true; {16802#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:10,407 INFO L273 TraceCheckUtils]: 97: Hoare triple {16802#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16802#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:10,407 INFO L273 TraceCheckUtils]: 98: Hoare triple {16802#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16802#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:10,412 INFO L273 TraceCheckUtils]: 99: Hoare triple {16802#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16803#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:10,412 INFO L273 TraceCheckUtils]: 100: Hoare triple {16803#(<= main_~i~0 25)} assume true; {16803#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:10,413 INFO L273 TraceCheckUtils]: 101: Hoare triple {16803#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16803#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:10,413 INFO L273 TraceCheckUtils]: 102: Hoare triple {16803#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16803#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:10,413 INFO L273 TraceCheckUtils]: 103: Hoare triple {16803#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16804#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:10,414 INFO L273 TraceCheckUtils]: 104: Hoare triple {16804#(<= main_~i~0 26)} assume true; {16804#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:10,414 INFO L273 TraceCheckUtils]: 105: Hoare triple {16804#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {16804#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:10,414 INFO L273 TraceCheckUtils]: 106: Hoare triple {16804#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16804#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:10,415 INFO L273 TraceCheckUtils]: 107: Hoare triple {16804#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16805#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:10,415 INFO L273 TraceCheckUtils]: 108: Hoare triple {16805#(<= main_~i~0 27)} assume true; {16805#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:10,415 INFO L273 TraceCheckUtils]: 109: Hoare triple {16805#(<= main_~i~0 27)} assume !(~i~0 < 100000); {16779#false} is VALID [2018-11-14 18:42:10,416 INFO L273 TraceCheckUtils]: 110: Hoare triple {16779#false} havoc ~x~0;~x~0 := 0; {16779#false} is VALID [2018-11-14 18:42:10,416 INFO L273 TraceCheckUtils]: 111: Hoare triple {16779#false} assume true; {16779#false} is VALID [2018-11-14 18:42:10,416 INFO L273 TraceCheckUtils]: 112: Hoare triple {16779#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {16779#false} is VALID [2018-11-14 18:42:10,416 INFO L256 TraceCheckUtils]: 113: Hoare triple {16779#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {16779#false} is VALID [2018-11-14 18:42:10,416 INFO L273 TraceCheckUtils]: 114: Hoare triple {16779#false} ~cond := #in~cond; {16779#false} is VALID [2018-11-14 18:42:10,416 INFO L273 TraceCheckUtils]: 115: Hoare triple {16779#false} assume ~cond == 0; {16779#false} is VALID [2018-11-14 18:42:10,416 INFO L273 TraceCheckUtils]: 116: Hoare triple {16779#false} assume !false; {16779#false} is VALID [2018-11-14 18:42:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:10,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:10,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-14 18:42:10,448 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 117 [2018-11-14 18:42:10,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:10,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 18:42:10,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:10,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 18:42:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 18:42:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:42:10,564 INFO L87 Difference]: Start difference. First operand 154 states and 209 transitions. Second operand 28 states. [2018-11-14 18:42:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:11,638 INFO L93 Difference]: Finished difference Result 181 states and 244 transitions. [2018-11-14 18:42:11,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 18:42:11,638 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 117 [2018-11-14 18:42:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:42:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 244 transitions. [2018-11-14 18:42:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:42:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 244 transitions. [2018-11-14 18:42:11,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 244 transitions. [2018-11-14 18:42:11,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:11,869 INFO L225 Difference]: With dead ends: 181 [2018-11-14 18:42:11,870 INFO L226 Difference]: Without dead ends: 162 [2018-11-14 18:42:11,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:42:11,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-14 18:42:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2018-11-14 18:42:11,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:11,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 159 states. [2018-11-14 18:42:11,903 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 159 states. [2018-11-14 18:42:11,903 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 159 states. [2018-11-14 18:42:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:11,906 INFO L93 Difference]: Finished difference Result 162 states and 221 transitions. [2018-11-14 18:42:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 221 transitions. [2018-11-14 18:42:11,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:11,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:11,906 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 162 states. [2018-11-14 18:42:11,906 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 162 states. [2018-11-14 18:42:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:11,909 INFO L93 Difference]: Finished difference Result 162 states and 221 transitions. [2018-11-14 18:42:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 221 transitions. [2018-11-14 18:42:11,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:11,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:11,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:11,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-14 18:42:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 216 transitions. [2018-11-14 18:42:11,913 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 216 transitions. Word has length 117 [2018-11-14 18:42:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:11,913 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 216 transitions. [2018-11-14 18:42:11,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 18:42:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 216 transitions. [2018-11-14 18:42:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-14 18:42:11,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:11,915 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:11,915 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:11,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash -548622880, now seen corresponding path program 26 times [2018-11-14 18:42:11,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:11,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:11,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:42:11,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:13,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {17897#true} call ULTIMATE.init(); {17897#true} is VALID [2018-11-14 18:42:13,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {17897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17897#true} is VALID [2018-11-14 18:42:13,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {17897#true} assume true; {17897#true} is VALID [2018-11-14 18:42:13,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17897#true} {17897#true} #91#return; {17897#true} is VALID [2018-11-14 18:42:13,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {17897#true} call #t~ret13 := main(); {17897#true} is VALID [2018-11-14 18:42:13,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {17897#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {17897#true} is VALID [2018-11-14 18:42:13,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {17897#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {17897#true} is VALID [2018-11-14 18:42:13,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {17897#true} ~i~0 := 2; {17899#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:13,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {17899#(<= main_~i~0 2)} assume true; {17899#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:13,168 INFO L273 TraceCheckUtils]: 9: Hoare triple {17899#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17899#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:13,169 INFO L273 TraceCheckUtils]: 10: Hoare triple {17899#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17899#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:13,169 INFO L273 TraceCheckUtils]: 11: Hoare triple {17899#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17900#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:13,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {17900#(<= main_~i~0 3)} assume true; {17900#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:13,170 INFO L273 TraceCheckUtils]: 13: Hoare triple {17900#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17900#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:13,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {17900#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17900#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:13,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {17900#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17901#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:13,172 INFO L273 TraceCheckUtils]: 16: Hoare triple {17901#(<= main_~i~0 4)} assume true; {17901#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:13,173 INFO L273 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17901#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:13,173 INFO L273 TraceCheckUtils]: 18: Hoare triple {17901#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17901#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:13,174 INFO L273 TraceCheckUtils]: 19: Hoare triple {17901#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17902#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:13,174 INFO L273 TraceCheckUtils]: 20: Hoare triple {17902#(<= main_~i~0 5)} assume true; {17902#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:13,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {17902#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17902#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:13,175 INFO L273 TraceCheckUtils]: 22: Hoare triple {17902#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17902#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:13,176 INFO L273 TraceCheckUtils]: 23: Hoare triple {17902#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17903#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:13,177 INFO L273 TraceCheckUtils]: 24: Hoare triple {17903#(<= main_~i~0 6)} assume true; {17903#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:13,177 INFO L273 TraceCheckUtils]: 25: Hoare triple {17903#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17903#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:13,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {17903#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17903#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:13,178 INFO L273 TraceCheckUtils]: 27: Hoare triple {17903#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17904#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:13,179 INFO L273 TraceCheckUtils]: 28: Hoare triple {17904#(<= main_~i~0 7)} assume true; {17904#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:13,179 INFO L273 TraceCheckUtils]: 29: Hoare triple {17904#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17904#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:13,180 INFO L273 TraceCheckUtils]: 30: Hoare triple {17904#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17904#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:13,180 INFO L273 TraceCheckUtils]: 31: Hoare triple {17904#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17905#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:13,181 INFO L273 TraceCheckUtils]: 32: Hoare triple {17905#(<= main_~i~0 8)} assume true; {17905#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:13,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {17905#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17905#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:13,182 INFO L273 TraceCheckUtils]: 34: Hoare triple {17905#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17905#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:13,183 INFO L273 TraceCheckUtils]: 35: Hoare triple {17905#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17906#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:13,183 INFO L273 TraceCheckUtils]: 36: Hoare triple {17906#(<= main_~i~0 9)} assume true; {17906#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:13,184 INFO L273 TraceCheckUtils]: 37: Hoare triple {17906#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17906#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:13,184 INFO L273 TraceCheckUtils]: 38: Hoare triple {17906#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17906#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:13,185 INFO L273 TraceCheckUtils]: 39: Hoare triple {17906#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17907#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:13,185 INFO L273 TraceCheckUtils]: 40: Hoare triple {17907#(<= main_~i~0 10)} assume true; {17907#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:13,186 INFO L273 TraceCheckUtils]: 41: Hoare triple {17907#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17907#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:13,186 INFO L273 TraceCheckUtils]: 42: Hoare triple {17907#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17907#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:13,187 INFO L273 TraceCheckUtils]: 43: Hoare triple {17907#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17908#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:13,188 INFO L273 TraceCheckUtils]: 44: Hoare triple {17908#(<= main_~i~0 11)} assume true; {17908#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:13,188 INFO L273 TraceCheckUtils]: 45: Hoare triple {17908#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17908#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:13,189 INFO L273 TraceCheckUtils]: 46: Hoare triple {17908#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17908#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:13,189 INFO L273 TraceCheckUtils]: 47: Hoare triple {17908#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17909#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:13,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {17909#(<= main_~i~0 12)} assume true; {17909#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:13,190 INFO L273 TraceCheckUtils]: 49: Hoare triple {17909#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17909#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:13,191 INFO L273 TraceCheckUtils]: 50: Hoare triple {17909#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17909#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:13,192 INFO L273 TraceCheckUtils]: 51: Hoare triple {17909#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17910#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:13,192 INFO L273 TraceCheckUtils]: 52: Hoare triple {17910#(<= main_~i~0 13)} assume true; {17910#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:13,193 INFO L273 TraceCheckUtils]: 53: Hoare triple {17910#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17910#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:13,193 INFO L273 TraceCheckUtils]: 54: Hoare triple {17910#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17910#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:13,194 INFO L273 TraceCheckUtils]: 55: Hoare triple {17910#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17911#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:13,194 INFO L273 TraceCheckUtils]: 56: Hoare triple {17911#(<= main_~i~0 14)} assume true; {17911#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:13,195 INFO L273 TraceCheckUtils]: 57: Hoare triple {17911#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17911#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:13,195 INFO L273 TraceCheckUtils]: 58: Hoare triple {17911#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17911#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:13,196 INFO L273 TraceCheckUtils]: 59: Hoare triple {17911#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17912#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:13,197 INFO L273 TraceCheckUtils]: 60: Hoare triple {17912#(<= main_~i~0 15)} assume true; {17912#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:13,197 INFO L273 TraceCheckUtils]: 61: Hoare triple {17912#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17912#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:13,198 INFO L273 TraceCheckUtils]: 62: Hoare triple {17912#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17912#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:13,198 INFO L273 TraceCheckUtils]: 63: Hoare triple {17912#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17913#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:13,199 INFO L273 TraceCheckUtils]: 64: Hoare triple {17913#(<= main_~i~0 16)} assume true; {17913#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:13,199 INFO L273 TraceCheckUtils]: 65: Hoare triple {17913#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17913#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:13,210 INFO L273 TraceCheckUtils]: 66: Hoare triple {17913#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17913#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:13,210 INFO L273 TraceCheckUtils]: 67: Hoare triple {17913#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17914#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:13,211 INFO L273 TraceCheckUtils]: 68: Hoare triple {17914#(<= main_~i~0 17)} assume true; {17914#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:13,211 INFO L273 TraceCheckUtils]: 69: Hoare triple {17914#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17914#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:13,211 INFO L273 TraceCheckUtils]: 70: Hoare triple {17914#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17914#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:13,212 INFO L273 TraceCheckUtils]: 71: Hoare triple {17914#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17915#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:13,212 INFO L273 TraceCheckUtils]: 72: Hoare triple {17915#(<= main_~i~0 18)} assume true; {17915#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:13,212 INFO L273 TraceCheckUtils]: 73: Hoare triple {17915#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17915#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:13,213 INFO L273 TraceCheckUtils]: 74: Hoare triple {17915#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17915#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:13,213 INFO L273 TraceCheckUtils]: 75: Hoare triple {17915#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17916#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:13,213 INFO L273 TraceCheckUtils]: 76: Hoare triple {17916#(<= main_~i~0 19)} assume true; {17916#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:13,214 INFO L273 TraceCheckUtils]: 77: Hoare triple {17916#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17916#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:13,214 INFO L273 TraceCheckUtils]: 78: Hoare triple {17916#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17916#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:13,214 INFO L273 TraceCheckUtils]: 79: Hoare triple {17916#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17917#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:13,215 INFO L273 TraceCheckUtils]: 80: Hoare triple {17917#(<= main_~i~0 20)} assume true; {17917#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:13,215 INFO L273 TraceCheckUtils]: 81: Hoare triple {17917#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17917#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:13,216 INFO L273 TraceCheckUtils]: 82: Hoare triple {17917#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17917#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:13,217 INFO L273 TraceCheckUtils]: 83: Hoare triple {17917#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17918#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:13,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {17918#(<= main_~i~0 21)} assume true; {17918#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:13,218 INFO L273 TraceCheckUtils]: 85: Hoare triple {17918#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17918#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:13,218 INFO L273 TraceCheckUtils]: 86: Hoare triple {17918#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17918#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:13,219 INFO L273 TraceCheckUtils]: 87: Hoare triple {17918#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17919#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:13,219 INFO L273 TraceCheckUtils]: 88: Hoare triple {17919#(<= main_~i~0 22)} assume true; {17919#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:13,220 INFO L273 TraceCheckUtils]: 89: Hoare triple {17919#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17919#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:13,220 INFO L273 TraceCheckUtils]: 90: Hoare triple {17919#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17919#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:13,221 INFO L273 TraceCheckUtils]: 91: Hoare triple {17919#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17920#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:13,222 INFO L273 TraceCheckUtils]: 92: Hoare triple {17920#(<= main_~i~0 23)} assume true; {17920#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:13,222 INFO L273 TraceCheckUtils]: 93: Hoare triple {17920#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17920#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:13,223 INFO L273 TraceCheckUtils]: 94: Hoare triple {17920#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17920#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:13,223 INFO L273 TraceCheckUtils]: 95: Hoare triple {17920#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17921#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:13,224 INFO L273 TraceCheckUtils]: 96: Hoare triple {17921#(<= main_~i~0 24)} assume true; {17921#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:13,224 INFO L273 TraceCheckUtils]: 97: Hoare triple {17921#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17921#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:13,225 INFO L273 TraceCheckUtils]: 98: Hoare triple {17921#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17921#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:13,225 INFO L273 TraceCheckUtils]: 99: Hoare triple {17921#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17922#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:13,226 INFO L273 TraceCheckUtils]: 100: Hoare triple {17922#(<= main_~i~0 25)} assume true; {17922#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:13,226 INFO L273 TraceCheckUtils]: 101: Hoare triple {17922#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17922#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:13,227 INFO L273 TraceCheckUtils]: 102: Hoare triple {17922#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17922#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:13,228 INFO L273 TraceCheckUtils]: 103: Hoare triple {17922#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17923#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:13,228 INFO L273 TraceCheckUtils]: 104: Hoare triple {17923#(<= main_~i~0 26)} assume true; {17923#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:13,229 INFO L273 TraceCheckUtils]: 105: Hoare triple {17923#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17923#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:13,229 INFO L273 TraceCheckUtils]: 106: Hoare triple {17923#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17923#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:13,230 INFO L273 TraceCheckUtils]: 107: Hoare triple {17923#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17924#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:13,230 INFO L273 TraceCheckUtils]: 108: Hoare triple {17924#(<= main_~i~0 27)} assume true; {17924#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:13,231 INFO L273 TraceCheckUtils]: 109: Hoare triple {17924#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17924#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:13,231 INFO L273 TraceCheckUtils]: 110: Hoare triple {17924#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17924#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:13,232 INFO L273 TraceCheckUtils]: 111: Hoare triple {17924#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17925#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:13,233 INFO L273 TraceCheckUtils]: 112: Hoare triple {17925#(<= main_~i~0 28)} assume true; {17925#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:13,233 INFO L273 TraceCheckUtils]: 113: Hoare triple {17925#(<= main_~i~0 28)} assume !(~i~0 < 100000); {17898#false} is VALID [2018-11-14 18:42:13,233 INFO L273 TraceCheckUtils]: 114: Hoare triple {17898#false} havoc ~x~0;~x~0 := 0; {17898#false} is VALID [2018-11-14 18:42:13,234 INFO L273 TraceCheckUtils]: 115: Hoare triple {17898#false} assume true; {17898#false} is VALID [2018-11-14 18:42:13,234 INFO L273 TraceCheckUtils]: 116: Hoare triple {17898#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {17898#false} is VALID [2018-11-14 18:42:13,234 INFO L256 TraceCheckUtils]: 117: Hoare triple {17898#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {17898#false} is VALID [2018-11-14 18:42:13,234 INFO L273 TraceCheckUtils]: 118: Hoare triple {17898#false} ~cond := #in~cond; {17898#false} is VALID [2018-11-14 18:42:13,234 INFO L273 TraceCheckUtils]: 119: Hoare triple {17898#false} assume ~cond == 0; {17898#false} is VALID [2018-11-14 18:42:13,235 INFO L273 TraceCheckUtils]: 120: Hoare triple {17898#false} assume !false; {17898#false} is VALID [2018-11-14 18:42:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:13,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:13,245 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-14 18:42:13,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:42:13,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:42:13,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:13,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:13,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {17897#true} call ULTIMATE.init(); {17897#true} is VALID [2018-11-14 18:42:13,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {17897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17897#true} is VALID [2018-11-14 18:42:13,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {17897#true} assume true; {17897#true} is VALID [2018-11-14 18:42:13,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17897#true} {17897#true} #91#return; {17897#true} is VALID [2018-11-14 18:42:13,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {17897#true} call #t~ret13 := main(); {17897#true} is VALID [2018-11-14 18:42:13,579 INFO L273 TraceCheckUtils]: 5: Hoare triple {17897#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {17897#true} is VALID [2018-11-14 18:42:13,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {17897#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {17897#true} is VALID [2018-11-14 18:42:13,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {17897#true} ~i~0 := 2; {17899#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:13,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {17899#(<= main_~i~0 2)} assume true; {17899#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:13,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {17899#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17899#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:13,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {17899#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17899#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:13,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {17899#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17900#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:13,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {17900#(<= main_~i~0 3)} assume true; {17900#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:13,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {17900#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17900#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:13,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {17900#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17900#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:13,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {17900#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17901#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:13,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {17901#(<= main_~i~0 4)} assume true; {17901#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:13,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17901#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:13,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {17901#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17901#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:13,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {17901#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17902#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:13,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {17902#(<= main_~i~0 5)} assume true; {17902#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:13,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {17902#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17902#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:13,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {17902#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17902#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:13,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {17902#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17903#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:13,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {17903#(<= main_~i~0 6)} assume true; {17903#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:13,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {17903#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17903#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:13,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {17903#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17903#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:13,589 INFO L273 TraceCheckUtils]: 27: Hoare triple {17903#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17904#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:13,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {17904#(<= main_~i~0 7)} assume true; {17904#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:13,590 INFO L273 TraceCheckUtils]: 29: Hoare triple {17904#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17904#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:13,590 INFO L273 TraceCheckUtils]: 30: Hoare triple {17904#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17904#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:13,591 INFO L273 TraceCheckUtils]: 31: Hoare triple {17904#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17905#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:13,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {17905#(<= main_~i~0 8)} assume true; {17905#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:13,592 INFO L273 TraceCheckUtils]: 33: Hoare triple {17905#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17905#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:13,592 INFO L273 TraceCheckUtils]: 34: Hoare triple {17905#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17905#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:13,593 INFO L273 TraceCheckUtils]: 35: Hoare triple {17905#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17906#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:13,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {17906#(<= main_~i~0 9)} assume true; {17906#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:13,594 INFO L273 TraceCheckUtils]: 37: Hoare triple {17906#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17906#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:13,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {17906#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17906#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:13,595 INFO L273 TraceCheckUtils]: 39: Hoare triple {17906#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17907#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:13,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {17907#(<= main_~i~0 10)} assume true; {17907#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:13,596 INFO L273 TraceCheckUtils]: 41: Hoare triple {17907#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17907#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:13,597 INFO L273 TraceCheckUtils]: 42: Hoare triple {17907#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17907#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:13,598 INFO L273 TraceCheckUtils]: 43: Hoare triple {17907#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17908#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:13,598 INFO L273 TraceCheckUtils]: 44: Hoare triple {17908#(<= main_~i~0 11)} assume true; {17908#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:13,599 INFO L273 TraceCheckUtils]: 45: Hoare triple {17908#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17908#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:13,599 INFO L273 TraceCheckUtils]: 46: Hoare triple {17908#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17908#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:13,600 INFO L273 TraceCheckUtils]: 47: Hoare triple {17908#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17909#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:13,600 INFO L273 TraceCheckUtils]: 48: Hoare triple {17909#(<= main_~i~0 12)} assume true; {17909#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:13,601 INFO L273 TraceCheckUtils]: 49: Hoare triple {17909#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17909#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:13,601 INFO L273 TraceCheckUtils]: 50: Hoare triple {17909#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17909#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:13,602 INFO L273 TraceCheckUtils]: 51: Hoare triple {17909#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17910#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:13,603 INFO L273 TraceCheckUtils]: 52: Hoare triple {17910#(<= main_~i~0 13)} assume true; {17910#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:13,603 INFO L273 TraceCheckUtils]: 53: Hoare triple {17910#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17910#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:13,604 INFO L273 TraceCheckUtils]: 54: Hoare triple {17910#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17910#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:13,604 INFO L273 TraceCheckUtils]: 55: Hoare triple {17910#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17911#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:13,605 INFO L273 TraceCheckUtils]: 56: Hoare triple {17911#(<= main_~i~0 14)} assume true; {17911#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:13,605 INFO L273 TraceCheckUtils]: 57: Hoare triple {17911#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17911#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:13,606 INFO L273 TraceCheckUtils]: 58: Hoare triple {17911#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17911#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:13,607 INFO L273 TraceCheckUtils]: 59: Hoare triple {17911#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17912#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:13,607 INFO L273 TraceCheckUtils]: 60: Hoare triple {17912#(<= main_~i~0 15)} assume true; {17912#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:13,608 INFO L273 TraceCheckUtils]: 61: Hoare triple {17912#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17912#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:13,608 INFO L273 TraceCheckUtils]: 62: Hoare triple {17912#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17912#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:13,609 INFO L273 TraceCheckUtils]: 63: Hoare triple {17912#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17913#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:13,609 INFO L273 TraceCheckUtils]: 64: Hoare triple {17913#(<= main_~i~0 16)} assume true; {17913#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:13,610 INFO L273 TraceCheckUtils]: 65: Hoare triple {17913#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17913#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:13,610 INFO L273 TraceCheckUtils]: 66: Hoare triple {17913#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17913#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:13,611 INFO L273 TraceCheckUtils]: 67: Hoare triple {17913#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17914#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:13,612 INFO L273 TraceCheckUtils]: 68: Hoare triple {17914#(<= main_~i~0 17)} assume true; {17914#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:13,612 INFO L273 TraceCheckUtils]: 69: Hoare triple {17914#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17914#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:13,612 INFO L273 TraceCheckUtils]: 70: Hoare triple {17914#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17914#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:13,613 INFO L273 TraceCheckUtils]: 71: Hoare triple {17914#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17915#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:13,614 INFO L273 TraceCheckUtils]: 72: Hoare triple {17915#(<= main_~i~0 18)} assume true; {17915#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:13,614 INFO L273 TraceCheckUtils]: 73: Hoare triple {17915#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17915#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:13,615 INFO L273 TraceCheckUtils]: 74: Hoare triple {17915#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17915#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:13,615 INFO L273 TraceCheckUtils]: 75: Hoare triple {17915#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17916#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:13,616 INFO L273 TraceCheckUtils]: 76: Hoare triple {17916#(<= main_~i~0 19)} assume true; {17916#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:13,616 INFO L273 TraceCheckUtils]: 77: Hoare triple {17916#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17916#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:13,617 INFO L273 TraceCheckUtils]: 78: Hoare triple {17916#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17916#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:13,618 INFO L273 TraceCheckUtils]: 79: Hoare triple {17916#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17917#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:13,618 INFO L273 TraceCheckUtils]: 80: Hoare triple {17917#(<= main_~i~0 20)} assume true; {17917#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:13,619 INFO L273 TraceCheckUtils]: 81: Hoare triple {17917#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17917#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:13,619 INFO L273 TraceCheckUtils]: 82: Hoare triple {17917#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17917#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:13,620 INFO L273 TraceCheckUtils]: 83: Hoare triple {17917#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17918#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:13,620 INFO L273 TraceCheckUtils]: 84: Hoare triple {17918#(<= main_~i~0 21)} assume true; {17918#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:13,621 INFO L273 TraceCheckUtils]: 85: Hoare triple {17918#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17918#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:13,621 INFO L273 TraceCheckUtils]: 86: Hoare triple {17918#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17918#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:13,622 INFO L273 TraceCheckUtils]: 87: Hoare triple {17918#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17919#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:13,623 INFO L273 TraceCheckUtils]: 88: Hoare triple {17919#(<= main_~i~0 22)} assume true; {17919#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:13,623 INFO L273 TraceCheckUtils]: 89: Hoare triple {17919#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17919#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:13,624 INFO L273 TraceCheckUtils]: 90: Hoare triple {17919#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17919#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:13,624 INFO L273 TraceCheckUtils]: 91: Hoare triple {17919#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17920#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:13,625 INFO L273 TraceCheckUtils]: 92: Hoare triple {17920#(<= main_~i~0 23)} assume true; {17920#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:13,625 INFO L273 TraceCheckUtils]: 93: Hoare triple {17920#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17920#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:13,626 INFO L273 TraceCheckUtils]: 94: Hoare triple {17920#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17920#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:13,627 INFO L273 TraceCheckUtils]: 95: Hoare triple {17920#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17921#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:13,627 INFO L273 TraceCheckUtils]: 96: Hoare triple {17921#(<= main_~i~0 24)} assume true; {17921#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:13,628 INFO L273 TraceCheckUtils]: 97: Hoare triple {17921#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17921#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:13,628 INFO L273 TraceCheckUtils]: 98: Hoare triple {17921#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17921#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:13,629 INFO L273 TraceCheckUtils]: 99: Hoare triple {17921#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17922#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:13,629 INFO L273 TraceCheckUtils]: 100: Hoare triple {17922#(<= main_~i~0 25)} assume true; {17922#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:13,630 INFO L273 TraceCheckUtils]: 101: Hoare triple {17922#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17922#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:13,630 INFO L273 TraceCheckUtils]: 102: Hoare triple {17922#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17922#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:13,631 INFO L273 TraceCheckUtils]: 103: Hoare triple {17922#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17923#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:13,632 INFO L273 TraceCheckUtils]: 104: Hoare triple {17923#(<= main_~i~0 26)} assume true; {17923#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:13,632 INFO L273 TraceCheckUtils]: 105: Hoare triple {17923#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17923#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:13,632 INFO L273 TraceCheckUtils]: 106: Hoare triple {17923#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17923#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:13,633 INFO L273 TraceCheckUtils]: 107: Hoare triple {17923#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17924#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:13,634 INFO L273 TraceCheckUtils]: 108: Hoare triple {17924#(<= main_~i~0 27)} assume true; {17924#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:13,634 INFO L273 TraceCheckUtils]: 109: Hoare triple {17924#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {17924#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:13,635 INFO L273 TraceCheckUtils]: 110: Hoare triple {17924#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17924#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:13,635 INFO L273 TraceCheckUtils]: 111: Hoare triple {17924#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17925#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:13,636 INFO L273 TraceCheckUtils]: 112: Hoare triple {17925#(<= main_~i~0 28)} assume true; {17925#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:13,637 INFO L273 TraceCheckUtils]: 113: Hoare triple {17925#(<= main_~i~0 28)} assume !(~i~0 < 100000); {17898#false} is VALID [2018-11-14 18:42:13,637 INFO L273 TraceCheckUtils]: 114: Hoare triple {17898#false} havoc ~x~0;~x~0 := 0; {17898#false} is VALID [2018-11-14 18:42:13,637 INFO L273 TraceCheckUtils]: 115: Hoare triple {17898#false} assume true; {17898#false} is VALID [2018-11-14 18:42:13,637 INFO L273 TraceCheckUtils]: 116: Hoare triple {17898#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {17898#false} is VALID [2018-11-14 18:42:13,637 INFO L256 TraceCheckUtils]: 117: Hoare triple {17898#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {17898#false} is VALID [2018-11-14 18:42:13,638 INFO L273 TraceCheckUtils]: 118: Hoare triple {17898#false} ~cond := #in~cond; {17898#false} is VALID [2018-11-14 18:42:13,638 INFO L273 TraceCheckUtils]: 119: Hoare triple {17898#false} assume ~cond == 0; {17898#false} is VALID [2018-11-14 18:42:13,638 INFO L273 TraceCheckUtils]: 120: Hoare triple {17898#false} assume !false; {17898#false} is VALID [2018-11-14 18:42:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:13,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:13,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-14 18:42:13,669 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 121 [2018-11-14 18:42:13,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:13,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 18:42:13,779 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-14 18:42:13,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 18:42:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 18:42:13,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:42:13,780 INFO L87 Difference]: Start difference. First operand 159 states and 216 transitions. Second operand 29 states. [2018-11-14 18:42:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:14,828 INFO L93 Difference]: Finished difference Result 186 states and 251 transitions. [2018-11-14 18:42:14,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 18:42:14,828 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 121 [2018-11-14 18:42:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:42:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 251 transitions. [2018-11-14 18:42:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:42:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 251 transitions. [2018-11-14 18:42:14,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 251 transitions. [2018-11-14 18:42:15,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:15,072 INFO L225 Difference]: With dead ends: 186 [2018-11-14 18:42:15,072 INFO L226 Difference]: Without dead ends: 167 [2018-11-14 18:42:15,073 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:42:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-14 18:42:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2018-11-14 18:42:15,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:15,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 164 states. [2018-11-14 18:42:15,195 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 164 states. [2018-11-14 18:42:15,196 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 164 states. [2018-11-14 18:42:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:15,198 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions. [2018-11-14 18:42:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 228 transitions. [2018-11-14 18:42:15,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:15,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:15,199 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 167 states. [2018-11-14 18:42:15,199 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 167 states. [2018-11-14 18:42:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:15,202 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions. [2018-11-14 18:42:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 228 transitions. [2018-11-14 18:42:15,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:15,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:15,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:15,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-14 18:42:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 223 transitions. [2018-11-14 18:42:15,205 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 223 transitions. Word has length 121 [2018-11-14 18:42:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:15,206 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 223 transitions. [2018-11-14 18:42:15,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 18:42:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 223 transitions. [2018-11-14 18:42:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-14 18:42:15,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:15,207 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:15,207 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:15,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:15,207 INFO L82 PathProgramCache]: Analyzing trace with hash 72895186, now seen corresponding path program 27 times [2018-11-14 18:42:15,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:15,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:15,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:16,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {19051#true} call ULTIMATE.init(); {19051#true} is VALID [2018-11-14 18:42:16,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {19051#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19051#true} is VALID [2018-11-14 18:42:16,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {19051#true} assume true; {19051#true} is VALID [2018-11-14 18:42:16,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19051#true} {19051#true} #91#return; {19051#true} is VALID [2018-11-14 18:42:16,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {19051#true} call #t~ret13 := main(); {19051#true} is VALID [2018-11-14 18:42:16,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {19051#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {19051#true} is VALID [2018-11-14 18:42:16,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {19051#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {19051#true} is VALID [2018-11-14 18:42:16,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {19051#true} ~i~0 := 2; {19053#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:16,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {19053#(<= main_~i~0 2)} assume true; {19053#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:16,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {19053#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19053#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:16,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {19053#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19053#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:16,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {19053#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19054#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:16,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {19054#(<= main_~i~0 3)} assume true; {19054#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:16,745 INFO L273 TraceCheckUtils]: 13: Hoare triple {19054#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19054#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:16,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {19054#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19054#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:16,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {19054#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19055#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:16,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {19055#(<= main_~i~0 4)} assume true; {19055#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:16,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {19055#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19055#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:16,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {19055#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19055#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:16,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {19055#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19056#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:16,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {19056#(<= main_~i~0 5)} assume true; {19056#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:16,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {19056#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19056#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:16,749 INFO L273 TraceCheckUtils]: 22: Hoare triple {19056#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19056#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:16,749 INFO L273 TraceCheckUtils]: 23: Hoare triple {19056#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19057#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:16,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {19057#(<= main_~i~0 6)} assume true; {19057#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:16,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {19057#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19057#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:16,751 INFO L273 TraceCheckUtils]: 26: Hoare triple {19057#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19057#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:16,752 INFO L273 TraceCheckUtils]: 27: Hoare triple {19057#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19058#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:16,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {19058#(<= main_~i~0 7)} assume true; {19058#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:16,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {19058#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19058#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:16,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {19058#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19058#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:16,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {19058#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19059#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:16,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {19059#(<= main_~i~0 8)} assume true; {19059#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:16,755 INFO L273 TraceCheckUtils]: 33: Hoare triple {19059#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19059#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:16,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {19059#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19059#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:16,756 INFO L273 TraceCheckUtils]: 35: Hoare triple {19059#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19060#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:16,757 INFO L273 TraceCheckUtils]: 36: Hoare triple {19060#(<= main_~i~0 9)} assume true; {19060#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:16,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {19060#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19060#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:16,758 INFO L273 TraceCheckUtils]: 38: Hoare triple {19060#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19060#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:16,758 INFO L273 TraceCheckUtils]: 39: Hoare triple {19060#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19061#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:16,760 INFO L273 TraceCheckUtils]: 40: Hoare triple {19061#(<= main_~i~0 10)} assume true; {19061#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:16,760 INFO L273 TraceCheckUtils]: 41: Hoare triple {19061#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19061#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:16,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {19061#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19061#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:16,762 INFO L273 TraceCheckUtils]: 43: Hoare triple {19061#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19062#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:16,762 INFO L273 TraceCheckUtils]: 44: Hoare triple {19062#(<= main_~i~0 11)} assume true; {19062#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:16,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {19062#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19062#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:16,763 INFO L273 TraceCheckUtils]: 46: Hoare triple {19062#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19062#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:16,764 INFO L273 TraceCheckUtils]: 47: Hoare triple {19062#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19063#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:16,764 INFO L273 TraceCheckUtils]: 48: Hoare triple {19063#(<= main_~i~0 12)} assume true; {19063#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:16,765 INFO L273 TraceCheckUtils]: 49: Hoare triple {19063#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19063#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:16,765 INFO L273 TraceCheckUtils]: 50: Hoare triple {19063#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19063#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:16,766 INFO L273 TraceCheckUtils]: 51: Hoare triple {19063#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19064#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:16,766 INFO L273 TraceCheckUtils]: 52: Hoare triple {19064#(<= main_~i~0 13)} assume true; {19064#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:16,767 INFO L273 TraceCheckUtils]: 53: Hoare triple {19064#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19064#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:16,767 INFO L273 TraceCheckUtils]: 54: Hoare triple {19064#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19064#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:16,768 INFO L273 TraceCheckUtils]: 55: Hoare triple {19064#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19065#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:16,769 INFO L273 TraceCheckUtils]: 56: Hoare triple {19065#(<= main_~i~0 14)} assume true; {19065#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:16,769 INFO L273 TraceCheckUtils]: 57: Hoare triple {19065#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19065#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:16,770 INFO L273 TraceCheckUtils]: 58: Hoare triple {19065#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19065#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:16,770 INFO L273 TraceCheckUtils]: 59: Hoare triple {19065#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19066#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:16,771 INFO L273 TraceCheckUtils]: 60: Hoare triple {19066#(<= main_~i~0 15)} assume true; {19066#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:16,772 INFO L273 TraceCheckUtils]: 61: Hoare triple {19066#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19066#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:16,772 INFO L273 TraceCheckUtils]: 62: Hoare triple {19066#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19066#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:16,773 INFO L273 TraceCheckUtils]: 63: Hoare triple {19066#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19067#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:16,773 INFO L273 TraceCheckUtils]: 64: Hoare triple {19067#(<= main_~i~0 16)} assume true; {19067#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:16,774 INFO L273 TraceCheckUtils]: 65: Hoare triple {19067#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19067#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:16,774 INFO L273 TraceCheckUtils]: 66: Hoare triple {19067#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19067#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:16,775 INFO L273 TraceCheckUtils]: 67: Hoare triple {19067#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19068#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:16,775 INFO L273 TraceCheckUtils]: 68: Hoare triple {19068#(<= main_~i~0 17)} assume true; {19068#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:16,776 INFO L273 TraceCheckUtils]: 69: Hoare triple {19068#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19068#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:16,776 INFO L273 TraceCheckUtils]: 70: Hoare triple {19068#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19068#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:16,777 INFO L273 TraceCheckUtils]: 71: Hoare triple {19068#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19069#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:16,778 INFO L273 TraceCheckUtils]: 72: Hoare triple {19069#(<= main_~i~0 18)} assume true; {19069#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:16,778 INFO L273 TraceCheckUtils]: 73: Hoare triple {19069#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19069#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:16,779 INFO L273 TraceCheckUtils]: 74: Hoare triple {19069#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19069#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:16,779 INFO L273 TraceCheckUtils]: 75: Hoare triple {19069#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19070#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:16,780 INFO L273 TraceCheckUtils]: 76: Hoare triple {19070#(<= main_~i~0 19)} assume true; {19070#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:16,780 INFO L273 TraceCheckUtils]: 77: Hoare triple {19070#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19070#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:16,781 INFO L273 TraceCheckUtils]: 78: Hoare triple {19070#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19070#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:16,782 INFO L273 TraceCheckUtils]: 79: Hoare triple {19070#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19071#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:16,782 INFO L273 TraceCheckUtils]: 80: Hoare triple {19071#(<= main_~i~0 20)} assume true; {19071#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:16,783 INFO L273 TraceCheckUtils]: 81: Hoare triple {19071#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19071#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:16,783 INFO L273 TraceCheckUtils]: 82: Hoare triple {19071#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19071#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:16,784 INFO L273 TraceCheckUtils]: 83: Hoare triple {19071#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19072#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:16,784 INFO L273 TraceCheckUtils]: 84: Hoare triple {19072#(<= main_~i~0 21)} assume true; {19072#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:16,785 INFO L273 TraceCheckUtils]: 85: Hoare triple {19072#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19072#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:16,785 INFO L273 TraceCheckUtils]: 86: Hoare triple {19072#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19072#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:16,786 INFO L273 TraceCheckUtils]: 87: Hoare triple {19072#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19073#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:16,787 INFO L273 TraceCheckUtils]: 88: Hoare triple {19073#(<= main_~i~0 22)} assume true; {19073#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:16,787 INFO L273 TraceCheckUtils]: 89: Hoare triple {19073#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19073#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:16,788 INFO L273 TraceCheckUtils]: 90: Hoare triple {19073#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19073#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:16,788 INFO L273 TraceCheckUtils]: 91: Hoare triple {19073#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19074#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:16,789 INFO L273 TraceCheckUtils]: 92: Hoare triple {19074#(<= main_~i~0 23)} assume true; {19074#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:16,789 INFO L273 TraceCheckUtils]: 93: Hoare triple {19074#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19074#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:16,790 INFO L273 TraceCheckUtils]: 94: Hoare triple {19074#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19074#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:16,791 INFO L273 TraceCheckUtils]: 95: Hoare triple {19074#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19075#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:16,791 INFO L273 TraceCheckUtils]: 96: Hoare triple {19075#(<= main_~i~0 24)} assume true; {19075#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:16,792 INFO L273 TraceCheckUtils]: 97: Hoare triple {19075#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19075#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:16,792 INFO L273 TraceCheckUtils]: 98: Hoare triple {19075#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19075#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:16,793 INFO L273 TraceCheckUtils]: 99: Hoare triple {19075#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19076#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:16,793 INFO L273 TraceCheckUtils]: 100: Hoare triple {19076#(<= main_~i~0 25)} assume true; {19076#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:16,794 INFO L273 TraceCheckUtils]: 101: Hoare triple {19076#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19076#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:16,794 INFO L273 TraceCheckUtils]: 102: Hoare triple {19076#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19076#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:16,795 INFO L273 TraceCheckUtils]: 103: Hoare triple {19076#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19077#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:16,795 INFO L273 TraceCheckUtils]: 104: Hoare triple {19077#(<= main_~i~0 26)} assume true; {19077#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:16,796 INFO L273 TraceCheckUtils]: 105: Hoare triple {19077#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19077#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:16,796 INFO L273 TraceCheckUtils]: 106: Hoare triple {19077#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19077#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:16,797 INFO L273 TraceCheckUtils]: 107: Hoare triple {19077#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19078#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:16,798 INFO L273 TraceCheckUtils]: 108: Hoare triple {19078#(<= main_~i~0 27)} assume true; {19078#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:16,798 INFO L273 TraceCheckUtils]: 109: Hoare triple {19078#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19078#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:16,799 INFO L273 TraceCheckUtils]: 110: Hoare triple {19078#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19078#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:16,799 INFO L273 TraceCheckUtils]: 111: Hoare triple {19078#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19079#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:16,800 INFO L273 TraceCheckUtils]: 112: Hoare triple {19079#(<= main_~i~0 28)} assume true; {19079#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:16,800 INFO L273 TraceCheckUtils]: 113: Hoare triple {19079#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19079#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:16,801 INFO L273 TraceCheckUtils]: 114: Hoare triple {19079#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19079#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:16,802 INFO L273 TraceCheckUtils]: 115: Hoare triple {19079#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19080#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:16,802 INFO L273 TraceCheckUtils]: 116: Hoare triple {19080#(<= main_~i~0 29)} assume true; {19080#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:16,803 INFO L273 TraceCheckUtils]: 117: Hoare triple {19080#(<= main_~i~0 29)} assume !(~i~0 < 100000); {19052#false} is VALID [2018-11-14 18:42:16,803 INFO L273 TraceCheckUtils]: 118: Hoare triple {19052#false} havoc ~x~0;~x~0 := 0; {19052#false} is VALID [2018-11-14 18:42:16,803 INFO L273 TraceCheckUtils]: 119: Hoare triple {19052#false} assume true; {19052#false} is VALID [2018-11-14 18:42:16,803 INFO L273 TraceCheckUtils]: 120: Hoare triple {19052#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {19052#false} is VALID [2018-11-14 18:42:16,804 INFO L256 TraceCheckUtils]: 121: Hoare triple {19052#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {19052#false} is VALID [2018-11-14 18:42:16,804 INFO L273 TraceCheckUtils]: 122: Hoare triple {19052#false} ~cond := #in~cond; {19052#false} is VALID [2018-11-14 18:42:16,804 INFO L273 TraceCheckUtils]: 123: Hoare triple {19052#false} assume ~cond == 0; {19052#false} is VALID [2018-11-14 18:42:16,804 INFO L273 TraceCheckUtils]: 124: Hoare triple {19052#false} assume !false; {19052#false} is VALID [2018-11-14 18:42:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:16,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:16,816 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-14 18:42:16,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:42:16,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-14 18:42:16,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:16,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:17,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {19051#true} call ULTIMATE.init(); {19051#true} is VALID [2018-11-14 18:42:17,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {19051#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19051#true} is VALID [2018-11-14 18:42:17,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {19051#true} assume true; {19051#true} is VALID [2018-11-14 18:42:17,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19051#true} {19051#true} #91#return; {19051#true} is VALID [2018-11-14 18:42:17,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {19051#true} call #t~ret13 := main(); {19051#true} is VALID [2018-11-14 18:42:17,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {19051#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {19051#true} is VALID [2018-11-14 18:42:17,292 INFO L273 TraceCheckUtils]: 6: Hoare triple {19051#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {19051#true} is VALID [2018-11-14 18:42:17,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {19051#true} ~i~0 := 2; {19053#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:17,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {19053#(<= main_~i~0 2)} assume true; {19053#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:17,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {19053#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19053#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:17,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {19053#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19053#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:17,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {19053#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19054#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:17,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {19054#(<= main_~i~0 3)} assume true; {19054#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:17,295 INFO L273 TraceCheckUtils]: 13: Hoare triple {19054#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19054#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:17,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {19054#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19054#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:17,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {19054#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19055#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:17,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {19055#(<= main_~i~0 4)} assume true; {19055#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:17,297 INFO L273 TraceCheckUtils]: 17: Hoare triple {19055#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19055#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:17,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {19055#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19055#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:17,299 INFO L273 TraceCheckUtils]: 19: Hoare triple {19055#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19056#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:17,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {19056#(<= main_~i~0 5)} assume true; {19056#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:17,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {19056#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19056#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:17,300 INFO L273 TraceCheckUtils]: 22: Hoare triple {19056#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19056#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:17,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {19056#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19057#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:17,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {19057#(<= main_~i~0 6)} assume true; {19057#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:17,302 INFO L273 TraceCheckUtils]: 25: Hoare triple {19057#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19057#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:17,302 INFO L273 TraceCheckUtils]: 26: Hoare triple {19057#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19057#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:17,303 INFO L273 TraceCheckUtils]: 27: Hoare triple {19057#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19058#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:17,304 INFO L273 TraceCheckUtils]: 28: Hoare triple {19058#(<= main_~i~0 7)} assume true; {19058#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:17,304 INFO L273 TraceCheckUtils]: 29: Hoare triple {19058#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19058#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:17,305 INFO L273 TraceCheckUtils]: 30: Hoare triple {19058#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19058#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:17,305 INFO L273 TraceCheckUtils]: 31: Hoare triple {19058#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19059#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:17,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {19059#(<= main_~i~0 8)} assume true; {19059#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:17,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {19059#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19059#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:17,307 INFO L273 TraceCheckUtils]: 34: Hoare triple {19059#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19059#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:17,308 INFO L273 TraceCheckUtils]: 35: Hoare triple {19059#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19060#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:17,308 INFO L273 TraceCheckUtils]: 36: Hoare triple {19060#(<= main_~i~0 9)} assume true; {19060#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:17,309 INFO L273 TraceCheckUtils]: 37: Hoare triple {19060#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19060#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:17,309 INFO L273 TraceCheckUtils]: 38: Hoare triple {19060#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19060#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:17,310 INFO L273 TraceCheckUtils]: 39: Hoare triple {19060#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19061#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:17,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {19061#(<= main_~i~0 10)} assume true; {19061#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:17,311 INFO L273 TraceCheckUtils]: 41: Hoare triple {19061#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19061#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:17,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {19061#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19061#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:17,312 INFO L273 TraceCheckUtils]: 43: Hoare triple {19061#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19062#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:17,313 INFO L273 TraceCheckUtils]: 44: Hoare triple {19062#(<= main_~i~0 11)} assume true; {19062#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:17,313 INFO L273 TraceCheckUtils]: 45: Hoare triple {19062#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19062#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:17,314 INFO L273 TraceCheckUtils]: 46: Hoare triple {19062#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19062#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:17,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {19062#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19063#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:17,315 INFO L273 TraceCheckUtils]: 48: Hoare triple {19063#(<= main_~i~0 12)} assume true; {19063#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:17,315 INFO L273 TraceCheckUtils]: 49: Hoare triple {19063#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19063#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:17,316 INFO L273 TraceCheckUtils]: 50: Hoare triple {19063#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19063#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:17,316 INFO L273 TraceCheckUtils]: 51: Hoare triple {19063#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19064#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:17,317 INFO L273 TraceCheckUtils]: 52: Hoare triple {19064#(<= main_~i~0 13)} assume true; {19064#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:17,318 INFO L273 TraceCheckUtils]: 53: Hoare triple {19064#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19064#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:17,318 INFO L273 TraceCheckUtils]: 54: Hoare triple {19064#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19064#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:17,319 INFO L273 TraceCheckUtils]: 55: Hoare triple {19064#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19065#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:17,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {19065#(<= main_~i~0 14)} assume true; {19065#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:17,320 INFO L273 TraceCheckUtils]: 57: Hoare triple {19065#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19065#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:17,320 INFO L273 TraceCheckUtils]: 58: Hoare triple {19065#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19065#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:17,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {19065#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19066#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:17,322 INFO L273 TraceCheckUtils]: 60: Hoare triple {19066#(<= main_~i~0 15)} assume true; {19066#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:17,322 INFO L273 TraceCheckUtils]: 61: Hoare triple {19066#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19066#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:17,323 INFO L273 TraceCheckUtils]: 62: Hoare triple {19066#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19066#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:17,323 INFO L273 TraceCheckUtils]: 63: Hoare triple {19066#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19067#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:17,324 INFO L273 TraceCheckUtils]: 64: Hoare triple {19067#(<= main_~i~0 16)} assume true; {19067#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:17,324 INFO L273 TraceCheckUtils]: 65: Hoare triple {19067#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19067#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:17,325 INFO L273 TraceCheckUtils]: 66: Hoare triple {19067#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19067#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:17,325 INFO L273 TraceCheckUtils]: 67: Hoare triple {19067#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19068#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:17,326 INFO L273 TraceCheckUtils]: 68: Hoare triple {19068#(<= main_~i~0 17)} assume true; {19068#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:17,327 INFO L273 TraceCheckUtils]: 69: Hoare triple {19068#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19068#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:17,327 INFO L273 TraceCheckUtils]: 70: Hoare triple {19068#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19068#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:17,328 INFO L273 TraceCheckUtils]: 71: Hoare triple {19068#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19069#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:17,328 INFO L273 TraceCheckUtils]: 72: Hoare triple {19069#(<= main_~i~0 18)} assume true; {19069#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:17,329 INFO L273 TraceCheckUtils]: 73: Hoare triple {19069#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19069#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:17,329 INFO L273 TraceCheckUtils]: 74: Hoare triple {19069#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19069#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:17,330 INFO L273 TraceCheckUtils]: 75: Hoare triple {19069#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19070#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:17,330 INFO L273 TraceCheckUtils]: 76: Hoare triple {19070#(<= main_~i~0 19)} assume true; {19070#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:17,331 INFO L273 TraceCheckUtils]: 77: Hoare triple {19070#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19070#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:17,331 INFO L273 TraceCheckUtils]: 78: Hoare triple {19070#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19070#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:17,332 INFO L273 TraceCheckUtils]: 79: Hoare triple {19070#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19071#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:17,333 INFO L273 TraceCheckUtils]: 80: Hoare triple {19071#(<= main_~i~0 20)} assume true; {19071#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:17,333 INFO L273 TraceCheckUtils]: 81: Hoare triple {19071#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19071#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:17,334 INFO L273 TraceCheckUtils]: 82: Hoare triple {19071#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19071#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:17,334 INFO L273 TraceCheckUtils]: 83: Hoare triple {19071#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19072#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:17,335 INFO L273 TraceCheckUtils]: 84: Hoare triple {19072#(<= main_~i~0 21)} assume true; {19072#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:17,335 INFO L273 TraceCheckUtils]: 85: Hoare triple {19072#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19072#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:17,336 INFO L273 TraceCheckUtils]: 86: Hoare triple {19072#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19072#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:17,337 INFO L273 TraceCheckUtils]: 87: Hoare triple {19072#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19073#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:17,337 INFO L273 TraceCheckUtils]: 88: Hoare triple {19073#(<= main_~i~0 22)} assume true; {19073#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:17,338 INFO L273 TraceCheckUtils]: 89: Hoare triple {19073#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19073#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:17,338 INFO L273 TraceCheckUtils]: 90: Hoare triple {19073#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19073#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:17,339 INFO L273 TraceCheckUtils]: 91: Hoare triple {19073#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19074#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:17,339 INFO L273 TraceCheckUtils]: 92: Hoare triple {19074#(<= main_~i~0 23)} assume true; {19074#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:17,340 INFO L273 TraceCheckUtils]: 93: Hoare triple {19074#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19074#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:17,340 INFO L273 TraceCheckUtils]: 94: Hoare triple {19074#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19074#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:17,341 INFO L273 TraceCheckUtils]: 95: Hoare triple {19074#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19075#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:17,342 INFO L273 TraceCheckUtils]: 96: Hoare triple {19075#(<= main_~i~0 24)} assume true; {19075#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:17,342 INFO L273 TraceCheckUtils]: 97: Hoare triple {19075#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19075#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:17,343 INFO L273 TraceCheckUtils]: 98: Hoare triple {19075#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19075#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:17,343 INFO L273 TraceCheckUtils]: 99: Hoare triple {19075#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19076#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:17,344 INFO L273 TraceCheckUtils]: 100: Hoare triple {19076#(<= main_~i~0 25)} assume true; {19076#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:17,344 INFO L273 TraceCheckUtils]: 101: Hoare triple {19076#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19076#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:17,345 INFO L273 TraceCheckUtils]: 102: Hoare triple {19076#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19076#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:17,346 INFO L273 TraceCheckUtils]: 103: Hoare triple {19076#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19077#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:17,346 INFO L273 TraceCheckUtils]: 104: Hoare triple {19077#(<= main_~i~0 26)} assume true; {19077#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:17,347 INFO L273 TraceCheckUtils]: 105: Hoare triple {19077#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19077#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:17,347 INFO L273 TraceCheckUtils]: 106: Hoare triple {19077#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19077#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:17,348 INFO L273 TraceCheckUtils]: 107: Hoare triple {19077#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19078#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:17,348 INFO L273 TraceCheckUtils]: 108: Hoare triple {19078#(<= main_~i~0 27)} assume true; {19078#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:17,349 INFO L273 TraceCheckUtils]: 109: Hoare triple {19078#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19078#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:17,349 INFO L273 TraceCheckUtils]: 110: Hoare triple {19078#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19078#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:17,350 INFO L273 TraceCheckUtils]: 111: Hoare triple {19078#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19079#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:17,351 INFO L273 TraceCheckUtils]: 112: Hoare triple {19079#(<= main_~i~0 28)} assume true; {19079#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:17,351 INFO L273 TraceCheckUtils]: 113: Hoare triple {19079#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {19079#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:17,352 INFO L273 TraceCheckUtils]: 114: Hoare triple {19079#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {19079#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:17,352 INFO L273 TraceCheckUtils]: 115: Hoare triple {19079#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {19080#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:17,353 INFO L273 TraceCheckUtils]: 116: Hoare triple {19080#(<= main_~i~0 29)} assume true; {19080#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:17,353 INFO L273 TraceCheckUtils]: 117: Hoare triple {19080#(<= main_~i~0 29)} assume !(~i~0 < 100000); {19052#false} is VALID [2018-11-14 18:42:17,354 INFO L273 TraceCheckUtils]: 118: Hoare triple {19052#false} havoc ~x~0;~x~0 := 0; {19052#false} is VALID [2018-11-14 18:42:17,354 INFO L273 TraceCheckUtils]: 119: Hoare triple {19052#false} assume true; {19052#false} is VALID [2018-11-14 18:42:17,354 INFO L273 TraceCheckUtils]: 120: Hoare triple {19052#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {19052#false} is VALID [2018-11-14 18:42:17,354 INFO L256 TraceCheckUtils]: 121: Hoare triple {19052#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {19052#false} is VALID [2018-11-14 18:42:17,354 INFO L273 TraceCheckUtils]: 122: Hoare triple {19052#false} ~cond := #in~cond; {19052#false} is VALID [2018-11-14 18:42:17,355 INFO L273 TraceCheckUtils]: 123: Hoare triple {19052#false} assume ~cond == 0; {19052#false} is VALID [2018-11-14 18:42:17,355 INFO L273 TraceCheckUtils]: 124: Hoare triple {19052#false} assume !false; {19052#false} is VALID [2018-11-14 18:42:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:17,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:17,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-11-14 18:42:17,386 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 125 [2018-11-14 18:42:17,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:17,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 18:42:17,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:17,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 18:42:17,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 18:42:17,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:42:17,501 INFO L87 Difference]: Start difference. First operand 164 states and 223 transitions. Second operand 30 states. [2018-11-14 18:42:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:18,344 INFO L93 Difference]: Finished difference Result 191 states and 258 transitions. [2018-11-14 18:42:18,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 18:42:18,344 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 125 [2018-11-14 18:42:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:42:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 258 transitions. [2018-11-14 18:42:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:42:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 258 transitions. [2018-11-14 18:42:18,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 258 transitions. [2018-11-14 18:42:18,588 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-14 18:42:18,592 INFO L225 Difference]: With dead ends: 191 [2018-11-14 18:42:18,592 INFO L226 Difference]: Without dead ends: 172 [2018-11-14 18:42:18,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:42:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-14 18:42:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2018-11-14 18:42:18,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:18,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 169 states. [2018-11-14 18:42:18,918 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 169 states. [2018-11-14 18:42:18,918 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 169 states. [2018-11-14 18:42:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:18,921 INFO L93 Difference]: Finished difference Result 172 states and 235 transitions. [2018-11-14 18:42:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 235 transitions. [2018-11-14 18:42:18,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:18,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:18,922 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 172 states. [2018-11-14 18:42:18,922 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 172 states. [2018-11-14 18:42:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:18,924 INFO L93 Difference]: Finished difference Result 172 states and 235 transitions. [2018-11-14 18:42:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 235 transitions. [2018-11-14 18:42:18,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:18,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:18,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:18,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-14 18:42:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 230 transitions. [2018-11-14 18:42:18,927 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 230 transitions. Word has length 125 [2018-11-14 18:42:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:18,927 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 230 transitions. [2018-11-14 18:42:18,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 18:42:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 230 transitions. [2018-11-14 18:42:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-14 18:42:18,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:18,929 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:18,929 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:18,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:18,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1334320836, now seen corresponding path program 28 times [2018-11-14 18:42:18,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:18,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:18,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:18,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:18,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:19,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {20240#true} call ULTIMATE.init(); {20240#true} is VALID [2018-11-14 18:42:19,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {20240#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20240#true} is VALID [2018-11-14 18:42:19,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {20240#true} assume true; {20240#true} is VALID [2018-11-14 18:42:19,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20240#true} {20240#true} #91#return; {20240#true} is VALID [2018-11-14 18:42:19,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {20240#true} call #t~ret13 := main(); {20240#true} is VALID [2018-11-14 18:42:19,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {20240#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {20240#true} is VALID [2018-11-14 18:42:19,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {20240#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {20240#true} is VALID [2018-11-14 18:42:19,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {20240#true} ~i~0 := 2; {20242#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:19,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {20242#(<= main_~i~0 2)} assume true; {20242#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:19,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {20242#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20242#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:19,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {20242#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20242#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:19,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {20242#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20243#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:19,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {20243#(<= main_~i~0 3)} assume true; {20243#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:19,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {20243#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20243#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:19,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {20243#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20243#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:19,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {20243#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20244#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:19,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {20244#(<= main_~i~0 4)} assume true; {20244#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:19,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {20244#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20244#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:19,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {20244#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20244#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:19,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {20244#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20245#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:19,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {20245#(<= main_~i~0 5)} assume true; {20245#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:19,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {20245#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20245#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:19,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {20245#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20245#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:19,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {20245#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20246#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:19,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {20246#(<= main_~i~0 6)} assume true; {20246#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:19,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {20246#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20246#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:19,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {20246#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20246#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:19,489 INFO L273 TraceCheckUtils]: 27: Hoare triple {20246#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20247#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:19,489 INFO L273 TraceCheckUtils]: 28: Hoare triple {20247#(<= main_~i~0 7)} assume true; {20247#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:19,490 INFO L273 TraceCheckUtils]: 29: Hoare triple {20247#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20247#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:19,490 INFO L273 TraceCheckUtils]: 30: Hoare triple {20247#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20247#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:19,490 INFO L273 TraceCheckUtils]: 31: Hoare triple {20247#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20248#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:19,491 INFO L273 TraceCheckUtils]: 32: Hoare triple {20248#(<= main_~i~0 8)} assume true; {20248#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:19,491 INFO L273 TraceCheckUtils]: 33: Hoare triple {20248#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20248#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:19,491 INFO L273 TraceCheckUtils]: 34: Hoare triple {20248#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20248#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:19,492 INFO L273 TraceCheckUtils]: 35: Hoare triple {20248#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20249#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:19,492 INFO L273 TraceCheckUtils]: 36: Hoare triple {20249#(<= main_~i~0 9)} assume true; {20249#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:19,492 INFO L273 TraceCheckUtils]: 37: Hoare triple {20249#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20249#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:19,493 INFO L273 TraceCheckUtils]: 38: Hoare triple {20249#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20249#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:19,494 INFO L273 TraceCheckUtils]: 39: Hoare triple {20249#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20250#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:19,494 INFO L273 TraceCheckUtils]: 40: Hoare triple {20250#(<= main_~i~0 10)} assume true; {20250#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:19,495 INFO L273 TraceCheckUtils]: 41: Hoare triple {20250#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20250#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:19,495 INFO L273 TraceCheckUtils]: 42: Hoare triple {20250#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20250#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:19,496 INFO L273 TraceCheckUtils]: 43: Hoare triple {20250#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20251#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:19,496 INFO L273 TraceCheckUtils]: 44: Hoare triple {20251#(<= main_~i~0 11)} assume true; {20251#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:19,497 INFO L273 TraceCheckUtils]: 45: Hoare triple {20251#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20251#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:19,497 INFO L273 TraceCheckUtils]: 46: Hoare triple {20251#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20251#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:19,498 INFO L273 TraceCheckUtils]: 47: Hoare triple {20251#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20252#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:19,499 INFO L273 TraceCheckUtils]: 48: Hoare triple {20252#(<= main_~i~0 12)} assume true; {20252#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:19,499 INFO L273 TraceCheckUtils]: 49: Hoare triple {20252#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20252#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:19,500 INFO L273 TraceCheckUtils]: 50: Hoare triple {20252#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20252#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:19,500 INFO L273 TraceCheckUtils]: 51: Hoare triple {20252#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20253#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:19,501 INFO L273 TraceCheckUtils]: 52: Hoare triple {20253#(<= main_~i~0 13)} assume true; {20253#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:19,501 INFO L273 TraceCheckUtils]: 53: Hoare triple {20253#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20253#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:19,502 INFO L273 TraceCheckUtils]: 54: Hoare triple {20253#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20253#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:19,504 INFO L273 TraceCheckUtils]: 55: Hoare triple {20253#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20254#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:19,504 INFO L273 TraceCheckUtils]: 56: Hoare triple {20254#(<= main_~i~0 14)} assume true; {20254#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:19,505 INFO L273 TraceCheckUtils]: 57: Hoare triple {20254#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20254#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:19,505 INFO L273 TraceCheckUtils]: 58: Hoare triple {20254#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20254#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:19,506 INFO L273 TraceCheckUtils]: 59: Hoare triple {20254#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20255#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:19,506 INFO L273 TraceCheckUtils]: 60: Hoare triple {20255#(<= main_~i~0 15)} assume true; {20255#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:19,507 INFO L273 TraceCheckUtils]: 61: Hoare triple {20255#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20255#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:19,507 INFO L273 TraceCheckUtils]: 62: Hoare triple {20255#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20255#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:19,508 INFO L273 TraceCheckUtils]: 63: Hoare triple {20255#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20256#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:19,509 INFO L273 TraceCheckUtils]: 64: Hoare triple {20256#(<= main_~i~0 16)} assume true; {20256#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:19,509 INFO L273 TraceCheckUtils]: 65: Hoare triple {20256#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20256#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:19,510 INFO L273 TraceCheckUtils]: 66: Hoare triple {20256#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20256#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:19,510 INFO L273 TraceCheckUtils]: 67: Hoare triple {20256#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20257#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:19,511 INFO L273 TraceCheckUtils]: 68: Hoare triple {20257#(<= main_~i~0 17)} assume true; {20257#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:19,511 INFO L273 TraceCheckUtils]: 69: Hoare triple {20257#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20257#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:19,512 INFO L273 TraceCheckUtils]: 70: Hoare triple {20257#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20257#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:19,513 INFO L273 TraceCheckUtils]: 71: Hoare triple {20257#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20258#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:19,513 INFO L273 TraceCheckUtils]: 72: Hoare triple {20258#(<= main_~i~0 18)} assume true; {20258#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:19,514 INFO L273 TraceCheckUtils]: 73: Hoare triple {20258#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20258#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:19,514 INFO L273 TraceCheckUtils]: 74: Hoare triple {20258#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20258#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:19,515 INFO L273 TraceCheckUtils]: 75: Hoare triple {20258#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20259#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:19,515 INFO L273 TraceCheckUtils]: 76: Hoare triple {20259#(<= main_~i~0 19)} assume true; {20259#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:19,516 INFO L273 TraceCheckUtils]: 77: Hoare triple {20259#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20259#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:19,516 INFO L273 TraceCheckUtils]: 78: Hoare triple {20259#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20259#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:19,517 INFO L273 TraceCheckUtils]: 79: Hoare triple {20259#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20260#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:19,518 INFO L273 TraceCheckUtils]: 80: Hoare triple {20260#(<= main_~i~0 20)} assume true; {20260#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:19,518 INFO L273 TraceCheckUtils]: 81: Hoare triple {20260#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20260#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:19,519 INFO L273 TraceCheckUtils]: 82: Hoare triple {20260#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20260#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:19,519 INFO L273 TraceCheckUtils]: 83: Hoare triple {20260#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20261#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:19,520 INFO L273 TraceCheckUtils]: 84: Hoare triple {20261#(<= main_~i~0 21)} assume true; {20261#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:19,520 INFO L273 TraceCheckUtils]: 85: Hoare triple {20261#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20261#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:19,521 INFO L273 TraceCheckUtils]: 86: Hoare triple {20261#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20261#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:19,522 INFO L273 TraceCheckUtils]: 87: Hoare triple {20261#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20262#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:19,522 INFO L273 TraceCheckUtils]: 88: Hoare triple {20262#(<= main_~i~0 22)} assume true; {20262#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:19,523 INFO L273 TraceCheckUtils]: 89: Hoare triple {20262#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20262#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:19,523 INFO L273 TraceCheckUtils]: 90: Hoare triple {20262#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20262#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:19,524 INFO L273 TraceCheckUtils]: 91: Hoare triple {20262#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20263#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:19,524 INFO L273 TraceCheckUtils]: 92: Hoare triple {20263#(<= main_~i~0 23)} assume true; {20263#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:19,525 INFO L273 TraceCheckUtils]: 93: Hoare triple {20263#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20263#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:19,525 INFO L273 TraceCheckUtils]: 94: Hoare triple {20263#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20263#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:19,526 INFO L273 TraceCheckUtils]: 95: Hoare triple {20263#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20264#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:19,527 INFO L273 TraceCheckUtils]: 96: Hoare triple {20264#(<= main_~i~0 24)} assume true; {20264#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:19,527 INFO L273 TraceCheckUtils]: 97: Hoare triple {20264#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20264#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:19,528 INFO L273 TraceCheckUtils]: 98: Hoare triple {20264#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20264#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:19,528 INFO L273 TraceCheckUtils]: 99: Hoare triple {20264#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20265#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:19,529 INFO L273 TraceCheckUtils]: 100: Hoare triple {20265#(<= main_~i~0 25)} assume true; {20265#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:19,529 INFO L273 TraceCheckUtils]: 101: Hoare triple {20265#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20265#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:19,530 INFO L273 TraceCheckUtils]: 102: Hoare triple {20265#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20265#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:19,530 INFO L273 TraceCheckUtils]: 103: Hoare triple {20265#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20266#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:19,531 INFO L273 TraceCheckUtils]: 104: Hoare triple {20266#(<= main_~i~0 26)} assume true; {20266#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:19,531 INFO L273 TraceCheckUtils]: 105: Hoare triple {20266#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20266#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:19,532 INFO L273 TraceCheckUtils]: 106: Hoare triple {20266#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20266#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:19,533 INFO L273 TraceCheckUtils]: 107: Hoare triple {20266#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20267#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:19,533 INFO L273 TraceCheckUtils]: 108: Hoare triple {20267#(<= main_~i~0 27)} assume true; {20267#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:19,534 INFO L273 TraceCheckUtils]: 109: Hoare triple {20267#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20267#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:19,534 INFO L273 TraceCheckUtils]: 110: Hoare triple {20267#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20267#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:19,535 INFO L273 TraceCheckUtils]: 111: Hoare triple {20267#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20268#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:19,535 INFO L273 TraceCheckUtils]: 112: Hoare triple {20268#(<= main_~i~0 28)} assume true; {20268#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:19,536 INFO L273 TraceCheckUtils]: 113: Hoare triple {20268#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20268#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:19,536 INFO L273 TraceCheckUtils]: 114: Hoare triple {20268#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20268#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:19,537 INFO L273 TraceCheckUtils]: 115: Hoare triple {20268#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20269#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:19,538 INFO L273 TraceCheckUtils]: 116: Hoare triple {20269#(<= main_~i~0 29)} assume true; {20269#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:19,538 INFO L273 TraceCheckUtils]: 117: Hoare triple {20269#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20269#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:19,539 INFO L273 TraceCheckUtils]: 118: Hoare triple {20269#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20269#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:19,539 INFO L273 TraceCheckUtils]: 119: Hoare triple {20269#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20270#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:19,540 INFO L273 TraceCheckUtils]: 120: Hoare triple {20270#(<= main_~i~0 30)} assume true; {20270#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:19,541 INFO L273 TraceCheckUtils]: 121: Hoare triple {20270#(<= main_~i~0 30)} assume !(~i~0 < 100000); {20241#false} is VALID [2018-11-14 18:42:19,541 INFO L273 TraceCheckUtils]: 122: Hoare triple {20241#false} havoc ~x~0;~x~0 := 0; {20241#false} is VALID [2018-11-14 18:42:19,541 INFO L273 TraceCheckUtils]: 123: Hoare triple {20241#false} assume true; {20241#false} is VALID [2018-11-14 18:42:19,541 INFO L273 TraceCheckUtils]: 124: Hoare triple {20241#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {20241#false} is VALID [2018-11-14 18:42:19,541 INFO L256 TraceCheckUtils]: 125: Hoare triple {20241#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {20241#false} is VALID [2018-11-14 18:42:19,542 INFO L273 TraceCheckUtils]: 126: Hoare triple {20241#false} ~cond := #in~cond; {20241#false} is VALID [2018-11-14 18:42:19,542 INFO L273 TraceCheckUtils]: 127: Hoare triple {20241#false} assume ~cond == 0; {20241#false} is VALID [2018-11-14 18:42:19,542 INFO L273 TraceCheckUtils]: 128: Hoare triple {20241#false} assume !false; {20241#false} is VALID [2018-11-14 18:42:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:19,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:19,553 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-14 18:42:19,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:42:19,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:42:19,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:19,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:21,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {20240#true} call ULTIMATE.init(); {20240#true} is VALID [2018-11-14 18:42:21,037 INFO L273 TraceCheckUtils]: 1: Hoare triple {20240#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20240#true} is VALID [2018-11-14 18:42:21,037 INFO L273 TraceCheckUtils]: 2: Hoare triple {20240#true} assume true; {20240#true} is VALID [2018-11-14 18:42:21,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20240#true} {20240#true} #91#return; {20240#true} is VALID [2018-11-14 18:42:21,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {20240#true} call #t~ret13 := main(); {20240#true} is VALID [2018-11-14 18:42:21,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {20240#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {20240#true} is VALID [2018-11-14 18:42:21,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {20240#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {20240#true} is VALID [2018-11-14 18:42:21,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {20240#true} ~i~0 := 2; {20242#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:21,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {20242#(<= main_~i~0 2)} assume true; {20242#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:21,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {20242#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20242#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:21,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {20242#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20242#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:21,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {20242#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20243#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:21,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {20243#(<= main_~i~0 3)} assume true; {20243#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:21,040 INFO L273 TraceCheckUtils]: 13: Hoare triple {20243#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20243#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:21,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {20243#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20243#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:21,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {20243#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20244#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:21,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {20244#(<= main_~i~0 4)} assume true; {20244#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:21,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {20244#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20244#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:21,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {20244#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20244#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:21,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {20244#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20245#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:21,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {20245#(<= main_~i~0 5)} assume true; {20245#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:21,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {20245#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20245#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:21,045 INFO L273 TraceCheckUtils]: 22: Hoare triple {20245#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20245#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:21,046 INFO L273 TraceCheckUtils]: 23: Hoare triple {20245#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20246#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:21,046 INFO L273 TraceCheckUtils]: 24: Hoare triple {20246#(<= main_~i~0 6)} assume true; {20246#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:21,047 INFO L273 TraceCheckUtils]: 25: Hoare triple {20246#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20246#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:21,047 INFO L273 TraceCheckUtils]: 26: Hoare triple {20246#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20246#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:21,048 INFO L273 TraceCheckUtils]: 27: Hoare triple {20246#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20247#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:21,048 INFO L273 TraceCheckUtils]: 28: Hoare triple {20247#(<= main_~i~0 7)} assume true; {20247#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:21,049 INFO L273 TraceCheckUtils]: 29: Hoare triple {20247#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20247#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:21,049 INFO L273 TraceCheckUtils]: 30: Hoare triple {20247#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20247#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:21,050 INFO L273 TraceCheckUtils]: 31: Hoare triple {20247#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20248#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:21,051 INFO L273 TraceCheckUtils]: 32: Hoare triple {20248#(<= main_~i~0 8)} assume true; {20248#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:21,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {20248#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20248#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:21,052 INFO L273 TraceCheckUtils]: 34: Hoare triple {20248#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20248#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:21,052 INFO L273 TraceCheckUtils]: 35: Hoare triple {20248#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20249#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:21,053 INFO L273 TraceCheckUtils]: 36: Hoare triple {20249#(<= main_~i~0 9)} assume true; {20249#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:21,053 INFO L273 TraceCheckUtils]: 37: Hoare triple {20249#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20249#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:21,054 INFO L273 TraceCheckUtils]: 38: Hoare triple {20249#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20249#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:21,054 INFO L273 TraceCheckUtils]: 39: Hoare triple {20249#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20250#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:21,055 INFO L273 TraceCheckUtils]: 40: Hoare triple {20250#(<= main_~i~0 10)} assume true; {20250#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:21,056 INFO L273 TraceCheckUtils]: 41: Hoare triple {20250#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20250#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:21,056 INFO L273 TraceCheckUtils]: 42: Hoare triple {20250#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20250#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:21,057 INFO L273 TraceCheckUtils]: 43: Hoare triple {20250#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20251#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:21,057 INFO L273 TraceCheckUtils]: 44: Hoare triple {20251#(<= main_~i~0 11)} assume true; {20251#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:21,058 INFO L273 TraceCheckUtils]: 45: Hoare triple {20251#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20251#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:21,058 INFO L273 TraceCheckUtils]: 46: Hoare triple {20251#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20251#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:21,059 INFO L273 TraceCheckUtils]: 47: Hoare triple {20251#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20252#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:21,060 INFO L273 TraceCheckUtils]: 48: Hoare triple {20252#(<= main_~i~0 12)} assume true; {20252#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:21,060 INFO L273 TraceCheckUtils]: 49: Hoare triple {20252#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20252#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:21,061 INFO L273 TraceCheckUtils]: 50: Hoare triple {20252#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20252#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:21,061 INFO L273 TraceCheckUtils]: 51: Hoare triple {20252#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20253#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:21,062 INFO L273 TraceCheckUtils]: 52: Hoare triple {20253#(<= main_~i~0 13)} assume true; {20253#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:21,062 INFO L273 TraceCheckUtils]: 53: Hoare triple {20253#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20253#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:21,063 INFO L273 TraceCheckUtils]: 54: Hoare triple {20253#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20253#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:21,063 INFO L273 TraceCheckUtils]: 55: Hoare triple {20253#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20254#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:21,064 INFO L273 TraceCheckUtils]: 56: Hoare triple {20254#(<= main_~i~0 14)} assume true; {20254#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:21,064 INFO L273 TraceCheckUtils]: 57: Hoare triple {20254#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20254#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:21,065 INFO L273 TraceCheckUtils]: 58: Hoare triple {20254#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20254#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:21,066 INFO L273 TraceCheckUtils]: 59: Hoare triple {20254#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20255#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:21,066 INFO L273 TraceCheckUtils]: 60: Hoare triple {20255#(<= main_~i~0 15)} assume true; {20255#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:21,067 INFO L273 TraceCheckUtils]: 61: Hoare triple {20255#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20255#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:21,067 INFO L273 TraceCheckUtils]: 62: Hoare triple {20255#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20255#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:21,068 INFO L273 TraceCheckUtils]: 63: Hoare triple {20255#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20256#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:21,068 INFO L273 TraceCheckUtils]: 64: Hoare triple {20256#(<= main_~i~0 16)} assume true; {20256#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:21,069 INFO L273 TraceCheckUtils]: 65: Hoare triple {20256#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20256#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:21,069 INFO L273 TraceCheckUtils]: 66: Hoare triple {20256#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20256#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:21,070 INFO L273 TraceCheckUtils]: 67: Hoare triple {20256#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20257#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:21,071 INFO L273 TraceCheckUtils]: 68: Hoare triple {20257#(<= main_~i~0 17)} assume true; {20257#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:21,071 INFO L273 TraceCheckUtils]: 69: Hoare triple {20257#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20257#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:21,072 INFO L273 TraceCheckUtils]: 70: Hoare triple {20257#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20257#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:21,072 INFO L273 TraceCheckUtils]: 71: Hoare triple {20257#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20258#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:21,073 INFO L273 TraceCheckUtils]: 72: Hoare triple {20258#(<= main_~i~0 18)} assume true; {20258#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:21,073 INFO L273 TraceCheckUtils]: 73: Hoare triple {20258#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20258#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:21,074 INFO L273 TraceCheckUtils]: 74: Hoare triple {20258#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20258#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:21,074 INFO L273 TraceCheckUtils]: 75: Hoare triple {20258#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20259#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:21,075 INFO L273 TraceCheckUtils]: 76: Hoare triple {20259#(<= main_~i~0 19)} assume true; {20259#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:21,075 INFO L273 TraceCheckUtils]: 77: Hoare triple {20259#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20259#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:21,076 INFO L273 TraceCheckUtils]: 78: Hoare triple {20259#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20259#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:21,077 INFO L273 TraceCheckUtils]: 79: Hoare triple {20259#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20260#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:21,077 INFO L273 TraceCheckUtils]: 80: Hoare triple {20260#(<= main_~i~0 20)} assume true; {20260#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:21,078 INFO L273 TraceCheckUtils]: 81: Hoare triple {20260#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20260#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:21,078 INFO L273 TraceCheckUtils]: 82: Hoare triple {20260#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20260#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:21,079 INFO L273 TraceCheckUtils]: 83: Hoare triple {20260#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20261#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:21,079 INFO L273 TraceCheckUtils]: 84: Hoare triple {20261#(<= main_~i~0 21)} assume true; {20261#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:21,080 INFO L273 TraceCheckUtils]: 85: Hoare triple {20261#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20261#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:21,080 INFO L273 TraceCheckUtils]: 86: Hoare triple {20261#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20261#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:21,081 INFO L273 TraceCheckUtils]: 87: Hoare triple {20261#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20262#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:21,082 INFO L273 TraceCheckUtils]: 88: Hoare triple {20262#(<= main_~i~0 22)} assume true; {20262#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:21,082 INFO L273 TraceCheckUtils]: 89: Hoare triple {20262#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20262#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:21,083 INFO L273 TraceCheckUtils]: 90: Hoare triple {20262#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20262#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:21,083 INFO L273 TraceCheckUtils]: 91: Hoare triple {20262#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20263#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:21,084 INFO L273 TraceCheckUtils]: 92: Hoare triple {20263#(<= main_~i~0 23)} assume true; {20263#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:21,084 INFO L273 TraceCheckUtils]: 93: Hoare triple {20263#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20263#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:21,085 INFO L273 TraceCheckUtils]: 94: Hoare triple {20263#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20263#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:21,085 INFO L273 TraceCheckUtils]: 95: Hoare triple {20263#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20264#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:21,086 INFO L273 TraceCheckUtils]: 96: Hoare triple {20264#(<= main_~i~0 24)} assume true; {20264#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:21,086 INFO L273 TraceCheckUtils]: 97: Hoare triple {20264#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20264#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:21,087 INFO L273 TraceCheckUtils]: 98: Hoare triple {20264#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20264#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:21,088 INFO L273 TraceCheckUtils]: 99: Hoare triple {20264#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20265#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:21,088 INFO L273 TraceCheckUtils]: 100: Hoare triple {20265#(<= main_~i~0 25)} assume true; {20265#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:21,089 INFO L273 TraceCheckUtils]: 101: Hoare triple {20265#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20265#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:21,089 INFO L273 TraceCheckUtils]: 102: Hoare triple {20265#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20265#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:21,090 INFO L273 TraceCheckUtils]: 103: Hoare triple {20265#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20266#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:21,090 INFO L273 TraceCheckUtils]: 104: Hoare triple {20266#(<= main_~i~0 26)} assume true; {20266#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:21,091 INFO L273 TraceCheckUtils]: 105: Hoare triple {20266#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20266#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:21,091 INFO L273 TraceCheckUtils]: 106: Hoare triple {20266#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20266#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:21,092 INFO L273 TraceCheckUtils]: 107: Hoare triple {20266#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20267#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:21,093 INFO L273 TraceCheckUtils]: 108: Hoare triple {20267#(<= main_~i~0 27)} assume true; {20267#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:21,093 INFO L273 TraceCheckUtils]: 109: Hoare triple {20267#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20267#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:21,094 INFO L273 TraceCheckUtils]: 110: Hoare triple {20267#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20267#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:21,094 INFO L273 TraceCheckUtils]: 111: Hoare triple {20267#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20268#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:21,095 INFO L273 TraceCheckUtils]: 112: Hoare triple {20268#(<= main_~i~0 28)} assume true; {20268#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:21,095 INFO L273 TraceCheckUtils]: 113: Hoare triple {20268#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20268#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:21,096 INFO L273 TraceCheckUtils]: 114: Hoare triple {20268#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20268#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:21,096 INFO L273 TraceCheckUtils]: 115: Hoare triple {20268#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20269#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:21,097 INFO L273 TraceCheckUtils]: 116: Hoare triple {20269#(<= main_~i~0 29)} assume true; {20269#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:21,097 INFO L273 TraceCheckUtils]: 117: Hoare triple {20269#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {20269#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:21,098 INFO L273 TraceCheckUtils]: 118: Hoare triple {20269#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20269#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:21,099 INFO L273 TraceCheckUtils]: 119: Hoare triple {20269#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {20270#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:21,099 INFO L273 TraceCheckUtils]: 120: Hoare triple {20270#(<= main_~i~0 30)} assume true; {20270#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:21,100 INFO L273 TraceCheckUtils]: 121: Hoare triple {20270#(<= main_~i~0 30)} assume !(~i~0 < 100000); {20241#false} is VALID [2018-11-14 18:42:21,100 INFO L273 TraceCheckUtils]: 122: Hoare triple {20241#false} havoc ~x~0;~x~0 := 0; {20241#false} is VALID [2018-11-14 18:42:21,100 INFO L273 TraceCheckUtils]: 123: Hoare triple {20241#false} assume true; {20241#false} is VALID [2018-11-14 18:42:21,100 INFO L273 TraceCheckUtils]: 124: Hoare triple {20241#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {20241#false} is VALID [2018-11-14 18:42:21,101 INFO L256 TraceCheckUtils]: 125: Hoare triple {20241#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {20241#false} is VALID [2018-11-14 18:42:21,101 INFO L273 TraceCheckUtils]: 126: Hoare triple {20241#false} ~cond := #in~cond; {20241#false} is VALID [2018-11-14 18:42:21,101 INFO L273 TraceCheckUtils]: 127: Hoare triple {20241#false} assume ~cond == 0; {20241#false} is VALID [2018-11-14 18:42:21,101 INFO L273 TraceCheckUtils]: 128: Hoare triple {20241#false} assume !false; {20241#false} is VALID [2018-11-14 18:42:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:21,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:21,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-14 18:42:21,134 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 129 [2018-11-14 18:42:21,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:21,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 18:42:21,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:21,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 18:42:21,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 18:42:21,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:42:21,254 INFO L87 Difference]: Start difference. First operand 169 states and 230 transitions. Second operand 31 states. [2018-11-14 18:42:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:22,620 INFO L93 Difference]: Finished difference Result 196 states and 265 transitions. [2018-11-14 18:42:22,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 18:42:22,620 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 129 [2018-11-14 18:42:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:42:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 265 transitions. [2018-11-14 18:42:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:42:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 265 transitions. [2018-11-14 18:42:22,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 265 transitions. [2018-11-14 18:42:22,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:22,926 INFO L225 Difference]: With dead ends: 196 [2018-11-14 18:42:22,926 INFO L226 Difference]: Without dead ends: 177 [2018-11-14 18:42:22,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:42:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-14 18:42:22,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2018-11-14 18:42:22,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:22,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 174 states. [2018-11-14 18:42:22,996 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 174 states. [2018-11-14 18:42:22,996 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 174 states. [2018-11-14 18:42:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:22,999 INFO L93 Difference]: Finished difference Result 177 states and 242 transitions. [2018-11-14 18:42:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2018-11-14 18:42:22,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:22,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:22,999 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 177 states. [2018-11-14 18:42:22,999 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 177 states. [2018-11-14 18:42:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:23,003 INFO L93 Difference]: Finished difference Result 177 states and 242 transitions. [2018-11-14 18:42:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2018-11-14 18:42:23,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:23,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:23,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:23,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-14 18:42:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 237 transitions. [2018-11-14 18:42:23,007 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 237 transitions. Word has length 129 [2018-11-14 18:42:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:23,007 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 237 transitions. [2018-11-14 18:42:23,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 18:42:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 237 transitions. [2018-11-14 18:42:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-14 18:42:23,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:23,009 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:23,009 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:23,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash 367569334, now seen corresponding path program 29 times [2018-11-14 18:42:23,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:23,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:23,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {21464#true} call ULTIMATE.init(); {21464#true} is VALID [2018-11-14 18:42:23,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {21464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21464#true} is VALID [2018-11-14 18:42:23,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {21464#true} assume true; {21464#true} is VALID [2018-11-14 18:42:23,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21464#true} {21464#true} #91#return; {21464#true} is VALID [2018-11-14 18:42:23,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {21464#true} call #t~ret13 := main(); {21464#true} is VALID [2018-11-14 18:42:23,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {21464#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {21464#true} is VALID [2018-11-14 18:42:23,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {21464#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {21464#true} is VALID [2018-11-14 18:42:23,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {21464#true} ~i~0 := 2; {21466#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:23,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {21466#(<= main_~i~0 2)} assume true; {21466#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:23,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {21466#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21466#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:23,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {21466#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21466#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:23,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {21466#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21467#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:23,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {21467#(<= main_~i~0 3)} assume true; {21467#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:23,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {21467#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21467#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:23,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {21467#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21467#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:23,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {21467#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21468#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:23,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {21468#(<= main_~i~0 4)} assume true; {21468#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:23,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {21468#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21468#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:23,708 INFO L273 TraceCheckUtils]: 18: Hoare triple {21468#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21468#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:23,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {21468#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21469#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:23,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {21469#(<= main_~i~0 5)} assume true; {21469#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:23,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {21469#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21469#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:23,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {21469#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21469#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:23,711 INFO L273 TraceCheckUtils]: 23: Hoare triple {21469#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21470#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:23,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {21470#(<= main_~i~0 6)} assume true; {21470#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:23,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {21470#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21470#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:23,713 INFO L273 TraceCheckUtils]: 26: Hoare triple {21470#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21470#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:23,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {21470#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21471#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:23,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {21471#(<= main_~i~0 7)} assume true; {21471#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:23,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {21471#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21471#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:23,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {21471#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21471#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:23,716 INFO L273 TraceCheckUtils]: 31: Hoare triple {21471#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21472#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:23,716 INFO L273 TraceCheckUtils]: 32: Hoare triple {21472#(<= main_~i~0 8)} assume true; {21472#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:23,717 INFO L273 TraceCheckUtils]: 33: Hoare triple {21472#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21472#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:23,717 INFO L273 TraceCheckUtils]: 34: Hoare triple {21472#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21472#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:23,718 INFO L273 TraceCheckUtils]: 35: Hoare triple {21472#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21473#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:23,719 INFO L273 TraceCheckUtils]: 36: Hoare triple {21473#(<= main_~i~0 9)} assume true; {21473#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:23,719 INFO L273 TraceCheckUtils]: 37: Hoare triple {21473#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21473#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:23,720 INFO L273 TraceCheckUtils]: 38: Hoare triple {21473#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21473#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:23,720 INFO L273 TraceCheckUtils]: 39: Hoare triple {21473#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21474#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:23,721 INFO L273 TraceCheckUtils]: 40: Hoare triple {21474#(<= main_~i~0 10)} assume true; {21474#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:23,721 INFO L273 TraceCheckUtils]: 41: Hoare triple {21474#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21474#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:23,722 INFO L273 TraceCheckUtils]: 42: Hoare triple {21474#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21474#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:23,722 INFO L273 TraceCheckUtils]: 43: Hoare triple {21474#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21475#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:23,723 INFO L273 TraceCheckUtils]: 44: Hoare triple {21475#(<= main_~i~0 11)} assume true; {21475#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:23,723 INFO L273 TraceCheckUtils]: 45: Hoare triple {21475#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21475#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:23,724 INFO L273 TraceCheckUtils]: 46: Hoare triple {21475#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21475#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:23,725 INFO L273 TraceCheckUtils]: 47: Hoare triple {21475#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21476#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:23,725 INFO L273 TraceCheckUtils]: 48: Hoare triple {21476#(<= main_~i~0 12)} assume true; {21476#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:23,726 INFO L273 TraceCheckUtils]: 49: Hoare triple {21476#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21476#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:23,726 INFO L273 TraceCheckUtils]: 50: Hoare triple {21476#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21476#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:23,727 INFO L273 TraceCheckUtils]: 51: Hoare triple {21476#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21477#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:23,727 INFO L273 TraceCheckUtils]: 52: Hoare triple {21477#(<= main_~i~0 13)} assume true; {21477#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:23,728 INFO L273 TraceCheckUtils]: 53: Hoare triple {21477#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21477#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:23,728 INFO L273 TraceCheckUtils]: 54: Hoare triple {21477#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21477#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:23,729 INFO L273 TraceCheckUtils]: 55: Hoare triple {21477#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21478#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:23,730 INFO L273 TraceCheckUtils]: 56: Hoare triple {21478#(<= main_~i~0 14)} assume true; {21478#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:23,730 INFO L273 TraceCheckUtils]: 57: Hoare triple {21478#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21478#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:23,731 INFO L273 TraceCheckUtils]: 58: Hoare triple {21478#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21478#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:23,731 INFO L273 TraceCheckUtils]: 59: Hoare triple {21478#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21479#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:23,732 INFO L273 TraceCheckUtils]: 60: Hoare triple {21479#(<= main_~i~0 15)} assume true; {21479#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:23,732 INFO L273 TraceCheckUtils]: 61: Hoare triple {21479#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21479#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:23,733 INFO L273 TraceCheckUtils]: 62: Hoare triple {21479#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21479#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:23,733 INFO L273 TraceCheckUtils]: 63: Hoare triple {21479#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21480#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:23,734 INFO L273 TraceCheckUtils]: 64: Hoare triple {21480#(<= main_~i~0 16)} assume true; {21480#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:23,734 INFO L273 TraceCheckUtils]: 65: Hoare triple {21480#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21480#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:23,735 INFO L273 TraceCheckUtils]: 66: Hoare triple {21480#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21480#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:23,736 INFO L273 TraceCheckUtils]: 67: Hoare triple {21480#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21481#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:23,736 INFO L273 TraceCheckUtils]: 68: Hoare triple {21481#(<= main_~i~0 17)} assume true; {21481#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:23,737 INFO L273 TraceCheckUtils]: 69: Hoare triple {21481#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21481#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:23,737 INFO L273 TraceCheckUtils]: 70: Hoare triple {21481#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21481#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:23,738 INFO L273 TraceCheckUtils]: 71: Hoare triple {21481#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21482#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:23,738 INFO L273 TraceCheckUtils]: 72: Hoare triple {21482#(<= main_~i~0 18)} assume true; {21482#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:23,739 INFO L273 TraceCheckUtils]: 73: Hoare triple {21482#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21482#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:23,739 INFO L273 TraceCheckUtils]: 74: Hoare triple {21482#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21482#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:23,740 INFO L273 TraceCheckUtils]: 75: Hoare triple {21482#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21483#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:23,741 INFO L273 TraceCheckUtils]: 76: Hoare triple {21483#(<= main_~i~0 19)} assume true; {21483#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:23,741 INFO L273 TraceCheckUtils]: 77: Hoare triple {21483#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21483#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:23,742 INFO L273 TraceCheckUtils]: 78: Hoare triple {21483#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21483#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:23,742 INFO L273 TraceCheckUtils]: 79: Hoare triple {21483#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21484#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:23,743 INFO L273 TraceCheckUtils]: 80: Hoare triple {21484#(<= main_~i~0 20)} assume true; {21484#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:23,743 INFO L273 TraceCheckUtils]: 81: Hoare triple {21484#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21484#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:23,744 INFO L273 TraceCheckUtils]: 82: Hoare triple {21484#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21484#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:23,745 INFO L273 TraceCheckUtils]: 83: Hoare triple {21484#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21485#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:23,745 INFO L273 TraceCheckUtils]: 84: Hoare triple {21485#(<= main_~i~0 21)} assume true; {21485#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:23,746 INFO L273 TraceCheckUtils]: 85: Hoare triple {21485#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21485#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:23,746 INFO L273 TraceCheckUtils]: 86: Hoare triple {21485#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21485#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:23,747 INFO L273 TraceCheckUtils]: 87: Hoare triple {21485#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21486#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:23,747 INFO L273 TraceCheckUtils]: 88: Hoare triple {21486#(<= main_~i~0 22)} assume true; {21486#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:23,748 INFO L273 TraceCheckUtils]: 89: Hoare triple {21486#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21486#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:23,748 INFO L273 TraceCheckUtils]: 90: Hoare triple {21486#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21486#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:23,749 INFO L273 TraceCheckUtils]: 91: Hoare triple {21486#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21487#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:23,749 INFO L273 TraceCheckUtils]: 92: Hoare triple {21487#(<= main_~i~0 23)} assume true; {21487#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:23,750 INFO L273 TraceCheckUtils]: 93: Hoare triple {21487#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21487#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:23,750 INFO L273 TraceCheckUtils]: 94: Hoare triple {21487#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21487#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:23,751 INFO L273 TraceCheckUtils]: 95: Hoare triple {21487#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21488#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:23,752 INFO L273 TraceCheckUtils]: 96: Hoare triple {21488#(<= main_~i~0 24)} assume true; {21488#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:23,752 INFO L273 TraceCheckUtils]: 97: Hoare triple {21488#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21488#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:23,753 INFO L273 TraceCheckUtils]: 98: Hoare triple {21488#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21488#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:23,753 INFO L273 TraceCheckUtils]: 99: Hoare triple {21488#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21489#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:23,754 INFO L273 TraceCheckUtils]: 100: Hoare triple {21489#(<= main_~i~0 25)} assume true; {21489#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:23,754 INFO L273 TraceCheckUtils]: 101: Hoare triple {21489#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21489#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:23,755 INFO L273 TraceCheckUtils]: 102: Hoare triple {21489#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21489#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:23,756 INFO L273 TraceCheckUtils]: 103: Hoare triple {21489#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21490#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:23,756 INFO L273 TraceCheckUtils]: 104: Hoare triple {21490#(<= main_~i~0 26)} assume true; {21490#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:23,757 INFO L273 TraceCheckUtils]: 105: Hoare triple {21490#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21490#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:23,757 INFO L273 TraceCheckUtils]: 106: Hoare triple {21490#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21490#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:23,758 INFO L273 TraceCheckUtils]: 107: Hoare triple {21490#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21491#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:23,758 INFO L273 TraceCheckUtils]: 108: Hoare triple {21491#(<= main_~i~0 27)} assume true; {21491#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:23,759 INFO L273 TraceCheckUtils]: 109: Hoare triple {21491#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21491#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:23,759 INFO L273 TraceCheckUtils]: 110: Hoare triple {21491#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21491#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:23,760 INFO L273 TraceCheckUtils]: 111: Hoare triple {21491#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21492#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:23,760 INFO L273 TraceCheckUtils]: 112: Hoare triple {21492#(<= main_~i~0 28)} assume true; {21492#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:23,761 INFO L273 TraceCheckUtils]: 113: Hoare triple {21492#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21492#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:23,761 INFO L273 TraceCheckUtils]: 114: Hoare triple {21492#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21492#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:23,762 INFO L273 TraceCheckUtils]: 115: Hoare triple {21492#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21493#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:23,763 INFO L273 TraceCheckUtils]: 116: Hoare triple {21493#(<= main_~i~0 29)} assume true; {21493#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:23,763 INFO L273 TraceCheckUtils]: 117: Hoare triple {21493#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21493#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:23,764 INFO L273 TraceCheckUtils]: 118: Hoare triple {21493#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21493#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:23,764 INFO L273 TraceCheckUtils]: 119: Hoare triple {21493#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21494#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:23,765 INFO L273 TraceCheckUtils]: 120: Hoare triple {21494#(<= main_~i~0 30)} assume true; {21494#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:23,765 INFO L273 TraceCheckUtils]: 121: Hoare triple {21494#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21494#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:23,766 INFO L273 TraceCheckUtils]: 122: Hoare triple {21494#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21494#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:23,767 INFO L273 TraceCheckUtils]: 123: Hoare triple {21494#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21495#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:23,785 INFO L273 TraceCheckUtils]: 124: Hoare triple {21495#(<= main_~i~0 31)} assume true; {21495#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:23,799 INFO L273 TraceCheckUtils]: 125: Hoare triple {21495#(<= main_~i~0 31)} assume !(~i~0 < 100000); {21465#false} is VALID [2018-11-14 18:42:23,799 INFO L273 TraceCheckUtils]: 126: Hoare triple {21465#false} havoc ~x~0;~x~0 := 0; {21465#false} is VALID [2018-11-14 18:42:23,799 INFO L273 TraceCheckUtils]: 127: Hoare triple {21465#false} assume true; {21465#false} is VALID [2018-11-14 18:42:23,799 INFO L273 TraceCheckUtils]: 128: Hoare triple {21465#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {21465#false} is VALID [2018-11-14 18:42:23,800 INFO L256 TraceCheckUtils]: 129: Hoare triple {21465#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {21465#false} is VALID [2018-11-14 18:42:23,800 INFO L273 TraceCheckUtils]: 130: Hoare triple {21465#false} ~cond := #in~cond; {21465#false} is VALID [2018-11-14 18:42:23,800 INFO L273 TraceCheckUtils]: 131: Hoare triple {21465#false} assume ~cond == 0; {21465#false} is VALID [2018-11-14 18:42:23,800 INFO L273 TraceCheckUtils]: 132: Hoare triple {21465#false} assume !false; {21465#false} is VALID [2018-11-14 18:42:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:23,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:23,812 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-14 18:42:23,821 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:42:23,916 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-14 18:42:23,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:23,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:24,201 INFO L256 TraceCheckUtils]: 0: Hoare triple {21464#true} call ULTIMATE.init(); {21464#true} is VALID [2018-11-14 18:42:24,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {21464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21464#true} is VALID [2018-11-14 18:42:24,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {21464#true} assume true; {21464#true} is VALID [2018-11-14 18:42:24,202 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21464#true} {21464#true} #91#return; {21464#true} is VALID [2018-11-14 18:42:24,202 INFO L256 TraceCheckUtils]: 4: Hoare triple {21464#true} call #t~ret13 := main(); {21464#true} is VALID [2018-11-14 18:42:24,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {21464#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {21464#true} is VALID [2018-11-14 18:42:24,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {21464#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {21464#true} is VALID [2018-11-14 18:42:24,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {21464#true} ~i~0 := 2; {21466#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:24,203 INFO L273 TraceCheckUtils]: 8: Hoare triple {21466#(<= main_~i~0 2)} assume true; {21466#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:24,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {21466#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21466#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:24,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {21466#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21466#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:24,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {21466#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21467#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:24,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {21467#(<= main_~i~0 3)} assume true; {21467#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:24,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {21467#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21467#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:24,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {21467#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21467#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:24,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {21467#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21468#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:24,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {21468#(<= main_~i~0 4)} assume true; {21468#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:24,206 INFO L273 TraceCheckUtils]: 17: Hoare triple {21468#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21468#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:24,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {21468#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21468#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:24,207 INFO L273 TraceCheckUtils]: 19: Hoare triple {21468#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21469#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:24,207 INFO L273 TraceCheckUtils]: 20: Hoare triple {21469#(<= main_~i~0 5)} assume true; {21469#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:24,208 INFO L273 TraceCheckUtils]: 21: Hoare triple {21469#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21469#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:24,208 INFO L273 TraceCheckUtils]: 22: Hoare triple {21469#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21469#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:24,209 INFO L273 TraceCheckUtils]: 23: Hoare triple {21469#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21470#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:24,210 INFO L273 TraceCheckUtils]: 24: Hoare triple {21470#(<= main_~i~0 6)} assume true; {21470#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:24,210 INFO L273 TraceCheckUtils]: 25: Hoare triple {21470#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21470#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:24,211 INFO L273 TraceCheckUtils]: 26: Hoare triple {21470#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21470#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:24,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {21470#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21471#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:24,212 INFO L273 TraceCheckUtils]: 28: Hoare triple {21471#(<= main_~i~0 7)} assume true; {21471#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:24,212 INFO L273 TraceCheckUtils]: 29: Hoare triple {21471#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21471#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:24,213 INFO L273 TraceCheckUtils]: 30: Hoare triple {21471#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21471#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:24,214 INFO L273 TraceCheckUtils]: 31: Hoare triple {21471#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21472#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:24,214 INFO L273 TraceCheckUtils]: 32: Hoare triple {21472#(<= main_~i~0 8)} assume true; {21472#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:24,215 INFO L273 TraceCheckUtils]: 33: Hoare triple {21472#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21472#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:24,215 INFO L273 TraceCheckUtils]: 34: Hoare triple {21472#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21472#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:24,216 INFO L273 TraceCheckUtils]: 35: Hoare triple {21472#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21473#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:24,216 INFO L273 TraceCheckUtils]: 36: Hoare triple {21473#(<= main_~i~0 9)} assume true; {21473#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:24,217 INFO L273 TraceCheckUtils]: 37: Hoare triple {21473#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21473#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:24,217 INFO L273 TraceCheckUtils]: 38: Hoare triple {21473#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21473#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:24,218 INFO L273 TraceCheckUtils]: 39: Hoare triple {21473#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21474#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:24,218 INFO L273 TraceCheckUtils]: 40: Hoare triple {21474#(<= main_~i~0 10)} assume true; {21474#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:24,219 INFO L273 TraceCheckUtils]: 41: Hoare triple {21474#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21474#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:24,219 INFO L273 TraceCheckUtils]: 42: Hoare triple {21474#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21474#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:24,220 INFO L273 TraceCheckUtils]: 43: Hoare triple {21474#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21475#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:24,221 INFO L273 TraceCheckUtils]: 44: Hoare triple {21475#(<= main_~i~0 11)} assume true; {21475#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:24,221 INFO L273 TraceCheckUtils]: 45: Hoare triple {21475#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21475#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:24,222 INFO L273 TraceCheckUtils]: 46: Hoare triple {21475#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21475#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:24,222 INFO L273 TraceCheckUtils]: 47: Hoare triple {21475#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21476#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:24,223 INFO L273 TraceCheckUtils]: 48: Hoare triple {21476#(<= main_~i~0 12)} assume true; {21476#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:24,223 INFO L273 TraceCheckUtils]: 49: Hoare triple {21476#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21476#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:24,224 INFO L273 TraceCheckUtils]: 50: Hoare triple {21476#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21476#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:24,225 INFO L273 TraceCheckUtils]: 51: Hoare triple {21476#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21477#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:24,225 INFO L273 TraceCheckUtils]: 52: Hoare triple {21477#(<= main_~i~0 13)} assume true; {21477#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:24,226 INFO L273 TraceCheckUtils]: 53: Hoare triple {21477#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21477#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:24,226 INFO L273 TraceCheckUtils]: 54: Hoare triple {21477#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21477#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:24,227 INFO L273 TraceCheckUtils]: 55: Hoare triple {21477#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21478#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:24,227 INFO L273 TraceCheckUtils]: 56: Hoare triple {21478#(<= main_~i~0 14)} assume true; {21478#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:24,228 INFO L273 TraceCheckUtils]: 57: Hoare triple {21478#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21478#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:24,228 INFO L273 TraceCheckUtils]: 58: Hoare triple {21478#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21478#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:24,229 INFO L273 TraceCheckUtils]: 59: Hoare triple {21478#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21479#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:24,229 INFO L273 TraceCheckUtils]: 60: Hoare triple {21479#(<= main_~i~0 15)} assume true; {21479#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:24,230 INFO L273 TraceCheckUtils]: 61: Hoare triple {21479#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21479#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:24,230 INFO L273 TraceCheckUtils]: 62: Hoare triple {21479#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21479#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:24,231 INFO L273 TraceCheckUtils]: 63: Hoare triple {21479#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21480#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:24,232 INFO L273 TraceCheckUtils]: 64: Hoare triple {21480#(<= main_~i~0 16)} assume true; {21480#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:24,232 INFO L273 TraceCheckUtils]: 65: Hoare triple {21480#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21480#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:24,233 INFO L273 TraceCheckUtils]: 66: Hoare triple {21480#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21480#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:24,233 INFO L273 TraceCheckUtils]: 67: Hoare triple {21480#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21481#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:24,234 INFO L273 TraceCheckUtils]: 68: Hoare triple {21481#(<= main_~i~0 17)} assume true; {21481#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:24,234 INFO L273 TraceCheckUtils]: 69: Hoare triple {21481#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21481#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:24,235 INFO L273 TraceCheckUtils]: 70: Hoare triple {21481#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21481#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:24,236 INFO L273 TraceCheckUtils]: 71: Hoare triple {21481#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21482#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:24,236 INFO L273 TraceCheckUtils]: 72: Hoare triple {21482#(<= main_~i~0 18)} assume true; {21482#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:24,237 INFO L273 TraceCheckUtils]: 73: Hoare triple {21482#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21482#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:24,237 INFO L273 TraceCheckUtils]: 74: Hoare triple {21482#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21482#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:24,238 INFO L273 TraceCheckUtils]: 75: Hoare triple {21482#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21483#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:24,238 INFO L273 TraceCheckUtils]: 76: Hoare triple {21483#(<= main_~i~0 19)} assume true; {21483#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:24,239 INFO L273 TraceCheckUtils]: 77: Hoare triple {21483#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21483#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:24,239 INFO L273 TraceCheckUtils]: 78: Hoare triple {21483#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21483#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:24,240 INFO L273 TraceCheckUtils]: 79: Hoare triple {21483#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21484#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:24,240 INFO L273 TraceCheckUtils]: 80: Hoare triple {21484#(<= main_~i~0 20)} assume true; {21484#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:24,241 INFO L273 TraceCheckUtils]: 81: Hoare triple {21484#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21484#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:24,241 INFO L273 TraceCheckUtils]: 82: Hoare triple {21484#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21484#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:24,242 INFO L273 TraceCheckUtils]: 83: Hoare triple {21484#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21485#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:24,243 INFO L273 TraceCheckUtils]: 84: Hoare triple {21485#(<= main_~i~0 21)} assume true; {21485#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:24,243 INFO L273 TraceCheckUtils]: 85: Hoare triple {21485#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21485#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:24,244 INFO L273 TraceCheckUtils]: 86: Hoare triple {21485#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21485#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:24,244 INFO L273 TraceCheckUtils]: 87: Hoare triple {21485#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21486#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:24,245 INFO L273 TraceCheckUtils]: 88: Hoare triple {21486#(<= main_~i~0 22)} assume true; {21486#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:24,245 INFO L273 TraceCheckUtils]: 89: Hoare triple {21486#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21486#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:24,246 INFO L273 TraceCheckUtils]: 90: Hoare triple {21486#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21486#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:24,247 INFO L273 TraceCheckUtils]: 91: Hoare triple {21486#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21487#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:24,247 INFO L273 TraceCheckUtils]: 92: Hoare triple {21487#(<= main_~i~0 23)} assume true; {21487#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:24,248 INFO L273 TraceCheckUtils]: 93: Hoare triple {21487#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21487#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:24,248 INFO L273 TraceCheckUtils]: 94: Hoare triple {21487#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21487#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:24,249 INFO L273 TraceCheckUtils]: 95: Hoare triple {21487#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21488#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:24,249 INFO L273 TraceCheckUtils]: 96: Hoare triple {21488#(<= main_~i~0 24)} assume true; {21488#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:24,250 INFO L273 TraceCheckUtils]: 97: Hoare triple {21488#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21488#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:24,250 INFO L273 TraceCheckUtils]: 98: Hoare triple {21488#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21488#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:24,251 INFO L273 TraceCheckUtils]: 99: Hoare triple {21488#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21489#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:24,252 INFO L273 TraceCheckUtils]: 100: Hoare triple {21489#(<= main_~i~0 25)} assume true; {21489#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:24,252 INFO L273 TraceCheckUtils]: 101: Hoare triple {21489#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21489#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:24,253 INFO L273 TraceCheckUtils]: 102: Hoare triple {21489#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21489#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:24,253 INFO L273 TraceCheckUtils]: 103: Hoare triple {21489#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21490#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:24,254 INFO L273 TraceCheckUtils]: 104: Hoare triple {21490#(<= main_~i~0 26)} assume true; {21490#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:24,254 INFO L273 TraceCheckUtils]: 105: Hoare triple {21490#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21490#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:24,255 INFO L273 TraceCheckUtils]: 106: Hoare triple {21490#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21490#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:24,255 INFO L273 TraceCheckUtils]: 107: Hoare triple {21490#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21491#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:24,256 INFO L273 TraceCheckUtils]: 108: Hoare triple {21491#(<= main_~i~0 27)} assume true; {21491#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:24,256 INFO L273 TraceCheckUtils]: 109: Hoare triple {21491#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21491#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:24,257 INFO L273 TraceCheckUtils]: 110: Hoare triple {21491#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21491#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:24,258 INFO L273 TraceCheckUtils]: 111: Hoare triple {21491#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21492#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:24,258 INFO L273 TraceCheckUtils]: 112: Hoare triple {21492#(<= main_~i~0 28)} assume true; {21492#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:24,259 INFO L273 TraceCheckUtils]: 113: Hoare triple {21492#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21492#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:24,259 INFO L273 TraceCheckUtils]: 114: Hoare triple {21492#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21492#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:24,260 INFO L273 TraceCheckUtils]: 115: Hoare triple {21492#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21493#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:24,260 INFO L273 TraceCheckUtils]: 116: Hoare triple {21493#(<= main_~i~0 29)} assume true; {21493#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:24,261 INFO L273 TraceCheckUtils]: 117: Hoare triple {21493#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21493#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:24,261 INFO L273 TraceCheckUtils]: 118: Hoare triple {21493#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21493#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:24,262 INFO L273 TraceCheckUtils]: 119: Hoare triple {21493#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21494#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:24,263 INFO L273 TraceCheckUtils]: 120: Hoare triple {21494#(<= main_~i~0 30)} assume true; {21494#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:24,263 INFO L273 TraceCheckUtils]: 121: Hoare triple {21494#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {21494#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:24,264 INFO L273 TraceCheckUtils]: 122: Hoare triple {21494#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21494#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:24,264 INFO L273 TraceCheckUtils]: 123: Hoare triple {21494#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {21495#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:24,265 INFO L273 TraceCheckUtils]: 124: Hoare triple {21495#(<= main_~i~0 31)} assume true; {21495#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:24,265 INFO L273 TraceCheckUtils]: 125: Hoare triple {21495#(<= main_~i~0 31)} assume !(~i~0 < 100000); {21465#false} is VALID [2018-11-14 18:42:24,266 INFO L273 TraceCheckUtils]: 126: Hoare triple {21465#false} havoc ~x~0;~x~0 := 0; {21465#false} is VALID [2018-11-14 18:42:24,266 INFO L273 TraceCheckUtils]: 127: Hoare triple {21465#false} assume true; {21465#false} is VALID [2018-11-14 18:42:24,266 INFO L273 TraceCheckUtils]: 128: Hoare triple {21465#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {21465#false} is VALID [2018-11-14 18:42:24,266 INFO L256 TraceCheckUtils]: 129: Hoare triple {21465#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {21465#false} is VALID [2018-11-14 18:42:24,266 INFO L273 TraceCheckUtils]: 130: Hoare triple {21465#false} ~cond := #in~cond; {21465#false} is VALID [2018-11-14 18:42:24,267 INFO L273 TraceCheckUtils]: 131: Hoare triple {21465#false} assume ~cond == 0; {21465#false} is VALID [2018-11-14 18:42:24,267 INFO L273 TraceCheckUtils]: 132: Hoare triple {21465#false} assume !false; {21465#false} is VALID [2018-11-14 18:42:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:24,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:24,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-11-14 18:42:24,299 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 133 [2018-11-14 18:42:24,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:24,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 18:42:24,420 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-14 18:42:24,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 18:42:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 18:42:24,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:42:24,421 INFO L87 Difference]: Start difference. First operand 174 states and 237 transitions. Second operand 32 states. [2018-11-14 18:42:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:25,538 INFO L93 Difference]: Finished difference Result 201 states and 272 transitions. [2018-11-14 18:42:25,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 18:42:25,539 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 133 [2018-11-14 18:42:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:42:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 272 transitions. [2018-11-14 18:42:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:42:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 272 transitions. [2018-11-14 18:42:25,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 272 transitions. [2018-11-14 18:42:25,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:25,855 INFO L225 Difference]: With dead ends: 201 [2018-11-14 18:42:25,855 INFO L226 Difference]: Without dead ends: 182 [2018-11-14 18:42:25,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:42:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-14 18:42:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2018-11-14 18:42:25,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:25,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 179 states. [2018-11-14 18:42:25,924 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 179 states. [2018-11-14 18:42:25,924 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 179 states. [2018-11-14 18:42:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:25,927 INFO L93 Difference]: Finished difference Result 182 states and 249 transitions. [2018-11-14 18:42:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 249 transitions. [2018-11-14 18:42:25,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:25,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:25,928 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 182 states. [2018-11-14 18:42:25,928 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 182 states. [2018-11-14 18:42:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:25,931 INFO L93 Difference]: Finished difference Result 182 states and 249 transitions. [2018-11-14 18:42:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 249 transitions. [2018-11-14 18:42:25,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:25,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:25,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:25,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-14 18:42:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 244 transitions. [2018-11-14 18:42:25,935 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 244 transitions. Word has length 133 [2018-11-14 18:42:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:25,936 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 244 transitions. [2018-11-14 18:42:25,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 18:42:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 244 transitions. [2018-11-14 18:42:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-14 18:42:25,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:25,937 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:25,937 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:25,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1380346792, now seen corresponding path program 30 times [2018-11-14 18:42:25,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:25,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:25,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:25,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:25,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:26,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {22723#true} call ULTIMATE.init(); {22723#true} is VALID [2018-11-14 18:42:26,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {22723#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22723#true} is VALID [2018-11-14 18:42:26,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {22723#true} assume true; {22723#true} is VALID [2018-11-14 18:42:26,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22723#true} {22723#true} #91#return; {22723#true} is VALID [2018-11-14 18:42:26,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {22723#true} call #t~ret13 := main(); {22723#true} is VALID [2018-11-14 18:42:26,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {22723#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {22723#true} is VALID [2018-11-14 18:42:26,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {22723#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {22723#true} is VALID [2018-11-14 18:42:26,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {22723#true} ~i~0 := 2; {22725#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:26,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {22725#(<= main_~i~0 2)} assume true; {22725#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:26,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {22725#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22725#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:26,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {22725#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22725#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:26,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {22725#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22726#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:26,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {22726#(<= main_~i~0 3)} assume true; {22726#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:26,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {22726#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22726#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:26,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {22726#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22726#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:26,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {22726#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22727#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:26,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {22727#(<= main_~i~0 4)} assume true; {22727#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:26,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {22727#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22727#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:26,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {22727#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22727#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:26,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {22727#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22728#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:26,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {22728#(<= main_~i~0 5)} assume true; {22728#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:26,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {22728#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22728#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:26,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {22728#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22728#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:26,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {22728#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22729#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:26,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {22729#(<= main_~i~0 6)} assume true; {22729#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:26,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {22729#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22729#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:26,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {22729#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22729#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:26,788 INFO L273 TraceCheckUtils]: 27: Hoare triple {22729#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22730#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:26,789 INFO L273 TraceCheckUtils]: 28: Hoare triple {22730#(<= main_~i~0 7)} assume true; {22730#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:26,789 INFO L273 TraceCheckUtils]: 29: Hoare triple {22730#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22730#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:26,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {22730#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22730#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:26,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {22730#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22731#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:26,791 INFO L273 TraceCheckUtils]: 32: Hoare triple {22731#(<= main_~i~0 8)} assume true; {22731#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:26,792 INFO L273 TraceCheckUtils]: 33: Hoare triple {22731#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22731#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:26,792 INFO L273 TraceCheckUtils]: 34: Hoare triple {22731#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22731#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:26,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {22731#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22732#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:26,793 INFO L273 TraceCheckUtils]: 36: Hoare triple {22732#(<= main_~i~0 9)} assume true; {22732#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:26,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {22732#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22732#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:26,794 INFO L273 TraceCheckUtils]: 38: Hoare triple {22732#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22732#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:26,795 INFO L273 TraceCheckUtils]: 39: Hoare triple {22732#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22733#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:26,795 INFO L273 TraceCheckUtils]: 40: Hoare triple {22733#(<= main_~i~0 10)} assume true; {22733#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:26,796 INFO L273 TraceCheckUtils]: 41: Hoare triple {22733#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22733#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:26,796 INFO L273 TraceCheckUtils]: 42: Hoare triple {22733#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22733#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:26,797 INFO L273 TraceCheckUtils]: 43: Hoare triple {22733#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22734#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:26,798 INFO L273 TraceCheckUtils]: 44: Hoare triple {22734#(<= main_~i~0 11)} assume true; {22734#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:26,798 INFO L273 TraceCheckUtils]: 45: Hoare triple {22734#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22734#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:26,799 INFO L273 TraceCheckUtils]: 46: Hoare triple {22734#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22734#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:26,799 INFO L273 TraceCheckUtils]: 47: Hoare triple {22734#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22735#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:26,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {22735#(<= main_~i~0 12)} assume true; {22735#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:26,800 INFO L273 TraceCheckUtils]: 49: Hoare triple {22735#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22735#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:26,801 INFO L273 TraceCheckUtils]: 50: Hoare triple {22735#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22735#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:26,801 INFO L273 TraceCheckUtils]: 51: Hoare triple {22735#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22736#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:26,802 INFO L273 TraceCheckUtils]: 52: Hoare triple {22736#(<= main_~i~0 13)} assume true; {22736#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:26,802 INFO L273 TraceCheckUtils]: 53: Hoare triple {22736#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22736#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:26,803 INFO L273 TraceCheckUtils]: 54: Hoare triple {22736#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22736#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:26,804 INFO L273 TraceCheckUtils]: 55: Hoare triple {22736#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22737#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:26,804 INFO L273 TraceCheckUtils]: 56: Hoare triple {22737#(<= main_~i~0 14)} assume true; {22737#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:26,805 INFO L273 TraceCheckUtils]: 57: Hoare triple {22737#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22737#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:26,805 INFO L273 TraceCheckUtils]: 58: Hoare triple {22737#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22737#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:26,806 INFO L273 TraceCheckUtils]: 59: Hoare triple {22737#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22738#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:26,806 INFO L273 TraceCheckUtils]: 60: Hoare triple {22738#(<= main_~i~0 15)} assume true; {22738#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:26,807 INFO L273 TraceCheckUtils]: 61: Hoare triple {22738#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22738#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:26,807 INFO L273 TraceCheckUtils]: 62: Hoare triple {22738#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22738#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:26,808 INFO L273 TraceCheckUtils]: 63: Hoare triple {22738#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22739#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:26,809 INFO L273 TraceCheckUtils]: 64: Hoare triple {22739#(<= main_~i~0 16)} assume true; {22739#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:26,809 INFO L273 TraceCheckUtils]: 65: Hoare triple {22739#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22739#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:26,809 INFO L273 TraceCheckUtils]: 66: Hoare triple {22739#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22739#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:26,810 INFO L273 TraceCheckUtils]: 67: Hoare triple {22739#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22740#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:26,811 INFO L273 TraceCheckUtils]: 68: Hoare triple {22740#(<= main_~i~0 17)} assume true; {22740#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:26,811 INFO L273 TraceCheckUtils]: 69: Hoare triple {22740#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22740#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:26,812 INFO L273 TraceCheckUtils]: 70: Hoare triple {22740#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22740#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:26,812 INFO L273 TraceCheckUtils]: 71: Hoare triple {22740#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22741#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:26,813 INFO L273 TraceCheckUtils]: 72: Hoare triple {22741#(<= main_~i~0 18)} assume true; {22741#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:26,813 INFO L273 TraceCheckUtils]: 73: Hoare triple {22741#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22741#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:26,814 INFO L273 TraceCheckUtils]: 74: Hoare triple {22741#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22741#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:26,815 INFO L273 TraceCheckUtils]: 75: Hoare triple {22741#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22742#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:26,815 INFO L273 TraceCheckUtils]: 76: Hoare triple {22742#(<= main_~i~0 19)} assume true; {22742#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:26,816 INFO L273 TraceCheckUtils]: 77: Hoare triple {22742#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22742#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:26,816 INFO L273 TraceCheckUtils]: 78: Hoare triple {22742#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22742#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:26,817 INFO L273 TraceCheckUtils]: 79: Hoare triple {22742#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22743#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:26,817 INFO L273 TraceCheckUtils]: 80: Hoare triple {22743#(<= main_~i~0 20)} assume true; {22743#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:26,818 INFO L273 TraceCheckUtils]: 81: Hoare triple {22743#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22743#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:26,818 INFO L273 TraceCheckUtils]: 82: Hoare triple {22743#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22743#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:26,819 INFO L273 TraceCheckUtils]: 83: Hoare triple {22743#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22744#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:26,820 INFO L273 TraceCheckUtils]: 84: Hoare triple {22744#(<= main_~i~0 21)} assume true; {22744#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:26,820 INFO L273 TraceCheckUtils]: 85: Hoare triple {22744#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22744#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:26,821 INFO L273 TraceCheckUtils]: 86: Hoare triple {22744#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22744#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:26,821 INFO L273 TraceCheckUtils]: 87: Hoare triple {22744#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22745#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:26,822 INFO L273 TraceCheckUtils]: 88: Hoare triple {22745#(<= main_~i~0 22)} assume true; {22745#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:26,822 INFO L273 TraceCheckUtils]: 89: Hoare triple {22745#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22745#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:26,823 INFO L273 TraceCheckUtils]: 90: Hoare triple {22745#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22745#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:26,823 INFO L273 TraceCheckUtils]: 91: Hoare triple {22745#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22746#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:26,824 INFO L273 TraceCheckUtils]: 92: Hoare triple {22746#(<= main_~i~0 23)} assume true; {22746#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:26,824 INFO L273 TraceCheckUtils]: 93: Hoare triple {22746#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22746#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:26,825 INFO L273 TraceCheckUtils]: 94: Hoare triple {22746#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22746#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:26,826 INFO L273 TraceCheckUtils]: 95: Hoare triple {22746#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22747#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:26,826 INFO L273 TraceCheckUtils]: 96: Hoare triple {22747#(<= main_~i~0 24)} assume true; {22747#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:26,827 INFO L273 TraceCheckUtils]: 97: Hoare triple {22747#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22747#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:26,827 INFO L273 TraceCheckUtils]: 98: Hoare triple {22747#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22747#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:26,828 INFO L273 TraceCheckUtils]: 99: Hoare triple {22747#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22748#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:26,828 INFO L273 TraceCheckUtils]: 100: Hoare triple {22748#(<= main_~i~0 25)} assume true; {22748#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:26,829 INFO L273 TraceCheckUtils]: 101: Hoare triple {22748#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22748#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:26,829 INFO L273 TraceCheckUtils]: 102: Hoare triple {22748#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22748#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:26,830 INFO L273 TraceCheckUtils]: 103: Hoare triple {22748#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22749#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:26,831 INFO L273 TraceCheckUtils]: 104: Hoare triple {22749#(<= main_~i~0 26)} assume true; {22749#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:26,831 INFO L273 TraceCheckUtils]: 105: Hoare triple {22749#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22749#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:26,832 INFO L273 TraceCheckUtils]: 106: Hoare triple {22749#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22749#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:26,832 INFO L273 TraceCheckUtils]: 107: Hoare triple {22749#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22750#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:26,833 INFO L273 TraceCheckUtils]: 108: Hoare triple {22750#(<= main_~i~0 27)} assume true; {22750#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:26,833 INFO L273 TraceCheckUtils]: 109: Hoare triple {22750#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22750#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:26,834 INFO L273 TraceCheckUtils]: 110: Hoare triple {22750#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22750#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:26,834 INFO L273 TraceCheckUtils]: 111: Hoare triple {22750#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22751#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:26,835 INFO L273 TraceCheckUtils]: 112: Hoare triple {22751#(<= main_~i~0 28)} assume true; {22751#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:26,835 INFO L273 TraceCheckUtils]: 113: Hoare triple {22751#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22751#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:26,836 INFO L273 TraceCheckUtils]: 114: Hoare triple {22751#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22751#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:26,837 INFO L273 TraceCheckUtils]: 115: Hoare triple {22751#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22752#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:26,837 INFO L273 TraceCheckUtils]: 116: Hoare triple {22752#(<= main_~i~0 29)} assume true; {22752#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:26,838 INFO L273 TraceCheckUtils]: 117: Hoare triple {22752#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22752#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:26,838 INFO L273 TraceCheckUtils]: 118: Hoare triple {22752#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22752#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:26,839 INFO L273 TraceCheckUtils]: 119: Hoare triple {22752#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22753#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:26,839 INFO L273 TraceCheckUtils]: 120: Hoare triple {22753#(<= main_~i~0 30)} assume true; {22753#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:26,840 INFO L273 TraceCheckUtils]: 121: Hoare triple {22753#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22753#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:26,840 INFO L273 TraceCheckUtils]: 122: Hoare triple {22753#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22753#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:26,841 INFO L273 TraceCheckUtils]: 123: Hoare triple {22753#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22754#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:26,842 INFO L273 TraceCheckUtils]: 124: Hoare triple {22754#(<= main_~i~0 31)} assume true; {22754#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:26,842 INFO L273 TraceCheckUtils]: 125: Hoare triple {22754#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22754#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:26,843 INFO L273 TraceCheckUtils]: 126: Hoare triple {22754#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22754#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:26,843 INFO L273 TraceCheckUtils]: 127: Hoare triple {22754#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22755#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:26,844 INFO L273 TraceCheckUtils]: 128: Hoare triple {22755#(<= main_~i~0 32)} assume true; {22755#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:26,844 INFO L273 TraceCheckUtils]: 129: Hoare triple {22755#(<= main_~i~0 32)} assume !(~i~0 < 100000); {22724#false} is VALID [2018-11-14 18:42:26,845 INFO L273 TraceCheckUtils]: 130: Hoare triple {22724#false} havoc ~x~0;~x~0 := 0; {22724#false} is VALID [2018-11-14 18:42:26,845 INFO L273 TraceCheckUtils]: 131: Hoare triple {22724#false} assume true; {22724#false} is VALID [2018-11-14 18:42:26,845 INFO L273 TraceCheckUtils]: 132: Hoare triple {22724#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {22724#false} is VALID [2018-11-14 18:42:26,845 INFO L256 TraceCheckUtils]: 133: Hoare triple {22724#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {22724#false} is VALID [2018-11-14 18:42:26,845 INFO L273 TraceCheckUtils]: 134: Hoare triple {22724#false} ~cond := #in~cond; {22724#false} is VALID [2018-11-14 18:42:26,846 INFO L273 TraceCheckUtils]: 135: Hoare triple {22724#false} assume ~cond == 0; {22724#false} is VALID [2018-11-14 18:42:26,846 INFO L273 TraceCheckUtils]: 136: Hoare triple {22724#false} assume !false; {22724#false} is VALID [2018-11-14 18:42:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:26,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:26,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 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-14 18:42:26,868 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:42:26,969 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-14 18:42:26,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:26,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:27,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {22723#true} call ULTIMATE.init(); {22723#true} is VALID [2018-11-14 18:42:27,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {22723#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22723#true} is VALID [2018-11-14 18:42:27,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {22723#true} assume true; {22723#true} is VALID [2018-11-14 18:42:27,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22723#true} {22723#true} #91#return; {22723#true} is VALID [2018-11-14 18:42:27,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {22723#true} call #t~ret13 := main(); {22723#true} is VALID [2018-11-14 18:42:27,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {22723#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {22723#true} is VALID [2018-11-14 18:42:27,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {22723#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {22723#true} is VALID [2018-11-14 18:42:27,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {22723#true} ~i~0 := 2; {22725#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:27,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {22725#(<= main_~i~0 2)} assume true; {22725#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:27,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {22725#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22725#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:27,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {22725#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22725#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:27,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {22725#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22726#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:27,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {22726#(<= main_~i~0 3)} assume true; {22726#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:27,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {22726#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22726#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:27,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {22726#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22726#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:27,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {22726#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22727#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:27,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {22727#(<= main_~i~0 4)} assume true; {22727#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:27,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {22727#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22727#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:27,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {22727#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22727#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:27,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {22727#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22728#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:27,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {22728#(<= main_~i~0 5)} assume true; {22728#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:27,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {22728#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22728#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:27,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {22728#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22728#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:27,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {22728#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22729#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:27,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {22729#(<= main_~i~0 6)} assume true; {22729#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:27,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {22729#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22729#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:27,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {22729#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22729#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:27,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {22729#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22730#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:27,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {22730#(<= main_~i~0 7)} assume true; {22730#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:27,256 INFO L273 TraceCheckUtils]: 29: Hoare triple {22730#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22730#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:27,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {22730#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22730#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:27,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {22730#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22731#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:27,258 INFO L273 TraceCheckUtils]: 32: Hoare triple {22731#(<= main_~i~0 8)} assume true; {22731#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:27,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {22731#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22731#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:27,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {22731#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22731#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:27,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {22731#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22732#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:27,260 INFO L273 TraceCheckUtils]: 36: Hoare triple {22732#(<= main_~i~0 9)} assume true; {22732#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:27,260 INFO L273 TraceCheckUtils]: 37: Hoare triple {22732#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22732#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:27,261 INFO L273 TraceCheckUtils]: 38: Hoare triple {22732#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22732#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:27,261 INFO L273 TraceCheckUtils]: 39: Hoare triple {22732#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22733#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:27,262 INFO L273 TraceCheckUtils]: 40: Hoare triple {22733#(<= main_~i~0 10)} assume true; {22733#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:27,262 INFO L273 TraceCheckUtils]: 41: Hoare triple {22733#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22733#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:27,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {22733#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22733#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:27,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {22733#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22734#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:27,264 INFO L273 TraceCheckUtils]: 44: Hoare triple {22734#(<= main_~i~0 11)} assume true; {22734#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:27,265 INFO L273 TraceCheckUtils]: 45: Hoare triple {22734#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22734#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:27,265 INFO L273 TraceCheckUtils]: 46: Hoare triple {22734#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22734#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:27,266 INFO L273 TraceCheckUtils]: 47: Hoare triple {22734#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22735#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:27,266 INFO L273 TraceCheckUtils]: 48: Hoare triple {22735#(<= main_~i~0 12)} assume true; {22735#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:27,267 INFO L273 TraceCheckUtils]: 49: Hoare triple {22735#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22735#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:27,267 INFO L273 TraceCheckUtils]: 50: Hoare triple {22735#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22735#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:27,268 INFO L273 TraceCheckUtils]: 51: Hoare triple {22735#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22736#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:27,269 INFO L273 TraceCheckUtils]: 52: Hoare triple {22736#(<= main_~i~0 13)} assume true; {22736#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:27,269 INFO L273 TraceCheckUtils]: 53: Hoare triple {22736#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22736#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:27,270 INFO L273 TraceCheckUtils]: 54: Hoare triple {22736#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22736#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:27,270 INFO L273 TraceCheckUtils]: 55: Hoare triple {22736#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22737#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:27,271 INFO L273 TraceCheckUtils]: 56: Hoare triple {22737#(<= main_~i~0 14)} assume true; {22737#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:27,271 INFO L273 TraceCheckUtils]: 57: Hoare triple {22737#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22737#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:27,272 INFO L273 TraceCheckUtils]: 58: Hoare triple {22737#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22737#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:27,272 INFO L273 TraceCheckUtils]: 59: Hoare triple {22737#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22738#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:27,273 INFO L273 TraceCheckUtils]: 60: Hoare triple {22738#(<= main_~i~0 15)} assume true; {22738#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:27,273 INFO L273 TraceCheckUtils]: 61: Hoare triple {22738#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22738#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:27,274 INFO L273 TraceCheckUtils]: 62: Hoare triple {22738#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22738#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:27,275 INFO L273 TraceCheckUtils]: 63: Hoare triple {22738#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22739#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:27,275 INFO L273 TraceCheckUtils]: 64: Hoare triple {22739#(<= main_~i~0 16)} assume true; {22739#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:27,276 INFO L273 TraceCheckUtils]: 65: Hoare triple {22739#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22739#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:27,276 INFO L273 TraceCheckUtils]: 66: Hoare triple {22739#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22739#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:27,277 INFO L273 TraceCheckUtils]: 67: Hoare triple {22739#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22740#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:27,277 INFO L273 TraceCheckUtils]: 68: Hoare triple {22740#(<= main_~i~0 17)} assume true; {22740#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:27,278 INFO L273 TraceCheckUtils]: 69: Hoare triple {22740#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22740#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:27,278 INFO L273 TraceCheckUtils]: 70: Hoare triple {22740#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22740#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:27,279 INFO L273 TraceCheckUtils]: 71: Hoare triple {22740#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22741#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:27,280 INFO L273 TraceCheckUtils]: 72: Hoare triple {22741#(<= main_~i~0 18)} assume true; {22741#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:27,280 INFO L273 TraceCheckUtils]: 73: Hoare triple {22741#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22741#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:27,280 INFO L273 TraceCheckUtils]: 74: Hoare triple {22741#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22741#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:27,281 INFO L273 TraceCheckUtils]: 75: Hoare triple {22741#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22742#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:27,282 INFO L273 TraceCheckUtils]: 76: Hoare triple {22742#(<= main_~i~0 19)} assume true; {22742#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:27,282 INFO L273 TraceCheckUtils]: 77: Hoare triple {22742#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22742#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:27,283 INFO L273 TraceCheckUtils]: 78: Hoare triple {22742#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22742#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:27,283 INFO L273 TraceCheckUtils]: 79: Hoare triple {22742#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22743#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:27,284 INFO L273 TraceCheckUtils]: 80: Hoare triple {22743#(<= main_~i~0 20)} assume true; {22743#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:27,284 INFO L273 TraceCheckUtils]: 81: Hoare triple {22743#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22743#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:27,285 INFO L273 TraceCheckUtils]: 82: Hoare triple {22743#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22743#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:27,286 INFO L273 TraceCheckUtils]: 83: Hoare triple {22743#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22744#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:27,286 INFO L273 TraceCheckUtils]: 84: Hoare triple {22744#(<= main_~i~0 21)} assume true; {22744#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:27,287 INFO L273 TraceCheckUtils]: 85: Hoare triple {22744#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22744#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:27,287 INFO L273 TraceCheckUtils]: 86: Hoare triple {22744#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22744#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:27,288 INFO L273 TraceCheckUtils]: 87: Hoare triple {22744#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22745#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:27,288 INFO L273 TraceCheckUtils]: 88: Hoare triple {22745#(<= main_~i~0 22)} assume true; {22745#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:27,289 INFO L273 TraceCheckUtils]: 89: Hoare triple {22745#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22745#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:27,289 INFO L273 TraceCheckUtils]: 90: Hoare triple {22745#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22745#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:27,290 INFO L273 TraceCheckUtils]: 91: Hoare triple {22745#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22746#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:27,290 INFO L273 TraceCheckUtils]: 92: Hoare triple {22746#(<= main_~i~0 23)} assume true; {22746#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:27,291 INFO L273 TraceCheckUtils]: 93: Hoare triple {22746#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22746#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:27,291 INFO L273 TraceCheckUtils]: 94: Hoare triple {22746#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22746#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:27,292 INFO L273 TraceCheckUtils]: 95: Hoare triple {22746#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22747#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:27,293 INFO L273 TraceCheckUtils]: 96: Hoare triple {22747#(<= main_~i~0 24)} assume true; {22747#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:27,293 INFO L273 TraceCheckUtils]: 97: Hoare triple {22747#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22747#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:27,294 INFO L273 TraceCheckUtils]: 98: Hoare triple {22747#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22747#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:27,294 INFO L273 TraceCheckUtils]: 99: Hoare triple {22747#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22748#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:27,295 INFO L273 TraceCheckUtils]: 100: Hoare triple {22748#(<= main_~i~0 25)} assume true; {22748#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:27,295 INFO L273 TraceCheckUtils]: 101: Hoare triple {22748#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22748#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:27,296 INFO L273 TraceCheckUtils]: 102: Hoare triple {22748#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22748#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:27,297 INFO L273 TraceCheckUtils]: 103: Hoare triple {22748#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22749#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:27,297 INFO L273 TraceCheckUtils]: 104: Hoare triple {22749#(<= main_~i~0 26)} assume true; {22749#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:27,298 INFO L273 TraceCheckUtils]: 105: Hoare triple {22749#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22749#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:27,298 INFO L273 TraceCheckUtils]: 106: Hoare triple {22749#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22749#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:27,299 INFO L273 TraceCheckUtils]: 107: Hoare triple {22749#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22750#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:27,299 INFO L273 TraceCheckUtils]: 108: Hoare triple {22750#(<= main_~i~0 27)} assume true; {22750#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:27,300 INFO L273 TraceCheckUtils]: 109: Hoare triple {22750#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22750#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:27,300 INFO L273 TraceCheckUtils]: 110: Hoare triple {22750#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22750#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:27,301 INFO L273 TraceCheckUtils]: 111: Hoare triple {22750#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22751#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:27,302 INFO L273 TraceCheckUtils]: 112: Hoare triple {22751#(<= main_~i~0 28)} assume true; {22751#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:27,302 INFO L273 TraceCheckUtils]: 113: Hoare triple {22751#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22751#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:27,303 INFO L273 TraceCheckUtils]: 114: Hoare triple {22751#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22751#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:27,303 INFO L273 TraceCheckUtils]: 115: Hoare triple {22751#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22752#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:27,304 INFO L273 TraceCheckUtils]: 116: Hoare triple {22752#(<= main_~i~0 29)} assume true; {22752#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:27,304 INFO L273 TraceCheckUtils]: 117: Hoare triple {22752#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22752#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:27,305 INFO L273 TraceCheckUtils]: 118: Hoare triple {22752#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22752#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:27,305 INFO L273 TraceCheckUtils]: 119: Hoare triple {22752#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22753#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:27,306 INFO L273 TraceCheckUtils]: 120: Hoare triple {22753#(<= main_~i~0 30)} assume true; {22753#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:27,306 INFO L273 TraceCheckUtils]: 121: Hoare triple {22753#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22753#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:27,307 INFO L273 TraceCheckUtils]: 122: Hoare triple {22753#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22753#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:27,307 INFO L273 TraceCheckUtils]: 123: Hoare triple {22753#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22754#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:27,308 INFO L273 TraceCheckUtils]: 124: Hoare triple {22754#(<= main_~i~0 31)} assume true; {22754#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:27,308 INFO L273 TraceCheckUtils]: 125: Hoare triple {22754#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {22754#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:27,309 INFO L273 TraceCheckUtils]: 126: Hoare triple {22754#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22754#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:27,309 INFO L273 TraceCheckUtils]: 127: Hoare triple {22754#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {22755#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:27,310 INFO L273 TraceCheckUtils]: 128: Hoare triple {22755#(<= main_~i~0 32)} assume true; {22755#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:27,310 INFO L273 TraceCheckUtils]: 129: Hoare triple {22755#(<= main_~i~0 32)} assume !(~i~0 < 100000); {22724#false} is VALID [2018-11-14 18:42:27,311 INFO L273 TraceCheckUtils]: 130: Hoare triple {22724#false} havoc ~x~0;~x~0 := 0; {22724#false} is VALID [2018-11-14 18:42:27,311 INFO L273 TraceCheckUtils]: 131: Hoare triple {22724#false} assume true; {22724#false} is VALID [2018-11-14 18:42:27,311 INFO L273 TraceCheckUtils]: 132: Hoare triple {22724#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {22724#false} is VALID [2018-11-14 18:42:27,311 INFO L256 TraceCheckUtils]: 133: Hoare triple {22724#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {22724#false} is VALID [2018-11-14 18:42:27,311 INFO L273 TraceCheckUtils]: 134: Hoare triple {22724#false} ~cond := #in~cond; {22724#false} is VALID [2018-11-14 18:42:27,311 INFO L273 TraceCheckUtils]: 135: Hoare triple {22724#false} assume ~cond == 0; {22724#false} is VALID [2018-11-14 18:42:27,312 INFO L273 TraceCheckUtils]: 136: Hoare triple {22724#false} assume !false; {22724#false} is VALID [2018-11-14 18:42:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:27,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:27,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-14 18:42:27,346 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 137 [2018-11-14 18:42:27,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:27,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 18:42:27,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:27,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 18:42:27,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 18:42:27,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:42:27,539 INFO L87 Difference]: Start difference. First operand 179 states and 244 transitions. Second operand 33 states. [2018-11-14 18:42:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:28,888 INFO L93 Difference]: Finished difference Result 206 states and 279 transitions. [2018-11-14 18:42:28,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 18:42:28,888 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 137 [2018-11-14 18:42:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:42:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 279 transitions. [2018-11-14 18:42:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:42:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 279 transitions. [2018-11-14 18:42:28,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 279 transitions. [2018-11-14 18:42:29,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:29,160 INFO L225 Difference]: With dead ends: 206 [2018-11-14 18:42:29,160 INFO L226 Difference]: Without dead ends: 187 [2018-11-14 18:42:29,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:42:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-14 18:42:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2018-11-14 18:42:29,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:29,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 184 states. [2018-11-14 18:42:29,192 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 184 states. [2018-11-14 18:42:29,192 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 184 states. [2018-11-14 18:42:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:29,195 INFO L93 Difference]: Finished difference Result 187 states and 256 transitions. [2018-11-14 18:42:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 256 transitions. [2018-11-14 18:42:29,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:29,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:29,195 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 187 states. [2018-11-14 18:42:29,196 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 187 states. [2018-11-14 18:42:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:29,199 INFO L93 Difference]: Finished difference Result 187 states and 256 transitions. [2018-11-14 18:42:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 256 transitions. [2018-11-14 18:42:29,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:29,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:29,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:29,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-14 18:42:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 251 transitions. [2018-11-14 18:42:29,203 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 251 transitions. Word has length 137 [2018-11-14 18:42:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:29,204 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 251 transitions. [2018-11-14 18:42:29,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 18:42:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 251 transitions. [2018-11-14 18:42:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-14 18:42:29,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:29,205 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:29,205 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:29,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:29,205 INFO L82 PathProgramCache]: Analyzing trace with hash -986848102, now seen corresponding path program 31 times [2018-11-14 18:42:29,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:29,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:29,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:29,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:29,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:29,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {24017#true} call ULTIMATE.init(); {24017#true} is VALID [2018-11-14 18:42:29,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {24017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24017#true} is VALID [2018-11-14 18:42:29,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {24017#true} assume true; {24017#true} is VALID [2018-11-14 18:42:29,905 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24017#true} {24017#true} #91#return; {24017#true} is VALID [2018-11-14 18:42:29,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {24017#true} call #t~ret13 := main(); {24017#true} is VALID [2018-11-14 18:42:29,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {24017#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {24017#true} is VALID [2018-11-14 18:42:29,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {24017#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {24017#true} is VALID [2018-11-14 18:42:29,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {24017#true} ~i~0 := 2; {24019#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:29,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {24019#(<= main_~i~0 2)} assume true; {24019#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:29,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {24019#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24019#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:29,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {24019#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24019#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:29,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {24019#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24020#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:29,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {24020#(<= main_~i~0 3)} assume true; {24020#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:29,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {24020#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24020#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:29,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {24020#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24020#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:29,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {24020#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24021#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:29,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {24021#(<= main_~i~0 4)} assume true; {24021#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:29,911 INFO L273 TraceCheckUtils]: 17: Hoare triple {24021#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24021#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:29,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {24021#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24021#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:29,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {24021#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24022#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:29,912 INFO L273 TraceCheckUtils]: 20: Hoare triple {24022#(<= main_~i~0 5)} assume true; {24022#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:29,913 INFO L273 TraceCheckUtils]: 21: Hoare triple {24022#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24022#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:29,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {24022#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24022#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:29,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {24022#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24023#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:29,915 INFO L273 TraceCheckUtils]: 24: Hoare triple {24023#(<= main_~i~0 6)} assume true; {24023#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:29,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {24023#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24023#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:29,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {24023#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24023#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:29,916 INFO L273 TraceCheckUtils]: 27: Hoare triple {24023#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24024#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:29,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {24024#(<= main_~i~0 7)} assume true; {24024#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:29,917 INFO L273 TraceCheckUtils]: 29: Hoare triple {24024#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24024#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:29,918 INFO L273 TraceCheckUtils]: 30: Hoare triple {24024#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24024#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:29,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {24024#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24025#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:29,919 INFO L273 TraceCheckUtils]: 32: Hoare triple {24025#(<= main_~i~0 8)} assume true; {24025#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:29,919 INFO L273 TraceCheckUtils]: 33: Hoare triple {24025#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24025#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:29,920 INFO L273 TraceCheckUtils]: 34: Hoare triple {24025#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24025#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:29,921 INFO L273 TraceCheckUtils]: 35: Hoare triple {24025#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24026#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:29,921 INFO L273 TraceCheckUtils]: 36: Hoare triple {24026#(<= main_~i~0 9)} assume true; {24026#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:29,922 INFO L273 TraceCheckUtils]: 37: Hoare triple {24026#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24026#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:29,922 INFO L273 TraceCheckUtils]: 38: Hoare triple {24026#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24026#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:29,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {24026#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24027#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:29,923 INFO L273 TraceCheckUtils]: 40: Hoare triple {24027#(<= main_~i~0 10)} assume true; {24027#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:29,924 INFO L273 TraceCheckUtils]: 41: Hoare triple {24027#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24027#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:29,924 INFO L273 TraceCheckUtils]: 42: Hoare triple {24027#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24027#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:29,925 INFO L273 TraceCheckUtils]: 43: Hoare triple {24027#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24028#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:29,926 INFO L273 TraceCheckUtils]: 44: Hoare triple {24028#(<= main_~i~0 11)} assume true; {24028#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:29,926 INFO L273 TraceCheckUtils]: 45: Hoare triple {24028#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24028#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:29,926 INFO L273 TraceCheckUtils]: 46: Hoare triple {24028#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24028#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:29,927 INFO L273 TraceCheckUtils]: 47: Hoare triple {24028#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24029#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:29,928 INFO L273 TraceCheckUtils]: 48: Hoare triple {24029#(<= main_~i~0 12)} assume true; {24029#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:29,928 INFO L273 TraceCheckUtils]: 49: Hoare triple {24029#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24029#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:29,929 INFO L273 TraceCheckUtils]: 50: Hoare triple {24029#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24029#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:29,929 INFO L273 TraceCheckUtils]: 51: Hoare triple {24029#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24030#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:29,930 INFO L273 TraceCheckUtils]: 52: Hoare triple {24030#(<= main_~i~0 13)} assume true; {24030#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:29,930 INFO L273 TraceCheckUtils]: 53: Hoare triple {24030#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24030#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:29,931 INFO L273 TraceCheckUtils]: 54: Hoare triple {24030#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24030#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:29,932 INFO L273 TraceCheckUtils]: 55: Hoare triple {24030#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24031#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:29,932 INFO L273 TraceCheckUtils]: 56: Hoare triple {24031#(<= main_~i~0 14)} assume true; {24031#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:29,933 INFO L273 TraceCheckUtils]: 57: Hoare triple {24031#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24031#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:29,933 INFO L273 TraceCheckUtils]: 58: Hoare triple {24031#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24031#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:29,934 INFO L273 TraceCheckUtils]: 59: Hoare triple {24031#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24032#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:29,934 INFO L273 TraceCheckUtils]: 60: Hoare triple {24032#(<= main_~i~0 15)} assume true; {24032#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:29,935 INFO L273 TraceCheckUtils]: 61: Hoare triple {24032#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24032#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:29,935 INFO L273 TraceCheckUtils]: 62: Hoare triple {24032#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24032#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:29,936 INFO L273 TraceCheckUtils]: 63: Hoare triple {24032#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24033#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:29,937 INFO L273 TraceCheckUtils]: 64: Hoare triple {24033#(<= main_~i~0 16)} assume true; {24033#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:29,937 INFO L273 TraceCheckUtils]: 65: Hoare triple {24033#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24033#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:29,938 INFO L273 TraceCheckUtils]: 66: Hoare triple {24033#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24033#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:29,938 INFO L273 TraceCheckUtils]: 67: Hoare triple {24033#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24034#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:29,939 INFO L273 TraceCheckUtils]: 68: Hoare triple {24034#(<= main_~i~0 17)} assume true; {24034#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:29,939 INFO L273 TraceCheckUtils]: 69: Hoare triple {24034#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24034#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:29,940 INFO L273 TraceCheckUtils]: 70: Hoare triple {24034#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24034#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:29,940 INFO L273 TraceCheckUtils]: 71: Hoare triple {24034#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24035#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:29,941 INFO L273 TraceCheckUtils]: 72: Hoare triple {24035#(<= main_~i~0 18)} assume true; {24035#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:29,941 INFO L273 TraceCheckUtils]: 73: Hoare triple {24035#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24035#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:29,942 INFO L273 TraceCheckUtils]: 74: Hoare triple {24035#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24035#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:29,943 INFO L273 TraceCheckUtils]: 75: Hoare triple {24035#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24036#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:29,943 INFO L273 TraceCheckUtils]: 76: Hoare triple {24036#(<= main_~i~0 19)} assume true; {24036#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:29,944 INFO L273 TraceCheckUtils]: 77: Hoare triple {24036#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24036#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:29,944 INFO L273 TraceCheckUtils]: 78: Hoare triple {24036#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24036#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:29,945 INFO L273 TraceCheckUtils]: 79: Hoare triple {24036#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24037#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:29,945 INFO L273 TraceCheckUtils]: 80: Hoare triple {24037#(<= main_~i~0 20)} assume true; {24037#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:29,946 INFO L273 TraceCheckUtils]: 81: Hoare triple {24037#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24037#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:29,946 INFO L273 TraceCheckUtils]: 82: Hoare triple {24037#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24037#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:29,947 INFO L273 TraceCheckUtils]: 83: Hoare triple {24037#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24038#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:29,948 INFO L273 TraceCheckUtils]: 84: Hoare triple {24038#(<= main_~i~0 21)} assume true; {24038#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:29,948 INFO L273 TraceCheckUtils]: 85: Hoare triple {24038#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24038#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:29,949 INFO L273 TraceCheckUtils]: 86: Hoare triple {24038#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24038#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:29,949 INFO L273 TraceCheckUtils]: 87: Hoare triple {24038#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24039#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:29,950 INFO L273 TraceCheckUtils]: 88: Hoare triple {24039#(<= main_~i~0 22)} assume true; {24039#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:29,950 INFO L273 TraceCheckUtils]: 89: Hoare triple {24039#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24039#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:29,951 INFO L273 TraceCheckUtils]: 90: Hoare triple {24039#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24039#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:29,951 INFO L273 TraceCheckUtils]: 91: Hoare triple {24039#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24040#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:29,952 INFO L273 TraceCheckUtils]: 92: Hoare triple {24040#(<= main_~i~0 23)} assume true; {24040#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:29,952 INFO L273 TraceCheckUtils]: 93: Hoare triple {24040#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24040#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:29,953 INFO L273 TraceCheckUtils]: 94: Hoare triple {24040#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24040#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:29,954 INFO L273 TraceCheckUtils]: 95: Hoare triple {24040#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24041#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:29,954 INFO L273 TraceCheckUtils]: 96: Hoare triple {24041#(<= main_~i~0 24)} assume true; {24041#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:29,955 INFO L273 TraceCheckUtils]: 97: Hoare triple {24041#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24041#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:29,955 INFO L273 TraceCheckUtils]: 98: Hoare triple {24041#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24041#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:29,956 INFO L273 TraceCheckUtils]: 99: Hoare triple {24041#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24042#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:29,956 INFO L273 TraceCheckUtils]: 100: Hoare triple {24042#(<= main_~i~0 25)} assume true; {24042#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:29,957 INFO L273 TraceCheckUtils]: 101: Hoare triple {24042#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24042#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:29,957 INFO L273 TraceCheckUtils]: 102: Hoare triple {24042#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24042#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:29,958 INFO L273 TraceCheckUtils]: 103: Hoare triple {24042#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24043#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:29,959 INFO L273 TraceCheckUtils]: 104: Hoare triple {24043#(<= main_~i~0 26)} assume true; {24043#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:29,959 INFO L273 TraceCheckUtils]: 105: Hoare triple {24043#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24043#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:29,960 INFO L273 TraceCheckUtils]: 106: Hoare triple {24043#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24043#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:29,960 INFO L273 TraceCheckUtils]: 107: Hoare triple {24043#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24044#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:29,961 INFO L273 TraceCheckUtils]: 108: Hoare triple {24044#(<= main_~i~0 27)} assume true; {24044#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:29,961 INFO L273 TraceCheckUtils]: 109: Hoare triple {24044#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24044#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:29,962 INFO L273 TraceCheckUtils]: 110: Hoare triple {24044#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24044#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:29,962 INFO L273 TraceCheckUtils]: 111: Hoare triple {24044#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24045#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:29,963 INFO L273 TraceCheckUtils]: 112: Hoare triple {24045#(<= main_~i~0 28)} assume true; {24045#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:29,963 INFO L273 TraceCheckUtils]: 113: Hoare triple {24045#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24045#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:29,964 INFO L273 TraceCheckUtils]: 114: Hoare triple {24045#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24045#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:29,965 INFO L273 TraceCheckUtils]: 115: Hoare triple {24045#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24046#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:29,965 INFO L273 TraceCheckUtils]: 116: Hoare triple {24046#(<= main_~i~0 29)} assume true; {24046#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:29,966 INFO L273 TraceCheckUtils]: 117: Hoare triple {24046#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24046#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:29,966 INFO L273 TraceCheckUtils]: 118: Hoare triple {24046#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24046#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:29,967 INFO L273 TraceCheckUtils]: 119: Hoare triple {24046#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24047#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:29,967 INFO L273 TraceCheckUtils]: 120: Hoare triple {24047#(<= main_~i~0 30)} assume true; {24047#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:29,968 INFO L273 TraceCheckUtils]: 121: Hoare triple {24047#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24047#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:29,968 INFO L273 TraceCheckUtils]: 122: Hoare triple {24047#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24047#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:29,969 INFO L273 TraceCheckUtils]: 123: Hoare triple {24047#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24048#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:29,970 INFO L273 TraceCheckUtils]: 124: Hoare triple {24048#(<= main_~i~0 31)} assume true; {24048#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:29,970 INFO L273 TraceCheckUtils]: 125: Hoare triple {24048#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24048#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:29,971 INFO L273 TraceCheckUtils]: 126: Hoare triple {24048#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24048#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:29,971 INFO L273 TraceCheckUtils]: 127: Hoare triple {24048#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24049#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:29,972 INFO L273 TraceCheckUtils]: 128: Hoare triple {24049#(<= main_~i~0 32)} assume true; {24049#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:29,972 INFO L273 TraceCheckUtils]: 129: Hoare triple {24049#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24049#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:29,973 INFO L273 TraceCheckUtils]: 130: Hoare triple {24049#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24049#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:29,974 INFO L273 TraceCheckUtils]: 131: Hoare triple {24049#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24050#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:29,974 INFO L273 TraceCheckUtils]: 132: Hoare triple {24050#(<= main_~i~0 33)} assume true; {24050#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:29,975 INFO L273 TraceCheckUtils]: 133: Hoare triple {24050#(<= main_~i~0 33)} assume !(~i~0 < 100000); {24018#false} is VALID [2018-11-14 18:42:29,975 INFO L273 TraceCheckUtils]: 134: Hoare triple {24018#false} havoc ~x~0;~x~0 := 0; {24018#false} is VALID [2018-11-14 18:42:29,975 INFO L273 TraceCheckUtils]: 135: Hoare triple {24018#false} assume true; {24018#false} is VALID [2018-11-14 18:42:29,975 INFO L273 TraceCheckUtils]: 136: Hoare triple {24018#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {24018#false} is VALID [2018-11-14 18:42:29,975 INFO L256 TraceCheckUtils]: 137: Hoare triple {24018#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {24018#false} is VALID [2018-11-14 18:42:29,976 INFO L273 TraceCheckUtils]: 138: Hoare triple {24018#false} ~cond := #in~cond; {24018#false} is VALID [2018-11-14 18:42:29,976 INFO L273 TraceCheckUtils]: 139: Hoare triple {24018#false} assume ~cond == 0; {24018#false} is VALID [2018-11-14 18:42:29,976 INFO L273 TraceCheckUtils]: 140: Hoare triple {24018#false} assume !false; {24018#false} is VALID [2018-11-14 18:42:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:29,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:29,990 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-14 18:42:29,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:42:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:30,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:30,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {24017#true} call ULTIMATE.init(); {24017#true} is VALID [2018-11-14 18:42:30,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {24017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24017#true} is VALID [2018-11-14 18:42:30,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {24017#true} assume true; {24017#true} is VALID [2018-11-14 18:42:30,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24017#true} {24017#true} #91#return; {24017#true} is VALID [2018-11-14 18:42:30,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {24017#true} call #t~ret13 := main(); {24017#true} is VALID [2018-11-14 18:42:30,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {24017#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {24017#true} is VALID [2018-11-14 18:42:30,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {24017#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {24017#true} is VALID [2018-11-14 18:42:30,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {24017#true} ~i~0 := 2; {24019#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:30,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {24019#(<= main_~i~0 2)} assume true; {24019#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:30,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {24019#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24019#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:30,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {24019#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24019#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:30,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {24019#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24020#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:30,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {24020#(<= main_~i~0 3)} assume true; {24020#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:30,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {24020#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24020#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:30,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {24020#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24020#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:30,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {24020#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24021#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:30,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {24021#(<= main_~i~0 4)} assume true; {24021#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:30,357 INFO L273 TraceCheckUtils]: 17: Hoare triple {24021#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24021#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:30,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {24021#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24021#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:30,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {24021#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24022#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:30,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {24022#(<= main_~i~0 5)} assume true; {24022#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:30,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {24022#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24022#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:30,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {24022#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24022#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:30,360 INFO L273 TraceCheckUtils]: 23: Hoare triple {24022#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24023#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:30,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {24023#(<= main_~i~0 6)} assume true; {24023#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:30,361 INFO L273 TraceCheckUtils]: 25: Hoare triple {24023#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24023#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:30,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {24023#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24023#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:30,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {24023#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24024#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:30,363 INFO L273 TraceCheckUtils]: 28: Hoare triple {24024#(<= main_~i~0 7)} assume true; {24024#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:30,363 INFO L273 TraceCheckUtils]: 29: Hoare triple {24024#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24024#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:30,364 INFO L273 TraceCheckUtils]: 30: Hoare triple {24024#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24024#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:30,364 INFO L273 TraceCheckUtils]: 31: Hoare triple {24024#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24025#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:30,365 INFO L273 TraceCheckUtils]: 32: Hoare triple {24025#(<= main_~i~0 8)} assume true; {24025#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:30,365 INFO L273 TraceCheckUtils]: 33: Hoare triple {24025#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24025#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:30,366 INFO L273 TraceCheckUtils]: 34: Hoare triple {24025#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24025#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:30,367 INFO L273 TraceCheckUtils]: 35: Hoare triple {24025#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24026#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:30,367 INFO L273 TraceCheckUtils]: 36: Hoare triple {24026#(<= main_~i~0 9)} assume true; {24026#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:30,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {24026#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24026#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:30,368 INFO L273 TraceCheckUtils]: 38: Hoare triple {24026#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24026#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:30,369 INFO L273 TraceCheckUtils]: 39: Hoare triple {24026#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24027#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:30,369 INFO L273 TraceCheckUtils]: 40: Hoare triple {24027#(<= main_~i~0 10)} assume true; {24027#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:30,370 INFO L273 TraceCheckUtils]: 41: Hoare triple {24027#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24027#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:30,370 INFO L273 TraceCheckUtils]: 42: Hoare triple {24027#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24027#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:30,371 INFO L273 TraceCheckUtils]: 43: Hoare triple {24027#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24028#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:30,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {24028#(<= main_~i~0 11)} assume true; {24028#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:30,372 INFO L273 TraceCheckUtils]: 45: Hoare triple {24028#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24028#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:30,373 INFO L273 TraceCheckUtils]: 46: Hoare triple {24028#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24028#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:30,373 INFO L273 TraceCheckUtils]: 47: Hoare triple {24028#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24029#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:30,374 INFO L273 TraceCheckUtils]: 48: Hoare triple {24029#(<= main_~i~0 12)} assume true; {24029#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:30,374 INFO L273 TraceCheckUtils]: 49: Hoare triple {24029#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24029#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:30,375 INFO L273 TraceCheckUtils]: 50: Hoare triple {24029#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24029#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:30,375 INFO L273 TraceCheckUtils]: 51: Hoare triple {24029#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24030#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:30,376 INFO L273 TraceCheckUtils]: 52: Hoare triple {24030#(<= main_~i~0 13)} assume true; {24030#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:30,376 INFO L273 TraceCheckUtils]: 53: Hoare triple {24030#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24030#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:30,377 INFO L273 TraceCheckUtils]: 54: Hoare triple {24030#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24030#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:30,378 INFO L273 TraceCheckUtils]: 55: Hoare triple {24030#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24031#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:30,378 INFO L273 TraceCheckUtils]: 56: Hoare triple {24031#(<= main_~i~0 14)} assume true; {24031#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:30,379 INFO L273 TraceCheckUtils]: 57: Hoare triple {24031#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24031#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:30,379 INFO L273 TraceCheckUtils]: 58: Hoare triple {24031#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24031#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:30,380 INFO L273 TraceCheckUtils]: 59: Hoare triple {24031#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24032#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:30,380 INFO L273 TraceCheckUtils]: 60: Hoare triple {24032#(<= main_~i~0 15)} assume true; {24032#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:30,381 INFO L273 TraceCheckUtils]: 61: Hoare triple {24032#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24032#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:30,381 INFO L273 TraceCheckUtils]: 62: Hoare triple {24032#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24032#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:30,382 INFO L273 TraceCheckUtils]: 63: Hoare triple {24032#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24033#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:30,383 INFO L273 TraceCheckUtils]: 64: Hoare triple {24033#(<= main_~i~0 16)} assume true; {24033#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:30,383 INFO L273 TraceCheckUtils]: 65: Hoare triple {24033#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24033#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:30,384 INFO L273 TraceCheckUtils]: 66: Hoare triple {24033#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24033#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:30,384 INFO L273 TraceCheckUtils]: 67: Hoare triple {24033#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24034#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:30,385 INFO L273 TraceCheckUtils]: 68: Hoare triple {24034#(<= main_~i~0 17)} assume true; {24034#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:30,385 INFO L273 TraceCheckUtils]: 69: Hoare triple {24034#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24034#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:30,386 INFO L273 TraceCheckUtils]: 70: Hoare triple {24034#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24034#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:30,387 INFO L273 TraceCheckUtils]: 71: Hoare triple {24034#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24035#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:30,387 INFO L273 TraceCheckUtils]: 72: Hoare triple {24035#(<= main_~i~0 18)} assume true; {24035#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:30,388 INFO L273 TraceCheckUtils]: 73: Hoare triple {24035#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24035#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:30,388 INFO L273 TraceCheckUtils]: 74: Hoare triple {24035#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24035#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:30,389 INFO L273 TraceCheckUtils]: 75: Hoare triple {24035#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24036#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:30,389 INFO L273 TraceCheckUtils]: 76: Hoare triple {24036#(<= main_~i~0 19)} assume true; {24036#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:30,390 INFO L273 TraceCheckUtils]: 77: Hoare triple {24036#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24036#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:30,390 INFO L273 TraceCheckUtils]: 78: Hoare triple {24036#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24036#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:30,391 INFO L273 TraceCheckUtils]: 79: Hoare triple {24036#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24037#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:30,391 INFO L273 TraceCheckUtils]: 80: Hoare triple {24037#(<= main_~i~0 20)} assume true; {24037#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:30,392 INFO L273 TraceCheckUtils]: 81: Hoare triple {24037#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24037#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:30,392 INFO L273 TraceCheckUtils]: 82: Hoare triple {24037#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24037#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:30,393 INFO L273 TraceCheckUtils]: 83: Hoare triple {24037#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24038#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:30,394 INFO L273 TraceCheckUtils]: 84: Hoare triple {24038#(<= main_~i~0 21)} assume true; {24038#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:30,394 INFO L273 TraceCheckUtils]: 85: Hoare triple {24038#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24038#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:30,395 INFO L273 TraceCheckUtils]: 86: Hoare triple {24038#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24038#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:30,395 INFO L273 TraceCheckUtils]: 87: Hoare triple {24038#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24039#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:30,396 INFO L273 TraceCheckUtils]: 88: Hoare triple {24039#(<= main_~i~0 22)} assume true; {24039#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:30,396 INFO L273 TraceCheckUtils]: 89: Hoare triple {24039#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24039#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:30,397 INFO L273 TraceCheckUtils]: 90: Hoare triple {24039#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24039#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:30,398 INFO L273 TraceCheckUtils]: 91: Hoare triple {24039#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24040#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:30,398 INFO L273 TraceCheckUtils]: 92: Hoare triple {24040#(<= main_~i~0 23)} assume true; {24040#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:30,399 INFO L273 TraceCheckUtils]: 93: Hoare triple {24040#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24040#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:30,399 INFO L273 TraceCheckUtils]: 94: Hoare triple {24040#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24040#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:30,400 INFO L273 TraceCheckUtils]: 95: Hoare triple {24040#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24041#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:30,400 INFO L273 TraceCheckUtils]: 96: Hoare triple {24041#(<= main_~i~0 24)} assume true; {24041#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:30,401 INFO L273 TraceCheckUtils]: 97: Hoare triple {24041#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24041#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:30,401 INFO L273 TraceCheckUtils]: 98: Hoare triple {24041#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24041#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:30,402 INFO L273 TraceCheckUtils]: 99: Hoare triple {24041#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24042#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:30,402 INFO L273 TraceCheckUtils]: 100: Hoare triple {24042#(<= main_~i~0 25)} assume true; {24042#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:30,403 INFO L273 TraceCheckUtils]: 101: Hoare triple {24042#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24042#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:30,403 INFO L273 TraceCheckUtils]: 102: Hoare triple {24042#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24042#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:30,404 INFO L273 TraceCheckUtils]: 103: Hoare triple {24042#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24043#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:30,405 INFO L273 TraceCheckUtils]: 104: Hoare triple {24043#(<= main_~i~0 26)} assume true; {24043#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:30,405 INFO L273 TraceCheckUtils]: 105: Hoare triple {24043#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24043#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:30,406 INFO L273 TraceCheckUtils]: 106: Hoare triple {24043#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24043#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:30,406 INFO L273 TraceCheckUtils]: 107: Hoare triple {24043#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24044#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:30,407 INFO L273 TraceCheckUtils]: 108: Hoare triple {24044#(<= main_~i~0 27)} assume true; {24044#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:30,407 INFO L273 TraceCheckUtils]: 109: Hoare triple {24044#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24044#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:30,408 INFO L273 TraceCheckUtils]: 110: Hoare triple {24044#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24044#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:30,409 INFO L273 TraceCheckUtils]: 111: Hoare triple {24044#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24045#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:30,409 INFO L273 TraceCheckUtils]: 112: Hoare triple {24045#(<= main_~i~0 28)} assume true; {24045#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:30,410 INFO L273 TraceCheckUtils]: 113: Hoare triple {24045#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24045#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:30,410 INFO L273 TraceCheckUtils]: 114: Hoare triple {24045#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24045#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:30,411 INFO L273 TraceCheckUtils]: 115: Hoare triple {24045#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24046#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:30,411 INFO L273 TraceCheckUtils]: 116: Hoare triple {24046#(<= main_~i~0 29)} assume true; {24046#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:30,412 INFO L273 TraceCheckUtils]: 117: Hoare triple {24046#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24046#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:30,412 INFO L273 TraceCheckUtils]: 118: Hoare triple {24046#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24046#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:30,413 INFO L273 TraceCheckUtils]: 119: Hoare triple {24046#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24047#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:30,414 INFO L273 TraceCheckUtils]: 120: Hoare triple {24047#(<= main_~i~0 30)} assume true; {24047#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:30,414 INFO L273 TraceCheckUtils]: 121: Hoare triple {24047#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24047#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:30,415 INFO L273 TraceCheckUtils]: 122: Hoare triple {24047#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24047#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:30,415 INFO L273 TraceCheckUtils]: 123: Hoare triple {24047#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24048#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:30,416 INFO L273 TraceCheckUtils]: 124: Hoare triple {24048#(<= main_~i~0 31)} assume true; {24048#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:30,416 INFO L273 TraceCheckUtils]: 125: Hoare triple {24048#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24048#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:30,417 INFO L273 TraceCheckUtils]: 126: Hoare triple {24048#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24048#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:30,417 INFO L273 TraceCheckUtils]: 127: Hoare triple {24048#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24049#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:30,418 INFO L273 TraceCheckUtils]: 128: Hoare triple {24049#(<= main_~i~0 32)} assume true; {24049#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:30,418 INFO L273 TraceCheckUtils]: 129: Hoare triple {24049#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {24049#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:30,419 INFO L273 TraceCheckUtils]: 130: Hoare triple {24049#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24049#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:30,420 INFO L273 TraceCheckUtils]: 131: Hoare triple {24049#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {24050#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:30,420 INFO L273 TraceCheckUtils]: 132: Hoare triple {24050#(<= main_~i~0 33)} assume true; {24050#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:30,421 INFO L273 TraceCheckUtils]: 133: Hoare triple {24050#(<= main_~i~0 33)} assume !(~i~0 < 100000); {24018#false} is VALID [2018-11-14 18:42:30,421 INFO L273 TraceCheckUtils]: 134: Hoare triple {24018#false} havoc ~x~0;~x~0 := 0; {24018#false} is VALID [2018-11-14 18:42:30,421 INFO L273 TraceCheckUtils]: 135: Hoare triple {24018#false} assume true; {24018#false} is VALID [2018-11-14 18:42:30,421 INFO L273 TraceCheckUtils]: 136: Hoare triple {24018#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {24018#false} is VALID [2018-11-14 18:42:30,422 INFO L256 TraceCheckUtils]: 137: Hoare triple {24018#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {24018#false} is VALID [2018-11-14 18:42:30,422 INFO L273 TraceCheckUtils]: 138: Hoare triple {24018#false} ~cond := #in~cond; {24018#false} is VALID [2018-11-14 18:42:30,422 INFO L273 TraceCheckUtils]: 139: Hoare triple {24018#false} assume ~cond == 0; {24018#false} is VALID [2018-11-14 18:42:30,422 INFO L273 TraceCheckUtils]: 140: Hoare triple {24018#false} assume !false; {24018#false} is VALID [2018-11-14 18:42:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:30,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:30,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-11-14 18:42:30,458 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 141 [2018-11-14 18:42:30,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:30,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 18:42:30,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:30,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 18:42:30,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 18:42:30,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:42:30,595 INFO L87 Difference]: Start difference. First operand 184 states and 251 transitions. Second operand 34 states. [2018-11-14 18:42:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:31,799 INFO L93 Difference]: Finished difference Result 211 states and 286 transitions. [2018-11-14 18:42:31,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 18:42:31,799 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 141 [2018-11-14 18:42:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:42:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 286 transitions. [2018-11-14 18:42:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:42:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 286 transitions. [2018-11-14 18:42:31,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 286 transitions. [2018-11-14 18:42:32,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:32,103 INFO L225 Difference]: With dead ends: 211 [2018-11-14 18:42:32,103 INFO L226 Difference]: Without dead ends: 192 [2018-11-14 18:42:32,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:42:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-14 18:42:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2018-11-14 18:42:32,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:32,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 189 states. [2018-11-14 18:42:32,130 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 189 states. [2018-11-14 18:42:32,130 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 189 states. [2018-11-14 18:42:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:32,134 INFO L93 Difference]: Finished difference Result 192 states and 263 transitions. [2018-11-14 18:42:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 263 transitions. [2018-11-14 18:42:32,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:32,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:32,134 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 192 states. [2018-11-14 18:42:32,134 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 192 states. [2018-11-14 18:42:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:32,137 INFO L93 Difference]: Finished difference Result 192 states and 263 transitions. [2018-11-14 18:42:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 263 transitions. [2018-11-14 18:42:32,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:32,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:32,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:32,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-14 18:42:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 258 transitions. [2018-11-14 18:42:32,140 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 258 transitions. Word has length 141 [2018-11-14 18:42:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:32,140 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 258 transitions. [2018-11-14 18:42:32,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 18:42:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 258 transitions. [2018-11-14 18:42:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-14 18:42:32,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:32,141 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:32,141 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:32,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash 350983308, now seen corresponding path program 32 times [2018-11-14 18:42:32,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:32,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:32,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:42:32,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:33,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {25346#true} call ULTIMATE.init(); {25346#true} is VALID [2018-11-14 18:42:33,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {25346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25346#true} is VALID [2018-11-14 18:42:33,493 INFO L273 TraceCheckUtils]: 2: Hoare triple {25346#true} assume true; {25346#true} is VALID [2018-11-14 18:42:33,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25346#true} {25346#true} #91#return; {25346#true} is VALID [2018-11-14 18:42:33,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {25346#true} call #t~ret13 := main(); {25346#true} is VALID [2018-11-14 18:42:33,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {25346#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {25346#true} is VALID [2018-11-14 18:42:33,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {25346#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {25346#true} is VALID [2018-11-14 18:42:33,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {25346#true} ~i~0 := 2; {25348#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:33,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {25348#(<= main_~i~0 2)} assume true; {25348#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:33,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {25348#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25348#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:33,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {25348#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25348#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:33,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {25348#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25349#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:33,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {25349#(<= main_~i~0 3)} assume true; {25349#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:33,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {25349#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25349#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:33,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {25349#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25349#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:33,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {25349#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25350#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:33,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {25350#(<= main_~i~0 4)} assume true; {25350#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:33,501 INFO L273 TraceCheckUtils]: 17: Hoare triple {25350#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25350#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:33,502 INFO L273 TraceCheckUtils]: 18: Hoare triple {25350#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25350#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:33,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {25350#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25351#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:33,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {25351#(<= main_~i~0 5)} assume true; {25351#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:33,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {25351#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25351#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:33,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {25351#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25351#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:33,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {25351#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25352#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:33,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {25352#(<= main_~i~0 6)} assume true; {25352#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:33,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {25352#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25352#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:33,508 INFO L273 TraceCheckUtils]: 26: Hoare triple {25352#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25352#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:33,508 INFO L273 TraceCheckUtils]: 27: Hoare triple {25352#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25353#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:33,509 INFO L273 TraceCheckUtils]: 28: Hoare triple {25353#(<= main_~i~0 7)} assume true; {25353#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:33,509 INFO L273 TraceCheckUtils]: 29: Hoare triple {25353#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25353#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:33,509 INFO L273 TraceCheckUtils]: 30: Hoare triple {25353#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25353#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:33,510 INFO L273 TraceCheckUtils]: 31: Hoare triple {25353#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25354#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:33,510 INFO L273 TraceCheckUtils]: 32: Hoare triple {25354#(<= main_~i~0 8)} assume true; {25354#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:33,511 INFO L273 TraceCheckUtils]: 33: Hoare triple {25354#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25354#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:33,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {25354#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25354#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:33,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {25354#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25355#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:33,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {25355#(<= main_~i~0 9)} assume true; {25355#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:33,513 INFO L273 TraceCheckUtils]: 37: Hoare triple {25355#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25355#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:33,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {25355#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25355#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:33,514 INFO L273 TraceCheckUtils]: 39: Hoare triple {25355#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25356#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:33,515 INFO L273 TraceCheckUtils]: 40: Hoare triple {25356#(<= main_~i~0 10)} assume true; {25356#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:33,515 INFO L273 TraceCheckUtils]: 41: Hoare triple {25356#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25356#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:33,515 INFO L273 TraceCheckUtils]: 42: Hoare triple {25356#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25356#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:33,516 INFO L273 TraceCheckUtils]: 43: Hoare triple {25356#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25357#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:33,517 INFO L273 TraceCheckUtils]: 44: Hoare triple {25357#(<= main_~i~0 11)} assume true; {25357#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:33,517 INFO L273 TraceCheckUtils]: 45: Hoare triple {25357#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25357#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:33,518 INFO L273 TraceCheckUtils]: 46: Hoare triple {25357#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25357#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:33,518 INFO L273 TraceCheckUtils]: 47: Hoare triple {25357#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25358#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:33,519 INFO L273 TraceCheckUtils]: 48: Hoare triple {25358#(<= main_~i~0 12)} assume true; {25358#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:33,519 INFO L273 TraceCheckUtils]: 49: Hoare triple {25358#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25358#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:33,520 INFO L273 TraceCheckUtils]: 50: Hoare triple {25358#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25358#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:33,521 INFO L273 TraceCheckUtils]: 51: Hoare triple {25358#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25359#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:33,521 INFO L273 TraceCheckUtils]: 52: Hoare triple {25359#(<= main_~i~0 13)} assume true; {25359#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:33,522 INFO L273 TraceCheckUtils]: 53: Hoare triple {25359#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25359#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:33,522 INFO L273 TraceCheckUtils]: 54: Hoare triple {25359#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25359#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:33,523 INFO L273 TraceCheckUtils]: 55: Hoare triple {25359#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25360#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:33,523 INFO L273 TraceCheckUtils]: 56: Hoare triple {25360#(<= main_~i~0 14)} assume true; {25360#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:33,524 INFO L273 TraceCheckUtils]: 57: Hoare triple {25360#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25360#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:33,524 INFO L273 TraceCheckUtils]: 58: Hoare triple {25360#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25360#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:33,525 INFO L273 TraceCheckUtils]: 59: Hoare triple {25360#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25361#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:33,526 INFO L273 TraceCheckUtils]: 60: Hoare triple {25361#(<= main_~i~0 15)} assume true; {25361#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:33,526 INFO L273 TraceCheckUtils]: 61: Hoare triple {25361#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25361#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:33,526 INFO L273 TraceCheckUtils]: 62: Hoare triple {25361#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25361#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:33,527 INFO L273 TraceCheckUtils]: 63: Hoare triple {25361#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25362#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:33,528 INFO L273 TraceCheckUtils]: 64: Hoare triple {25362#(<= main_~i~0 16)} assume true; {25362#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:33,528 INFO L273 TraceCheckUtils]: 65: Hoare triple {25362#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25362#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:33,529 INFO L273 TraceCheckUtils]: 66: Hoare triple {25362#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25362#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:33,529 INFO L273 TraceCheckUtils]: 67: Hoare triple {25362#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25363#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:33,530 INFO L273 TraceCheckUtils]: 68: Hoare triple {25363#(<= main_~i~0 17)} assume true; {25363#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:33,530 INFO L273 TraceCheckUtils]: 69: Hoare triple {25363#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25363#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:33,531 INFO L273 TraceCheckUtils]: 70: Hoare triple {25363#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25363#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:33,532 INFO L273 TraceCheckUtils]: 71: Hoare triple {25363#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25364#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:33,532 INFO L273 TraceCheckUtils]: 72: Hoare triple {25364#(<= main_~i~0 18)} assume true; {25364#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:33,533 INFO L273 TraceCheckUtils]: 73: Hoare triple {25364#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25364#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:33,533 INFO L273 TraceCheckUtils]: 74: Hoare triple {25364#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25364#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:33,534 INFO L273 TraceCheckUtils]: 75: Hoare triple {25364#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25365#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:33,534 INFO L273 TraceCheckUtils]: 76: Hoare triple {25365#(<= main_~i~0 19)} assume true; {25365#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:33,535 INFO L273 TraceCheckUtils]: 77: Hoare triple {25365#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25365#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:33,535 INFO L273 TraceCheckUtils]: 78: Hoare triple {25365#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25365#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:33,536 INFO L273 TraceCheckUtils]: 79: Hoare triple {25365#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25366#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:33,536 INFO L273 TraceCheckUtils]: 80: Hoare triple {25366#(<= main_~i~0 20)} assume true; {25366#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:33,537 INFO L273 TraceCheckUtils]: 81: Hoare triple {25366#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25366#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:33,537 INFO L273 TraceCheckUtils]: 82: Hoare triple {25366#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25366#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:33,538 INFO L273 TraceCheckUtils]: 83: Hoare triple {25366#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25367#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:33,539 INFO L273 TraceCheckUtils]: 84: Hoare triple {25367#(<= main_~i~0 21)} assume true; {25367#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:33,539 INFO L273 TraceCheckUtils]: 85: Hoare triple {25367#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25367#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:33,540 INFO L273 TraceCheckUtils]: 86: Hoare triple {25367#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25367#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:33,540 INFO L273 TraceCheckUtils]: 87: Hoare triple {25367#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25368#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:33,541 INFO L273 TraceCheckUtils]: 88: Hoare triple {25368#(<= main_~i~0 22)} assume true; {25368#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:33,541 INFO L273 TraceCheckUtils]: 89: Hoare triple {25368#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25368#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:33,542 INFO L273 TraceCheckUtils]: 90: Hoare triple {25368#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25368#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:33,543 INFO L273 TraceCheckUtils]: 91: Hoare triple {25368#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25369#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:33,543 INFO L273 TraceCheckUtils]: 92: Hoare triple {25369#(<= main_~i~0 23)} assume true; {25369#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:33,544 INFO L273 TraceCheckUtils]: 93: Hoare triple {25369#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25369#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:33,544 INFO L273 TraceCheckUtils]: 94: Hoare triple {25369#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25369#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:33,545 INFO L273 TraceCheckUtils]: 95: Hoare triple {25369#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25370#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:33,545 INFO L273 TraceCheckUtils]: 96: Hoare triple {25370#(<= main_~i~0 24)} assume true; {25370#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:33,546 INFO L273 TraceCheckUtils]: 97: Hoare triple {25370#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25370#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:33,546 INFO L273 TraceCheckUtils]: 98: Hoare triple {25370#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25370#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:33,547 INFO L273 TraceCheckUtils]: 99: Hoare triple {25370#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25371#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:33,547 INFO L273 TraceCheckUtils]: 100: Hoare triple {25371#(<= main_~i~0 25)} assume true; {25371#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:33,548 INFO L273 TraceCheckUtils]: 101: Hoare triple {25371#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25371#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:33,548 INFO L273 TraceCheckUtils]: 102: Hoare triple {25371#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25371#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:33,549 INFO L273 TraceCheckUtils]: 103: Hoare triple {25371#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25372#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:33,550 INFO L273 TraceCheckUtils]: 104: Hoare triple {25372#(<= main_~i~0 26)} assume true; {25372#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:33,550 INFO L273 TraceCheckUtils]: 105: Hoare triple {25372#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25372#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:33,551 INFO L273 TraceCheckUtils]: 106: Hoare triple {25372#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25372#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:33,551 INFO L273 TraceCheckUtils]: 107: Hoare triple {25372#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25373#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:33,552 INFO L273 TraceCheckUtils]: 108: Hoare triple {25373#(<= main_~i~0 27)} assume true; {25373#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:33,552 INFO L273 TraceCheckUtils]: 109: Hoare triple {25373#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25373#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:33,553 INFO L273 TraceCheckUtils]: 110: Hoare triple {25373#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25373#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:33,572 INFO L273 TraceCheckUtils]: 111: Hoare triple {25373#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25374#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:33,573 INFO L273 TraceCheckUtils]: 112: Hoare triple {25374#(<= main_~i~0 28)} assume true; {25374#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:33,573 INFO L273 TraceCheckUtils]: 113: Hoare triple {25374#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25374#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:33,573 INFO L273 TraceCheckUtils]: 114: Hoare triple {25374#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25374#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:33,574 INFO L273 TraceCheckUtils]: 115: Hoare triple {25374#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25375#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:33,574 INFO L273 TraceCheckUtils]: 116: Hoare triple {25375#(<= main_~i~0 29)} assume true; {25375#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:33,575 INFO L273 TraceCheckUtils]: 117: Hoare triple {25375#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25375#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:33,575 INFO L273 TraceCheckUtils]: 118: Hoare triple {25375#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25375#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:33,576 INFO L273 TraceCheckUtils]: 119: Hoare triple {25375#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25376#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:33,576 INFO L273 TraceCheckUtils]: 120: Hoare triple {25376#(<= main_~i~0 30)} assume true; {25376#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:33,577 INFO L273 TraceCheckUtils]: 121: Hoare triple {25376#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25376#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:33,577 INFO L273 TraceCheckUtils]: 122: Hoare triple {25376#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25376#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:33,578 INFO L273 TraceCheckUtils]: 123: Hoare triple {25376#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25377#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:33,578 INFO L273 TraceCheckUtils]: 124: Hoare triple {25377#(<= main_~i~0 31)} assume true; {25377#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:33,579 INFO L273 TraceCheckUtils]: 125: Hoare triple {25377#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25377#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:33,579 INFO L273 TraceCheckUtils]: 126: Hoare triple {25377#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25377#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:33,580 INFO L273 TraceCheckUtils]: 127: Hoare triple {25377#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25378#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:33,581 INFO L273 TraceCheckUtils]: 128: Hoare triple {25378#(<= main_~i~0 32)} assume true; {25378#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:33,581 INFO L273 TraceCheckUtils]: 129: Hoare triple {25378#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25378#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:33,582 INFO L273 TraceCheckUtils]: 130: Hoare triple {25378#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25378#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:33,582 INFO L273 TraceCheckUtils]: 131: Hoare triple {25378#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25379#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:33,583 INFO L273 TraceCheckUtils]: 132: Hoare triple {25379#(<= main_~i~0 33)} assume true; {25379#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:33,583 INFO L273 TraceCheckUtils]: 133: Hoare triple {25379#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25379#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:33,584 INFO L273 TraceCheckUtils]: 134: Hoare triple {25379#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25379#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:33,584 INFO L273 TraceCheckUtils]: 135: Hoare triple {25379#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25380#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:33,585 INFO L273 TraceCheckUtils]: 136: Hoare triple {25380#(<= main_~i~0 34)} assume true; {25380#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:33,586 INFO L273 TraceCheckUtils]: 137: Hoare triple {25380#(<= main_~i~0 34)} assume !(~i~0 < 100000); {25347#false} is VALID [2018-11-14 18:42:33,586 INFO L273 TraceCheckUtils]: 138: Hoare triple {25347#false} havoc ~x~0;~x~0 := 0; {25347#false} is VALID [2018-11-14 18:42:33,586 INFO L273 TraceCheckUtils]: 139: Hoare triple {25347#false} assume true; {25347#false} is VALID [2018-11-14 18:42:33,586 INFO L273 TraceCheckUtils]: 140: Hoare triple {25347#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {25347#false} is VALID [2018-11-14 18:42:33,586 INFO L256 TraceCheckUtils]: 141: Hoare triple {25347#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {25347#false} is VALID [2018-11-14 18:42:33,587 INFO L273 TraceCheckUtils]: 142: Hoare triple {25347#false} ~cond := #in~cond; {25347#false} is VALID [2018-11-14 18:42:33,587 INFO L273 TraceCheckUtils]: 143: Hoare triple {25347#false} assume ~cond == 0; {25347#false} is VALID [2018-11-14 18:42:33,587 INFO L273 TraceCheckUtils]: 144: Hoare triple {25347#false} assume !false; {25347#false} is VALID [2018-11-14 18:42:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:33,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:33,601 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-14 18:42:33,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:42:33,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:42:33,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:33,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:33,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {25346#true} call ULTIMATE.init(); {25346#true} is VALID [2018-11-14 18:42:33,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {25346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25346#true} is VALID [2018-11-14 18:42:33,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {25346#true} assume true; {25346#true} is VALID [2018-11-14 18:42:33,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25346#true} {25346#true} #91#return; {25346#true} is VALID [2018-11-14 18:42:33,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {25346#true} call #t~ret13 := main(); {25346#true} is VALID [2018-11-14 18:42:33,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {25346#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {25346#true} is VALID [2018-11-14 18:42:33,987 INFO L273 TraceCheckUtils]: 6: Hoare triple {25346#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {25346#true} is VALID [2018-11-14 18:42:33,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {25346#true} ~i~0 := 2; {25348#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:33,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {25348#(<= main_~i~0 2)} assume true; {25348#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:33,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {25348#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25348#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:33,989 INFO L273 TraceCheckUtils]: 10: Hoare triple {25348#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25348#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:33,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {25348#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25349#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:33,990 INFO L273 TraceCheckUtils]: 12: Hoare triple {25349#(<= main_~i~0 3)} assume true; {25349#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:33,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {25349#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25349#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:33,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {25349#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25349#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:33,991 INFO L273 TraceCheckUtils]: 15: Hoare triple {25349#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25350#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:33,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {25350#(<= main_~i~0 4)} assume true; {25350#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:33,992 INFO L273 TraceCheckUtils]: 17: Hoare triple {25350#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25350#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:33,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {25350#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25350#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:33,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {25350#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25351#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:33,994 INFO L273 TraceCheckUtils]: 20: Hoare triple {25351#(<= main_~i~0 5)} assume true; {25351#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:33,994 INFO L273 TraceCheckUtils]: 21: Hoare triple {25351#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25351#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:33,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {25351#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25351#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:33,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {25351#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25352#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:33,996 INFO L273 TraceCheckUtils]: 24: Hoare triple {25352#(<= main_~i~0 6)} assume true; {25352#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:33,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {25352#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25352#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:33,997 INFO L273 TraceCheckUtils]: 26: Hoare triple {25352#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25352#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:33,998 INFO L273 TraceCheckUtils]: 27: Hoare triple {25352#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25353#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:33,998 INFO L273 TraceCheckUtils]: 28: Hoare triple {25353#(<= main_~i~0 7)} assume true; {25353#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:33,999 INFO L273 TraceCheckUtils]: 29: Hoare triple {25353#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25353#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:33,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {25353#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25353#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:34,000 INFO L273 TraceCheckUtils]: 31: Hoare triple {25353#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25354#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:34,000 INFO L273 TraceCheckUtils]: 32: Hoare triple {25354#(<= main_~i~0 8)} assume true; {25354#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:34,001 INFO L273 TraceCheckUtils]: 33: Hoare triple {25354#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25354#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:34,001 INFO L273 TraceCheckUtils]: 34: Hoare triple {25354#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25354#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:34,002 INFO L273 TraceCheckUtils]: 35: Hoare triple {25354#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25355#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:34,003 INFO L273 TraceCheckUtils]: 36: Hoare triple {25355#(<= main_~i~0 9)} assume true; {25355#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:34,005 INFO L273 TraceCheckUtils]: 37: Hoare triple {25355#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25355#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:34,005 INFO L273 TraceCheckUtils]: 38: Hoare triple {25355#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25355#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:34,006 INFO L273 TraceCheckUtils]: 39: Hoare triple {25355#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25356#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:34,006 INFO L273 TraceCheckUtils]: 40: Hoare triple {25356#(<= main_~i~0 10)} assume true; {25356#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:34,007 INFO L273 TraceCheckUtils]: 41: Hoare triple {25356#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25356#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:34,007 INFO L273 TraceCheckUtils]: 42: Hoare triple {25356#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25356#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:34,008 INFO L273 TraceCheckUtils]: 43: Hoare triple {25356#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25357#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:34,009 INFO L273 TraceCheckUtils]: 44: Hoare triple {25357#(<= main_~i~0 11)} assume true; {25357#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:34,009 INFO L273 TraceCheckUtils]: 45: Hoare triple {25357#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25357#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:34,010 INFO L273 TraceCheckUtils]: 46: Hoare triple {25357#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25357#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:34,010 INFO L273 TraceCheckUtils]: 47: Hoare triple {25357#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25358#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:34,011 INFO L273 TraceCheckUtils]: 48: Hoare triple {25358#(<= main_~i~0 12)} assume true; {25358#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:34,011 INFO L273 TraceCheckUtils]: 49: Hoare triple {25358#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25358#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:34,012 INFO L273 TraceCheckUtils]: 50: Hoare triple {25358#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25358#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:34,013 INFO L273 TraceCheckUtils]: 51: Hoare triple {25358#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25359#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:34,013 INFO L273 TraceCheckUtils]: 52: Hoare triple {25359#(<= main_~i~0 13)} assume true; {25359#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:34,014 INFO L273 TraceCheckUtils]: 53: Hoare triple {25359#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25359#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:34,014 INFO L273 TraceCheckUtils]: 54: Hoare triple {25359#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25359#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:34,015 INFO L273 TraceCheckUtils]: 55: Hoare triple {25359#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25360#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:34,015 INFO L273 TraceCheckUtils]: 56: Hoare triple {25360#(<= main_~i~0 14)} assume true; {25360#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:34,016 INFO L273 TraceCheckUtils]: 57: Hoare triple {25360#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25360#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:34,016 INFO L273 TraceCheckUtils]: 58: Hoare triple {25360#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25360#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:34,017 INFO L273 TraceCheckUtils]: 59: Hoare triple {25360#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25361#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:34,017 INFO L273 TraceCheckUtils]: 60: Hoare triple {25361#(<= main_~i~0 15)} assume true; {25361#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:34,018 INFO L273 TraceCheckUtils]: 61: Hoare triple {25361#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25361#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:34,018 INFO L273 TraceCheckUtils]: 62: Hoare triple {25361#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25361#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:34,019 INFO L273 TraceCheckUtils]: 63: Hoare triple {25361#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25362#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:34,020 INFO L273 TraceCheckUtils]: 64: Hoare triple {25362#(<= main_~i~0 16)} assume true; {25362#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:34,020 INFO L273 TraceCheckUtils]: 65: Hoare triple {25362#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25362#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:34,021 INFO L273 TraceCheckUtils]: 66: Hoare triple {25362#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25362#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:34,021 INFO L273 TraceCheckUtils]: 67: Hoare triple {25362#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25363#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:34,022 INFO L273 TraceCheckUtils]: 68: Hoare triple {25363#(<= main_~i~0 17)} assume true; {25363#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:34,022 INFO L273 TraceCheckUtils]: 69: Hoare triple {25363#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25363#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:34,023 INFO L273 TraceCheckUtils]: 70: Hoare triple {25363#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25363#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:34,024 INFO L273 TraceCheckUtils]: 71: Hoare triple {25363#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25364#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:34,024 INFO L273 TraceCheckUtils]: 72: Hoare triple {25364#(<= main_~i~0 18)} assume true; {25364#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:34,025 INFO L273 TraceCheckUtils]: 73: Hoare triple {25364#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25364#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:34,025 INFO L273 TraceCheckUtils]: 74: Hoare triple {25364#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25364#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:34,026 INFO L273 TraceCheckUtils]: 75: Hoare triple {25364#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25365#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:34,026 INFO L273 TraceCheckUtils]: 76: Hoare triple {25365#(<= main_~i~0 19)} assume true; {25365#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:34,027 INFO L273 TraceCheckUtils]: 77: Hoare triple {25365#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25365#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:34,027 INFO L273 TraceCheckUtils]: 78: Hoare triple {25365#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25365#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:34,028 INFO L273 TraceCheckUtils]: 79: Hoare triple {25365#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25366#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:34,029 INFO L273 TraceCheckUtils]: 80: Hoare triple {25366#(<= main_~i~0 20)} assume true; {25366#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:34,029 INFO L273 TraceCheckUtils]: 81: Hoare triple {25366#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25366#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:34,030 INFO L273 TraceCheckUtils]: 82: Hoare triple {25366#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25366#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:34,030 INFO L273 TraceCheckUtils]: 83: Hoare triple {25366#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25367#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:34,031 INFO L273 TraceCheckUtils]: 84: Hoare triple {25367#(<= main_~i~0 21)} assume true; {25367#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:34,031 INFO L273 TraceCheckUtils]: 85: Hoare triple {25367#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25367#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:34,032 INFO L273 TraceCheckUtils]: 86: Hoare triple {25367#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25367#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:34,033 INFO L273 TraceCheckUtils]: 87: Hoare triple {25367#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25368#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:34,033 INFO L273 TraceCheckUtils]: 88: Hoare triple {25368#(<= main_~i~0 22)} assume true; {25368#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:34,034 INFO L273 TraceCheckUtils]: 89: Hoare triple {25368#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25368#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:34,034 INFO L273 TraceCheckUtils]: 90: Hoare triple {25368#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25368#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:34,035 INFO L273 TraceCheckUtils]: 91: Hoare triple {25368#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25369#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:34,035 INFO L273 TraceCheckUtils]: 92: Hoare triple {25369#(<= main_~i~0 23)} assume true; {25369#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:34,036 INFO L273 TraceCheckUtils]: 93: Hoare triple {25369#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25369#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:34,036 INFO L273 TraceCheckUtils]: 94: Hoare triple {25369#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25369#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:34,037 INFO L273 TraceCheckUtils]: 95: Hoare triple {25369#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25370#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:34,037 INFO L273 TraceCheckUtils]: 96: Hoare triple {25370#(<= main_~i~0 24)} assume true; {25370#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:34,038 INFO L273 TraceCheckUtils]: 97: Hoare triple {25370#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25370#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:34,038 INFO L273 TraceCheckUtils]: 98: Hoare triple {25370#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25370#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:34,039 INFO L273 TraceCheckUtils]: 99: Hoare triple {25370#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25371#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:34,040 INFO L273 TraceCheckUtils]: 100: Hoare triple {25371#(<= main_~i~0 25)} assume true; {25371#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:34,040 INFO L273 TraceCheckUtils]: 101: Hoare triple {25371#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25371#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:34,041 INFO L273 TraceCheckUtils]: 102: Hoare triple {25371#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25371#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:34,041 INFO L273 TraceCheckUtils]: 103: Hoare triple {25371#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25372#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:34,042 INFO L273 TraceCheckUtils]: 104: Hoare triple {25372#(<= main_~i~0 26)} assume true; {25372#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:34,042 INFO L273 TraceCheckUtils]: 105: Hoare triple {25372#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25372#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:34,043 INFO L273 TraceCheckUtils]: 106: Hoare triple {25372#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25372#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:34,044 INFO L273 TraceCheckUtils]: 107: Hoare triple {25372#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25373#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:34,044 INFO L273 TraceCheckUtils]: 108: Hoare triple {25373#(<= main_~i~0 27)} assume true; {25373#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:34,045 INFO L273 TraceCheckUtils]: 109: Hoare triple {25373#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25373#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:34,045 INFO L273 TraceCheckUtils]: 110: Hoare triple {25373#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25373#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:34,046 INFO L273 TraceCheckUtils]: 111: Hoare triple {25373#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25374#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:34,046 INFO L273 TraceCheckUtils]: 112: Hoare triple {25374#(<= main_~i~0 28)} assume true; {25374#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:34,047 INFO L273 TraceCheckUtils]: 113: Hoare triple {25374#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25374#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:34,047 INFO L273 TraceCheckUtils]: 114: Hoare triple {25374#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25374#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:34,048 INFO L273 TraceCheckUtils]: 115: Hoare triple {25374#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25375#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:34,048 INFO L273 TraceCheckUtils]: 116: Hoare triple {25375#(<= main_~i~0 29)} assume true; {25375#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:34,049 INFO L273 TraceCheckUtils]: 117: Hoare triple {25375#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25375#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:34,049 INFO L273 TraceCheckUtils]: 118: Hoare triple {25375#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25375#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:34,050 INFO L273 TraceCheckUtils]: 119: Hoare triple {25375#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25376#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:34,051 INFO L273 TraceCheckUtils]: 120: Hoare triple {25376#(<= main_~i~0 30)} assume true; {25376#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:34,051 INFO L273 TraceCheckUtils]: 121: Hoare triple {25376#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25376#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:34,052 INFO L273 TraceCheckUtils]: 122: Hoare triple {25376#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25376#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:34,052 INFO L273 TraceCheckUtils]: 123: Hoare triple {25376#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25377#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:34,053 INFO L273 TraceCheckUtils]: 124: Hoare triple {25377#(<= main_~i~0 31)} assume true; {25377#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:34,053 INFO L273 TraceCheckUtils]: 125: Hoare triple {25377#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25377#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:34,054 INFO L273 TraceCheckUtils]: 126: Hoare triple {25377#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25377#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:34,055 INFO L273 TraceCheckUtils]: 127: Hoare triple {25377#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25378#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:34,055 INFO L273 TraceCheckUtils]: 128: Hoare triple {25378#(<= main_~i~0 32)} assume true; {25378#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:34,056 INFO L273 TraceCheckUtils]: 129: Hoare triple {25378#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25378#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:34,056 INFO L273 TraceCheckUtils]: 130: Hoare triple {25378#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25378#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:34,057 INFO L273 TraceCheckUtils]: 131: Hoare triple {25378#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25379#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:34,057 INFO L273 TraceCheckUtils]: 132: Hoare triple {25379#(<= main_~i~0 33)} assume true; {25379#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:34,058 INFO L273 TraceCheckUtils]: 133: Hoare triple {25379#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {25379#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:34,058 INFO L273 TraceCheckUtils]: 134: Hoare triple {25379#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25379#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:34,059 INFO L273 TraceCheckUtils]: 135: Hoare triple {25379#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {25380#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:34,060 INFO L273 TraceCheckUtils]: 136: Hoare triple {25380#(<= main_~i~0 34)} assume true; {25380#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:34,060 INFO L273 TraceCheckUtils]: 137: Hoare triple {25380#(<= main_~i~0 34)} assume !(~i~0 < 100000); {25347#false} is VALID [2018-11-14 18:42:34,060 INFO L273 TraceCheckUtils]: 138: Hoare triple {25347#false} havoc ~x~0;~x~0 := 0; {25347#false} is VALID [2018-11-14 18:42:34,061 INFO L273 TraceCheckUtils]: 139: Hoare triple {25347#false} assume true; {25347#false} is VALID [2018-11-14 18:42:34,061 INFO L273 TraceCheckUtils]: 140: Hoare triple {25347#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {25347#false} is VALID [2018-11-14 18:42:34,061 INFO L256 TraceCheckUtils]: 141: Hoare triple {25347#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {25347#false} is VALID [2018-11-14 18:42:34,061 INFO L273 TraceCheckUtils]: 142: Hoare triple {25347#false} ~cond := #in~cond; {25347#false} is VALID [2018-11-14 18:42:34,061 INFO L273 TraceCheckUtils]: 143: Hoare triple {25347#false} assume ~cond == 0; {25347#false} is VALID [2018-11-14 18:42:34,062 INFO L273 TraceCheckUtils]: 144: Hoare triple {25347#false} assume !false; {25347#false} is VALID [2018-11-14 18:42:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:34,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:34,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-11-14 18:42:34,096 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 145 [2018-11-14 18:42:34,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:34,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 18:42:34,228 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-14 18:42:34,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 18:42:34,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 18:42:34,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 18:42:34,229 INFO L87 Difference]: Start difference. First operand 189 states and 258 transitions. Second operand 35 states. [2018-11-14 18:42:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:35,476 INFO L93 Difference]: Finished difference Result 216 states and 293 transitions. [2018-11-14 18:42:35,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 18:42:35,476 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 145 [2018-11-14 18:42:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:42:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 293 transitions. [2018-11-14 18:42:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:42:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 293 transitions. [2018-11-14 18:42:35,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 293 transitions. [2018-11-14 18:42:35,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:35,751 INFO L225 Difference]: With dead ends: 216 [2018-11-14 18:42:35,752 INFO L226 Difference]: Without dead ends: 197 [2018-11-14 18:42:35,752 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 18:42:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-14 18:42:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-11-14 18:42:35,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:35,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 194 states. [2018-11-14 18:42:35,783 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 194 states. [2018-11-14 18:42:35,783 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 194 states. [2018-11-14 18:42:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:35,787 INFO L93 Difference]: Finished difference Result 197 states and 270 transitions. [2018-11-14 18:42:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 270 transitions. [2018-11-14 18:42:35,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:35,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:35,788 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 197 states. [2018-11-14 18:42:35,788 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 197 states. [2018-11-14 18:42:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:35,791 INFO L93 Difference]: Finished difference Result 197 states and 270 transitions. [2018-11-14 18:42:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 270 transitions. [2018-11-14 18:42:35,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:35,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:35,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:35,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-14 18:42:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 265 transitions. [2018-11-14 18:42:35,794 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 265 transitions. Word has length 145 [2018-11-14 18:42:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:35,794 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 265 transitions. [2018-11-14 18:42:35,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 18:42:35,794 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 265 transitions. [2018-11-14 18:42:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-14 18:42:35,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:35,795 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:35,795 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:35,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:35,795 INFO L82 PathProgramCache]: Analyzing trace with hash -309593218, now seen corresponding path program 33 times [2018-11-14 18:42:35,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:35,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:35,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:35,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:35,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:36,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {26710#true} call ULTIMATE.init(); {26710#true} is VALID [2018-11-14 18:42:36,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {26710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26710#true} is VALID [2018-11-14 18:42:36,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {26710#true} assume true; {26710#true} is VALID [2018-11-14 18:42:36,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26710#true} {26710#true} #91#return; {26710#true} is VALID [2018-11-14 18:42:36,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {26710#true} call #t~ret13 := main(); {26710#true} is VALID [2018-11-14 18:42:36,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {26710#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {26710#true} is VALID [2018-11-14 18:42:36,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {26710#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {26710#true} is VALID [2018-11-14 18:42:36,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {26710#true} ~i~0 := 2; {26712#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:36,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {26712#(<= main_~i~0 2)} assume true; {26712#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:36,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {26712#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26712#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:36,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {26712#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26712#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:36,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {26712#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26713#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:36,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {26713#(<= main_~i~0 3)} assume true; {26713#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:36,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {26713#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26713#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:36,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {26713#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26713#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:36,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {26713#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26714#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:36,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {26714#(<= main_~i~0 4)} assume true; {26714#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:36,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {26714#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26714#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:36,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {26714#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26714#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:36,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {26714#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26715#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:36,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {26715#(<= main_~i~0 5)} assume true; {26715#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:36,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {26715#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26715#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:36,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {26715#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26715#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:36,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {26715#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26716#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:36,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {26716#(<= main_~i~0 6)} assume true; {26716#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:36,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {26716#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26716#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:36,783 INFO L273 TraceCheckUtils]: 26: Hoare triple {26716#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26716#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:36,783 INFO L273 TraceCheckUtils]: 27: Hoare triple {26716#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26717#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:36,784 INFO L273 TraceCheckUtils]: 28: Hoare triple {26717#(<= main_~i~0 7)} assume true; {26717#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:36,784 INFO L273 TraceCheckUtils]: 29: Hoare triple {26717#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26717#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:36,785 INFO L273 TraceCheckUtils]: 30: Hoare triple {26717#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26717#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:36,786 INFO L273 TraceCheckUtils]: 31: Hoare triple {26717#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26718#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:36,786 INFO L273 TraceCheckUtils]: 32: Hoare triple {26718#(<= main_~i~0 8)} assume true; {26718#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:36,787 INFO L273 TraceCheckUtils]: 33: Hoare triple {26718#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26718#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:36,787 INFO L273 TraceCheckUtils]: 34: Hoare triple {26718#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26718#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:36,788 INFO L273 TraceCheckUtils]: 35: Hoare triple {26718#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26719#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:36,788 INFO L273 TraceCheckUtils]: 36: Hoare triple {26719#(<= main_~i~0 9)} assume true; {26719#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:36,789 INFO L273 TraceCheckUtils]: 37: Hoare triple {26719#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26719#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:36,789 INFO L273 TraceCheckUtils]: 38: Hoare triple {26719#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26719#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:36,790 INFO L273 TraceCheckUtils]: 39: Hoare triple {26719#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26720#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:36,791 INFO L273 TraceCheckUtils]: 40: Hoare triple {26720#(<= main_~i~0 10)} assume true; {26720#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:36,791 INFO L273 TraceCheckUtils]: 41: Hoare triple {26720#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26720#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:36,792 INFO L273 TraceCheckUtils]: 42: Hoare triple {26720#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26720#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:36,792 INFO L273 TraceCheckUtils]: 43: Hoare triple {26720#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26721#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:36,793 INFO L273 TraceCheckUtils]: 44: Hoare triple {26721#(<= main_~i~0 11)} assume true; {26721#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:36,793 INFO L273 TraceCheckUtils]: 45: Hoare triple {26721#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26721#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:36,794 INFO L273 TraceCheckUtils]: 46: Hoare triple {26721#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26721#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:36,794 INFO L273 TraceCheckUtils]: 47: Hoare triple {26721#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26722#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:36,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {26722#(<= main_~i~0 12)} assume true; {26722#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:36,795 INFO L273 TraceCheckUtils]: 49: Hoare triple {26722#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26722#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:36,796 INFO L273 TraceCheckUtils]: 50: Hoare triple {26722#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26722#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:36,797 INFO L273 TraceCheckUtils]: 51: Hoare triple {26722#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26723#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:36,797 INFO L273 TraceCheckUtils]: 52: Hoare triple {26723#(<= main_~i~0 13)} assume true; {26723#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:36,798 INFO L273 TraceCheckUtils]: 53: Hoare triple {26723#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26723#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:36,798 INFO L273 TraceCheckUtils]: 54: Hoare triple {26723#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26723#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:36,799 INFO L273 TraceCheckUtils]: 55: Hoare triple {26723#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26724#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:36,799 INFO L273 TraceCheckUtils]: 56: Hoare triple {26724#(<= main_~i~0 14)} assume true; {26724#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:36,800 INFO L273 TraceCheckUtils]: 57: Hoare triple {26724#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26724#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:36,800 INFO L273 TraceCheckUtils]: 58: Hoare triple {26724#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26724#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:36,801 INFO L273 TraceCheckUtils]: 59: Hoare triple {26724#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26725#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:36,801 INFO L273 TraceCheckUtils]: 60: Hoare triple {26725#(<= main_~i~0 15)} assume true; {26725#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:36,802 INFO L273 TraceCheckUtils]: 61: Hoare triple {26725#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26725#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:36,802 INFO L273 TraceCheckUtils]: 62: Hoare triple {26725#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26725#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:36,803 INFO L273 TraceCheckUtils]: 63: Hoare triple {26725#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26726#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:36,804 INFO L273 TraceCheckUtils]: 64: Hoare triple {26726#(<= main_~i~0 16)} assume true; {26726#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:36,804 INFO L273 TraceCheckUtils]: 65: Hoare triple {26726#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26726#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:36,805 INFO L273 TraceCheckUtils]: 66: Hoare triple {26726#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26726#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:36,805 INFO L273 TraceCheckUtils]: 67: Hoare triple {26726#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26727#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:36,806 INFO L273 TraceCheckUtils]: 68: Hoare triple {26727#(<= main_~i~0 17)} assume true; {26727#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:36,806 INFO L273 TraceCheckUtils]: 69: Hoare triple {26727#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26727#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:36,807 INFO L273 TraceCheckUtils]: 70: Hoare triple {26727#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26727#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:36,808 INFO L273 TraceCheckUtils]: 71: Hoare triple {26727#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26728#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:36,808 INFO L273 TraceCheckUtils]: 72: Hoare triple {26728#(<= main_~i~0 18)} assume true; {26728#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:36,809 INFO L273 TraceCheckUtils]: 73: Hoare triple {26728#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26728#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:36,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {26728#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26728#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:36,810 INFO L273 TraceCheckUtils]: 75: Hoare triple {26728#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26729#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:36,810 INFO L273 TraceCheckUtils]: 76: Hoare triple {26729#(<= main_~i~0 19)} assume true; {26729#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:36,811 INFO L273 TraceCheckUtils]: 77: Hoare triple {26729#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26729#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:36,811 INFO L273 TraceCheckUtils]: 78: Hoare triple {26729#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26729#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:36,812 INFO L273 TraceCheckUtils]: 79: Hoare triple {26729#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26730#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:36,812 INFO L273 TraceCheckUtils]: 80: Hoare triple {26730#(<= main_~i~0 20)} assume true; {26730#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:36,813 INFO L273 TraceCheckUtils]: 81: Hoare triple {26730#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26730#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:36,813 INFO L273 TraceCheckUtils]: 82: Hoare triple {26730#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26730#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:36,814 INFO L273 TraceCheckUtils]: 83: Hoare triple {26730#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26731#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:36,815 INFO L273 TraceCheckUtils]: 84: Hoare triple {26731#(<= main_~i~0 21)} assume true; {26731#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:36,815 INFO L273 TraceCheckUtils]: 85: Hoare triple {26731#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26731#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:36,816 INFO L273 TraceCheckUtils]: 86: Hoare triple {26731#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26731#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:36,816 INFO L273 TraceCheckUtils]: 87: Hoare triple {26731#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26732#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:36,817 INFO L273 TraceCheckUtils]: 88: Hoare triple {26732#(<= main_~i~0 22)} assume true; {26732#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:36,817 INFO L273 TraceCheckUtils]: 89: Hoare triple {26732#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26732#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:36,818 INFO L273 TraceCheckUtils]: 90: Hoare triple {26732#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26732#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:36,818 INFO L273 TraceCheckUtils]: 91: Hoare triple {26732#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26733#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:36,819 INFO L273 TraceCheckUtils]: 92: Hoare triple {26733#(<= main_~i~0 23)} assume true; {26733#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:36,819 INFO L273 TraceCheckUtils]: 93: Hoare triple {26733#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26733#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:36,820 INFO L273 TraceCheckUtils]: 94: Hoare triple {26733#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26733#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:36,821 INFO L273 TraceCheckUtils]: 95: Hoare triple {26733#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26734#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:36,821 INFO L273 TraceCheckUtils]: 96: Hoare triple {26734#(<= main_~i~0 24)} assume true; {26734#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:36,822 INFO L273 TraceCheckUtils]: 97: Hoare triple {26734#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26734#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:36,822 INFO L273 TraceCheckUtils]: 98: Hoare triple {26734#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26734#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:36,823 INFO L273 TraceCheckUtils]: 99: Hoare triple {26734#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26735#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:36,823 INFO L273 TraceCheckUtils]: 100: Hoare triple {26735#(<= main_~i~0 25)} assume true; {26735#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:36,824 INFO L273 TraceCheckUtils]: 101: Hoare triple {26735#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26735#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:36,824 INFO L273 TraceCheckUtils]: 102: Hoare triple {26735#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26735#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:36,825 INFO L273 TraceCheckUtils]: 103: Hoare triple {26735#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26736#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:36,826 INFO L273 TraceCheckUtils]: 104: Hoare triple {26736#(<= main_~i~0 26)} assume true; {26736#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:36,826 INFO L273 TraceCheckUtils]: 105: Hoare triple {26736#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26736#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:36,827 INFO L273 TraceCheckUtils]: 106: Hoare triple {26736#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26736#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:36,827 INFO L273 TraceCheckUtils]: 107: Hoare triple {26736#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26737#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:36,828 INFO L273 TraceCheckUtils]: 108: Hoare triple {26737#(<= main_~i~0 27)} assume true; {26737#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:36,828 INFO L273 TraceCheckUtils]: 109: Hoare triple {26737#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26737#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:36,829 INFO L273 TraceCheckUtils]: 110: Hoare triple {26737#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26737#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:36,829 INFO L273 TraceCheckUtils]: 111: Hoare triple {26737#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26738#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:36,830 INFO L273 TraceCheckUtils]: 112: Hoare triple {26738#(<= main_~i~0 28)} assume true; {26738#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:36,830 INFO L273 TraceCheckUtils]: 113: Hoare triple {26738#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26738#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:36,831 INFO L273 TraceCheckUtils]: 114: Hoare triple {26738#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26738#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:36,832 INFO L273 TraceCheckUtils]: 115: Hoare triple {26738#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26739#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:36,832 INFO L273 TraceCheckUtils]: 116: Hoare triple {26739#(<= main_~i~0 29)} assume true; {26739#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:36,833 INFO L273 TraceCheckUtils]: 117: Hoare triple {26739#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26739#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:36,833 INFO L273 TraceCheckUtils]: 118: Hoare triple {26739#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26739#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:36,834 INFO L273 TraceCheckUtils]: 119: Hoare triple {26739#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26740#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:36,834 INFO L273 TraceCheckUtils]: 120: Hoare triple {26740#(<= main_~i~0 30)} assume true; {26740#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:36,835 INFO L273 TraceCheckUtils]: 121: Hoare triple {26740#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26740#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:36,835 INFO L273 TraceCheckUtils]: 122: Hoare triple {26740#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26740#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:36,836 INFO L273 TraceCheckUtils]: 123: Hoare triple {26740#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26741#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:36,837 INFO L273 TraceCheckUtils]: 124: Hoare triple {26741#(<= main_~i~0 31)} assume true; {26741#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:36,837 INFO L273 TraceCheckUtils]: 125: Hoare triple {26741#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26741#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:36,838 INFO L273 TraceCheckUtils]: 126: Hoare triple {26741#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26741#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:36,838 INFO L273 TraceCheckUtils]: 127: Hoare triple {26741#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26742#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:36,839 INFO L273 TraceCheckUtils]: 128: Hoare triple {26742#(<= main_~i~0 32)} assume true; {26742#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:36,839 INFO L273 TraceCheckUtils]: 129: Hoare triple {26742#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26742#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:36,840 INFO L273 TraceCheckUtils]: 130: Hoare triple {26742#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26742#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:36,840 INFO L273 TraceCheckUtils]: 131: Hoare triple {26742#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26743#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:36,841 INFO L273 TraceCheckUtils]: 132: Hoare triple {26743#(<= main_~i~0 33)} assume true; {26743#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:36,841 INFO L273 TraceCheckUtils]: 133: Hoare triple {26743#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26743#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:36,842 INFO L273 TraceCheckUtils]: 134: Hoare triple {26743#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26743#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:36,843 INFO L273 TraceCheckUtils]: 135: Hoare triple {26743#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26744#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:36,843 INFO L273 TraceCheckUtils]: 136: Hoare triple {26744#(<= main_~i~0 34)} assume true; {26744#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:36,844 INFO L273 TraceCheckUtils]: 137: Hoare triple {26744#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26744#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:36,844 INFO L273 TraceCheckUtils]: 138: Hoare triple {26744#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26744#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:36,845 INFO L273 TraceCheckUtils]: 139: Hoare triple {26744#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26745#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:36,845 INFO L273 TraceCheckUtils]: 140: Hoare triple {26745#(<= main_~i~0 35)} assume true; {26745#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:36,846 INFO L273 TraceCheckUtils]: 141: Hoare triple {26745#(<= main_~i~0 35)} assume !(~i~0 < 100000); {26711#false} is VALID [2018-11-14 18:42:36,846 INFO L273 TraceCheckUtils]: 142: Hoare triple {26711#false} havoc ~x~0;~x~0 := 0; {26711#false} is VALID [2018-11-14 18:42:36,846 INFO L273 TraceCheckUtils]: 143: Hoare triple {26711#false} assume true; {26711#false} is VALID [2018-11-14 18:42:36,847 INFO L273 TraceCheckUtils]: 144: Hoare triple {26711#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {26711#false} is VALID [2018-11-14 18:42:36,847 INFO L256 TraceCheckUtils]: 145: Hoare triple {26711#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {26711#false} is VALID [2018-11-14 18:42:36,847 INFO L273 TraceCheckUtils]: 146: Hoare triple {26711#false} ~cond := #in~cond; {26711#false} is VALID [2018-11-14 18:42:36,847 INFO L273 TraceCheckUtils]: 147: Hoare triple {26711#false} assume ~cond == 0; {26711#false} is VALID [2018-11-14 18:42:36,847 INFO L273 TraceCheckUtils]: 148: Hoare triple {26711#false} assume !false; {26711#false} is VALID [2018-11-14 18:42:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:36,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:36,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 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-14 18:42:36,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:42:36,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-14 18:42:36,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:37,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:37,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {26710#true} call ULTIMATE.init(); {26710#true} is VALID [2018-11-14 18:42:37,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {26710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26710#true} is VALID [2018-11-14 18:42:37,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {26710#true} assume true; {26710#true} is VALID [2018-11-14 18:42:37,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26710#true} {26710#true} #91#return; {26710#true} is VALID [2018-11-14 18:42:37,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {26710#true} call #t~ret13 := main(); {26710#true} is VALID [2018-11-14 18:42:37,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {26710#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {26710#true} is VALID [2018-11-14 18:42:37,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {26710#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {26710#true} is VALID [2018-11-14 18:42:37,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {26710#true} ~i~0 := 2; {26712#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:37,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {26712#(<= main_~i~0 2)} assume true; {26712#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:37,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {26712#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26712#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:37,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {26712#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26712#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:37,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {26712#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26713#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:37,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {26713#(<= main_~i~0 3)} assume true; {26713#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:37,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {26713#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26713#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:37,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {26713#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26713#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:37,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {26713#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26714#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:37,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {26714#(<= main_~i~0 4)} assume true; {26714#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:37,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {26714#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26714#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:37,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {26714#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26714#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:37,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {26714#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26715#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:37,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {26715#(<= main_~i~0 5)} assume true; {26715#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:37,347 INFO L273 TraceCheckUtils]: 21: Hoare triple {26715#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26715#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:37,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {26715#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26715#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:37,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {26715#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26716#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:37,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {26716#(<= main_~i~0 6)} assume true; {26716#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:37,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {26716#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26716#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:37,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {26716#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26716#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:37,350 INFO L273 TraceCheckUtils]: 27: Hoare triple {26716#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26717#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:37,351 INFO L273 TraceCheckUtils]: 28: Hoare triple {26717#(<= main_~i~0 7)} assume true; {26717#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:37,351 INFO L273 TraceCheckUtils]: 29: Hoare triple {26717#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26717#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:37,352 INFO L273 TraceCheckUtils]: 30: Hoare triple {26717#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26717#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:37,352 INFO L273 TraceCheckUtils]: 31: Hoare triple {26717#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26718#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:37,353 INFO L273 TraceCheckUtils]: 32: Hoare triple {26718#(<= main_~i~0 8)} assume true; {26718#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:37,353 INFO L273 TraceCheckUtils]: 33: Hoare triple {26718#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26718#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:37,354 INFO L273 TraceCheckUtils]: 34: Hoare triple {26718#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26718#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:37,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {26718#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26719#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:37,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {26719#(<= main_~i~0 9)} assume true; {26719#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:37,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {26719#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26719#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:37,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {26719#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26719#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:37,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {26719#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26720#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:37,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {26720#(<= main_~i~0 10)} assume true; {26720#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:37,357 INFO L273 TraceCheckUtils]: 41: Hoare triple {26720#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26720#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:37,358 INFO L273 TraceCheckUtils]: 42: Hoare triple {26720#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26720#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:37,358 INFO L273 TraceCheckUtils]: 43: Hoare triple {26720#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26721#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:37,359 INFO L273 TraceCheckUtils]: 44: Hoare triple {26721#(<= main_~i~0 11)} assume true; {26721#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:37,359 INFO L273 TraceCheckUtils]: 45: Hoare triple {26721#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26721#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:37,360 INFO L273 TraceCheckUtils]: 46: Hoare triple {26721#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26721#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:37,361 INFO L273 TraceCheckUtils]: 47: Hoare triple {26721#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26722#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:37,361 INFO L273 TraceCheckUtils]: 48: Hoare triple {26722#(<= main_~i~0 12)} assume true; {26722#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:37,362 INFO L273 TraceCheckUtils]: 49: Hoare triple {26722#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26722#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:37,362 INFO L273 TraceCheckUtils]: 50: Hoare triple {26722#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26722#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:37,363 INFO L273 TraceCheckUtils]: 51: Hoare triple {26722#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26723#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:37,363 INFO L273 TraceCheckUtils]: 52: Hoare triple {26723#(<= main_~i~0 13)} assume true; {26723#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:37,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {26723#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26723#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:37,364 INFO L273 TraceCheckUtils]: 54: Hoare triple {26723#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26723#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:37,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {26723#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26724#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:37,365 INFO L273 TraceCheckUtils]: 56: Hoare triple {26724#(<= main_~i~0 14)} assume true; {26724#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:37,366 INFO L273 TraceCheckUtils]: 57: Hoare triple {26724#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26724#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:37,366 INFO L273 TraceCheckUtils]: 58: Hoare triple {26724#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26724#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:37,367 INFO L273 TraceCheckUtils]: 59: Hoare triple {26724#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26725#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:37,367 INFO L273 TraceCheckUtils]: 60: Hoare triple {26725#(<= main_~i~0 15)} assume true; {26725#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:37,368 INFO L273 TraceCheckUtils]: 61: Hoare triple {26725#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26725#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:37,368 INFO L273 TraceCheckUtils]: 62: Hoare triple {26725#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26725#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:37,369 INFO L273 TraceCheckUtils]: 63: Hoare triple {26725#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26726#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:37,369 INFO L273 TraceCheckUtils]: 64: Hoare triple {26726#(<= main_~i~0 16)} assume true; {26726#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:37,370 INFO L273 TraceCheckUtils]: 65: Hoare triple {26726#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26726#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:37,370 INFO L273 TraceCheckUtils]: 66: Hoare triple {26726#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26726#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:37,371 INFO L273 TraceCheckUtils]: 67: Hoare triple {26726#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26727#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:37,371 INFO L273 TraceCheckUtils]: 68: Hoare triple {26727#(<= main_~i~0 17)} assume true; {26727#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:37,372 INFO L273 TraceCheckUtils]: 69: Hoare triple {26727#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26727#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:37,372 INFO L273 TraceCheckUtils]: 70: Hoare triple {26727#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26727#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:37,373 INFO L273 TraceCheckUtils]: 71: Hoare triple {26727#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26728#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:37,373 INFO L273 TraceCheckUtils]: 72: Hoare triple {26728#(<= main_~i~0 18)} assume true; {26728#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:37,374 INFO L273 TraceCheckUtils]: 73: Hoare triple {26728#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26728#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:37,374 INFO L273 TraceCheckUtils]: 74: Hoare triple {26728#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26728#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:37,375 INFO L273 TraceCheckUtils]: 75: Hoare triple {26728#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26729#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:37,376 INFO L273 TraceCheckUtils]: 76: Hoare triple {26729#(<= main_~i~0 19)} assume true; {26729#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:37,376 INFO L273 TraceCheckUtils]: 77: Hoare triple {26729#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26729#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:37,376 INFO L273 TraceCheckUtils]: 78: Hoare triple {26729#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26729#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:37,377 INFO L273 TraceCheckUtils]: 79: Hoare triple {26729#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26730#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:37,378 INFO L273 TraceCheckUtils]: 80: Hoare triple {26730#(<= main_~i~0 20)} assume true; {26730#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:37,378 INFO L273 TraceCheckUtils]: 81: Hoare triple {26730#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26730#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:37,379 INFO L273 TraceCheckUtils]: 82: Hoare triple {26730#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26730#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:37,379 INFO L273 TraceCheckUtils]: 83: Hoare triple {26730#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26731#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:37,380 INFO L273 TraceCheckUtils]: 84: Hoare triple {26731#(<= main_~i~0 21)} assume true; {26731#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:37,380 INFO L273 TraceCheckUtils]: 85: Hoare triple {26731#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26731#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:37,381 INFO L273 TraceCheckUtils]: 86: Hoare triple {26731#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26731#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:37,381 INFO L273 TraceCheckUtils]: 87: Hoare triple {26731#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26732#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:37,382 INFO L273 TraceCheckUtils]: 88: Hoare triple {26732#(<= main_~i~0 22)} assume true; {26732#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:37,382 INFO L273 TraceCheckUtils]: 89: Hoare triple {26732#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26732#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:37,383 INFO L273 TraceCheckUtils]: 90: Hoare triple {26732#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26732#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:37,383 INFO L273 TraceCheckUtils]: 91: Hoare triple {26732#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26733#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:37,384 INFO L273 TraceCheckUtils]: 92: Hoare triple {26733#(<= main_~i~0 23)} assume true; {26733#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:37,384 INFO L273 TraceCheckUtils]: 93: Hoare triple {26733#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26733#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:37,385 INFO L273 TraceCheckUtils]: 94: Hoare triple {26733#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26733#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:37,385 INFO L273 TraceCheckUtils]: 95: Hoare triple {26733#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26734#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:37,386 INFO L273 TraceCheckUtils]: 96: Hoare triple {26734#(<= main_~i~0 24)} assume true; {26734#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:37,386 INFO L273 TraceCheckUtils]: 97: Hoare triple {26734#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26734#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:37,387 INFO L273 TraceCheckUtils]: 98: Hoare triple {26734#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26734#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:37,388 INFO L273 TraceCheckUtils]: 99: Hoare triple {26734#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26735#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:37,388 INFO L273 TraceCheckUtils]: 100: Hoare triple {26735#(<= main_~i~0 25)} assume true; {26735#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:37,388 INFO L273 TraceCheckUtils]: 101: Hoare triple {26735#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26735#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:37,389 INFO L273 TraceCheckUtils]: 102: Hoare triple {26735#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26735#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:37,390 INFO L273 TraceCheckUtils]: 103: Hoare triple {26735#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26736#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:37,390 INFO L273 TraceCheckUtils]: 104: Hoare triple {26736#(<= main_~i~0 26)} assume true; {26736#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:37,391 INFO L273 TraceCheckUtils]: 105: Hoare triple {26736#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26736#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:37,391 INFO L273 TraceCheckUtils]: 106: Hoare triple {26736#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26736#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:37,392 INFO L273 TraceCheckUtils]: 107: Hoare triple {26736#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26737#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:37,392 INFO L273 TraceCheckUtils]: 108: Hoare triple {26737#(<= main_~i~0 27)} assume true; {26737#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:37,393 INFO L273 TraceCheckUtils]: 109: Hoare triple {26737#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26737#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:37,393 INFO L273 TraceCheckUtils]: 110: Hoare triple {26737#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26737#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:37,394 INFO L273 TraceCheckUtils]: 111: Hoare triple {26737#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26738#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:37,394 INFO L273 TraceCheckUtils]: 112: Hoare triple {26738#(<= main_~i~0 28)} assume true; {26738#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:37,395 INFO L273 TraceCheckUtils]: 113: Hoare triple {26738#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26738#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:37,395 INFO L273 TraceCheckUtils]: 114: Hoare triple {26738#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26738#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:37,396 INFO L273 TraceCheckUtils]: 115: Hoare triple {26738#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26739#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:37,396 INFO L273 TraceCheckUtils]: 116: Hoare triple {26739#(<= main_~i~0 29)} assume true; {26739#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:37,397 INFO L273 TraceCheckUtils]: 117: Hoare triple {26739#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26739#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:37,397 INFO L273 TraceCheckUtils]: 118: Hoare triple {26739#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26739#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:37,398 INFO L273 TraceCheckUtils]: 119: Hoare triple {26739#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26740#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:37,398 INFO L273 TraceCheckUtils]: 120: Hoare triple {26740#(<= main_~i~0 30)} assume true; {26740#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:37,399 INFO L273 TraceCheckUtils]: 121: Hoare triple {26740#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26740#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:37,399 INFO L273 TraceCheckUtils]: 122: Hoare triple {26740#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26740#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:37,400 INFO L273 TraceCheckUtils]: 123: Hoare triple {26740#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26741#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:37,400 INFO L273 TraceCheckUtils]: 124: Hoare triple {26741#(<= main_~i~0 31)} assume true; {26741#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:37,401 INFO L273 TraceCheckUtils]: 125: Hoare triple {26741#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26741#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:37,401 INFO L273 TraceCheckUtils]: 126: Hoare triple {26741#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26741#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:37,402 INFO L273 TraceCheckUtils]: 127: Hoare triple {26741#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26742#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:37,402 INFO L273 TraceCheckUtils]: 128: Hoare triple {26742#(<= main_~i~0 32)} assume true; {26742#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:37,403 INFO L273 TraceCheckUtils]: 129: Hoare triple {26742#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26742#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:37,403 INFO L273 TraceCheckUtils]: 130: Hoare triple {26742#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26742#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:37,404 INFO L273 TraceCheckUtils]: 131: Hoare triple {26742#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26743#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:37,405 INFO L273 TraceCheckUtils]: 132: Hoare triple {26743#(<= main_~i~0 33)} assume true; {26743#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:37,405 INFO L273 TraceCheckUtils]: 133: Hoare triple {26743#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26743#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:37,406 INFO L273 TraceCheckUtils]: 134: Hoare triple {26743#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26743#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:37,406 INFO L273 TraceCheckUtils]: 135: Hoare triple {26743#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26744#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:37,407 INFO L273 TraceCheckUtils]: 136: Hoare triple {26744#(<= main_~i~0 34)} assume true; {26744#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:37,407 INFO L273 TraceCheckUtils]: 137: Hoare triple {26744#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {26744#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:37,428 INFO L273 TraceCheckUtils]: 138: Hoare triple {26744#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26744#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:37,442 INFO L273 TraceCheckUtils]: 139: Hoare triple {26744#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {26745#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:37,450 INFO L273 TraceCheckUtils]: 140: Hoare triple {26745#(<= main_~i~0 35)} assume true; {26745#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:37,455 INFO L273 TraceCheckUtils]: 141: Hoare triple {26745#(<= main_~i~0 35)} assume !(~i~0 < 100000); {26711#false} is VALID [2018-11-14 18:42:37,455 INFO L273 TraceCheckUtils]: 142: Hoare triple {26711#false} havoc ~x~0;~x~0 := 0; {26711#false} is VALID [2018-11-14 18:42:37,455 INFO L273 TraceCheckUtils]: 143: Hoare triple {26711#false} assume true; {26711#false} is VALID [2018-11-14 18:42:37,456 INFO L273 TraceCheckUtils]: 144: Hoare triple {26711#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {26711#false} is VALID [2018-11-14 18:42:37,456 INFO L256 TraceCheckUtils]: 145: Hoare triple {26711#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {26711#false} is VALID [2018-11-14 18:42:37,456 INFO L273 TraceCheckUtils]: 146: Hoare triple {26711#false} ~cond := #in~cond; {26711#false} is VALID [2018-11-14 18:42:37,456 INFO L273 TraceCheckUtils]: 147: Hoare triple {26711#false} assume ~cond == 0; {26711#false} is VALID [2018-11-14 18:42:37,456 INFO L273 TraceCheckUtils]: 148: Hoare triple {26711#false} assume !false; {26711#false} is VALID [2018-11-14 18:42:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:37,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:37,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-11-14 18:42:37,491 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 149 [2018-11-14 18:42:37,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:37,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 18:42:37,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:37,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 18:42:37,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 18:42:37,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 18:42:37,668 INFO L87 Difference]: Start difference. First operand 194 states and 265 transitions. Second operand 36 states. [2018-11-14 18:42:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:39,117 INFO L93 Difference]: Finished difference Result 221 states and 300 transitions. [2018-11-14 18:42:39,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-14 18:42:39,117 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 149 [2018-11-14 18:42:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:42:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 300 transitions. [2018-11-14 18:42:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:42:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 300 transitions. [2018-11-14 18:42:39,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 300 transitions. [2018-11-14 18:42:39,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:39,399 INFO L225 Difference]: With dead ends: 221 [2018-11-14 18:42:39,399 INFO L226 Difference]: Without dead ends: 202 [2018-11-14 18:42:39,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 18:42:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-14 18:42:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-11-14 18:42:39,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:39,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 199 states. [2018-11-14 18:42:39,452 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 199 states. [2018-11-14 18:42:39,453 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 199 states. [2018-11-14 18:42:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:39,456 INFO L93 Difference]: Finished difference Result 202 states and 277 transitions. [2018-11-14 18:42:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 277 transitions. [2018-11-14 18:42:39,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:39,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:39,457 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 202 states. [2018-11-14 18:42:39,457 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 202 states. [2018-11-14 18:42:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:39,461 INFO L93 Difference]: Finished difference Result 202 states and 277 transitions. [2018-11-14 18:42:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 277 transitions. [2018-11-14 18:42:39,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:39,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:39,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:39,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-14 18:42:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 272 transitions. [2018-11-14 18:42:39,466 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 272 transitions. Word has length 149 [2018-11-14 18:42:39,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:39,466 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 272 transitions. [2018-11-14 18:42:39,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 18:42:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 272 transitions. [2018-11-14 18:42:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-14 18:42:39,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:39,468 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:39,468 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:39,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:39,468 INFO L82 PathProgramCache]: Analyzing trace with hash 551262576, now seen corresponding path program 34 times [2018-11-14 18:42:39,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:39,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:39,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:40,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {28109#true} call ULTIMATE.init(); {28109#true} is VALID [2018-11-14 18:42:40,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {28109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28109#true} is VALID [2018-11-14 18:42:40,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {28109#true} assume true; {28109#true} is VALID [2018-11-14 18:42:40,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28109#true} {28109#true} #91#return; {28109#true} is VALID [2018-11-14 18:42:40,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {28109#true} call #t~ret13 := main(); {28109#true} is VALID [2018-11-14 18:42:40,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {28109#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {28109#true} is VALID [2018-11-14 18:42:40,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {28109#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {28109#true} is VALID [2018-11-14 18:42:40,821 INFO L273 TraceCheckUtils]: 7: Hoare triple {28109#true} ~i~0 := 2; {28111#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:40,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {28111#(<= main_~i~0 2)} assume true; {28111#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:40,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {28111#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28111#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:40,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {28111#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28111#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:40,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {28111#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28112#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:40,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {28112#(<= main_~i~0 3)} assume true; {28112#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:40,825 INFO L273 TraceCheckUtils]: 13: Hoare triple {28112#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28112#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:40,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {28112#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28112#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:40,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {28112#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28113#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:40,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {28113#(<= main_~i~0 4)} assume true; {28113#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:40,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {28113#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28113#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:40,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {28113#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28113#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:40,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {28113#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28114#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:40,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {28114#(<= main_~i~0 5)} assume true; {28114#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:40,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {28114#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28114#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:40,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {28114#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28114#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:40,829 INFO L273 TraceCheckUtils]: 23: Hoare triple {28114#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28115#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:40,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {28115#(<= main_~i~0 6)} assume true; {28115#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:40,830 INFO L273 TraceCheckUtils]: 25: Hoare triple {28115#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28115#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:40,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {28115#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28115#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:40,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {28115#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28116#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:40,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {28116#(<= main_~i~0 7)} assume true; {28116#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:40,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {28116#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28116#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:40,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {28116#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28116#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:40,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {28116#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28117#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:40,834 INFO L273 TraceCheckUtils]: 32: Hoare triple {28117#(<= main_~i~0 8)} assume true; {28117#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:40,835 INFO L273 TraceCheckUtils]: 33: Hoare triple {28117#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28117#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:40,835 INFO L273 TraceCheckUtils]: 34: Hoare triple {28117#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28117#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:40,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {28117#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28118#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:40,836 INFO L273 TraceCheckUtils]: 36: Hoare triple {28118#(<= main_~i~0 9)} assume true; {28118#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:40,837 INFO L273 TraceCheckUtils]: 37: Hoare triple {28118#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28118#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:40,837 INFO L273 TraceCheckUtils]: 38: Hoare triple {28118#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28118#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:40,838 INFO L273 TraceCheckUtils]: 39: Hoare triple {28118#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28119#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:40,839 INFO L273 TraceCheckUtils]: 40: Hoare triple {28119#(<= main_~i~0 10)} assume true; {28119#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:40,839 INFO L273 TraceCheckUtils]: 41: Hoare triple {28119#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28119#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:40,840 INFO L273 TraceCheckUtils]: 42: Hoare triple {28119#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28119#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:40,840 INFO L273 TraceCheckUtils]: 43: Hoare triple {28119#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28120#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:40,841 INFO L273 TraceCheckUtils]: 44: Hoare triple {28120#(<= main_~i~0 11)} assume true; {28120#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:40,841 INFO L273 TraceCheckUtils]: 45: Hoare triple {28120#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28120#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:40,842 INFO L273 TraceCheckUtils]: 46: Hoare triple {28120#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28120#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:40,842 INFO L273 TraceCheckUtils]: 47: Hoare triple {28120#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28121#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:40,843 INFO L273 TraceCheckUtils]: 48: Hoare triple {28121#(<= main_~i~0 12)} assume true; {28121#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:40,843 INFO L273 TraceCheckUtils]: 49: Hoare triple {28121#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28121#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:40,844 INFO L273 TraceCheckUtils]: 50: Hoare triple {28121#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28121#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:40,845 INFO L273 TraceCheckUtils]: 51: Hoare triple {28121#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28122#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:40,845 INFO L273 TraceCheckUtils]: 52: Hoare triple {28122#(<= main_~i~0 13)} assume true; {28122#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:40,846 INFO L273 TraceCheckUtils]: 53: Hoare triple {28122#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28122#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:40,846 INFO L273 TraceCheckUtils]: 54: Hoare triple {28122#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28122#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:40,847 INFO L273 TraceCheckUtils]: 55: Hoare triple {28122#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28123#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:40,847 INFO L273 TraceCheckUtils]: 56: Hoare triple {28123#(<= main_~i~0 14)} assume true; {28123#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:40,848 INFO L273 TraceCheckUtils]: 57: Hoare triple {28123#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28123#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:40,848 INFO L273 TraceCheckUtils]: 58: Hoare triple {28123#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28123#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:40,849 INFO L273 TraceCheckUtils]: 59: Hoare triple {28123#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28124#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:40,850 INFO L273 TraceCheckUtils]: 60: Hoare triple {28124#(<= main_~i~0 15)} assume true; {28124#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:40,850 INFO L273 TraceCheckUtils]: 61: Hoare triple {28124#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28124#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:40,851 INFO L273 TraceCheckUtils]: 62: Hoare triple {28124#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28124#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:40,851 INFO L273 TraceCheckUtils]: 63: Hoare triple {28124#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28125#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:40,852 INFO L273 TraceCheckUtils]: 64: Hoare triple {28125#(<= main_~i~0 16)} assume true; {28125#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:40,852 INFO L273 TraceCheckUtils]: 65: Hoare triple {28125#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28125#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:40,853 INFO L273 TraceCheckUtils]: 66: Hoare triple {28125#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28125#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:40,853 INFO L273 TraceCheckUtils]: 67: Hoare triple {28125#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28126#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:40,854 INFO L273 TraceCheckUtils]: 68: Hoare triple {28126#(<= main_~i~0 17)} assume true; {28126#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:40,854 INFO L273 TraceCheckUtils]: 69: Hoare triple {28126#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28126#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:40,855 INFO L273 TraceCheckUtils]: 70: Hoare triple {28126#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28126#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:40,856 INFO L273 TraceCheckUtils]: 71: Hoare triple {28126#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28127#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:40,856 INFO L273 TraceCheckUtils]: 72: Hoare triple {28127#(<= main_~i~0 18)} assume true; {28127#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:40,857 INFO L273 TraceCheckUtils]: 73: Hoare triple {28127#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28127#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:40,857 INFO L273 TraceCheckUtils]: 74: Hoare triple {28127#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28127#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:40,858 INFO L273 TraceCheckUtils]: 75: Hoare triple {28127#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28128#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:40,858 INFO L273 TraceCheckUtils]: 76: Hoare triple {28128#(<= main_~i~0 19)} assume true; {28128#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:40,859 INFO L273 TraceCheckUtils]: 77: Hoare triple {28128#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28128#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:40,859 INFO L273 TraceCheckUtils]: 78: Hoare triple {28128#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28128#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:40,860 INFO L273 TraceCheckUtils]: 79: Hoare triple {28128#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28129#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:40,861 INFO L273 TraceCheckUtils]: 80: Hoare triple {28129#(<= main_~i~0 20)} assume true; {28129#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:40,861 INFO L273 TraceCheckUtils]: 81: Hoare triple {28129#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28129#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:40,862 INFO L273 TraceCheckUtils]: 82: Hoare triple {28129#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28129#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:40,862 INFO L273 TraceCheckUtils]: 83: Hoare triple {28129#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28130#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:40,863 INFO L273 TraceCheckUtils]: 84: Hoare triple {28130#(<= main_~i~0 21)} assume true; {28130#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:40,863 INFO L273 TraceCheckUtils]: 85: Hoare triple {28130#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28130#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:40,864 INFO L273 TraceCheckUtils]: 86: Hoare triple {28130#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28130#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:40,864 INFO L273 TraceCheckUtils]: 87: Hoare triple {28130#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28131#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:40,865 INFO L273 TraceCheckUtils]: 88: Hoare triple {28131#(<= main_~i~0 22)} assume true; {28131#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:40,866 INFO L273 TraceCheckUtils]: 89: Hoare triple {28131#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28131#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:40,866 INFO L273 TraceCheckUtils]: 90: Hoare triple {28131#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28131#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:40,867 INFO L273 TraceCheckUtils]: 91: Hoare triple {28131#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28132#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:40,867 INFO L273 TraceCheckUtils]: 92: Hoare triple {28132#(<= main_~i~0 23)} assume true; {28132#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:40,868 INFO L273 TraceCheckUtils]: 93: Hoare triple {28132#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28132#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:40,868 INFO L273 TraceCheckUtils]: 94: Hoare triple {28132#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28132#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:40,869 INFO L273 TraceCheckUtils]: 95: Hoare triple {28132#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28133#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:40,869 INFO L273 TraceCheckUtils]: 96: Hoare triple {28133#(<= main_~i~0 24)} assume true; {28133#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:40,870 INFO L273 TraceCheckUtils]: 97: Hoare triple {28133#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28133#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:40,870 INFO L273 TraceCheckUtils]: 98: Hoare triple {28133#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28133#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:40,871 INFO L273 TraceCheckUtils]: 99: Hoare triple {28133#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28134#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:40,872 INFO L273 TraceCheckUtils]: 100: Hoare triple {28134#(<= main_~i~0 25)} assume true; {28134#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:40,872 INFO L273 TraceCheckUtils]: 101: Hoare triple {28134#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28134#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:40,873 INFO L273 TraceCheckUtils]: 102: Hoare triple {28134#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28134#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:40,873 INFO L273 TraceCheckUtils]: 103: Hoare triple {28134#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28135#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:40,874 INFO L273 TraceCheckUtils]: 104: Hoare triple {28135#(<= main_~i~0 26)} assume true; {28135#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:40,874 INFO L273 TraceCheckUtils]: 105: Hoare triple {28135#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28135#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:40,875 INFO L273 TraceCheckUtils]: 106: Hoare triple {28135#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28135#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:40,876 INFO L273 TraceCheckUtils]: 107: Hoare triple {28135#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28136#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:40,876 INFO L273 TraceCheckUtils]: 108: Hoare triple {28136#(<= main_~i~0 27)} assume true; {28136#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:40,877 INFO L273 TraceCheckUtils]: 109: Hoare triple {28136#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28136#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:40,877 INFO L273 TraceCheckUtils]: 110: Hoare triple {28136#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28136#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:40,878 INFO L273 TraceCheckUtils]: 111: Hoare triple {28136#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28137#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:40,878 INFO L273 TraceCheckUtils]: 112: Hoare triple {28137#(<= main_~i~0 28)} assume true; {28137#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:40,879 INFO L273 TraceCheckUtils]: 113: Hoare triple {28137#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28137#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:40,879 INFO L273 TraceCheckUtils]: 114: Hoare triple {28137#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28137#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:40,880 INFO L273 TraceCheckUtils]: 115: Hoare triple {28137#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28138#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:40,880 INFO L273 TraceCheckUtils]: 116: Hoare triple {28138#(<= main_~i~0 29)} assume true; {28138#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:40,881 INFO L273 TraceCheckUtils]: 117: Hoare triple {28138#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28138#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:40,881 INFO L273 TraceCheckUtils]: 118: Hoare triple {28138#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28138#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:40,882 INFO L273 TraceCheckUtils]: 119: Hoare triple {28138#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28139#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:40,883 INFO L273 TraceCheckUtils]: 120: Hoare triple {28139#(<= main_~i~0 30)} assume true; {28139#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:40,883 INFO L273 TraceCheckUtils]: 121: Hoare triple {28139#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28139#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:40,884 INFO L273 TraceCheckUtils]: 122: Hoare triple {28139#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28139#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:40,884 INFO L273 TraceCheckUtils]: 123: Hoare triple {28139#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28140#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:40,885 INFO L273 TraceCheckUtils]: 124: Hoare triple {28140#(<= main_~i~0 31)} assume true; {28140#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:40,885 INFO L273 TraceCheckUtils]: 125: Hoare triple {28140#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28140#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:40,886 INFO L273 TraceCheckUtils]: 126: Hoare triple {28140#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28140#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:40,887 INFO L273 TraceCheckUtils]: 127: Hoare triple {28140#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28141#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:40,887 INFO L273 TraceCheckUtils]: 128: Hoare triple {28141#(<= main_~i~0 32)} assume true; {28141#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:40,888 INFO L273 TraceCheckUtils]: 129: Hoare triple {28141#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28141#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:40,888 INFO L273 TraceCheckUtils]: 130: Hoare triple {28141#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28141#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:40,889 INFO L273 TraceCheckUtils]: 131: Hoare triple {28141#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28142#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:40,889 INFO L273 TraceCheckUtils]: 132: Hoare triple {28142#(<= main_~i~0 33)} assume true; {28142#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:40,890 INFO L273 TraceCheckUtils]: 133: Hoare triple {28142#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28142#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:40,890 INFO L273 TraceCheckUtils]: 134: Hoare triple {28142#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28142#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:40,891 INFO L273 TraceCheckUtils]: 135: Hoare triple {28142#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28143#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:40,891 INFO L273 TraceCheckUtils]: 136: Hoare triple {28143#(<= main_~i~0 34)} assume true; {28143#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:40,892 INFO L273 TraceCheckUtils]: 137: Hoare triple {28143#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28143#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:40,892 INFO L273 TraceCheckUtils]: 138: Hoare triple {28143#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28143#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:40,893 INFO L273 TraceCheckUtils]: 139: Hoare triple {28143#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28144#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:40,894 INFO L273 TraceCheckUtils]: 140: Hoare triple {28144#(<= main_~i~0 35)} assume true; {28144#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:40,894 INFO L273 TraceCheckUtils]: 141: Hoare triple {28144#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28144#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:40,895 INFO L273 TraceCheckUtils]: 142: Hoare triple {28144#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28144#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:40,895 INFO L273 TraceCheckUtils]: 143: Hoare triple {28144#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28145#(<= main_~i~0 36)} is VALID [2018-11-14 18:42:40,896 INFO L273 TraceCheckUtils]: 144: Hoare triple {28145#(<= main_~i~0 36)} assume true; {28145#(<= main_~i~0 36)} is VALID [2018-11-14 18:42:40,897 INFO L273 TraceCheckUtils]: 145: Hoare triple {28145#(<= main_~i~0 36)} assume !(~i~0 < 100000); {28110#false} is VALID [2018-11-14 18:42:40,897 INFO L273 TraceCheckUtils]: 146: Hoare triple {28110#false} havoc ~x~0;~x~0 := 0; {28110#false} is VALID [2018-11-14 18:42:40,897 INFO L273 TraceCheckUtils]: 147: Hoare triple {28110#false} assume true; {28110#false} is VALID [2018-11-14 18:42:40,897 INFO L273 TraceCheckUtils]: 148: Hoare triple {28110#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {28110#false} is VALID [2018-11-14 18:42:40,897 INFO L256 TraceCheckUtils]: 149: Hoare triple {28110#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {28110#false} is VALID [2018-11-14 18:42:40,898 INFO L273 TraceCheckUtils]: 150: Hoare triple {28110#false} ~cond := #in~cond; {28110#false} is VALID [2018-11-14 18:42:40,898 INFO L273 TraceCheckUtils]: 151: Hoare triple {28110#false} assume ~cond == 0; {28110#false} is VALID [2018-11-14 18:42:40,898 INFO L273 TraceCheckUtils]: 152: Hoare triple {28110#false} assume !false; {28110#false} is VALID [2018-11-14 18:42:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:40,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:40,914 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-14 18:42:40,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:42:40,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:42:40,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:41,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:41,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {28109#true} call ULTIMATE.init(); {28109#true} is VALID [2018-11-14 18:42:41,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {28109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28109#true} is VALID [2018-11-14 18:42:41,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {28109#true} assume true; {28109#true} is VALID [2018-11-14 18:42:41,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28109#true} {28109#true} #91#return; {28109#true} is VALID [2018-11-14 18:42:41,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {28109#true} call #t~ret13 := main(); {28109#true} is VALID [2018-11-14 18:42:41,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {28109#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset + 0, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, ~#array~0.offset + 4, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {28109#true} is VALID [2018-11-14 18:42:41,471 INFO L273 TraceCheckUtils]: 6: Hoare triple {28109#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {28109#true} is VALID [2018-11-14 18:42:41,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {28109#true} ~i~0 := 2; {28111#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:41,472 INFO L273 TraceCheckUtils]: 8: Hoare triple {28111#(<= main_~i~0 2)} assume true; {28111#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:41,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {28111#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28111#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:41,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {28111#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28111#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:41,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {28111#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28112#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:41,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {28112#(<= main_~i~0 3)} assume true; {28112#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:41,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {28112#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28112#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:41,474 INFO L273 TraceCheckUtils]: 14: Hoare triple {28112#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28112#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:41,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {28112#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28113#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:41,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {28113#(<= main_~i~0 4)} assume true; {28113#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:41,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {28113#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28113#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:41,476 INFO L273 TraceCheckUtils]: 18: Hoare triple {28113#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28113#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:41,477 INFO L273 TraceCheckUtils]: 19: Hoare triple {28113#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28114#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:41,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {28114#(<= main_~i~0 5)} assume true; {28114#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:41,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {28114#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28114#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:41,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {28114#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28114#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:41,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {28114#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28115#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:41,480 INFO L273 TraceCheckUtils]: 24: Hoare triple {28115#(<= main_~i~0 6)} assume true; {28115#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:41,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {28115#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28115#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:41,481 INFO L273 TraceCheckUtils]: 26: Hoare triple {28115#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28115#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:41,482 INFO L273 TraceCheckUtils]: 27: Hoare triple {28115#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28116#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:41,482 INFO L273 TraceCheckUtils]: 28: Hoare triple {28116#(<= main_~i~0 7)} assume true; {28116#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:41,483 INFO L273 TraceCheckUtils]: 29: Hoare triple {28116#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28116#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:41,483 INFO L273 TraceCheckUtils]: 30: Hoare triple {28116#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28116#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:41,484 INFO L273 TraceCheckUtils]: 31: Hoare triple {28116#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28117#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:41,484 INFO L273 TraceCheckUtils]: 32: Hoare triple {28117#(<= main_~i~0 8)} assume true; {28117#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:41,485 INFO L273 TraceCheckUtils]: 33: Hoare triple {28117#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28117#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:41,485 INFO L273 TraceCheckUtils]: 34: Hoare triple {28117#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28117#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:41,486 INFO L273 TraceCheckUtils]: 35: Hoare triple {28117#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28118#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:41,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {28118#(<= main_~i~0 9)} assume true; {28118#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:41,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {28118#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28118#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:41,487 INFO L273 TraceCheckUtils]: 38: Hoare triple {28118#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28118#(<= main_~i~0 9)} is VALID [2018-11-14 18:42:41,488 INFO L273 TraceCheckUtils]: 39: Hoare triple {28118#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28119#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:41,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {28119#(<= main_~i~0 10)} assume true; {28119#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:41,489 INFO L273 TraceCheckUtils]: 41: Hoare triple {28119#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28119#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:41,490 INFO L273 TraceCheckUtils]: 42: Hoare triple {28119#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28119#(<= main_~i~0 10)} is VALID [2018-11-14 18:42:41,490 INFO L273 TraceCheckUtils]: 43: Hoare triple {28119#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28120#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:41,491 INFO L273 TraceCheckUtils]: 44: Hoare triple {28120#(<= main_~i~0 11)} assume true; {28120#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:41,491 INFO L273 TraceCheckUtils]: 45: Hoare triple {28120#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28120#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:41,492 INFO L273 TraceCheckUtils]: 46: Hoare triple {28120#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28120#(<= main_~i~0 11)} is VALID [2018-11-14 18:42:41,493 INFO L273 TraceCheckUtils]: 47: Hoare triple {28120#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28121#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:41,493 INFO L273 TraceCheckUtils]: 48: Hoare triple {28121#(<= main_~i~0 12)} assume true; {28121#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:41,494 INFO L273 TraceCheckUtils]: 49: Hoare triple {28121#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28121#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:41,494 INFO L273 TraceCheckUtils]: 50: Hoare triple {28121#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28121#(<= main_~i~0 12)} is VALID [2018-11-14 18:42:41,495 INFO L273 TraceCheckUtils]: 51: Hoare triple {28121#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28122#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:41,495 INFO L273 TraceCheckUtils]: 52: Hoare triple {28122#(<= main_~i~0 13)} assume true; {28122#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:41,496 INFO L273 TraceCheckUtils]: 53: Hoare triple {28122#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28122#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:41,496 INFO L273 TraceCheckUtils]: 54: Hoare triple {28122#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28122#(<= main_~i~0 13)} is VALID [2018-11-14 18:42:41,497 INFO L273 TraceCheckUtils]: 55: Hoare triple {28122#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28123#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:41,497 INFO L273 TraceCheckUtils]: 56: Hoare triple {28123#(<= main_~i~0 14)} assume true; {28123#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:41,498 INFO L273 TraceCheckUtils]: 57: Hoare triple {28123#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28123#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:41,498 INFO L273 TraceCheckUtils]: 58: Hoare triple {28123#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28123#(<= main_~i~0 14)} is VALID [2018-11-14 18:42:41,499 INFO L273 TraceCheckUtils]: 59: Hoare triple {28123#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28124#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:41,500 INFO L273 TraceCheckUtils]: 60: Hoare triple {28124#(<= main_~i~0 15)} assume true; {28124#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:41,500 INFO L273 TraceCheckUtils]: 61: Hoare triple {28124#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28124#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:41,501 INFO L273 TraceCheckUtils]: 62: Hoare triple {28124#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28124#(<= main_~i~0 15)} is VALID [2018-11-14 18:42:41,501 INFO L273 TraceCheckUtils]: 63: Hoare triple {28124#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28125#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:41,502 INFO L273 TraceCheckUtils]: 64: Hoare triple {28125#(<= main_~i~0 16)} assume true; {28125#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:41,502 INFO L273 TraceCheckUtils]: 65: Hoare triple {28125#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28125#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:41,503 INFO L273 TraceCheckUtils]: 66: Hoare triple {28125#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28125#(<= main_~i~0 16)} is VALID [2018-11-14 18:42:41,504 INFO L273 TraceCheckUtils]: 67: Hoare triple {28125#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28126#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:41,504 INFO L273 TraceCheckUtils]: 68: Hoare triple {28126#(<= main_~i~0 17)} assume true; {28126#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:41,505 INFO L273 TraceCheckUtils]: 69: Hoare triple {28126#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28126#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:41,505 INFO L273 TraceCheckUtils]: 70: Hoare triple {28126#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28126#(<= main_~i~0 17)} is VALID [2018-11-14 18:42:41,506 INFO L273 TraceCheckUtils]: 71: Hoare triple {28126#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28127#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:41,506 INFO L273 TraceCheckUtils]: 72: Hoare triple {28127#(<= main_~i~0 18)} assume true; {28127#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:41,507 INFO L273 TraceCheckUtils]: 73: Hoare triple {28127#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28127#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:41,507 INFO L273 TraceCheckUtils]: 74: Hoare triple {28127#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28127#(<= main_~i~0 18)} is VALID [2018-11-14 18:42:41,508 INFO L273 TraceCheckUtils]: 75: Hoare triple {28127#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28128#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:41,509 INFO L273 TraceCheckUtils]: 76: Hoare triple {28128#(<= main_~i~0 19)} assume true; {28128#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:41,509 INFO L273 TraceCheckUtils]: 77: Hoare triple {28128#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28128#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:41,510 INFO L273 TraceCheckUtils]: 78: Hoare triple {28128#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28128#(<= main_~i~0 19)} is VALID [2018-11-14 18:42:41,510 INFO L273 TraceCheckUtils]: 79: Hoare triple {28128#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28129#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:41,511 INFO L273 TraceCheckUtils]: 80: Hoare triple {28129#(<= main_~i~0 20)} assume true; {28129#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:41,511 INFO L273 TraceCheckUtils]: 81: Hoare triple {28129#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28129#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:41,512 INFO L273 TraceCheckUtils]: 82: Hoare triple {28129#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28129#(<= main_~i~0 20)} is VALID [2018-11-14 18:42:41,512 INFO L273 TraceCheckUtils]: 83: Hoare triple {28129#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28130#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:41,513 INFO L273 TraceCheckUtils]: 84: Hoare triple {28130#(<= main_~i~0 21)} assume true; {28130#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:41,513 INFO L273 TraceCheckUtils]: 85: Hoare triple {28130#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28130#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:41,514 INFO L273 TraceCheckUtils]: 86: Hoare triple {28130#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28130#(<= main_~i~0 21)} is VALID [2018-11-14 18:42:41,515 INFO L273 TraceCheckUtils]: 87: Hoare triple {28130#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28131#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:41,515 INFO L273 TraceCheckUtils]: 88: Hoare triple {28131#(<= main_~i~0 22)} assume true; {28131#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:41,516 INFO L273 TraceCheckUtils]: 89: Hoare triple {28131#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28131#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:41,516 INFO L273 TraceCheckUtils]: 90: Hoare triple {28131#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28131#(<= main_~i~0 22)} is VALID [2018-11-14 18:42:41,517 INFO L273 TraceCheckUtils]: 91: Hoare triple {28131#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28132#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:41,517 INFO L273 TraceCheckUtils]: 92: Hoare triple {28132#(<= main_~i~0 23)} assume true; {28132#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:41,518 INFO L273 TraceCheckUtils]: 93: Hoare triple {28132#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28132#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:41,518 INFO L273 TraceCheckUtils]: 94: Hoare triple {28132#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28132#(<= main_~i~0 23)} is VALID [2018-11-14 18:42:41,519 INFO L273 TraceCheckUtils]: 95: Hoare triple {28132#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28133#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:41,520 INFO L273 TraceCheckUtils]: 96: Hoare triple {28133#(<= main_~i~0 24)} assume true; {28133#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:41,520 INFO L273 TraceCheckUtils]: 97: Hoare triple {28133#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28133#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:41,521 INFO L273 TraceCheckUtils]: 98: Hoare triple {28133#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28133#(<= main_~i~0 24)} is VALID [2018-11-14 18:42:41,521 INFO L273 TraceCheckUtils]: 99: Hoare triple {28133#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28134#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:41,522 INFO L273 TraceCheckUtils]: 100: Hoare triple {28134#(<= main_~i~0 25)} assume true; {28134#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:41,522 INFO L273 TraceCheckUtils]: 101: Hoare triple {28134#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28134#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:41,523 INFO L273 TraceCheckUtils]: 102: Hoare triple {28134#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28134#(<= main_~i~0 25)} is VALID [2018-11-14 18:42:41,524 INFO L273 TraceCheckUtils]: 103: Hoare triple {28134#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28135#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:41,524 INFO L273 TraceCheckUtils]: 104: Hoare triple {28135#(<= main_~i~0 26)} assume true; {28135#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:41,525 INFO L273 TraceCheckUtils]: 105: Hoare triple {28135#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28135#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:41,525 INFO L273 TraceCheckUtils]: 106: Hoare triple {28135#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28135#(<= main_~i~0 26)} is VALID [2018-11-14 18:42:41,526 INFO L273 TraceCheckUtils]: 107: Hoare triple {28135#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28136#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:41,526 INFO L273 TraceCheckUtils]: 108: Hoare triple {28136#(<= main_~i~0 27)} assume true; {28136#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:41,527 INFO L273 TraceCheckUtils]: 109: Hoare triple {28136#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28136#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:41,527 INFO L273 TraceCheckUtils]: 110: Hoare triple {28136#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28136#(<= main_~i~0 27)} is VALID [2018-11-14 18:42:41,528 INFO L273 TraceCheckUtils]: 111: Hoare triple {28136#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28137#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:41,528 INFO L273 TraceCheckUtils]: 112: Hoare triple {28137#(<= main_~i~0 28)} assume true; {28137#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:41,529 INFO L273 TraceCheckUtils]: 113: Hoare triple {28137#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28137#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:41,529 INFO L273 TraceCheckUtils]: 114: Hoare triple {28137#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28137#(<= main_~i~0 28)} is VALID [2018-11-14 18:42:41,530 INFO L273 TraceCheckUtils]: 115: Hoare triple {28137#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28138#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:41,531 INFO L273 TraceCheckUtils]: 116: Hoare triple {28138#(<= main_~i~0 29)} assume true; {28138#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:41,531 INFO L273 TraceCheckUtils]: 117: Hoare triple {28138#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28138#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:41,532 INFO L273 TraceCheckUtils]: 118: Hoare triple {28138#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28138#(<= main_~i~0 29)} is VALID [2018-11-14 18:42:41,532 INFO L273 TraceCheckUtils]: 119: Hoare triple {28138#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28139#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:41,533 INFO L273 TraceCheckUtils]: 120: Hoare triple {28139#(<= main_~i~0 30)} assume true; {28139#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:41,533 INFO L273 TraceCheckUtils]: 121: Hoare triple {28139#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28139#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:41,534 INFO L273 TraceCheckUtils]: 122: Hoare triple {28139#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28139#(<= main_~i~0 30)} is VALID [2018-11-14 18:42:41,535 INFO L273 TraceCheckUtils]: 123: Hoare triple {28139#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28140#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:41,535 INFO L273 TraceCheckUtils]: 124: Hoare triple {28140#(<= main_~i~0 31)} assume true; {28140#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:41,536 INFO L273 TraceCheckUtils]: 125: Hoare triple {28140#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28140#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:41,536 INFO L273 TraceCheckUtils]: 126: Hoare triple {28140#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28140#(<= main_~i~0 31)} is VALID [2018-11-14 18:42:41,537 INFO L273 TraceCheckUtils]: 127: Hoare triple {28140#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28141#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:41,537 INFO L273 TraceCheckUtils]: 128: Hoare triple {28141#(<= main_~i~0 32)} assume true; {28141#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:41,538 INFO L273 TraceCheckUtils]: 129: Hoare triple {28141#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28141#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:41,538 INFO L273 TraceCheckUtils]: 130: Hoare triple {28141#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28141#(<= main_~i~0 32)} is VALID [2018-11-14 18:42:41,539 INFO L273 TraceCheckUtils]: 131: Hoare triple {28141#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28142#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:41,539 INFO L273 TraceCheckUtils]: 132: Hoare triple {28142#(<= main_~i~0 33)} assume true; {28142#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:41,540 INFO L273 TraceCheckUtils]: 133: Hoare triple {28142#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28142#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:41,540 INFO L273 TraceCheckUtils]: 134: Hoare triple {28142#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28142#(<= main_~i~0 33)} is VALID [2018-11-14 18:42:41,541 INFO L273 TraceCheckUtils]: 135: Hoare triple {28142#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28143#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:41,541 INFO L273 TraceCheckUtils]: 136: Hoare triple {28143#(<= main_~i~0 34)} assume true; {28143#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:41,542 INFO L273 TraceCheckUtils]: 137: Hoare triple {28143#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28143#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:41,542 INFO L273 TraceCheckUtils]: 138: Hoare triple {28143#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28143#(<= main_~i~0 34)} is VALID [2018-11-14 18:42:41,543 INFO L273 TraceCheckUtils]: 139: Hoare triple {28143#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28144#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:41,543 INFO L273 TraceCheckUtils]: 140: Hoare triple {28144#(<= main_~i~0 35)} assume true; {28144#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:41,544 INFO L273 TraceCheckUtils]: 141: Hoare triple {28144#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4); {28144#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:41,544 INFO L273 TraceCheckUtils]: 142: Hoare triple {28144#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 * 4, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28144#(<= main_~i~0 35)} is VALID [2018-11-14 18:42:41,545 INFO L273 TraceCheckUtils]: 143: Hoare triple {28144#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {28145#(<= main_~i~0 36)} is VALID [2018-11-14 18:42:41,546 INFO L273 TraceCheckUtils]: 144: Hoare triple {28145#(<= main_~i~0 36)} assume true; {28145#(<= main_~i~0 36)} is VALID [2018-11-14 18:42:41,546 INFO L273 TraceCheckUtils]: 145: Hoare triple {28145#(<= main_~i~0 36)} assume !(~i~0 < 100000); {28110#false} is VALID [2018-11-14 18:42:41,546 INFO L273 TraceCheckUtils]: 146: Hoare triple {28110#false} havoc ~x~0;~x~0 := 0; {28110#false} is VALID [2018-11-14 18:42:41,546 INFO L273 TraceCheckUtils]: 147: Hoare triple {28110#false} assume true; {28110#false} is VALID [2018-11-14 18:42:41,547 INFO L273 TraceCheckUtils]: 148: Hoare triple {28110#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~x~0 * 4, 4); {28110#false} is VALID [2018-11-14 18:42:41,547 INFO L256 TraceCheckUtils]: 149: Hoare triple {28110#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {28110#false} is VALID [2018-11-14 18:42:41,547 INFO L273 TraceCheckUtils]: 150: Hoare triple {28110#false} ~cond := #in~cond; {28110#false} is VALID [2018-11-14 18:42:41,547 INFO L273 TraceCheckUtils]: 151: Hoare triple {28110#false} assume ~cond == 0; {28110#false} is VALID [2018-11-14 18:42:41,547 INFO L273 TraceCheckUtils]: 152: Hoare triple {28110#false} assume !false; {28110#false} is VALID [2018-11-14 18:42:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:42:41,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:41,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-11-14 18:42:41,585 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 153 [2018-11-14 18:42:41,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:41,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states.