java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_minInArray_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:04:59,774 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:04:59,776 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:04:59,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:04:59,799 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:04:59,800 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:04:59,801 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:04:59,806 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:04:59,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:04:59,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:04:59,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:04:59,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:04:59,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:04:59,817 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:04:59,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:04:59,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:04:59,829 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:04:59,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:04:59,836 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:04:59,840 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:04:59,841 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:04:59,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:04:59,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:04:59,848 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:04:59,848 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:04:59,853 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:04:59,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:04:59,858 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:04:59,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:04:59,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:04:59,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:04:59,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:04:59,863 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:04:59,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:04:59,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:04:59,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:04:59,867 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:04:59,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:04:59,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:04:59,896 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:04:59,898 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:04:59,899 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:04:59,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:04:59,899 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:04:59,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:04:59,900 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:04:59,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:04:59,900 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:04:59,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:04:59,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:04:59,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:04:59,901 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:04:59,901 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:04:59,901 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:04:59,901 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:04:59,903 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:04:59,903 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:04:59,903 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:04:59,904 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:04:59,904 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:04:59,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:04:59,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:04:59,905 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:04:59,905 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:04:59,905 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:04:59,905 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:04:59,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:04:59,906 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:04:59,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:04:59,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:05:00,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:05:00,002 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:05:00,002 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:05:00,003 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_minInArray_true-unreach-call_ground.i [2018-11-23 12:05:00,067 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6d8fdac/ab752c6d0dc74574bcee070b0ca15393/FLAG9acf26f4e [2018-11-23 12:05:00,594 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:05:00,595 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_minInArray_true-unreach-call_ground.i [2018-11-23 12:05:00,601 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6d8fdac/ab752c6d0dc74574bcee070b0ca15393/FLAG9acf26f4e [2018-11-23 12:05:00,938 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6d8fdac/ab752c6d0dc74574bcee070b0ca15393 [2018-11-23 12:05:00,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:05:00,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:05:00,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:00,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:05:00,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:05:00,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:00" (1/1) ... [2018-11-23 12:05:00,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d9d738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:00, skipping insertion in model container [2018-11-23 12:05:00,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:00" (1/1) ... [2018-11-23 12:05:00,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:05:00,991 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:05:01,234 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:01,239 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:05:01,267 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:01,292 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:05:01,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01 WrapperNode [2018-11-23 12:05:01,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:01,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:01,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:05:01,294 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:05:01,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (1/1) ... [2018-11-23 12:05:01,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (1/1) ... [2018-11-23 12:05:01,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:01,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:05:01,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:05:01,322 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:05:01,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (1/1) ... [2018-11-23 12:05:01,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (1/1) ... [2018-11-23 12:05:01,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (1/1) ... [2018-11-23 12:05:01,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (1/1) ... [2018-11-23 12:05:01,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (1/1) ... [2018-11-23 12:05:01,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (1/1) ... [2018-11-23 12:05:01,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (1/1) ... [2018-11-23 12:05:01,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:05:01,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:05:01,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:05:01,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:05:01,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:05:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:05:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:05:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:05:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:05:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:05:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:05:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:05:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:05:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:05:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:05:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:05:01,997 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:05:01,998 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:05:01,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:01 BoogieIcfgContainer [2018-11-23 12:05:01,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:05:01,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:05:02,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:05:02,003 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:05:02,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:05:00" (1/3) ... [2018-11-23 12:05:02,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11445a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:02, skipping insertion in model container [2018-11-23 12:05:02,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:01" (2/3) ... [2018-11-23 12:05:02,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11445a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:02, skipping insertion in model container [2018-11-23 12:05:02,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:01" (3/3) ... [2018-11-23 12:05:02,007 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_minInArray_true-unreach-call_ground.i [2018-11-23 12:05:02,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:05:02,027 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:05:02,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:05:02,080 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:05:02,080 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:05:02,081 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:05:02,081 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:05:02,081 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:05:02,082 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:05:02,082 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:05:02,082 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:05:02,082 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:05:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 12:05:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:05:02,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:02,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:02,114 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:02,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:02,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1513105276, now seen corresponding path program 1 times [2018-11-23 12:05:02,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:02,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:02,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:02,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:02,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 12:05:02,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 12:05:02,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:05:02,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #55#return; {28#true} is VALID [2018-11-23 12:05:02,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret4 := main(); {28#true} is VALID [2018-11-23 12:05:02,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {28#true} is VALID [2018-11-23 12:05:02,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 12:05:02,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} havoc ~x~0;~x~0 := 0; {29#false} is VALID [2018-11-23 12:05:02,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {29#false} is VALID [2018-11-23 12:05:02,278 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {29#false} is VALID [2018-11-23 12:05:02,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 12:05:02,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 12:05:02,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 12:05:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:02,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:02,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:05:02,291 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:05:02,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:02,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:05:02,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:02,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:05:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:05:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:05:02,387 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 12:05:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:02,599 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 12:05:02,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:05:02,599 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:05:02,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:05:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 12:05:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:05:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 12:05:02,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 12:05:02,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:02,925 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:05:02,926 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:05:02,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:05:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:05:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:05:02,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:02,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:05:02,975 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:05:02,975 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:05:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:02,979 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:05:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:05:02,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:02,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:02,980 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:05:02,980 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:05:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:02,984 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:05:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:05:02,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:02,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:02,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:02,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 12:05:02,991 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 12:05:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:02,992 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:05:02,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:05:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:05:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:05:02,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:02,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:02,996 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:02,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1609256121, now seen corresponding path program 1 times [2018-11-23 12:05:02,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:02,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:02,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:03,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2018-11-23 12:05:03,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {152#true} is VALID [2018-11-23 12:05:03,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2018-11-23 12:05:03,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #55#return; {152#true} is VALID [2018-11-23 12:05:03,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret4 := main(); {152#true} is VALID [2018-11-23 12:05:03,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {154#(= main_~i~0 0)} is VALID [2018-11-23 12:05:03,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {154#(= main_~i~0 0)} assume !(~i~0 < 100000); {153#false} is VALID [2018-11-23 12:05:03,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {153#false} havoc ~x~0;~x~0 := 0; {153#false} is VALID [2018-11-23 12:05:03,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {153#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {153#false} is VALID [2018-11-23 12:05:03,121 INFO L256 TraceCheckUtils]: 9: Hoare triple {153#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {153#false} is VALID [2018-11-23 12:05:03,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2018-11-23 12:05:03,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2018-11-23 12:05:03,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {153#false} assume !false; {153#false} is VALID [2018-11-23 12:05:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:03,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:03,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:05:03,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:05:03,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:03,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:05:03,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:03,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:05:03,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:05:03,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:05:03,193 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 12:05:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:03,389 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:05:03,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:05:03,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:05:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 12:05:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 12:05:03,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 12:05:03,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:03,477 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:05:03,478 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 12:05:03,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:05:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 12:05:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 12:05:03,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:03,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2018-11-23 12:05:03,511 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2018-11-23 12:05:03,511 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2018-11-23 12:05:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:03,513 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 12:05:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 12:05:03,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:03,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:03,514 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2018-11-23 12:05:03,515 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2018-11-23 12:05:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:03,517 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 12:05:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 12:05:03,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:03,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:03,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:03,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 12:05:03,520 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 12:05:03,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:03,521 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 12:05:03,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:05:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:05:03,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:05:03,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:03,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:03,522 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:03,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:03,523 INFO L82 PathProgramCache]: Analyzing trace with hash -30491421, now seen corresponding path program 1 times [2018-11-23 12:05:03,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:03,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:03,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:03,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:03,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:03,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 12:05:03,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 12:05:03,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 12:05:03,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #55#return; {279#true} is VALID [2018-11-23 12:05:03,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret4 := main(); {279#true} is VALID [2018-11-23 12:05:03,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {281#(= main_~i~0 0)} is VALID [2018-11-23 12:05:03,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {281#(= main_~i~0 0)} is VALID [2018-11-23 12:05:03,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {281#(= main_~i~0 0)} is VALID [2018-11-23 12:05:03,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {281#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {282#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:03,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 1)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 12:05:03,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-23 12:05:03,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {280#false} is VALID [2018-11-23 12:05:03,753 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {280#false} is VALID [2018-11-23 12:05:03,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 12:05:03,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 12:05:03,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 12:05:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:03,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:03,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:03,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:03,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:04,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 12:05:04,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 12:05:04,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 12:05:04,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #55#return; {279#true} is VALID [2018-11-23 12:05:04,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret4 := main(); {279#true} is VALID [2018-11-23 12:05:04,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {301#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:04,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {301#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:04,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {301#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {301#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:04,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {301#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {282#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:04,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 1)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 12:05:04,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-23 12:05:04,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {280#false} is VALID [2018-11-23 12:05:04,098 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {280#false} is VALID [2018-11-23 12:05:04,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 12:05:04,098 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 12:05:04,099 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 12:05:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:04,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:04,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:05:04,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:05:04,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:04,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:05:04,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:04,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:05:04,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:05:04,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:05:04,169 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-23 12:05:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:04,522 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:05:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:05:04,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:05:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:05:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:05:04,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-23 12:05:04,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:04,685 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:05:04,685 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:05:04,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:05:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:05:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 12:05:04,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:04,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 12:05:04,696 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 12:05:04,697 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 12:05:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:04,699 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:05:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:05:04,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:04,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:04,700 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 12:05:04,700 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 12:05:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:04,703 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:05:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:05:04,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:04,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:04,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:04,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 12:05:04,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 16 [2018-11-23 12:05:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:04,707 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 12:05:04,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:05:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:05:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:05:04,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:04,708 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:04,708 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:04,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:04,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1208509561, now seen corresponding path program 2 times [2018-11-23 12:05:04,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:04,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:04,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:04,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:04,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:04,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2018-11-23 12:05:04,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {467#true} is VALID [2018-11-23 12:05:04,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-23 12:05:04,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #55#return; {467#true} is VALID [2018-11-23 12:05:04,850 INFO L256 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret4 := main(); {467#true} is VALID [2018-11-23 12:05:04,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {469#(= main_~i~0 0)} is VALID [2018-11-23 12:05:04,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {469#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {469#(= main_~i~0 0)} is VALID [2018-11-23 12:05:04,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {469#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {469#(= main_~i~0 0)} is VALID [2018-11-23 12:05:04,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:04,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:04,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {470#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:04,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {471#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:04,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {471#(<= main_~i~0 2)} assume !(~i~0 < 100000); {468#false} is VALID [2018-11-23 12:05:04,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {468#false} havoc ~x~0;~x~0 := 0; {468#false} is VALID [2018-11-23 12:05:04,862 INFO L273 TraceCheckUtils]: 14: Hoare triple {468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {468#false} is VALID [2018-11-23 12:05:04,862 INFO L256 TraceCheckUtils]: 15: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {468#false} is VALID [2018-11-23 12:05:04,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2018-11-23 12:05:04,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2018-11-23 12:05:04,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {468#false} assume !false; {468#false} is VALID [2018-11-23 12:05:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:04,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:04,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:04,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:04,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:04,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:04,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:05,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2018-11-23 12:05:05,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {467#true} is VALID [2018-11-23 12:05:05,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-23 12:05:05,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #55#return; {467#true} is VALID [2018-11-23 12:05:05,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret4 := main(); {467#true} is VALID [2018-11-23 12:05:05,024 INFO L273 TraceCheckUtils]: 5: Hoare triple {467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {490#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:05,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {490#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {490#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:05,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {490#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {490#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:05,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {490#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:05,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:05,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {470#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:05,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {471#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:05,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {471#(<= main_~i~0 2)} assume !(~i~0 < 100000); {468#false} is VALID [2018-11-23 12:05:05,075 INFO L273 TraceCheckUtils]: 13: Hoare triple {468#false} havoc ~x~0;~x~0 := 0; {468#false} is VALID [2018-11-23 12:05:05,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {468#false} is VALID [2018-11-23 12:05:05,076 INFO L256 TraceCheckUtils]: 15: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {468#false} is VALID [2018-11-23 12:05:05,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2018-11-23 12:05:05,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2018-11-23 12:05:05,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {468#false} assume !false; {468#false} is VALID [2018-11-23 12:05:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:05,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:05,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:05:05,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:05:05,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:05,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:05:05,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:05,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:05:05,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:05:05,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:05:05,191 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-11-23 12:05:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:05,359 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 12:05:05,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:05:05,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:05:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:05:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 12:05:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:05:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 12:05:05,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-23 12:05:05,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:05,506 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:05:05,506 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:05:05,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:05:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:05:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 12:05:05,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:05,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 12:05:05,523 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 12:05:05,523 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 12:05:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:05,526 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:05:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:05:05,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:05,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:05,527 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 12:05:05,528 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 12:05:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:05,530 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:05:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:05:05,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:05,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:05,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:05,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:05:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:05:05,534 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2018-11-23 12:05:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:05,534 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:05:05,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:05:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:05:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:05:05,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:05,535 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:05,536 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:05,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1337822499, now seen corresponding path program 3 times [2018-11-23 12:05:05,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:05,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:05,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:05,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:05,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:05,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-23 12:05:05,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {679#true} is VALID [2018-11-23 12:05:05,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-23 12:05:05,655 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #55#return; {679#true} is VALID [2018-11-23 12:05:05,655 INFO L256 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret4 := main(); {679#true} is VALID [2018-11-23 12:05:05,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {681#(= main_~i~0 0)} is VALID [2018-11-23 12:05:05,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {681#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {681#(= main_~i~0 0)} is VALID [2018-11-23 12:05:05,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {681#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {681#(= main_~i~0 0)} is VALID [2018-11-23 12:05:05,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {681#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:05,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {682#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:05,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {682#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:05,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {682#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:05,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {683#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:05,672 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:05,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {684#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:05,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {684#(<= main_~i~0 3)} assume !(~i~0 < 100000); {680#false} is VALID [2018-11-23 12:05:05,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#false} havoc ~x~0;~x~0 := 0; {680#false} is VALID [2018-11-23 12:05:05,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {680#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {680#false} is VALID [2018-11-23 12:05:05,675 INFO L256 TraceCheckUtils]: 18: Hoare triple {680#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {680#false} is VALID [2018-11-23 12:05:05,675 INFO L273 TraceCheckUtils]: 19: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-23 12:05:05,675 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#false} assume 0 == ~cond; {680#false} is VALID [2018-11-23 12:05:05,676 INFO L273 TraceCheckUtils]: 21: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-23 12:05:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:05,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:05,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:05,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:05,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:05:05,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:05,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:05,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-23 12:05:05,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {679#true} is VALID [2018-11-23 12:05:05,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-23 12:05:05,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #55#return; {679#true} is VALID [2018-11-23 12:05:05,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret4 := main(); {679#true} is VALID [2018-11-23 12:05:05,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {703#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:05,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {703#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {703#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:05,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {703#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {703#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:05,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {703#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:05,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {682#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:05,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {682#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:05,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {682#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:05,847 INFO L273 TraceCheckUtils]: 12: Hoare triple {683#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:05,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:05,849 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {684#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:05,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {684#(<= main_~i~0 3)} assume !(~i~0 < 100000); {680#false} is VALID [2018-11-23 12:05:05,850 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#false} havoc ~x~0;~x~0 := 0; {680#false} is VALID [2018-11-23 12:05:05,850 INFO L273 TraceCheckUtils]: 17: Hoare triple {680#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {680#false} is VALID [2018-11-23 12:05:05,850 INFO L256 TraceCheckUtils]: 18: Hoare triple {680#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {680#false} is VALID [2018-11-23 12:05:05,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-23 12:05:05,851 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#false} assume 0 == ~cond; {680#false} is VALID [2018-11-23 12:05:05,851 INFO L273 TraceCheckUtils]: 21: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-23 12:05:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:05,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:05,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:05:05,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 12:05:05,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:05,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:05:05,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:05,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:05:05,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:05:05,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:05:05,908 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 7 states. [2018-11-23 12:05:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:06,189 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-23 12:05:06,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:05:06,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 12:05:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:05:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 12:05:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:05:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 12:05:06,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2018-11-23 12:05:06,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:06,352 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:05:06,352 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:05:06,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:05:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:05:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 12:05:06,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:06,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-23 12:05:06,387 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-23 12:05:06,388 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-23 12:05:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:06,390 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:05:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:05:06,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:06,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:06,391 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-23 12:05:06,391 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-23 12:05:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:06,393 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:05:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:05:06,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:06,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:06,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:06,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:05:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:05:06,397 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2018-11-23 12:05:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:06,397 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:05:06,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:05:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:05:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:05:06,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:06,399 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:06,399 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:06,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:06,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1113893945, now seen corresponding path program 4 times [2018-11-23 12:05:06,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:06,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:06,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:06,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {915#true} call ULTIMATE.init(); {915#true} is VALID [2018-11-23 12:05:06,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {915#true} is VALID [2018-11-23 12:05:06,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-23 12:05:06,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {915#true} {915#true} #55#return; {915#true} is VALID [2018-11-23 12:05:06,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {915#true} call #t~ret4 := main(); {915#true} is VALID [2018-11-23 12:05:06,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {915#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {917#(= main_~i~0 0)} is VALID [2018-11-23 12:05:06,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {917#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {917#(= main_~i~0 0)} is VALID [2018-11-23 12:05:06,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {917#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {917#(= main_~i~0 0)} is VALID [2018-11-23 12:05:06,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {917#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:06,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {918#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:06,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:06,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {918#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:06,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:06,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {919#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:06,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:06,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {920#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:06,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {920#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:06,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {920#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {921#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:06,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {921#(<= main_~i~0 4)} assume !(~i~0 < 100000); {916#false} is VALID [2018-11-23 12:05:06,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {916#false} havoc ~x~0;~x~0 := 0; {916#false} is VALID [2018-11-23 12:05:06,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {916#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {916#false} is VALID [2018-11-23 12:05:06,556 INFO L256 TraceCheckUtils]: 21: Hoare triple {916#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {916#false} is VALID [2018-11-23 12:05:06,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {916#false} ~cond := #in~cond; {916#false} is VALID [2018-11-23 12:05:06,556 INFO L273 TraceCheckUtils]: 23: Hoare triple {916#false} assume 0 == ~cond; {916#false} is VALID [2018-11-23 12:05:06,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {916#false} assume !false; {916#false} is VALID [2018-11-23 12:05:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:06,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:06,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:06,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:06,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:06,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:06,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:06,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {915#true} call ULTIMATE.init(); {915#true} is VALID [2018-11-23 12:05:06,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {915#true} is VALID [2018-11-23 12:05:06,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-23 12:05:06,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {915#true} {915#true} #55#return; {915#true} is VALID [2018-11-23 12:05:06,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {915#true} call #t~ret4 := main(); {915#true} is VALID [2018-11-23 12:05:06,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {915#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {940#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:06,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {940#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {940#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:06,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {940#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {940#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:06,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {940#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:06,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {918#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:06,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:06,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {918#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:06,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:06,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {919#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:06,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:06,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {920#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:06,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {920#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:06,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {920#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {921#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:06,809 INFO L273 TraceCheckUtils]: 18: Hoare triple {921#(<= main_~i~0 4)} assume !(~i~0 < 100000); {916#false} is VALID [2018-11-23 12:05:06,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {916#false} havoc ~x~0;~x~0 := 0; {916#false} is VALID [2018-11-23 12:05:06,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {916#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {916#false} is VALID [2018-11-23 12:05:06,810 INFO L256 TraceCheckUtils]: 21: Hoare triple {916#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {916#false} is VALID [2018-11-23 12:05:06,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {916#false} ~cond := #in~cond; {916#false} is VALID [2018-11-23 12:05:06,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {916#false} assume 0 == ~cond; {916#false} is VALID [2018-11-23 12:05:06,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {916#false} assume !false; {916#false} is VALID [2018-11-23 12:05:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:06,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:06,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:05:06,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:05:06,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:06,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:05:06,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:06,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:05:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:05:06,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:05:06,941 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 8 states. [2018-11-23 12:05:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:07,272 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:05:07,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:05:07,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:05:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:05:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2018-11-23 12:05:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:05:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2018-11-23 12:05:07,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2018-11-23 12:05:07,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:07,348 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:05:07,348 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:05:07,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:05:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:05:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 12:05:07,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:07,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2018-11-23 12:05:07,370 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2018-11-23 12:05:07,370 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2018-11-23 12:05:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:07,372 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 12:05:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:05:07,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:07,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:07,373 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2018-11-23 12:05:07,373 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2018-11-23 12:05:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:07,375 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 12:05:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:05:07,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:07,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:07,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:07,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:05:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 12:05:07,379 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 25 [2018-11-23 12:05:07,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:07,379 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 12:05:07,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:05:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:05:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:05:07,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:07,380 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:07,381 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:07,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:07,381 INFO L82 PathProgramCache]: Analyzing trace with hash 142552419, now seen corresponding path program 5 times [2018-11-23 12:05:07,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:07,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:07,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:07,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:07,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:07,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-23 12:05:07,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1175#true} is VALID [2018-11-23 12:05:07,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-23 12:05:07,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #55#return; {1175#true} is VALID [2018-11-23 12:05:07,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret4 := main(); {1175#true} is VALID [2018-11-23 12:05:07,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {1175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1177#(= main_~i~0 0)} is VALID [2018-11-23 12:05:07,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {1177#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1177#(= main_~i~0 0)} is VALID [2018-11-23 12:05:07,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {1177#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1177#(= main_~i~0 0)} is VALID [2018-11-23 12:05:07,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {1177#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,565 INFO L273 TraceCheckUtils]: 14: Hoare triple {1179#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {1180#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {1180#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,567 INFO L273 TraceCheckUtils]: 17: Hoare triple {1180#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,567 INFO L273 TraceCheckUtils]: 18: Hoare triple {1181#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,568 INFO L273 TraceCheckUtils]: 19: Hoare triple {1181#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {1181#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1182#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:07,570 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1176#false} is VALID [2018-11-23 12:05:07,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {1176#false} havoc ~x~0;~x~0 := 0; {1176#false} is VALID [2018-11-23 12:05:07,571 INFO L273 TraceCheckUtils]: 23: Hoare triple {1176#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1176#false} is VALID [2018-11-23 12:05:07,571 INFO L256 TraceCheckUtils]: 24: Hoare triple {1176#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1176#false} is VALID [2018-11-23 12:05:07,572 INFO L273 TraceCheckUtils]: 25: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2018-11-23 12:05:07,572 INFO L273 TraceCheckUtils]: 26: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2018-11-23 12:05:07,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-23 12:05:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:07,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:07,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:07,590 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:07,692 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:05:07,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:07,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:07,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-23 12:05:07,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1175#true} is VALID [2018-11-23 12:05:07,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-23 12:05:07,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #55#return; {1175#true} is VALID [2018-11-23 12:05:07,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret4 := main(); {1175#true} is VALID [2018-11-23 12:05:07,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {1175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1201#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:07,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {1201#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1201#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:07,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {1201#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1201#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:07,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {1201#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {1179#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {1180#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,953 INFO L273 TraceCheckUtils]: 16: Hoare triple {1180#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,954 INFO L273 TraceCheckUtils]: 17: Hoare triple {1180#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {1181#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,956 INFO L273 TraceCheckUtils]: 19: Hoare triple {1181#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {1181#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1182#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:07,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1176#false} is VALID [2018-11-23 12:05:07,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {1176#false} havoc ~x~0;~x~0 := 0; {1176#false} is VALID [2018-11-23 12:05:07,958 INFO L273 TraceCheckUtils]: 23: Hoare triple {1176#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1176#false} is VALID [2018-11-23 12:05:07,959 INFO L256 TraceCheckUtils]: 24: Hoare triple {1176#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1176#false} is VALID [2018-11-23 12:05:07,959 INFO L273 TraceCheckUtils]: 25: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2018-11-23 12:05:07,959 INFO L273 TraceCheckUtils]: 26: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2018-11-23 12:05:07,960 INFO L273 TraceCheckUtils]: 27: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-23 12:05:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:07,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:07,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:05:07,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:05:07,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:07,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:05:08,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:08,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:05:08,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:05:08,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:05:08,034 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 9 states. [2018-11-23 12:05:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:08,242 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:05:08,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:05:08,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:05:08,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:05:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 12:05:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:05:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 12:05:08,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2018-11-23 12:05:08,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:08,323 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:05:08,323 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:05:08,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:05:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:05:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 12:05:08,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:08,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2018-11-23 12:05:08,365 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2018-11-23 12:05:08,365 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2018-11-23 12:05:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:08,368 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 12:05:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:05:08,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:08,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:08,369 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2018-11-23 12:05:08,369 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2018-11-23 12:05:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:08,371 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 12:05:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:05:08,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:08,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:08,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:08,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:05:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 12:05:08,375 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 28 [2018-11-23 12:05:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:08,375 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 12:05:08,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:05:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 12:05:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:05:08,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:08,377 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:08,377 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:08,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1898175495, now seen corresponding path program 6 times [2018-11-23 12:05:08,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:08,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:08,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:08,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:08,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2018-11-23 12:05:08,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {1459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1459#true} is VALID [2018-11-23 12:05:08,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2018-11-23 12:05:08,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #55#return; {1459#true} is VALID [2018-11-23 12:05:08,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret4 := main(); {1459#true} is VALID [2018-11-23 12:05:08,524 INFO L273 TraceCheckUtils]: 5: Hoare triple {1459#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1461#(= main_~i~0 0)} is VALID [2018-11-23 12:05:08,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {1461#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1461#(= main_~i~0 0)} is VALID [2018-11-23 12:05:08,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {1461#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1461#(= main_~i~0 0)} is VALID [2018-11-23 12:05:08,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {1461#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {1462#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {1462#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {1463#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {1463#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {1463#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {1464#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {1464#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {1464#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,549 INFO L273 TraceCheckUtils]: 18: Hoare triple {1465#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,549 INFO L273 TraceCheckUtils]: 19: Hoare triple {1465#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {1465#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1467#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:08,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {1467#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1460#false} is VALID [2018-11-23 12:05:08,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {1460#false} havoc ~x~0;~x~0 := 0; {1460#false} is VALID [2018-11-23 12:05:08,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {1460#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1460#false} is VALID [2018-11-23 12:05:08,554 INFO L256 TraceCheckUtils]: 27: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1460#false} is VALID [2018-11-23 12:05:08,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2018-11-23 12:05:08,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2018-11-23 12:05:08,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2018-11-23 12:05:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:08,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:08,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:08,576 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:08,615 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:05:08,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:08,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:08,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2018-11-23 12:05:08,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {1459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1459#true} is VALID [2018-11-23 12:05:08,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2018-11-23 12:05:08,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #55#return; {1459#true} is VALID [2018-11-23 12:05:08,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret4 := main(); {1459#true} is VALID [2018-11-23 12:05:08,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {1459#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1486#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:08,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {1486#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1486#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:08,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {1486#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1486#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:08,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {1486#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,784 INFO L273 TraceCheckUtils]: 9: Hoare triple {1462#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {1462#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {1463#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {1463#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {1463#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {1464#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {1464#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {1464#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {1465#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,791 INFO L273 TraceCheckUtils]: 19: Hoare triple {1465#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {1465#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1467#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:08,796 INFO L273 TraceCheckUtils]: 24: Hoare triple {1467#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1460#false} is VALID [2018-11-23 12:05:08,796 INFO L273 TraceCheckUtils]: 25: Hoare triple {1460#false} havoc ~x~0;~x~0 := 0; {1460#false} is VALID [2018-11-23 12:05:08,796 INFO L273 TraceCheckUtils]: 26: Hoare triple {1460#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1460#false} is VALID [2018-11-23 12:05:08,797 INFO L256 TraceCheckUtils]: 27: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1460#false} is VALID [2018-11-23 12:05:08,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2018-11-23 12:05:08,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2018-11-23 12:05:08,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2018-11-23 12:05:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:08,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:08,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:05:08,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 12:05:08,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:08,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:05:08,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:08,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:05:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:05:08,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:05:08,895 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 10 states. [2018-11-23 12:05:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:09,368 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-23 12:05:09,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:05:09,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 12:05:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:05:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-23 12:05:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:05:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-23 12:05:09,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2018-11-23 12:05:09,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:09,539 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:05:09,539 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:05:09,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:05:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:05:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 12:05:09,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:09,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2018-11-23 12:05:09,606 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2018-11-23 12:05:09,606 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2018-11-23 12:05:09,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:09,609 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 12:05:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:05:09,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:09,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:09,610 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2018-11-23 12:05:09,610 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2018-11-23 12:05:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:09,611 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 12:05:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:05:09,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:09,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:09,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:09,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:05:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 12:05:09,614 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 31 [2018-11-23 12:05:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:09,614 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 12:05:09,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:05:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:05:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:05:09,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:09,616 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:09,616 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:09,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:09,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1961386589, now seen corresponding path program 7 times [2018-11-23 12:05:09,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:09,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:09,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:09,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:10,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {1767#true} call ULTIMATE.init(); {1767#true} is VALID [2018-11-23 12:05:10,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {1767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1767#true} is VALID [2018-11-23 12:05:10,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {1767#true} assume true; {1767#true} is VALID [2018-11-23 12:05:10,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1767#true} {1767#true} #55#return; {1767#true} is VALID [2018-11-23 12:05:10,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {1767#true} call #t~ret4 := main(); {1767#true} is VALID [2018-11-23 12:05:10,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {1767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1769#(= main_~i~0 0)} is VALID [2018-11-23 12:05:10,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {1769#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1769#(= main_~i~0 0)} is VALID [2018-11-23 12:05:10,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {1769#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1769#(= main_~i~0 0)} is VALID [2018-11-23 12:05:10,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {1769#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {1770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {1770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {1770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {1771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {1771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {1771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {1772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {1772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {1772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,341 INFO L273 TraceCheckUtils]: 18: Hoare triple {1773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {1773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {1773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {1774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {1774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {1774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {1775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {1775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {1775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {1776#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:10,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {1776#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1768#false} is VALID [2018-11-23 12:05:10,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {1768#false} havoc ~x~0;~x~0 := 0; {1768#false} is VALID [2018-11-23 12:05:10,347 INFO L273 TraceCheckUtils]: 29: Hoare triple {1768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1768#false} is VALID [2018-11-23 12:05:10,348 INFO L256 TraceCheckUtils]: 30: Hoare triple {1768#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1768#false} is VALID [2018-11-23 12:05:10,348 INFO L273 TraceCheckUtils]: 31: Hoare triple {1768#false} ~cond := #in~cond; {1768#false} is VALID [2018-11-23 12:05:10,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {1768#false} assume 0 == ~cond; {1768#false} is VALID [2018-11-23 12:05:10,348 INFO L273 TraceCheckUtils]: 33: Hoare triple {1768#false} assume !false; {1768#false} is VALID [2018-11-23 12:05:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:10,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:10,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:10,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:10,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:10,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {1767#true} call ULTIMATE.init(); {1767#true} is VALID [2018-11-23 12:05:10,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {1767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1767#true} is VALID [2018-11-23 12:05:10,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {1767#true} assume true; {1767#true} is VALID [2018-11-23 12:05:10,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1767#true} {1767#true} #55#return; {1767#true} is VALID [2018-11-23 12:05:10,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {1767#true} call #t~ret4 := main(); {1767#true} is VALID [2018-11-23 12:05:10,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {1767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1795#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:10,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {1795#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1795#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:10,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {1795#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1795#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:10,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {1795#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {1770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {1770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {1770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {1771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {1771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {1771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {1772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {1772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,575 INFO L273 TraceCheckUtils]: 17: Hoare triple {1772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {1773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,576 INFO L273 TraceCheckUtils]: 19: Hoare triple {1773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {1773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,581 INFO L273 TraceCheckUtils]: 21: Hoare triple {1774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,581 INFO L273 TraceCheckUtils]: 22: Hoare triple {1774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,582 INFO L273 TraceCheckUtils]: 23: Hoare triple {1774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {1775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,601 INFO L273 TraceCheckUtils]: 25: Hoare triple {1775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,616 INFO L273 TraceCheckUtils]: 26: Hoare triple {1775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {1776#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:10,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {1776#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1768#false} is VALID [2018-11-23 12:05:10,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {1768#false} havoc ~x~0;~x~0 := 0; {1768#false} is VALID [2018-11-23 12:05:10,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {1768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1768#false} is VALID [2018-11-23 12:05:10,632 INFO L256 TraceCheckUtils]: 30: Hoare triple {1768#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1768#false} is VALID [2018-11-23 12:05:10,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {1768#false} ~cond := #in~cond; {1768#false} is VALID [2018-11-23 12:05:10,632 INFO L273 TraceCheckUtils]: 32: Hoare triple {1768#false} assume 0 == ~cond; {1768#false} is VALID [2018-11-23 12:05:10,632 INFO L273 TraceCheckUtils]: 33: Hoare triple {1768#false} assume !false; {1768#false} is VALID [2018-11-23 12:05:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:10,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:10,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:05:10,659 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-23 12:05:10,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:10,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:05:10,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:10,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:05:10,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:05:10,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:05:10,711 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 11 states. [2018-11-23 12:05:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:10,931 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 12:05:10,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:05:10,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-23 12:05:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:05:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 12:05:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:05:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 12:05:10,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2018-11-23 12:05:11,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:11,103 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:05:11,103 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:05:11,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:05:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:05:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 12:05:11,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:11,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 12:05:11,250 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 12:05:11,251 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 12:05:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:11,253 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 12:05:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 12:05:11,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:11,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:11,253 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 12:05:11,253 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 12:05:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:11,255 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 12:05:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 12:05:11,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:11,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:11,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:11,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:05:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-11-23 12:05:11,258 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 34 [2018-11-23 12:05:11,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:11,258 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-23 12:05:11,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:05:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-11-23 12:05:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:05:11,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:11,259 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:11,260 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:11,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:11,260 INFO L82 PathProgramCache]: Analyzing trace with hash 407555001, now seen corresponding path program 8 times [2018-11-23 12:05:11,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:11,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:11,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:11,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-23 12:05:11,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2099#true} is VALID [2018-11-23 12:05:11,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-23 12:05:11,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2099#true} {2099#true} #55#return; {2099#true} is VALID [2018-11-23 12:05:11,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {2099#true} call #t~ret4 := main(); {2099#true} is VALID [2018-11-23 12:05:11,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {2099#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2101#(= main_~i~0 0)} is VALID [2018-11-23 12:05:11,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {2101#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2101#(= main_~i~0 0)} is VALID [2018-11-23 12:05:11,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {2101#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2101#(= main_~i~0 0)} is VALID [2018-11-23 12:05:11,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {2101#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:11,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {2102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:11,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {2102#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:11,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {2102#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:11,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {2103#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:11,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {2103#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:11,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {2103#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:11,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {2104#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:11,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {2104#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:11,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {2104#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:11,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {2105#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:11,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {2105#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:11,636 INFO L273 TraceCheckUtils]: 20: Hoare triple {2105#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:11,636 INFO L273 TraceCheckUtils]: 21: Hoare triple {2106#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:11,638 INFO L273 TraceCheckUtils]: 22: Hoare triple {2106#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:11,638 INFO L273 TraceCheckUtils]: 23: Hoare triple {2106#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:11,640 INFO L273 TraceCheckUtils]: 24: Hoare triple {2107#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:11,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {2107#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:11,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {2107#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:11,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {2108#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:11,644 INFO L273 TraceCheckUtils]: 28: Hoare triple {2108#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:11,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {2108#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2109#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:11,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {2109#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2100#false} is VALID [2018-11-23 12:05:11,647 INFO L273 TraceCheckUtils]: 31: Hoare triple {2100#false} havoc ~x~0;~x~0 := 0; {2100#false} is VALID [2018-11-23 12:05:11,647 INFO L273 TraceCheckUtils]: 32: Hoare triple {2100#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2100#false} is VALID [2018-11-23 12:05:11,647 INFO L256 TraceCheckUtils]: 33: Hoare triple {2100#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2100#false} is VALID [2018-11-23 12:05:11,647 INFO L273 TraceCheckUtils]: 34: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-23 12:05:11,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {2100#false} assume 0 == ~cond; {2100#false} is VALID [2018-11-23 12:05:11,648 INFO L273 TraceCheckUtils]: 36: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-23 12:05:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:11,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:11,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:11,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:11,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:11,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:11,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:11,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-23 12:05:11,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2099#true} is VALID [2018-11-23 12:05:11,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-23 12:05:11,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2099#true} {2099#true} #55#return; {2099#true} is VALID [2018-11-23 12:05:11,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {2099#true} call #t~ret4 := main(); {2099#true} is VALID [2018-11-23 12:05:11,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {2099#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2128#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:11,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {2128#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2128#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:11,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {2128#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2128#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:11,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {2128#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:11,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {2102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:11,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {2102#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:11,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {2102#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:11,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {2103#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:11,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {2103#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:11,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {2103#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:11,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {2104#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:11,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {2104#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:11,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {2104#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:11,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {2105#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:11,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {2105#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:11,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {2105#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:11,884 INFO L273 TraceCheckUtils]: 21: Hoare triple {2106#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:11,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {2106#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:11,885 INFO L273 TraceCheckUtils]: 23: Hoare triple {2106#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:11,886 INFO L273 TraceCheckUtils]: 24: Hoare triple {2107#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:11,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {2107#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:11,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {2107#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:11,895 INFO L273 TraceCheckUtils]: 27: Hoare triple {2108#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:11,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {2108#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:11,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {2108#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2109#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:11,897 INFO L273 TraceCheckUtils]: 30: Hoare triple {2109#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2100#false} is VALID [2018-11-23 12:05:11,897 INFO L273 TraceCheckUtils]: 31: Hoare triple {2100#false} havoc ~x~0;~x~0 := 0; {2100#false} is VALID [2018-11-23 12:05:11,897 INFO L273 TraceCheckUtils]: 32: Hoare triple {2100#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2100#false} is VALID [2018-11-23 12:05:11,897 INFO L256 TraceCheckUtils]: 33: Hoare triple {2100#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2100#false} is VALID [2018-11-23 12:05:11,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-23 12:05:11,897 INFO L273 TraceCheckUtils]: 35: Hoare triple {2100#false} assume 0 == ~cond; {2100#false} is VALID [2018-11-23 12:05:11,897 INFO L273 TraceCheckUtils]: 36: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-23 12:05:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:11,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:11,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:05:11,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 12:05:11,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:11,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:05:11,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:11,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:05:11,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:05:11,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:05:11,985 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 12 states. [2018-11-23 12:05:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:12,459 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-11-23 12:05:12,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:05:12,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 12:05:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:05:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:05:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:05:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:05:12,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:05:12,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:12,540 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:05:12,540 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:05:12,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:05:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:05:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 12:05:12,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:12,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-23 12:05:12,559 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-23 12:05:12,560 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-23 12:05:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:12,561 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-23 12:05:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 12:05:12,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:12,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:12,562 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-23 12:05:12,562 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-23 12:05:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:12,563 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-23 12:05:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 12:05:12,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:12,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:12,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:12,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:05:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-23 12:05:12,565 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 37 [2018-11-23 12:05:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:12,566 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 12:05:12,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:05:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-11-23 12:05:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:05:12,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:12,567 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:12,567 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:12,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1356145181, now seen corresponding path program 9 times [2018-11-23 12:05:12,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:12,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:12,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:12,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:12,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:12,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2455#true} is VALID [2018-11-23 12:05:12,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {2455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2455#true} is VALID [2018-11-23 12:05:12,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2018-11-23 12:05:12,830 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #55#return; {2455#true} is VALID [2018-11-23 12:05:12,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret4 := main(); {2455#true} is VALID [2018-11-23 12:05:12,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {2455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2457#(= main_~i~0 0)} is VALID [2018-11-23 12:05:12,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {2457#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2457#(= main_~i~0 0)} is VALID [2018-11-23 12:05:12,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {2457#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2457#(= main_~i~0 0)} is VALID [2018-11-23 12:05:12,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {2457#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:12,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {2458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:12,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {2458#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:12,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {2458#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:12,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:12,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {2459#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:12,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {2459#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:12,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {2460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:12,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {2460#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:12,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {2460#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:12,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {2461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:12,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {2461#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:12,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {2461#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:12,840 INFO L273 TraceCheckUtils]: 21: Hoare triple {2462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:12,840 INFO L273 TraceCheckUtils]: 22: Hoare triple {2462#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:12,841 INFO L273 TraceCheckUtils]: 23: Hoare triple {2462#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:12,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {2463#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:12,842 INFO L273 TraceCheckUtils]: 25: Hoare triple {2463#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:12,843 INFO L273 TraceCheckUtils]: 26: Hoare triple {2463#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:12,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {2464#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:12,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {2464#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:12,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {2464#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:12,845 INFO L273 TraceCheckUtils]: 30: Hoare triple {2465#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:12,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {2465#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:12,847 INFO L273 TraceCheckUtils]: 32: Hoare triple {2465#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2466#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:12,848 INFO L273 TraceCheckUtils]: 33: Hoare triple {2466#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2456#false} is VALID [2018-11-23 12:05:12,848 INFO L273 TraceCheckUtils]: 34: Hoare triple {2456#false} havoc ~x~0;~x~0 := 0; {2456#false} is VALID [2018-11-23 12:05:12,848 INFO L273 TraceCheckUtils]: 35: Hoare triple {2456#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2456#false} is VALID [2018-11-23 12:05:12,848 INFO L256 TraceCheckUtils]: 36: Hoare triple {2456#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2456#false} is VALID [2018-11-23 12:05:12,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {2456#false} ~cond := #in~cond; {2456#false} is VALID [2018-11-23 12:05:12,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {2456#false} assume 0 == ~cond; {2456#false} is VALID [2018-11-23 12:05:12,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2018-11-23 12:05:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:12,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:12,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:12,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:12,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:05:12,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:12,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:13,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2455#true} is VALID [2018-11-23 12:05:13,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {2455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2455#true} is VALID [2018-11-23 12:05:13,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2018-11-23 12:05:13,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #55#return; {2455#true} is VALID [2018-11-23 12:05:13,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret4 := main(); {2455#true} is VALID [2018-11-23 12:05:13,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {2455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2485#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:13,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {2485#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2485#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:13,015 INFO L273 TraceCheckUtils]: 7: Hoare triple {2485#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2485#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:13,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {2485#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {2458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,017 INFO L273 TraceCheckUtils]: 10: Hoare triple {2458#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {2458#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,018 INFO L273 TraceCheckUtils]: 13: Hoare triple {2459#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {2459#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {2460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {2460#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {2460#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {2461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {2461#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,023 INFO L273 TraceCheckUtils]: 20: Hoare triple {2461#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {2462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {2462#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {2462#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {2463#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {2463#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {2463#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {2464#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,043 INFO L273 TraceCheckUtils]: 28: Hoare triple {2464#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,044 INFO L273 TraceCheckUtils]: 29: Hoare triple {2464#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,044 INFO L273 TraceCheckUtils]: 30: Hoare triple {2465#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,045 INFO L273 TraceCheckUtils]: 31: Hoare triple {2465#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {2465#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2466#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:13,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {2466#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2456#false} is VALID [2018-11-23 12:05:13,047 INFO L273 TraceCheckUtils]: 34: Hoare triple {2456#false} havoc ~x~0;~x~0 := 0; {2456#false} is VALID [2018-11-23 12:05:13,047 INFO L273 TraceCheckUtils]: 35: Hoare triple {2456#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2456#false} is VALID [2018-11-23 12:05:13,048 INFO L256 TraceCheckUtils]: 36: Hoare triple {2456#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2456#false} is VALID [2018-11-23 12:05:13,048 INFO L273 TraceCheckUtils]: 37: Hoare triple {2456#false} ~cond := #in~cond; {2456#false} is VALID [2018-11-23 12:05:13,048 INFO L273 TraceCheckUtils]: 38: Hoare triple {2456#false} assume 0 == ~cond; {2456#false} is VALID [2018-11-23 12:05:13,048 INFO L273 TraceCheckUtils]: 39: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2018-11-23 12:05:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:13,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:13,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:05:13,072 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 12:05:13,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:13,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:05:13,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:13,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:05:13,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:05:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:05:13,118 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 13 states. [2018-11-23 12:05:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,281 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-23 12:05:13,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:05:13,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 12:05:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:05:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2018-11-23 12:05:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:05:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2018-11-23 12:05:13,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 74 transitions. [2018-11-23 12:05:13,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:13,359 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:05:13,360 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:05:13,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:05:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:05:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-23 12:05:13,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:13,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2018-11-23 12:05:13,379 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2018-11-23 12:05:13,379 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2018-11-23 12:05:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,380 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 12:05:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-23 12:05:13,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:13,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:13,381 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2018-11-23 12:05:13,381 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2018-11-23 12:05:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,382 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 12:05:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-23 12:05:13,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:13,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:13,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:13,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:05:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-23 12:05:13,384 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 40 [2018-11-23 12:05:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:13,384 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 12:05:13,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:05:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:05:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:05:13,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:13,385 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:13,386 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:13,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:13,386 INFO L82 PathProgramCache]: Analyzing trace with hash 881632121, now seen corresponding path program 10 times [2018-11-23 12:05:13,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:13,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:13,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:13,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:13,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:13,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {2835#true} call ULTIMATE.init(); {2835#true} is VALID [2018-11-23 12:05:13,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {2835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2835#true} is VALID [2018-11-23 12:05:13,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {2835#true} assume true; {2835#true} is VALID [2018-11-23 12:05:13,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2835#true} {2835#true} #55#return; {2835#true} is VALID [2018-11-23 12:05:13,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {2835#true} call #t~ret4 := main(); {2835#true} is VALID [2018-11-23 12:05:13,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2837#(= main_~i~0 0)} is VALID [2018-11-23 12:05:13,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {2837#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2837#(= main_~i~0 0)} is VALID [2018-11-23 12:05:13,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {2837#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2837#(= main_~i~0 0)} is VALID [2018-11-23 12:05:13,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {2837#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {2838#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {2838#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {2838#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {2839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {2839#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {2839#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {2840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {2840#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {2840#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {2841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,751 INFO L273 TraceCheckUtils]: 19: Hoare triple {2841#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {2841#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {2842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {2842#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,754 INFO L273 TraceCheckUtils]: 23: Hoare triple {2842#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {2843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {2843#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {2843#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,756 INFO L273 TraceCheckUtils]: 27: Hoare triple {2844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {2844#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {2844#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {2845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,759 INFO L273 TraceCheckUtils]: 31: Hoare triple {2845#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {2845#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:13,760 INFO L273 TraceCheckUtils]: 33: Hoare triple {2846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:13,761 INFO L273 TraceCheckUtils]: 34: Hoare triple {2846#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:13,761 INFO L273 TraceCheckUtils]: 35: Hoare triple {2846#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {2847#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:13,762 INFO L273 TraceCheckUtils]: 36: Hoare triple {2847#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2836#false} is VALID [2018-11-23 12:05:13,762 INFO L273 TraceCheckUtils]: 37: Hoare triple {2836#false} havoc ~x~0;~x~0 := 0; {2836#false} is VALID [2018-11-23 12:05:13,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {2836#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2836#false} is VALID [2018-11-23 12:05:13,763 INFO L256 TraceCheckUtils]: 39: Hoare triple {2836#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2836#false} is VALID [2018-11-23 12:05:13,763 INFO L273 TraceCheckUtils]: 40: Hoare triple {2836#false} ~cond := #in~cond; {2836#false} is VALID [2018-11-23 12:05:13,763 INFO L273 TraceCheckUtils]: 41: Hoare triple {2836#false} assume 0 == ~cond; {2836#false} is VALID [2018-11-23 12:05:13,763 INFO L273 TraceCheckUtils]: 42: Hoare triple {2836#false} assume !false; {2836#false} is VALID [2018-11-23 12:05:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:13,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:13,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:13,775 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:13,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:13,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:13,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:13,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {2835#true} call ULTIMATE.init(); {2835#true} is VALID [2018-11-23 12:05:13,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {2835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2835#true} is VALID [2018-11-23 12:05:13,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {2835#true} assume true; {2835#true} is VALID [2018-11-23 12:05:14,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2835#true} {2835#true} #55#return; {2835#true} is VALID [2018-11-23 12:05:14,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {2835#true} call #t~ret4 := main(); {2835#true} is VALID [2018-11-23 12:05:14,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2866#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:14,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {2866#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2866#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:14,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {2866#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2866#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:14,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {2866#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {2838#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {2838#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {2838#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {2839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {2839#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {2839#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:14,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {2840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:14,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {2840#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:14,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {2840#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:14,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {2841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:14,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {2841#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:14,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {2841#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:14,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {2842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:14,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {2842#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:14,015 INFO L273 TraceCheckUtils]: 23: Hoare triple {2842#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:14,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {2843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:14,016 INFO L273 TraceCheckUtils]: 25: Hoare triple {2843#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:14,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {2843#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:14,017 INFO L273 TraceCheckUtils]: 27: Hoare triple {2844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:14,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {2844#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:14,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {2844#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:14,019 INFO L273 TraceCheckUtils]: 30: Hoare triple {2845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:14,019 INFO L273 TraceCheckUtils]: 31: Hoare triple {2845#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:14,020 INFO L273 TraceCheckUtils]: 32: Hoare triple {2845#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:14,021 INFO L273 TraceCheckUtils]: 33: Hoare triple {2846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:14,021 INFO L273 TraceCheckUtils]: 34: Hoare triple {2846#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:14,022 INFO L273 TraceCheckUtils]: 35: Hoare triple {2846#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {2847#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:14,023 INFO L273 TraceCheckUtils]: 36: Hoare triple {2847#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2836#false} is VALID [2018-11-23 12:05:14,023 INFO L273 TraceCheckUtils]: 37: Hoare triple {2836#false} havoc ~x~0;~x~0 := 0; {2836#false} is VALID [2018-11-23 12:05:14,023 INFO L273 TraceCheckUtils]: 38: Hoare triple {2836#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2836#false} is VALID [2018-11-23 12:05:14,023 INFO L256 TraceCheckUtils]: 39: Hoare triple {2836#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2836#false} is VALID [2018-11-23 12:05:14,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {2836#false} ~cond := #in~cond; {2836#false} is VALID [2018-11-23 12:05:14,024 INFO L273 TraceCheckUtils]: 41: Hoare triple {2836#false} assume 0 == ~cond; {2836#false} is VALID [2018-11-23 12:05:14,024 INFO L273 TraceCheckUtils]: 42: Hoare triple {2836#false} assume !false; {2836#false} is VALID [2018-11-23 12:05:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:14,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:14,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:05:14,048 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-23 12:05:14,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:14,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:05:14,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:14,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:05:14,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:05:14,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:05:14,096 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 14 states. [2018-11-23 12:05:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:14,355 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-11-23 12:05:14,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:05:14,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-23 12:05:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:05:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 12:05:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:05:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 12:05:14,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2018-11-23 12:05:14,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:14,483 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:05:14,483 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:05:14,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:05:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:05:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-23 12:05:14,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:14,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 51 states. [2018-11-23 12:05:14,507 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 51 states. [2018-11-23 12:05:14,507 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 51 states. [2018-11-23 12:05:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:14,509 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 12:05:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 12:05:14,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:14,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:14,509 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 53 states. [2018-11-23 12:05:14,509 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 53 states. [2018-11-23 12:05:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:14,510 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 12:05:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 12:05:14,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:14,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:14,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:14,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:05:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-23 12:05:14,512 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 43 [2018-11-23 12:05:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:14,512 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-23 12:05:14,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:05:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 12:05:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:05:14,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:14,513 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:14,513 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:14,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:14,514 INFO L82 PathProgramCache]: Analyzing trace with hash 22867491, now seen corresponding path program 11 times [2018-11-23 12:05:14,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:14,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:14,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:14,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:14,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {3239#true} call ULTIMATE.init(); {3239#true} is VALID [2018-11-23 12:05:14,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {3239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3239#true} is VALID [2018-11-23 12:05:14,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {3239#true} assume true; {3239#true} is VALID [2018-11-23 12:05:14,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3239#true} {3239#true} #55#return; {3239#true} is VALID [2018-11-23 12:05:14,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {3239#true} call #t~ret4 := main(); {3239#true} is VALID [2018-11-23 12:05:14,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {3239#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3241#(= main_~i~0 0)} is VALID [2018-11-23 12:05:14,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {3241#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3241#(= main_~i~0 0)} is VALID [2018-11-23 12:05:14,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {3241#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3241#(= main_~i~0 0)} is VALID [2018-11-23 12:05:14,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {3241#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,710 INFO L273 TraceCheckUtils]: 9: Hoare triple {3242#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {3242#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {3242#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {3243#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {3243#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {3243#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:14,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {3244#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:14,714 INFO L273 TraceCheckUtils]: 16: Hoare triple {3244#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:14,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {3244#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:14,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {3245#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:14,716 INFO L273 TraceCheckUtils]: 19: Hoare triple {3245#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:14,717 INFO L273 TraceCheckUtils]: 20: Hoare triple {3245#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:14,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {3246#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:14,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {3246#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:14,719 INFO L273 TraceCheckUtils]: 23: Hoare triple {3246#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:14,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {3247#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:14,720 INFO L273 TraceCheckUtils]: 25: Hoare triple {3247#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:14,721 INFO L273 TraceCheckUtils]: 26: Hoare triple {3247#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:14,721 INFO L273 TraceCheckUtils]: 27: Hoare triple {3248#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:14,722 INFO L273 TraceCheckUtils]: 28: Hoare triple {3248#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:14,722 INFO L273 TraceCheckUtils]: 29: Hoare triple {3248#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:14,723 INFO L273 TraceCheckUtils]: 30: Hoare triple {3249#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:14,724 INFO L273 TraceCheckUtils]: 31: Hoare triple {3249#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:14,724 INFO L273 TraceCheckUtils]: 32: Hoare triple {3249#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:14,725 INFO L273 TraceCheckUtils]: 33: Hoare triple {3250#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:14,725 INFO L273 TraceCheckUtils]: 34: Hoare triple {3250#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:14,726 INFO L273 TraceCheckUtils]: 35: Hoare triple {3250#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:14,727 INFO L273 TraceCheckUtils]: 36: Hoare triple {3251#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:14,727 INFO L273 TraceCheckUtils]: 37: Hoare triple {3251#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:14,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {3251#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3252#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:14,729 INFO L273 TraceCheckUtils]: 39: Hoare triple {3252#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3240#false} is VALID [2018-11-23 12:05:14,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {3240#false} havoc ~x~0;~x~0 := 0; {3240#false} is VALID [2018-11-23 12:05:14,729 INFO L273 TraceCheckUtils]: 41: Hoare triple {3240#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3240#false} is VALID [2018-11-23 12:05:14,730 INFO L256 TraceCheckUtils]: 42: Hoare triple {3240#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {3240#false} is VALID [2018-11-23 12:05:14,730 INFO L273 TraceCheckUtils]: 43: Hoare triple {3240#false} ~cond := #in~cond; {3240#false} is VALID [2018-11-23 12:05:14,730 INFO L273 TraceCheckUtils]: 44: Hoare triple {3240#false} assume 0 == ~cond; {3240#false} is VALID [2018-11-23 12:05:14,730 INFO L273 TraceCheckUtils]: 45: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2018-11-23 12:05:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:14,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:14,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:14,746 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:14,810 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:05:14,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:14,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:14,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {3239#true} call ULTIMATE.init(); {3239#true} is VALID [2018-11-23 12:05:14,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {3239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3239#true} is VALID [2018-11-23 12:05:14,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {3239#true} assume true; {3239#true} is VALID [2018-11-23 12:05:14,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3239#true} {3239#true} #55#return; {3239#true} is VALID [2018-11-23 12:05:14,970 INFO L256 TraceCheckUtils]: 4: Hoare triple {3239#true} call #t~ret4 := main(); {3239#true} is VALID [2018-11-23 12:05:14,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {3239#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3271#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:14,971 INFO L273 TraceCheckUtils]: 6: Hoare triple {3271#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3271#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:14,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {3271#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3271#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:14,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {3271#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {3242#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {3242#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {3242#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {3243#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {3243#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {3243#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:14,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {3244#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:14,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {3244#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:14,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {3244#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:14,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {3245#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:14,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {3245#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:14,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {3245#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:14,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {3246#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:14,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {3246#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:14,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {3246#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:14,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {3247#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:14,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {3247#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:14,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {3247#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:14,985 INFO L273 TraceCheckUtils]: 27: Hoare triple {3248#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:14,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {3248#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:14,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {3248#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:14,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {3249#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:14,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {3249#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:14,989 INFO L273 TraceCheckUtils]: 32: Hoare triple {3249#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:14,990 INFO L273 TraceCheckUtils]: 33: Hoare triple {3250#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:14,990 INFO L273 TraceCheckUtils]: 34: Hoare triple {3250#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:14,991 INFO L273 TraceCheckUtils]: 35: Hoare triple {3250#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:14,992 INFO L273 TraceCheckUtils]: 36: Hoare triple {3251#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:14,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {3251#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:14,993 INFO L273 TraceCheckUtils]: 38: Hoare triple {3251#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3252#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:14,994 INFO L273 TraceCheckUtils]: 39: Hoare triple {3252#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3240#false} is VALID [2018-11-23 12:05:14,995 INFO L273 TraceCheckUtils]: 40: Hoare triple {3240#false} havoc ~x~0;~x~0 := 0; {3240#false} is VALID [2018-11-23 12:05:14,995 INFO L273 TraceCheckUtils]: 41: Hoare triple {3240#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3240#false} is VALID [2018-11-23 12:05:14,995 INFO L256 TraceCheckUtils]: 42: Hoare triple {3240#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {3240#false} is VALID [2018-11-23 12:05:14,995 INFO L273 TraceCheckUtils]: 43: Hoare triple {3240#false} ~cond := #in~cond; {3240#false} is VALID [2018-11-23 12:05:14,996 INFO L273 TraceCheckUtils]: 44: Hoare triple {3240#false} assume 0 == ~cond; {3240#false} is VALID [2018-11-23 12:05:14,996 INFO L273 TraceCheckUtils]: 45: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2018-11-23 12:05:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:15,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:15,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:05:15,019 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-23 12:05:15,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:15,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:05:15,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:15,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:05:15,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:05:15,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:05:15,073 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 15 states. [2018-11-23 12:05:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:15,441 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 12:05:15,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:05:15,441 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-23 12:05:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:05:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2018-11-23 12:05:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:05:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2018-11-23 12:05:15,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 82 transitions. [2018-11-23 12:05:15,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:15,567 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:05:15,567 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:05:15,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:05:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:05:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-23 12:05:15,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:15,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 54 states. [2018-11-23 12:05:15,606 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 54 states. [2018-11-23 12:05:15,606 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 54 states. [2018-11-23 12:05:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:15,607 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-23 12:05:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 12:05:15,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:15,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:15,608 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 56 states. [2018-11-23 12:05:15,608 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 56 states. [2018-11-23 12:05:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:15,609 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-23 12:05:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 12:05:15,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:15,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:15,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:15,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:05:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2018-11-23 12:05:15,611 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 46 [2018-11-23 12:05:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:15,611 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-23 12:05:15,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:05:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2018-11-23 12:05:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:05:15,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:15,612 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:15,612 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:15,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:15,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1685957433, now seen corresponding path program 12 times [2018-11-23 12:05:15,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:15,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:15,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:15,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:15,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {3667#true} call ULTIMATE.init(); {3667#true} is VALID [2018-11-23 12:05:15,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {3667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3667#true} is VALID [2018-11-23 12:05:15,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {3667#true} assume true; {3667#true} is VALID [2018-11-23 12:05:15,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3667#true} {3667#true} #55#return; {3667#true} is VALID [2018-11-23 12:05:15,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {3667#true} call #t~ret4 := main(); {3667#true} is VALID [2018-11-23 12:05:15,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {3667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3669#(= main_~i~0 0)} is VALID [2018-11-23 12:05:15,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {3669#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3669#(= main_~i~0 0)} is VALID [2018-11-23 12:05:15,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {3669#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3669#(= main_~i~0 0)} is VALID [2018-11-23 12:05:15,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {3669#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {3670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {3670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {3670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {3671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {3671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {3671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:15,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {3672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:15,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {3672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:15,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {3672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:15,938 INFO L273 TraceCheckUtils]: 18: Hoare triple {3673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:15,938 INFO L273 TraceCheckUtils]: 19: Hoare triple {3673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:15,939 INFO L273 TraceCheckUtils]: 20: Hoare triple {3673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:15,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {3674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:15,941 INFO L273 TraceCheckUtils]: 22: Hoare triple {3674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:15,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {3674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:15,942 INFO L273 TraceCheckUtils]: 24: Hoare triple {3675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:15,943 INFO L273 TraceCheckUtils]: 25: Hoare triple {3675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:15,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {3675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:15,944 INFO L273 TraceCheckUtils]: 27: Hoare triple {3676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:15,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {3676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:15,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {3676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:15,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {3677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:15,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {3677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:15,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {3677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:15,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {3678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:15,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {3678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:15,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {3678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:15,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {3679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:15,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {3679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:15,953 INFO L273 TraceCheckUtils]: 38: Hoare triple {3679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:15,953 INFO L273 TraceCheckUtils]: 39: Hoare triple {3680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:15,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {3680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:15,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {3680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {3681#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:15,956 INFO L273 TraceCheckUtils]: 42: Hoare triple {3681#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3668#false} is VALID [2018-11-23 12:05:15,956 INFO L273 TraceCheckUtils]: 43: Hoare triple {3668#false} havoc ~x~0;~x~0 := 0; {3668#false} is VALID [2018-11-23 12:05:15,956 INFO L273 TraceCheckUtils]: 44: Hoare triple {3668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3668#false} is VALID [2018-11-23 12:05:15,956 INFO L256 TraceCheckUtils]: 45: Hoare triple {3668#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {3668#false} is VALID [2018-11-23 12:05:15,957 INFO L273 TraceCheckUtils]: 46: Hoare triple {3668#false} ~cond := #in~cond; {3668#false} is VALID [2018-11-23 12:05:15,957 INFO L273 TraceCheckUtils]: 47: Hoare triple {3668#false} assume 0 == ~cond; {3668#false} is VALID [2018-11-23 12:05:15,957 INFO L273 TraceCheckUtils]: 48: Hoare triple {3668#false} assume !false; {3668#false} is VALID [2018-11-23 12:05:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:15,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:15,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:15,972 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:16,007 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:05:16,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:16,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:16,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {3667#true} call ULTIMATE.init(); {3667#true} is VALID [2018-11-23 12:05:16,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {3667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3667#true} is VALID [2018-11-23 12:05:16,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {3667#true} assume true; {3667#true} is VALID [2018-11-23 12:05:16,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3667#true} {3667#true} #55#return; {3667#true} is VALID [2018-11-23 12:05:16,184 INFO L256 TraceCheckUtils]: 4: Hoare triple {3667#true} call #t~ret4 := main(); {3667#true} is VALID [2018-11-23 12:05:16,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {3667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3700#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:16,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {3700#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3700#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:16,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {3700#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3700#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:16,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {3700#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {3670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {3670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {3670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {3671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {3671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {3671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {3672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {3672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {3672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:16,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {3673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:16,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {3673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:16,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {3673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:16,218 INFO L273 TraceCheckUtils]: 21: Hoare triple {3674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:16,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {3674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:16,247 INFO L273 TraceCheckUtils]: 23: Hoare triple {3674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:16,263 INFO L273 TraceCheckUtils]: 24: Hoare triple {3675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:16,272 INFO L273 TraceCheckUtils]: 25: Hoare triple {3675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:16,290 INFO L273 TraceCheckUtils]: 26: Hoare triple {3675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:16,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {3676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:16,309 INFO L273 TraceCheckUtils]: 28: Hoare triple {3676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:16,310 INFO L273 TraceCheckUtils]: 29: Hoare triple {3676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:16,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {3677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:16,311 INFO L273 TraceCheckUtils]: 31: Hoare triple {3677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:16,313 INFO L273 TraceCheckUtils]: 32: Hoare triple {3677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:16,313 INFO L273 TraceCheckUtils]: 33: Hoare triple {3678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:16,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {3678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:16,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {3678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:16,316 INFO L273 TraceCheckUtils]: 36: Hoare triple {3679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:16,316 INFO L273 TraceCheckUtils]: 37: Hoare triple {3679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:16,317 INFO L273 TraceCheckUtils]: 38: Hoare triple {3679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:16,317 INFO L273 TraceCheckUtils]: 39: Hoare triple {3680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:16,317 INFO L273 TraceCheckUtils]: 40: Hoare triple {3680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:16,318 INFO L273 TraceCheckUtils]: 41: Hoare triple {3680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {3681#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:16,318 INFO L273 TraceCheckUtils]: 42: Hoare triple {3681#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3668#false} is VALID [2018-11-23 12:05:16,319 INFO L273 TraceCheckUtils]: 43: Hoare triple {3668#false} havoc ~x~0;~x~0 := 0; {3668#false} is VALID [2018-11-23 12:05:16,319 INFO L273 TraceCheckUtils]: 44: Hoare triple {3668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3668#false} is VALID [2018-11-23 12:05:16,319 INFO L256 TraceCheckUtils]: 45: Hoare triple {3668#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {3668#false} is VALID [2018-11-23 12:05:16,319 INFO L273 TraceCheckUtils]: 46: Hoare triple {3668#false} ~cond := #in~cond; {3668#false} is VALID [2018-11-23 12:05:16,319 INFO L273 TraceCheckUtils]: 47: Hoare triple {3668#false} assume 0 == ~cond; {3668#false} is VALID [2018-11-23 12:05:16,320 INFO L273 TraceCheckUtils]: 48: Hoare triple {3668#false} assume !false; {3668#false} is VALID [2018-11-23 12:05:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:16,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:16,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:05:16,347 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-23 12:05:16,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:16,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:05:16,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:16,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:05:16,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:05:16,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:16,417 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand 16 states. [2018-11-23 12:05:16,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:16,836 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-11-23 12:05:16,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:05:16,836 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-23 12:05:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2018-11-23 12:05:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2018-11-23 12:05:16,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 86 transitions. [2018-11-23 12:05:17,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:17,289 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:05:17,289 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:05:17,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:05:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 12:05:17,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:17,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 57 states. [2018-11-23 12:05:17,315 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 57 states. [2018-11-23 12:05:17,316 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 57 states. [2018-11-23 12:05:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:17,317 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-23 12:05:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-23 12:05:17,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:17,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:17,318 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 59 states. [2018-11-23 12:05:17,318 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 59 states. [2018-11-23 12:05:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:17,320 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-23 12:05:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-23 12:05:17,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:17,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:17,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:17,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:05:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-11-23 12:05:17,323 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 49 [2018-11-23 12:05:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:17,324 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-23 12:05:17,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:05:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2018-11-23 12:05:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:05:17,325 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:17,325 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:17,325 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:17,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:17,326 INFO L82 PathProgramCache]: Analyzing trace with hash 55692899, now seen corresponding path program 13 times [2018-11-23 12:05:17,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:17,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:17,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:17,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:17,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:17,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {4119#true} call ULTIMATE.init(); {4119#true} is VALID [2018-11-23 12:05:17,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {4119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4119#true} is VALID [2018-11-23 12:05:17,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {4119#true} assume true; {4119#true} is VALID [2018-11-23 12:05:17,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4119#true} {4119#true} #55#return; {4119#true} is VALID [2018-11-23 12:05:17,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {4119#true} call #t~ret4 := main(); {4119#true} is VALID [2018-11-23 12:05:17,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {4119#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4121#(= main_~i~0 0)} is VALID [2018-11-23 12:05:17,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {4121#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4121#(= main_~i~0 0)} is VALID [2018-11-23 12:05:17,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {4121#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4121#(= main_~i~0 0)} is VALID [2018-11-23 12:05:17,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {4121#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {4122#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {4122#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {4122#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {4123#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {4123#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {4123#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {4125#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {4126#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {4126#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,591 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,593 INFO L273 TraceCheckUtils]: 27: Hoare triple {4128#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {4128#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,595 INFO L273 TraceCheckUtils]: 30: Hoare triple {4129#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {4129#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {4129#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,596 INFO L273 TraceCheckUtils]: 33: Hoare triple {4130#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {4130#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {4130#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,598 INFO L273 TraceCheckUtils]: 36: Hoare triple {4131#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,599 INFO L273 TraceCheckUtils]: 37: Hoare triple {4131#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,599 INFO L273 TraceCheckUtils]: 38: Hoare triple {4131#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,600 INFO L273 TraceCheckUtils]: 39: Hoare triple {4132#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,601 INFO L273 TraceCheckUtils]: 40: Hoare triple {4132#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,601 INFO L273 TraceCheckUtils]: 41: Hoare triple {4132#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,602 INFO L273 TraceCheckUtils]: 42: Hoare triple {4133#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {4133#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,603 INFO L273 TraceCheckUtils]: 44: Hoare triple {4133#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4134#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:17,604 INFO L273 TraceCheckUtils]: 45: Hoare triple {4134#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4120#false} is VALID [2018-11-23 12:05:17,604 INFO L273 TraceCheckUtils]: 46: Hoare triple {4120#false} havoc ~x~0;~x~0 := 0; {4120#false} is VALID [2018-11-23 12:05:17,604 INFO L273 TraceCheckUtils]: 47: Hoare triple {4120#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4120#false} is VALID [2018-11-23 12:05:17,605 INFO L256 TraceCheckUtils]: 48: Hoare triple {4120#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {4120#false} is VALID [2018-11-23 12:05:17,605 INFO L273 TraceCheckUtils]: 49: Hoare triple {4120#false} ~cond := #in~cond; {4120#false} is VALID [2018-11-23 12:05:17,605 INFO L273 TraceCheckUtils]: 50: Hoare triple {4120#false} assume 0 == ~cond; {4120#false} is VALID [2018-11-23 12:05:17,605 INFO L273 TraceCheckUtils]: 51: Hoare triple {4120#false} assume !false; {4120#false} is VALID [2018-11-23 12:05:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:17,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:17,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:17,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:17,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:17,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {4119#true} call ULTIMATE.init(); {4119#true} is VALID [2018-11-23 12:05:17,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {4119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4119#true} is VALID [2018-11-23 12:05:17,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {4119#true} assume true; {4119#true} is VALID [2018-11-23 12:05:17,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4119#true} {4119#true} #55#return; {4119#true} is VALID [2018-11-23 12:05:17,860 INFO L256 TraceCheckUtils]: 4: Hoare triple {4119#true} call #t~ret4 := main(); {4119#true} is VALID [2018-11-23 12:05:17,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {4119#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4153#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:17,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {4153#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4153#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:17,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {4153#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4153#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:17,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {4153#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {4122#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {4122#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {4122#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {4123#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {4123#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {4123#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,867 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {4125#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,869 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {4126#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {4126#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {4128#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,874 INFO L273 TraceCheckUtils]: 29: Hoare triple {4128#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {4129#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {4129#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {4129#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,877 INFO L273 TraceCheckUtils]: 33: Hoare triple {4130#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {4130#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,878 INFO L273 TraceCheckUtils]: 35: Hoare triple {4130#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,878 INFO L273 TraceCheckUtils]: 36: Hoare triple {4131#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,879 INFO L273 TraceCheckUtils]: 37: Hoare triple {4131#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,880 INFO L273 TraceCheckUtils]: 38: Hoare triple {4131#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,880 INFO L273 TraceCheckUtils]: 39: Hoare triple {4132#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,881 INFO L273 TraceCheckUtils]: 40: Hoare triple {4132#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,881 INFO L273 TraceCheckUtils]: 41: Hoare triple {4132#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,882 INFO L273 TraceCheckUtils]: 42: Hoare triple {4133#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,883 INFO L273 TraceCheckUtils]: 43: Hoare triple {4133#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,883 INFO L273 TraceCheckUtils]: 44: Hoare triple {4133#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4134#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:17,884 INFO L273 TraceCheckUtils]: 45: Hoare triple {4134#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4120#false} is VALID [2018-11-23 12:05:17,884 INFO L273 TraceCheckUtils]: 46: Hoare triple {4120#false} havoc ~x~0;~x~0 := 0; {4120#false} is VALID [2018-11-23 12:05:17,884 INFO L273 TraceCheckUtils]: 47: Hoare triple {4120#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4120#false} is VALID [2018-11-23 12:05:17,885 INFO L256 TraceCheckUtils]: 48: Hoare triple {4120#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {4120#false} is VALID [2018-11-23 12:05:17,885 INFO L273 TraceCheckUtils]: 49: Hoare triple {4120#false} ~cond := #in~cond; {4120#false} is VALID [2018-11-23 12:05:17,885 INFO L273 TraceCheckUtils]: 50: Hoare triple {4120#false} assume 0 == ~cond; {4120#false} is VALID [2018-11-23 12:05:17,885 INFO L273 TraceCheckUtils]: 51: Hoare triple {4120#false} assume !false; {4120#false} is VALID [2018-11-23 12:05:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:17,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:17,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:05:17,909 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 12:05:17,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:17,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:05:17,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:17,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:05:17,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:05:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:17,964 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand 17 states. [2018-11-23 12:05:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:18,370 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2018-11-23 12:05:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:05:18,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 12:05:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 90 transitions. [2018-11-23 12:05:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 90 transitions. [2018-11-23 12:05:18,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 90 transitions. [2018-11-23 12:05:18,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:18,974 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:05:18,974 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:05:18,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:05:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-23 12:05:18,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:18,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-23 12:05:18,994 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-23 12:05:18,995 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-23 12:05:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:18,997 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 12:05:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 12:05:18,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:18,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:18,998 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-23 12:05:18,998 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-23 12:05:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:18,999 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 12:05:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 12:05:19,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:19,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:19,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:19,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:05:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2018-11-23 12:05:19,002 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 52 [2018-11-23 12:05:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:19,002 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2018-11-23 12:05:19,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:05:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 12:05:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:05:19,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:19,003 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:19,004 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:19,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash 335143673, now seen corresponding path program 14 times [2018-11-23 12:05:19,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:19,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:19,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:19,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:19,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:20,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4595#true} is VALID [2018-11-23 12:05:20,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {4595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4595#true} is VALID [2018-11-23 12:05:20,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2018-11-23 12:05:20,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #55#return; {4595#true} is VALID [2018-11-23 12:05:20,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret4 := main(); {4595#true} is VALID [2018-11-23 12:05:20,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {4595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4597#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {4597#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4597#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {4597#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4597#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {4597#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {4598#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {4598#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {4598#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {4599#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {4599#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {4599#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {4600#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {4600#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {4600#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {4601#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {4601#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {4601#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {4602#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {4602#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {4602#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {4603#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {4603#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {4603#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,645 INFO L273 TraceCheckUtils]: 27: Hoare triple {4604#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {4604#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {4604#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {4605#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,648 INFO L273 TraceCheckUtils]: 31: Hoare triple {4605#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,648 INFO L273 TraceCheckUtils]: 32: Hoare triple {4605#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {4606#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {4606#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,651 INFO L273 TraceCheckUtils]: 35: Hoare triple {4606#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,652 INFO L273 TraceCheckUtils]: 36: Hoare triple {4607#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,652 INFO L273 TraceCheckUtils]: 37: Hoare triple {4607#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,652 INFO L273 TraceCheckUtils]: 38: Hoare triple {4607#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,653 INFO L273 TraceCheckUtils]: 39: Hoare triple {4608#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,653 INFO L273 TraceCheckUtils]: 40: Hoare triple {4608#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,654 INFO L273 TraceCheckUtils]: 41: Hoare triple {4608#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,654 INFO L273 TraceCheckUtils]: 42: Hoare triple {4609#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,655 INFO L273 TraceCheckUtils]: 43: Hoare triple {4609#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {4609#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,656 INFO L273 TraceCheckUtils]: 45: Hoare triple {4610#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,657 INFO L273 TraceCheckUtils]: 46: Hoare triple {4610#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,657 INFO L273 TraceCheckUtils]: 47: Hoare triple {4610#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {4611#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:20,658 INFO L273 TraceCheckUtils]: 48: Hoare triple {4611#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4596#false} is VALID [2018-11-23 12:05:20,658 INFO L273 TraceCheckUtils]: 49: Hoare triple {4596#false} havoc ~x~0;~x~0 := 0; {4596#false} is VALID [2018-11-23 12:05:20,658 INFO L273 TraceCheckUtils]: 50: Hoare triple {4596#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4596#false} is VALID [2018-11-23 12:05:20,659 INFO L256 TraceCheckUtils]: 51: Hoare triple {4596#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {4596#false} is VALID [2018-11-23 12:05:20,659 INFO L273 TraceCheckUtils]: 52: Hoare triple {4596#false} ~cond := #in~cond; {4596#false} is VALID [2018-11-23 12:05:20,659 INFO L273 TraceCheckUtils]: 53: Hoare triple {4596#false} assume 0 == ~cond; {4596#false} is VALID [2018-11-23 12:05:20,659 INFO L273 TraceCheckUtils]: 54: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2018-11-23 12:05:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:20,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:20,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:20,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:20,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:20,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:20,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:20,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4595#true} is VALID [2018-11-23 12:05:20,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {4595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4595#true} is VALID [2018-11-23 12:05:20,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2018-11-23 12:05:20,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #55#return; {4595#true} is VALID [2018-11-23 12:05:20,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret4 := main(); {4595#true} is VALID [2018-11-23 12:05:20,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {4595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4630#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:20,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {4630#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4630#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:20,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {4630#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4630#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:20,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {4630#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {4598#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {4598#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {4598#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {4599#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {4599#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {4599#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {4600#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {4600#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {4600#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {4601#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {4601#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {4601#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {4602#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {4602#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,886 INFO L273 TraceCheckUtils]: 23: Hoare triple {4602#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {4603#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {4603#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {4603#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,889 INFO L273 TraceCheckUtils]: 27: Hoare triple {4604#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {4604#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,890 INFO L273 TraceCheckUtils]: 29: Hoare triple {4604#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,891 INFO L273 TraceCheckUtils]: 30: Hoare triple {4605#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {4605#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,892 INFO L273 TraceCheckUtils]: 32: Hoare triple {4605#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,893 INFO L273 TraceCheckUtils]: 33: Hoare triple {4606#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,893 INFO L273 TraceCheckUtils]: 34: Hoare triple {4606#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,894 INFO L273 TraceCheckUtils]: 35: Hoare triple {4606#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,894 INFO L273 TraceCheckUtils]: 36: Hoare triple {4607#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,895 INFO L273 TraceCheckUtils]: 37: Hoare triple {4607#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {4607#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,896 INFO L273 TraceCheckUtils]: 39: Hoare triple {4608#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {4608#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,898 INFO L273 TraceCheckUtils]: 41: Hoare triple {4608#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,898 INFO L273 TraceCheckUtils]: 42: Hoare triple {4609#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,899 INFO L273 TraceCheckUtils]: 43: Hoare triple {4609#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,899 INFO L273 TraceCheckUtils]: 44: Hoare triple {4609#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,900 INFO L273 TraceCheckUtils]: 45: Hoare triple {4610#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {4610#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,901 INFO L273 TraceCheckUtils]: 47: Hoare triple {4610#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {4611#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:20,902 INFO L273 TraceCheckUtils]: 48: Hoare triple {4611#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4596#false} is VALID [2018-11-23 12:05:20,902 INFO L273 TraceCheckUtils]: 49: Hoare triple {4596#false} havoc ~x~0;~x~0 := 0; {4596#false} is VALID [2018-11-23 12:05:20,902 INFO L273 TraceCheckUtils]: 50: Hoare triple {4596#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4596#false} is VALID [2018-11-23 12:05:20,903 INFO L256 TraceCheckUtils]: 51: Hoare triple {4596#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {4596#false} is VALID [2018-11-23 12:05:20,903 INFO L273 TraceCheckUtils]: 52: Hoare triple {4596#false} ~cond := #in~cond; {4596#false} is VALID [2018-11-23 12:05:20,903 INFO L273 TraceCheckUtils]: 53: Hoare triple {4596#false} assume 0 == ~cond; {4596#false} is VALID [2018-11-23 12:05:20,903 INFO L273 TraceCheckUtils]: 54: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2018-11-23 12:05:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:20,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:20,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:05:20,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 12:05:20,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:20,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:05:20,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:20,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:05:20,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:05:20,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:20,982 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand 18 states. [2018-11-23 12:05:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:21,208 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-23 12:05:21,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:05:21,209 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 12:05:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 12:05:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 12:05:21,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2018-11-23 12:05:21,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:21,857 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:05:21,857 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:05:21,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:05:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:05:21,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:21,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:05:21,941 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:05:21,941 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:05:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:21,943 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-11-23 12:05:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-11-23 12:05:21,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:21,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:21,943 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:05:21,944 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:05:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:21,945 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-11-23 12:05:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-11-23 12:05:21,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:21,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:21,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:21,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:05:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2018-11-23 12:05:21,948 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 55 [2018-11-23 12:05:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:21,948 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2018-11-23 12:05:21,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:05:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2018-11-23 12:05:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:05:21,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:21,949 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:21,950 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:21,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1806532259, now seen corresponding path program 15 times [2018-11-23 12:05:21,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:21,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:22,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {5095#true} call ULTIMATE.init(); {5095#true} is VALID [2018-11-23 12:05:22,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {5095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5095#true} is VALID [2018-11-23 12:05:22,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {5095#true} assume true; {5095#true} is VALID [2018-11-23 12:05:22,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5095#true} {5095#true} #55#return; {5095#true} is VALID [2018-11-23 12:05:22,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {5095#true} call #t~ret4 := main(); {5095#true} is VALID [2018-11-23 12:05:22,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {5095#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {5097#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {5097#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5097#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {5097#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5097#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {5097#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {5098#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {5098#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {5098#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {5099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {5099#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {5099#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,996 INFO L273 TraceCheckUtils]: 15: Hoare triple {5100#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {5100#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {5100#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {5101#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {5101#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:23,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {5101#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {5102#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {5102#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,001 INFO L273 TraceCheckUtils]: 23: Hoare triple {5102#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {5103#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,002 INFO L273 TraceCheckUtils]: 25: Hoare triple {5103#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {5103#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,004 INFO L273 TraceCheckUtils]: 27: Hoare triple {5104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {5104#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,005 INFO L273 TraceCheckUtils]: 29: Hoare triple {5104#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,006 INFO L273 TraceCheckUtils]: 30: Hoare triple {5105#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,006 INFO L273 TraceCheckUtils]: 31: Hoare triple {5105#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,007 INFO L273 TraceCheckUtils]: 32: Hoare triple {5105#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,007 INFO L273 TraceCheckUtils]: 33: Hoare triple {5106#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,008 INFO L273 TraceCheckUtils]: 34: Hoare triple {5106#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,009 INFO L273 TraceCheckUtils]: 35: Hoare triple {5106#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:23,009 INFO L273 TraceCheckUtils]: 36: Hoare triple {5107#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:23,010 INFO L273 TraceCheckUtils]: 37: Hoare triple {5107#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:23,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {5107#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:23,011 INFO L273 TraceCheckUtils]: 39: Hoare triple {5108#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:23,012 INFO L273 TraceCheckUtils]: 40: Hoare triple {5108#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:23,030 INFO L273 TraceCheckUtils]: 41: Hoare triple {5108#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:23,034 INFO L273 TraceCheckUtils]: 42: Hoare triple {5109#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:23,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {5109#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:23,035 INFO L273 TraceCheckUtils]: 44: Hoare triple {5109#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:23,035 INFO L273 TraceCheckUtils]: 45: Hoare triple {5110#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:23,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {5110#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:23,036 INFO L273 TraceCheckUtils]: 47: Hoare triple {5110#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:23,036 INFO L273 TraceCheckUtils]: 48: Hoare triple {5111#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:23,037 INFO L273 TraceCheckUtils]: 49: Hoare triple {5111#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:23,037 INFO L273 TraceCheckUtils]: 50: Hoare triple {5111#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5112#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:23,038 INFO L273 TraceCheckUtils]: 51: Hoare triple {5112#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5096#false} is VALID [2018-11-23 12:05:23,038 INFO L273 TraceCheckUtils]: 52: Hoare triple {5096#false} havoc ~x~0;~x~0 := 0; {5096#false} is VALID [2018-11-23 12:05:23,039 INFO L273 TraceCheckUtils]: 53: Hoare triple {5096#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5096#false} is VALID [2018-11-23 12:05:23,039 INFO L256 TraceCheckUtils]: 54: Hoare triple {5096#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {5096#false} is VALID [2018-11-23 12:05:23,039 INFO L273 TraceCheckUtils]: 55: Hoare triple {5096#false} ~cond := #in~cond; {5096#false} is VALID [2018-11-23 12:05:23,039 INFO L273 TraceCheckUtils]: 56: Hoare triple {5096#false} assume 0 == ~cond; {5096#false} is VALID [2018-11-23 12:05:23,039 INFO L273 TraceCheckUtils]: 57: Hoare triple {5096#false} assume !false; {5096#false} is VALID [2018-11-23 12:05:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:23,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:23,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:23,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:23,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 12:05:23,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:23,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:23,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {5095#true} call ULTIMATE.init(); {5095#true} is VALID [2018-11-23 12:05:23,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {5095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5095#true} is VALID [2018-11-23 12:05:23,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {5095#true} assume true; {5095#true} is VALID [2018-11-23 12:05:23,258 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5095#true} {5095#true} #55#return; {5095#true} is VALID [2018-11-23 12:05:23,258 INFO L256 TraceCheckUtils]: 4: Hoare triple {5095#true} call #t~ret4 := main(); {5095#true} is VALID [2018-11-23 12:05:23,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {5095#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {5131#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:23,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {5131#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5131#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:23,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {5131#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5131#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:23,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {5131#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {5098#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {5098#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {5098#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {5099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {5099#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {5099#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {5100#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {5100#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {5100#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:23,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {5101#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:23,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {5101#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:23,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {5101#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {5102#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {5102#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {5102#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {5103#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {5103#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {5103#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {5104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {5104#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,272 INFO L273 TraceCheckUtils]: 29: Hoare triple {5104#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {5105#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,273 INFO L273 TraceCheckUtils]: 31: Hoare triple {5105#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {5105#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {5106#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {5106#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,276 INFO L273 TraceCheckUtils]: 35: Hoare triple {5106#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:23,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {5107#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:23,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {5107#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:23,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {5107#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:23,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {5108#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:23,278 INFO L273 TraceCheckUtils]: 40: Hoare triple {5108#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:23,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {5108#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:23,280 INFO L273 TraceCheckUtils]: 42: Hoare triple {5109#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:23,280 INFO L273 TraceCheckUtils]: 43: Hoare triple {5109#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:23,281 INFO L273 TraceCheckUtils]: 44: Hoare triple {5109#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:23,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {5110#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:23,282 INFO L273 TraceCheckUtils]: 46: Hoare triple {5110#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:23,283 INFO L273 TraceCheckUtils]: 47: Hoare triple {5110#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:23,283 INFO L273 TraceCheckUtils]: 48: Hoare triple {5111#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:23,284 INFO L273 TraceCheckUtils]: 49: Hoare triple {5111#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:23,285 INFO L273 TraceCheckUtils]: 50: Hoare triple {5111#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5112#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:23,285 INFO L273 TraceCheckUtils]: 51: Hoare triple {5112#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5096#false} is VALID [2018-11-23 12:05:23,286 INFO L273 TraceCheckUtils]: 52: Hoare triple {5096#false} havoc ~x~0;~x~0 := 0; {5096#false} is VALID [2018-11-23 12:05:23,286 INFO L273 TraceCheckUtils]: 53: Hoare triple {5096#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5096#false} is VALID [2018-11-23 12:05:23,286 INFO L256 TraceCheckUtils]: 54: Hoare triple {5096#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {5096#false} is VALID [2018-11-23 12:05:23,286 INFO L273 TraceCheckUtils]: 55: Hoare triple {5096#false} ~cond := #in~cond; {5096#false} is VALID [2018-11-23 12:05:23,286 INFO L273 TraceCheckUtils]: 56: Hoare triple {5096#false} assume 0 == ~cond; {5096#false} is VALID [2018-11-23 12:05:23,287 INFO L273 TraceCheckUtils]: 57: Hoare triple {5096#false} assume !false; {5096#false} is VALID [2018-11-23 12:05:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:23,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:23,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:05:23,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-23 12:05:23,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:23,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:05:23,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:23,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:05:23,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:05:23,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:05:23,371 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand 19 states. [2018-11-23 12:05:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,738 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2018-11-23 12:05:23,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:05:23,739 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-23 12:05:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2018-11-23 12:05:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2018-11-23 12:05:23,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 98 transitions. [2018-11-23 12:05:24,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:24,404 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:05:24,404 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 12:05:24,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:05:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 12:05:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-23 12:05:24,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:24,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2018-11-23 12:05:24,428 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2018-11-23 12:05:24,428 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2018-11-23 12:05:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:24,429 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-11-23 12:05:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 12:05:24,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:24,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:24,430 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2018-11-23 12:05:24,430 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2018-11-23 12:05:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:24,432 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-11-23 12:05:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 12:05:24,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:24,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:24,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:24,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:05:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-11-23 12:05:24,434 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 58 [2018-11-23 12:05:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:24,435 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2018-11-23 12:05:24,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:05:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2018-11-23 12:05:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:05:24,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:24,436 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:24,436 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:24,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1507674809, now seen corresponding path program 16 times [2018-11-23 12:05:24,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:24,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:24,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:24,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:24,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:25,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {5619#true} call ULTIMATE.init(); {5619#true} is VALID [2018-11-23 12:05:25,221 INFO L273 TraceCheckUtils]: 1: Hoare triple {5619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5619#true} is VALID [2018-11-23 12:05:25,221 INFO L273 TraceCheckUtils]: 2: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 12:05:25,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5619#true} {5619#true} #55#return; {5619#true} is VALID [2018-11-23 12:05:25,222 INFO L256 TraceCheckUtils]: 4: Hoare triple {5619#true} call #t~ret4 := main(); {5619#true} is VALID [2018-11-23 12:05:25,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {5619#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {5621#(= main_~i~0 0)} is VALID [2018-11-23 12:05:25,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {5621#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5621#(= main_~i~0 0)} is VALID [2018-11-23 12:05:25,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {5621#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5621#(= main_~i~0 0)} is VALID [2018-11-23 12:05:25,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {5621#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {5622#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {5622#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {5622#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {5623#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {5623#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {5623#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {5624#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {5624#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {5624#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {5625#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {5625#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,230 INFO L273 TraceCheckUtils]: 20: Hoare triple {5625#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {5626#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {5626#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {5626#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {5627#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,233 INFO L273 TraceCheckUtils]: 25: Hoare triple {5627#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,234 INFO L273 TraceCheckUtils]: 26: Hoare triple {5627#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,235 INFO L273 TraceCheckUtils]: 27: Hoare triple {5628#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,235 INFO L273 TraceCheckUtils]: 28: Hoare triple {5628#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,236 INFO L273 TraceCheckUtils]: 29: Hoare triple {5628#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,237 INFO L273 TraceCheckUtils]: 30: Hoare triple {5629#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,237 INFO L273 TraceCheckUtils]: 31: Hoare triple {5629#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,238 INFO L273 TraceCheckUtils]: 32: Hoare triple {5629#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,238 INFO L273 TraceCheckUtils]: 33: Hoare triple {5630#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,239 INFO L273 TraceCheckUtils]: 34: Hoare triple {5630#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,240 INFO L273 TraceCheckUtils]: 35: Hoare triple {5630#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,240 INFO L273 TraceCheckUtils]: 36: Hoare triple {5631#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {5631#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {5631#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {5632#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {5632#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,243 INFO L273 TraceCheckUtils]: 41: Hoare triple {5632#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:25,244 INFO L273 TraceCheckUtils]: 42: Hoare triple {5633#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:25,244 INFO L273 TraceCheckUtils]: 43: Hoare triple {5633#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:25,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {5633#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:25,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {5634#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:25,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {5634#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:25,247 INFO L273 TraceCheckUtils]: 47: Hoare triple {5634#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:25,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {5635#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:25,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {5635#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:25,249 INFO L273 TraceCheckUtils]: 50: Hoare triple {5635#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:25,249 INFO L273 TraceCheckUtils]: 51: Hoare triple {5636#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:25,250 INFO L273 TraceCheckUtils]: 52: Hoare triple {5636#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:25,251 INFO L273 TraceCheckUtils]: 53: Hoare triple {5636#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {5637#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:25,251 INFO L273 TraceCheckUtils]: 54: Hoare triple {5637#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5620#false} is VALID [2018-11-23 12:05:25,252 INFO L273 TraceCheckUtils]: 55: Hoare triple {5620#false} havoc ~x~0;~x~0 := 0; {5620#false} is VALID [2018-11-23 12:05:25,252 INFO L273 TraceCheckUtils]: 56: Hoare triple {5620#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5620#false} is VALID [2018-11-23 12:05:25,252 INFO L256 TraceCheckUtils]: 57: Hoare triple {5620#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {5620#false} is VALID [2018-11-23 12:05:25,252 INFO L273 TraceCheckUtils]: 58: Hoare triple {5620#false} ~cond := #in~cond; {5620#false} is VALID [2018-11-23 12:05:25,252 INFO L273 TraceCheckUtils]: 59: Hoare triple {5620#false} assume 0 == ~cond; {5620#false} is VALID [2018-11-23 12:05:25,253 INFO L273 TraceCheckUtils]: 60: Hoare triple {5620#false} assume !false; {5620#false} is VALID [2018-11-23 12:05:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:25,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:25,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:25,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:25,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:25,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:25,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:25,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {5619#true} call ULTIMATE.init(); {5619#true} is VALID [2018-11-23 12:05:25,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {5619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5619#true} is VALID [2018-11-23 12:05:25,526 INFO L273 TraceCheckUtils]: 2: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 12:05:25,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5619#true} {5619#true} #55#return; {5619#true} is VALID [2018-11-23 12:05:25,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {5619#true} call #t~ret4 := main(); {5619#true} is VALID [2018-11-23 12:05:25,527 INFO L273 TraceCheckUtils]: 5: Hoare triple {5619#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {5656#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:25,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {5656#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5656#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:25,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {5656#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5656#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:25,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {5656#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,529 INFO L273 TraceCheckUtils]: 9: Hoare triple {5622#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {5622#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {5622#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {5623#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {5623#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {5623#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {5624#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {5624#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {5624#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {5625#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {5625#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {5625#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,536 INFO L273 TraceCheckUtils]: 21: Hoare triple {5626#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,537 INFO L273 TraceCheckUtils]: 22: Hoare triple {5626#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,538 INFO L273 TraceCheckUtils]: 23: Hoare triple {5626#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,538 INFO L273 TraceCheckUtils]: 24: Hoare triple {5627#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {5627#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,540 INFO L273 TraceCheckUtils]: 26: Hoare triple {5627#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,540 INFO L273 TraceCheckUtils]: 27: Hoare triple {5628#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {5628#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,541 INFO L273 TraceCheckUtils]: 29: Hoare triple {5628#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {5629#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,543 INFO L273 TraceCheckUtils]: 31: Hoare triple {5629#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,543 INFO L273 TraceCheckUtils]: 32: Hoare triple {5629#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {5630#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,544 INFO L273 TraceCheckUtils]: 34: Hoare triple {5630#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,545 INFO L273 TraceCheckUtils]: 35: Hoare triple {5630#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,546 INFO L273 TraceCheckUtils]: 36: Hoare triple {5631#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,546 INFO L273 TraceCheckUtils]: 37: Hoare triple {5631#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,547 INFO L273 TraceCheckUtils]: 38: Hoare triple {5631#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,547 INFO L273 TraceCheckUtils]: 39: Hoare triple {5632#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,548 INFO L273 TraceCheckUtils]: 40: Hoare triple {5632#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,549 INFO L273 TraceCheckUtils]: 41: Hoare triple {5632#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:25,549 INFO L273 TraceCheckUtils]: 42: Hoare triple {5633#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:25,550 INFO L273 TraceCheckUtils]: 43: Hoare triple {5633#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:25,551 INFO L273 TraceCheckUtils]: 44: Hoare triple {5633#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:25,551 INFO L273 TraceCheckUtils]: 45: Hoare triple {5634#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:25,552 INFO L273 TraceCheckUtils]: 46: Hoare triple {5634#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:25,552 INFO L273 TraceCheckUtils]: 47: Hoare triple {5634#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:25,553 INFO L273 TraceCheckUtils]: 48: Hoare triple {5635#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:25,553 INFO L273 TraceCheckUtils]: 49: Hoare triple {5635#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:25,554 INFO L273 TraceCheckUtils]: 50: Hoare triple {5635#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:25,555 INFO L273 TraceCheckUtils]: 51: Hoare triple {5636#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:25,555 INFO L273 TraceCheckUtils]: 52: Hoare triple {5636#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:25,556 INFO L273 TraceCheckUtils]: 53: Hoare triple {5636#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {5637#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:25,557 INFO L273 TraceCheckUtils]: 54: Hoare triple {5637#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5620#false} is VALID [2018-11-23 12:05:25,557 INFO L273 TraceCheckUtils]: 55: Hoare triple {5620#false} havoc ~x~0;~x~0 := 0; {5620#false} is VALID [2018-11-23 12:05:25,557 INFO L273 TraceCheckUtils]: 56: Hoare triple {5620#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5620#false} is VALID [2018-11-23 12:05:25,557 INFO L256 TraceCheckUtils]: 57: Hoare triple {5620#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {5620#false} is VALID [2018-11-23 12:05:25,558 INFO L273 TraceCheckUtils]: 58: Hoare triple {5620#false} ~cond := #in~cond; {5620#false} is VALID [2018-11-23 12:05:25,558 INFO L273 TraceCheckUtils]: 59: Hoare triple {5620#false} assume 0 == ~cond; {5620#false} is VALID [2018-11-23 12:05:25,558 INFO L273 TraceCheckUtils]: 60: Hoare triple {5620#false} assume !false; {5620#false} is VALID [2018-11-23 12:05:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:25,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:25,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:05:25,582 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-23 12:05:25,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:25,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:05:25,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:25,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:05:25,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:05:25,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:05:25,651 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 20 states. [2018-11-23 12:05:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,954 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-23 12:05:25,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:05:25,954 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-23 12:05:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2018-11-23 12:05:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2018-11-23 12:05:25,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 102 transitions. [2018-11-23 12:05:26,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:26,426 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:05:26,426 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 12:05:26,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:05:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 12:05:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-11-23 12:05:26,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:26,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 69 states. [2018-11-23 12:05:26,445 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 69 states. [2018-11-23 12:05:26,445 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 69 states. [2018-11-23 12:05:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:26,447 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-23 12:05:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 12:05:26,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:26,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:26,447 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 71 states. [2018-11-23 12:05:26,448 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 71 states. [2018-11-23 12:05:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:26,449 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-23 12:05:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 12:05:26,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:26,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:26,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:26,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:05:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2018-11-23 12:05:26,452 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 61 [2018-11-23 12:05:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:26,452 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2018-11-23 12:05:26,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:05:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2018-11-23 12:05:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:05:26,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:26,453 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:26,454 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:26,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1712586467, now seen corresponding path program 17 times [2018-11-23 12:05:26,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:26,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:26,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:26,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:26,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6167#true} is VALID [2018-11-23 12:05:27,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {6167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6167#true} is VALID [2018-11-23 12:05:27,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2018-11-23 12:05:27,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #55#return; {6167#true} is VALID [2018-11-23 12:05:27,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret4 := main(); {6167#true} is VALID [2018-11-23 12:05:27,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {6167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6169#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {6169#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6169#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {6169#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6169#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {6169#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {6170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {6170#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {6170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {6171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {6171#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {6171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {6172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {6172#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {6172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {6173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {6173#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,548 INFO L273 TraceCheckUtils]: 20: Hoare triple {6173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,548 INFO L273 TraceCheckUtils]: 21: Hoare triple {6174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,549 INFO L273 TraceCheckUtils]: 22: Hoare triple {6174#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,550 INFO L273 TraceCheckUtils]: 23: Hoare triple {6174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,550 INFO L273 TraceCheckUtils]: 24: Hoare triple {6175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,551 INFO L273 TraceCheckUtils]: 25: Hoare triple {6175#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {6175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,552 INFO L273 TraceCheckUtils]: 27: Hoare triple {6176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {6176#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {6176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {6177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,555 INFO L273 TraceCheckUtils]: 31: Hoare triple {6177#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {6177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {6178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {6178#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,558 INFO L273 TraceCheckUtils]: 35: Hoare triple {6178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,559 INFO L273 TraceCheckUtils]: 36: Hoare triple {6179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,559 INFO L273 TraceCheckUtils]: 37: Hoare triple {6179#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,560 INFO L273 TraceCheckUtils]: 38: Hoare triple {6179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,561 INFO L273 TraceCheckUtils]: 39: Hoare triple {6180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,561 INFO L273 TraceCheckUtils]: 40: Hoare triple {6180#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,562 INFO L273 TraceCheckUtils]: 41: Hoare triple {6180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,563 INFO L273 TraceCheckUtils]: 42: Hoare triple {6181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,564 INFO L273 TraceCheckUtils]: 43: Hoare triple {6181#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,564 INFO L273 TraceCheckUtils]: 44: Hoare triple {6181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {6182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,566 INFO L273 TraceCheckUtils]: 46: Hoare triple {6182#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,567 INFO L273 TraceCheckUtils]: 47: Hoare triple {6182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,567 INFO L273 TraceCheckUtils]: 48: Hoare triple {6183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,568 INFO L273 TraceCheckUtils]: 49: Hoare triple {6183#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,569 INFO L273 TraceCheckUtils]: 50: Hoare triple {6183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:27,569 INFO L273 TraceCheckUtils]: 51: Hoare triple {6184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:27,570 INFO L273 TraceCheckUtils]: 52: Hoare triple {6184#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:27,571 INFO L273 TraceCheckUtils]: 53: Hoare triple {6184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:27,572 INFO L273 TraceCheckUtils]: 54: Hoare triple {6185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:27,572 INFO L273 TraceCheckUtils]: 55: Hoare triple {6185#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:27,573 INFO L273 TraceCheckUtils]: 56: Hoare triple {6185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6186#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:27,574 INFO L273 TraceCheckUtils]: 57: Hoare triple {6186#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6168#false} is VALID [2018-11-23 12:05:27,574 INFO L273 TraceCheckUtils]: 58: Hoare triple {6168#false} havoc ~x~0;~x~0 := 0; {6168#false} is VALID [2018-11-23 12:05:27,574 INFO L273 TraceCheckUtils]: 59: Hoare triple {6168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6168#false} is VALID [2018-11-23 12:05:27,575 INFO L256 TraceCheckUtils]: 60: Hoare triple {6168#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {6168#false} is VALID [2018-11-23 12:05:27,575 INFO L273 TraceCheckUtils]: 61: Hoare triple {6168#false} ~cond := #in~cond; {6168#false} is VALID [2018-11-23 12:05:27,575 INFO L273 TraceCheckUtils]: 62: Hoare triple {6168#false} assume 0 == ~cond; {6168#false} is VALID [2018-11-23 12:05:27,575 INFO L273 TraceCheckUtils]: 63: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2018-11-23 12:05:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:27,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:27,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:27,591 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:27,630 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:05:27,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:28,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6167#true} is VALID [2018-11-23 12:05:28,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {6167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6167#true} is VALID [2018-11-23 12:05:28,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2018-11-23 12:05:28,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #55#return; {6167#true} is VALID [2018-11-23 12:05:28,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret4 := main(); {6167#true} is VALID [2018-11-23 12:05:28,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {6167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6205#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:28,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {6205#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6205#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:28,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {6205#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6205#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:28,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {6205#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:28,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {6170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:28,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {6170#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:28,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {6170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:28,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {6171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:28,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {6171#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:28,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {6171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:28,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {6172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:28,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {6172#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:28,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {6172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:28,030 INFO L273 TraceCheckUtils]: 18: Hoare triple {6173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:28,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {6173#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:28,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {6173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:28,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {6174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:28,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {6174#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:28,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {6174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:28,052 INFO L273 TraceCheckUtils]: 24: Hoare triple {6175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:28,052 INFO L273 TraceCheckUtils]: 25: Hoare triple {6175#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:28,053 INFO L273 TraceCheckUtils]: 26: Hoare triple {6175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:28,053 INFO L273 TraceCheckUtils]: 27: Hoare triple {6176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:28,054 INFO L273 TraceCheckUtils]: 28: Hoare triple {6176#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:28,055 INFO L273 TraceCheckUtils]: 29: Hoare triple {6176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:28,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {6177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:28,056 INFO L273 TraceCheckUtils]: 31: Hoare triple {6177#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:28,057 INFO L273 TraceCheckUtils]: 32: Hoare triple {6177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:28,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {6178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:28,058 INFO L273 TraceCheckUtils]: 34: Hoare triple {6178#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:28,059 INFO L273 TraceCheckUtils]: 35: Hoare triple {6178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:28,059 INFO L273 TraceCheckUtils]: 36: Hoare triple {6179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:28,060 INFO L273 TraceCheckUtils]: 37: Hoare triple {6179#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:28,061 INFO L273 TraceCheckUtils]: 38: Hoare triple {6179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:28,061 INFO L273 TraceCheckUtils]: 39: Hoare triple {6180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:28,062 INFO L273 TraceCheckUtils]: 40: Hoare triple {6180#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:28,063 INFO L273 TraceCheckUtils]: 41: Hoare triple {6180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:28,063 INFO L273 TraceCheckUtils]: 42: Hoare triple {6181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:28,064 INFO L273 TraceCheckUtils]: 43: Hoare triple {6181#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:28,065 INFO L273 TraceCheckUtils]: 44: Hoare triple {6181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:28,065 INFO L273 TraceCheckUtils]: 45: Hoare triple {6182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:28,066 INFO L273 TraceCheckUtils]: 46: Hoare triple {6182#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:28,067 INFO L273 TraceCheckUtils]: 47: Hoare triple {6182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:28,067 INFO L273 TraceCheckUtils]: 48: Hoare triple {6183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:28,068 INFO L273 TraceCheckUtils]: 49: Hoare triple {6183#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:28,069 INFO L273 TraceCheckUtils]: 50: Hoare triple {6183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:28,069 INFO L273 TraceCheckUtils]: 51: Hoare triple {6184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:28,070 INFO L273 TraceCheckUtils]: 52: Hoare triple {6184#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:28,071 INFO L273 TraceCheckUtils]: 53: Hoare triple {6184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:28,071 INFO L273 TraceCheckUtils]: 54: Hoare triple {6185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:28,072 INFO L273 TraceCheckUtils]: 55: Hoare triple {6185#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:28,073 INFO L273 TraceCheckUtils]: 56: Hoare triple {6185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6186#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:28,073 INFO L273 TraceCheckUtils]: 57: Hoare triple {6186#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6168#false} is VALID [2018-11-23 12:05:28,074 INFO L273 TraceCheckUtils]: 58: Hoare triple {6168#false} havoc ~x~0;~x~0 := 0; {6168#false} is VALID [2018-11-23 12:05:28,074 INFO L273 TraceCheckUtils]: 59: Hoare triple {6168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6168#false} is VALID [2018-11-23 12:05:28,074 INFO L256 TraceCheckUtils]: 60: Hoare triple {6168#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {6168#false} is VALID [2018-11-23 12:05:28,074 INFO L273 TraceCheckUtils]: 61: Hoare triple {6168#false} ~cond := #in~cond; {6168#false} is VALID [2018-11-23 12:05:28,075 INFO L273 TraceCheckUtils]: 62: Hoare triple {6168#false} assume 0 == ~cond; {6168#false} is VALID [2018-11-23 12:05:28,075 INFO L273 TraceCheckUtils]: 63: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2018-11-23 12:05:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:28,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:28,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:05:28,100 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-23 12:05:28,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:28,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:05:28,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:28,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:05:28,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:05:28,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:05:28,174 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand 21 states. [2018-11-23 12:05:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,547 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2018-11-23 12:05:28,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:05:28,547 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-23 12:05:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 106 transitions. [2018-11-23 12:05:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 106 transitions. [2018-11-23 12:05:28,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 106 transitions. [2018-11-23 12:05:28,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:28,710 INFO L225 Difference]: With dead ends: 85 [2018-11-23 12:05:28,710 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:05:28,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:05:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:05:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-23 12:05:28,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:28,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-23 12:05:28,765 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-23 12:05:28,765 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-23 12:05:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,766 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 12:05:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 12:05:28,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:28,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:28,767 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-23 12:05:28,767 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-23 12:05:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,769 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 12:05:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 12:05:28,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:28,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:28,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:28,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:05:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2018-11-23 12:05:28,771 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 64 [2018-11-23 12:05:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:28,771 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-11-23 12:05:28,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:05:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-11-23 12:05:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:05:28,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:28,772 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:28,772 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:28,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:28,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1207704967, now seen corresponding path program 18 times [2018-11-23 12:05:28,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:28,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:28,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:28,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:28,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:29,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {6739#true} call ULTIMATE.init(); {6739#true} is VALID [2018-11-23 12:05:29,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {6739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6739#true} is VALID [2018-11-23 12:05:29,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {6739#true} assume true; {6739#true} is VALID [2018-11-23 12:05:29,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6739#true} {6739#true} #55#return; {6739#true} is VALID [2018-11-23 12:05:29,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {6739#true} call #t~ret4 := main(); {6739#true} is VALID [2018-11-23 12:05:29,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {6739#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6741#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {6741#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6741#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {6741#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6741#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {6741#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {6742#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {6742#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {6742#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {6743#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {6743#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {6743#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {6744#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {6744#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {6744#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {6745#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {6745#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {6745#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {6746#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,117 INFO L273 TraceCheckUtils]: 22: Hoare triple {6746#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {6746#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,118 INFO L273 TraceCheckUtils]: 24: Hoare triple {6747#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,119 INFO L273 TraceCheckUtils]: 25: Hoare triple {6747#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {6747#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,120 INFO L273 TraceCheckUtils]: 27: Hoare triple {6748#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,120 INFO L273 TraceCheckUtils]: 28: Hoare triple {6748#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,121 INFO L273 TraceCheckUtils]: 29: Hoare triple {6748#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,122 INFO L273 TraceCheckUtils]: 30: Hoare triple {6749#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,122 INFO L273 TraceCheckUtils]: 31: Hoare triple {6749#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,123 INFO L273 TraceCheckUtils]: 32: Hoare triple {6749#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,124 INFO L273 TraceCheckUtils]: 33: Hoare triple {6750#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,124 INFO L273 TraceCheckUtils]: 34: Hoare triple {6750#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {6750#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,125 INFO L273 TraceCheckUtils]: 36: Hoare triple {6751#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,126 INFO L273 TraceCheckUtils]: 37: Hoare triple {6751#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,127 INFO L273 TraceCheckUtils]: 38: Hoare triple {6751#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,127 INFO L273 TraceCheckUtils]: 39: Hoare triple {6752#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,128 INFO L273 TraceCheckUtils]: 40: Hoare triple {6752#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,128 INFO L273 TraceCheckUtils]: 41: Hoare triple {6752#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,129 INFO L273 TraceCheckUtils]: 42: Hoare triple {6753#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,130 INFO L273 TraceCheckUtils]: 43: Hoare triple {6753#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,130 INFO L273 TraceCheckUtils]: 44: Hoare triple {6753#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,131 INFO L273 TraceCheckUtils]: 45: Hoare triple {6754#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,131 INFO L273 TraceCheckUtils]: 46: Hoare triple {6754#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,132 INFO L273 TraceCheckUtils]: 47: Hoare triple {6754#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,133 INFO L273 TraceCheckUtils]: 48: Hoare triple {6755#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,133 INFO L273 TraceCheckUtils]: 49: Hoare triple {6755#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,134 INFO L273 TraceCheckUtils]: 50: Hoare triple {6755#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:29,134 INFO L273 TraceCheckUtils]: 51: Hoare triple {6756#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:29,135 INFO L273 TraceCheckUtils]: 52: Hoare triple {6756#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:29,136 INFO L273 TraceCheckUtils]: 53: Hoare triple {6756#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:29,136 INFO L273 TraceCheckUtils]: 54: Hoare triple {6757#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:29,137 INFO L273 TraceCheckUtils]: 55: Hoare triple {6757#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:29,137 INFO L273 TraceCheckUtils]: 56: Hoare triple {6757#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:29,138 INFO L273 TraceCheckUtils]: 57: Hoare triple {6758#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:29,139 INFO L273 TraceCheckUtils]: 58: Hoare triple {6758#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:29,139 INFO L273 TraceCheckUtils]: 59: Hoare triple {6758#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {6759#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:29,140 INFO L273 TraceCheckUtils]: 60: Hoare triple {6759#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6740#false} is VALID [2018-11-23 12:05:29,140 INFO L273 TraceCheckUtils]: 61: Hoare triple {6740#false} havoc ~x~0;~x~0 := 0; {6740#false} is VALID [2018-11-23 12:05:29,140 INFO L273 TraceCheckUtils]: 62: Hoare triple {6740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6740#false} is VALID [2018-11-23 12:05:29,141 INFO L256 TraceCheckUtils]: 63: Hoare triple {6740#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {6740#false} is VALID [2018-11-23 12:05:29,141 INFO L273 TraceCheckUtils]: 64: Hoare triple {6740#false} ~cond := #in~cond; {6740#false} is VALID [2018-11-23 12:05:29,141 INFO L273 TraceCheckUtils]: 65: Hoare triple {6740#false} assume 0 == ~cond; {6740#false} is VALID [2018-11-23 12:05:29,141 INFO L273 TraceCheckUtils]: 66: Hoare triple {6740#false} assume !false; {6740#false} is VALID [2018-11-23 12:05:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:29,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:29,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:29,155 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:29,227 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:05:29,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:29,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:29,452 INFO L256 TraceCheckUtils]: 0: Hoare triple {6739#true} call ULTIMATE.init(); {6739#true} is VALID [2018-11-23 12:05:29,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {6739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6739#true} is VALID [2018-11-23 12:05:29,453 INFO L273 TraceCheckUtils]: 2: Hoare triple {6739#true} assume true; {6739#true} is VALID [2018-11-23 12:05:29,453 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6739#true} {6739#true} #55#return; {6739#true} is VALID [2018-11-23 12:05:29,453 INFO L256 TraceCheckUtils]: 4: Hoare triple {6739#true} call #t~ret4 := main(); {6739#true} is VALID [2018-11-23 12:05:29,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {6739#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6778#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:29,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {6778#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6778#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:29,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {6778#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6778#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:29,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {6778#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {6742#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {6742#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {6742#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {6743#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {6743#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {6743#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {6744#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {6744#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {6744#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {6745#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {6745#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {6745#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {6746#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {6746#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {6746#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {6747#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {6747#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {6747#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {6748#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {6748#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,467 INFO L273 TraceCheckUtils]: 29: Hoare triple {6748#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {6749#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {6749#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,469 INFO L273 TraceCheckUtils]: 32: Hoare triple {6749#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {6750#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,470 INFO L273 TraceCheckUtils]: 34: Hoare triple {6750#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {6750#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,472 INFO L273 TraceCheckUtils]: 36: Hoare triple {6751#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {6751#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {6751#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,473 INFO L273 TraceCheckUtils]: 39: Hoare triple {6752#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,474 INFO L273 TraceCheckUtils]: 40: Hoare triple {6752#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,475 INFO L273 TraceCheckUtils]: 41: Hoare triple {6752#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,475 INFO L273 TraceCheckUtils]: 42: Hoare triple {6753#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,476 INFO L273 TraceCheckUtils]: 43: Hoare triple {6753#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,476 INFO L273 TraceCheckUtils]: 44: Hoare triple {6753#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {6754#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,478 INFO L273 TraceCheckUtils]: 46: Hoare triple {6754#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,478 INFO L273 TraceCheckUtils]: 47: Hoare triple {6754#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,479 INFO L273 TraceCheckUtils]: 48: Hoare triple {6755#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {6755#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,480 INFO L273 TraceCheckUtils]: 50: Hoare triple {6755#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:29,481 INFO L273 TraceCheckUtils]: 51: Hoare triple {6756#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:29,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {6756#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:29,482 INFO L273 TraceCheckUtils]: 53: Hoare triple {6756#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:29,483 INFO L273 TraceCheckUtils]: 54: Hoare triple {6757#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:29,483 INFO L273 TraceCheckUtils]: 55: Hoare triple {6757#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:29,484 INFO L273 TraceCheckUtils]: 56: Hoare triple {6757#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:29,484 INFO L273 TraceCheckUtils]: 57: Hoare triple {6758#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:29,485 INFO L273 TraceCheckUtils]: 58: Hoare triple {6758#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:29,486 INFO L273 TraceCheckUtils]: 59: Hoare triple {6758#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {6759#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:29,486 INFO L273 TraceCheckUtils]: 60: Hoare triple {6759#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6740#false} is VALID [2018-11-23 12:05:29,487 INFO L273 TraceCheckUtils]: 61: Hoare triple {6740#false} havoc ~x~0;~x~0 := 0; {6740#false} is VALID [2018-11-23 12:05:29,487 INFO L273 TraceCheckUtils]: 62: Hoare triple {6740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6740#false} is VALID [2018-11-23 12:05:29,487 INFO L256 TraceCheckUtils]: 63: Hoare triple {6740#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {6740#false} is VALID [2018-11-23 12:05:29,487 INFO L273 TraceCheckUtils]: 64: Hoare triple {6740#false} ~cond := #in~cond; {6740#false} is VALID [2018-11-23 12:05:29,487 INFO L273 TraceCheckUtils]: 65: Hoare triple {6740#false} assume 0 == ~cond; {6740#false} is VALID [2018-11-23 12:05:29,488 INFO L273 TraceCheckUtils]: 66: Hoare triple {6740#false} assume !false; {6740#false} is VALID [2018-11-23 12:05:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:29,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:29,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:05:29,511 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-23 12:05:29,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:29,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:05:29,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:29,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:05:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:05:29,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:05:29,581 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 22 states. [2018-11-23 12:05:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:30,355 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-11-23 12:05:30,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:05:30,355 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-23 12:05:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2018-11-23 12:05:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2018-11-23 12:05:30,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 110 transitions. [2018-11-23 12:05:30,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:30,685 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:05:30,685 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:05:30,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:05:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:05:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:05:30,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:30,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:05:30,719 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:05:30,719 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:05:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:30,721 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2018-11-23 12:05:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-23 12:05:30,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:30,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:30,722 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:05:30,722 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:05:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:30,724 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2018-11-23 12:05:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-23 12:05:30,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:30,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:30,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:30,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:05:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2018-11-23 12:05:30,726 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 67 [2018-11-23 12:05:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:30,726 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-11-23 12:05:30,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:05:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-11-23 12:05:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:05:30,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:30,728 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:30,728 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:30,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash -752267485, now seen corresponding path program 19 times [2018-11-23 12:05:30,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:30,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:30,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:31,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {7335#true} call ULTIMATE.init(); {7335#true} is VALID [2018-11-23 12:05:31,358 INFO L273 TraceCheckUtils]: 1: Hoare triple {7335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7335#true} is VALID [2018-11-23 12:05:31,359 INFO L273 TraceCheckUtils]: 2: Hoare triple {7335#true} assume true; {7335#true} is VALID [2018-11-23 12:05:31,359 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7335#true} {7335#true} #55#return; {7335#true} is VALID [2018-11-23 12:05:31,359 INFO L256 TraceCheckUtils]: 4: Hoare triple {7335#true} call #t~ret4 := main(); {7335#true} is VALID [2018-11-23 12:05:31,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {7335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {7337#(= main_~i~0 0)} is VALID [2018-11-23 12:05:31,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {7337#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7337#(= main_~i~0 0)} is VALID [2018-11-23 12:05:31,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {7337#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7337#(= main_~i~0 0)} is VALID [2018-11-23 12:05:31,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {7337#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {7338#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {7338#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {7338#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {7339#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {7339#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {7339#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {7340#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {7340#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,367 INFO L273 TraceCheckUtils]: 17: Hoare triple {7340#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,368 INFO L273 TraceCheckUtils]: 18: Hoare triple {7341#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,368 INFO L273 TraceCheckUtils]: 19: Hoare triple {7341#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {7341#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,369 INFO L273 TraceCheckUtils]: 21: Hoare triple {7342#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,370 INFO L273 TraceCheckUtils]: 22: Hoare triple {7342#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {7342#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,371 INFO L273 TraceCheckUtils]: 24: Hoare triple {7343#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {7343#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {7343#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,373 INFO L273 TraceCheckUtils]: 27: Hoare triple {7344#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {7344#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {7344#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {7345#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {7345#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,376 INFO L273 TraceCheckUtils]: 32: Hoare triple {7345#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {7346#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,377 INFO L273 TraceCheckUtils]: 34: Hoare triple {7346#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {7346#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:31,379 INFO L273 TraceCheckUtils]: 36: Hoare triple {7347#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:31,379 INFO L273 TraceCheckUtils]: 37: Hoare triple {7347#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:31,380 INFO L273 TraceCheckUtils]: 38: Hoare triple {7347#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:31,380 INFO L273 TraceCheckUtils]: 39: Hoare triple {7348#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:31,381 INFO L273 TraceCheckUtils]: 40: Hoare triple {7348#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:31,382 INFO L273 TraceCheckUtils]: 41: Hoare triple {7348#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:31,382 INFO L273 TraceCheckUtils]: 42: Hoare triple {7349#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:31,383 INFO L273 TraceCheckUtils]: 43: Hoare triple {7349#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:31,383 INFO L273 TraceCheckUtils]: 44: Hoare triple {7349#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:31,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {7350#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:31,384 INFO L273 TraceCheckUtils]: 46: Hoare triple {7350#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:31,385 INFO L273 TraceCheckUtils]: 47: Hoare triple {7350#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:31,386 INFO L273 TraceCheckUtils]: 48: Hoare triple {7351#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:31,386 INFO L273 TraceCheckUtils]: 49: Hoare triple {7351#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:31,387 INFO L273 TraceCheckUtils]: 50: Hoare triple {7351#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:31,387 INFO L273 TraceCheckUtils]: 51: Hoare triple {7352#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:31,388 INFO L273 TraceCheckUtils]: 52: Hoare triple {7352#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:31,389 INFO L273 TraceCheckUtils]: 53: Hoare triple {7352#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:31,389 INFO L273 TraceCheckUtils]: 54: Hoare triple {7353#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:31,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {7353#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:31,391 INFO L273 TraceCheckUtils]: 56: Hoare triple {7353#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:31,391 INFO L273 TraceCheckUtils]: 57: Hoare triple {7354#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:31,392 INFO L273 TraceCheckUtils]: 58: Hoare triple {7354#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:31,392 INFO L273 TraceCheckUtils]: 59: Hoare triple {7354#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:31,393 INFO L273 TraceCheckUtils]: 60: Hoare triple {7355#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:31,393 INFO L273 TraceCheckUtils]: 61: Hoare triple {7355#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:31,394 INFO L273 TraceCheckUtils]: 62: Hoare triple {7355#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7356#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:31,395 INFO L273 TraceCheckUtils]: 63: Hoare triple {7356#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7336#false} is VALID [2018-11-23 12:05:31,395 INFO L273 TraceCheckUtils]: 64: Hoare triple {7336#false} havoc ~x~0;~x~0 := 0; {7336#false} is VALID [2018-11-23 12:05:31,395 INFO L273 TraceCheckUtils]: 65: Hoare triple {7336#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7336#false} is VALID [2018-11-23 12:05:31,396 INFO L256 TraceCheckUtils]: 66: Hoare triple {7336#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {7336#false} is VALID [2018-11-23 12:05:31,396 INFO L273 TraceCheckUtils]: 67: Hoare triple {7336#false} ~cond := #in~cond; {7336#false} is VALID [2018-11-23 12:05:31,396 INFO L273 TraceCheckUtils]: 68: Hoare triple {7336#false} assume 0 == ~cond; {7336#false} is VALID [2018-11-23 12:05:31,396 INFO L273 TraceCheckUtils]: 69: Hoare triple {7336#false} assume !false; {7336#false} is VALID [2018-11-23 12:05:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:31,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:31,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:31,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:31,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:31,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {7335#true} call ULTIMATE.init(); {7335#true} is VALID [2018-11-23 12:05:31,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {7335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7335#true} is VALID [2018-11-23 12:05:31,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {7335#true} assume true; {7335#true} is VALID [2018-11-23 12:05:31,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7335#true} {7335#true} #55#return; {7335#true} is VALID [2018-11-23 12:05:31,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {7335#true} call #t~ret4 := main(); {7335#true} is VALID [2018-11-23 12:05:31,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {7335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {7375#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:31,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {7375#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7375#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:31,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {7375#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7375#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:31,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {7375#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {7338#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {7338#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {7338#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {7339#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {7339#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {7339#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {7340#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {7340#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {7340#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {7341#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,737 INFO L273 TraceCheckUtils]: 19: Hoare triple {7341#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,738 INFO L273 TraceCheckUtils]: 20: Hoare triple {7341#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,738 INFO L273 TraceCheckUtils]: 21: Hoare triple {7342#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,739 INFO L273 TraceCheckUtils]: 22: Hoare triple {7342#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {7342#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,740 INFO L273 TraceCheckUtils]: 24: Hoare triple {7343#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {7343#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {7343#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {7344#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,742 INFO L273 TraceCheckUtils]: 28: Hoare triple {7344#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {7344#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {7345#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,744 INFO L273 TraceCheckUtils]: 31: Hoare triple {7345#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,745 INFO L273 TraceCheckUtils]: 32: Hoare triple {7345#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,745 INFO L273 TraceCheckUtils]: 33: Hoare triple {7346#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,746 INFO L273 TraceCheckUtils]: 34: Hoare triple {7346#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,746 INFO L273 TraceCheckUtils]: 35: Hoare triple {7346#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:31,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {7347#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:31,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {7347#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:31,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {7347#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:31,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {7348#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:31,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {7348#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:31,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {7348#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:31,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {7349#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:31,751 INFO L273 TraceCheckUtils]: 43: Hoare triple {7349#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:31,751 INFO L273 TraceCheckUtils]: 44: Hoare triple {7349#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:31,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {7350#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:31,752 INFO L273 TraceCheckUtils]: 46: Hoare triple {7350#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:31,753 INFO L273 TraceCheckUtils]: 47: Hoare triple {7350#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:31,753 INFO L273 TraceCheckUtils]: 48: Hoare triple {7351#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:31,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {7351#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:31,755 INFO L273 TraceCheckUtils]: 50: Hoare triple {7351#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:31,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {7352#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:31,756 INFO L273 TraceCheckUtils]: 52: Hoare triple {7352#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:31,756 INFO L273 TraceCheckUtils]: 53: Hoare triple {7352#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:31,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {7353#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:31,757 INFO L273 TraceCheckUtils]: 55: Hoare triple {7353#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:31,758 INFO L273 TraceCheckUtils]: 56: Hoare triple {7353#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:31,758 INFO L273 TraceCheckUtils]: 57: Hoare triple {7354#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:31,759 INFO L273 TraceCheckUtils]: 58: Hoare triple {7354#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:31,760 INFO L273 TraceCheckUtils]: 59: Hoare triple {7354#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:31,760 INFO L273 TraceCheckUtils]: 60: Hoare triple {7355#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:31,761 INFO L273 TraceCheckUtils]: 61: Hoare triple {7355#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:31,761 INFO L273 TraceCheckUtils]: 62: Hoare triple {7355#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7356#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:31,762 INFO L273 TraceCheckUtils]: 63: Hoare triple {7356#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7336#false} is VALID [2018-11-23 12:05:31,762 INFO L273 TraceCheckUtils]: 64: Hoare triple {7336#false} havoc ~x~0;~x~0 := 0; {7336#false} is VALID [2018-11-23 12:05:31,762 INFO L273 TraceCheckUtils]: 65: Hoare triple {7336#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7336#false} is VALID [2018-11-23 12:05:31,762 INFO L256 TraceCheckUtils]: 66: Hoare triple {7336#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {7336#false} is VALID [2018-11-23 12:05:31,763 INFO L273 TraceCheckUtils]: 67: Hoare triple {7336#false} ~cond := #in~cond; {7336#false} is VALID [2018-11-23 12:05:31,763 INFO L273 TraceCheckUtils]: 68: Hoare triple {7336#false} assume 0 == ~cond; {7336#false} is VALID [2018-11-23 12:05:31,763 INFO L273 TraceCheckUtils]: 69: Hoare triple {7336#false} assume !false; {7336#false} is VALID [2018-11-23 12:05:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:31,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:31,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:05:31,787 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-23 12:05:31,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:31,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:05:31,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:31,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:05:31,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:05:31,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:05:31,862 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 23 states. [2018-11-23 12:05:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:32,494 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2018-11-23 12:05:32,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:05:32,494 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-23 12:05:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:05:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 114 transitions. [2018-11-23 12:05:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:05:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 114 transitions. [2018-11-23 12:05:32,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 114 transitions. [2018-11-23 12:05:32,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:32,611 INFO L225 Difference]: With dead ends: 91 [2018-11-23 12:05:32,611 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:05:32,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:05:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:05:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-23 12:05:32,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:32,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 78 states. [2018-11-23 12:05:32,632 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 78 states. [2018-11-23 12:05:32,632 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 78 states. [2018-11-23 12:05:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:32,634 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-23 12:05:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-23 12:05:32,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:32,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:32,635 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 80 states. [2018-11-23 12:05:32,635 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 80 states. [2018-11-23 12:05:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:32,636 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-23 12:05:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-23 12:05:32,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:32,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:32,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:32,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:05:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2018-11-23 12:05:32,639 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 70 [2018-11-23 12:05:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:32,639 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2018-11-23 12:05:32,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:05:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2018-11-23 12:05:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:05:32,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:32,640 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:32,641 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:32,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:32,641 INFO L82 PathProgramCache]: Analyzing trace with hash -615929287, now seen corresponding path program 20 times [2018-11-23 12:05:32,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:32,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:32,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:32,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:32,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:33,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {7955#true} call ULTIMATE.init(); {7955#true} is VALID [2018-11-23 12:05:33,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {7955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7955#true} is VALID [2018-11-23 12:05:33,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {7955#true} assume true; {7955#true} is VALID [2018-11-23 12:05:33,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7955#true} {7955#true} #55#return; {7955#true} is VALID [2018-11-23 12:05:33,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {7955#true} call #t~ret4 := main(); {7955#true} is VALID [2018-11-23 12:05:33,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {7955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {7957#(= main_~i~0 0)} is VALID [2018-11-23 12:05:33,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {7957#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7957#(= main_~i~0 0)} is VALID [2018-11-23 12:05:33,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {7957#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7957#(= main_~i~0 0)} is VALID [2018-11-23 12:05:33,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {7957#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {7958#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {7958#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {7958#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {7959#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {7959#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {7959#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {7960#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {7960#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {7960#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {7961#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {7961#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {7961#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {7962#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {7962#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {7962#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {7963#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {7963#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {7963#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,444 INFO L273 TraceCheckUtils]: 27: Hoare triple {7964#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {7964#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {7964#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {7965#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,446 INFO L273 TraceCheckUtils]: 31: Hoare triple {7965#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {7965#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {7966#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,448 INFO L273 TraceCheckUtils]: 34: Hoare triple {7966#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,449 INFO L273 TraceCheckUtils]: 35: Hoare triple {7966#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,450 INFO L273 TraceCheckUtils]: 36: Hoare triple {7967#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,450 INFO L273 TraceCheckUtils]: 37: Hoare triple {7967#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,451 INFO L273 TraceCheckUtils]: 38: Hoare triple {7967#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,451 INFO L273 TraceCheckUtils]: 39: Hoare triple {7968#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,452 INFO L273 TraceCheckUtils]: 40: Hoare triple {7968#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,453 INFO L273 TraceCheckUtils]: 41: Hoare triple {7968#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,453 INFO L273 TraceCheckUtils]: 42: Hoare triple {7969#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,454 INFO L273 TraceCheckUtils]: 43: Hoare triple {7969#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,454 INFO L273 TraceCheckUtils]: 44: Hoare triple {7969#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,455 INFO L273 TraceCheckUtils]: 45: Hoare triple {7970#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,455 INFO L273 TraceCheckUtils]: 46: Hoare triple {7970#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,456 INFO L273 TraceCheckUtils]: 47: Hoare triple {7970#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,457 INFO L273 TraceCheckUtils]: 48: Hoare triple {7971#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,457 INFO L273 TraceCheckUtils]: 49: Hoare triple {7971#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,458 INFO L273 TraceCheckUtils]: 50: Hoare triple {7971#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,458 INFO L273 TraceCheckUtils]: 51: Hoare triple {7972#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,459 INFO L273 TraceCheckUtils]: 52: Hoare triple {7972#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,460 INFO L273 TraceCheckUtils]: 53: Hoare triple {7972#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:33,460 INFO L273 TraceCheckUtils]: 54: Hoare triple {7973#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:33,461 INFO L273 TraceCheckUtils]: 55: Hoare triple {7973#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:33,462 INFO L273 TraceCheckUtils]: 56: Hoare triple {7973#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:33,462 INFO L273 TraceCheckUtils]: 57: Hoare triple {7974#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:33,463 INFO L273 TraceCheckUtils]: 58: Hoare triple {7974#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:33,463 INFO L273 TraceCheckUtils]: 59: Hoare triple {7974#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:33,464 INFO L273 TraceCheckUtils]: 60: Hoare triple {7975#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:33,464 INFO L273 TraceCheckUtils]: 61: Hoare triple {7975#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:33,465 INFO L273 TraceCheckUtils]: 62: Hoare triple {7975#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:33,466 INFO L273 TraceCheckUtils]: 63: Hoare triple {7976#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:33,466 INFO L273 TraceCheckUtils]: 64: Hoare triple {7976#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:33,467 INFO L273 TraceCheckUtils]: 65: Hoare triple {7976#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {7977#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:33,468 INFO L273 TraceCheckUtils]: 66: Hoare triple {7977#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7956#false} is VALID [2018-11-23 12:05:33,468 INFO L273 TraceCheckUtils]: 67: Hoare triple {7956#false} havoc ~x~0;~x~0 := 0; {7956#false} is VALID [2018-11-23 12:05:33,468 INFO L273 TraceCheckUtils]: 68: Hoare triple {7956#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7956#false} is VALID [2018-11-23 12:05:33,468 INFO L256 TraceCheckUtils]: 69: Hoare triple {7956#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {7956#false} is VALID [2018-11-23 12:05:33,468 INFO L273 TraceCheckUtils]: 70: Hoare triple {7956#false} ~cond := #in~cond; {7956#false} is VALID [2018-11-23 12:05:33,469 INFO L273 TraceCheckUtils]: 71: Hoare triple {7956#false} assume 0 == ~cond; {7956#false} is VALID [2018-11-23 12:05:33,469 INFO L273 TraceCheckUtils]: 72: Hoare triple {7956#false} assume !false; {7956#false} is VALID [2018-11-23 12:05:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:33,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:33,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:33,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:33,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:33,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:33,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:33,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {7955#true} call ULTIMATE.init(); {7955#true} is VALID [2018-11-23 12:05:33,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {7955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7955#true} is VALID [2018-11-23 12:05:33,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {7955#true} assume true; {7955#true} is VALID [2018-11-23 12:05:33,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7955#true} {7955#true} #55#return; {7955#true} is VALID [2018-11-23 12:05:33,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {7955#true} call #t~ret4 := main(); {7955#true} is VALID [2018-11-23 12:05:33,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {7955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {7996#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:33,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {7996#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7996#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:33,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {7996#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7996#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:33,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {7996#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {7958#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {7958#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {7958#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {7959#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {7959#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,709 INFO L273 TraceCheckUtils]: 14: Hoare triple {7959#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {7960#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {7960#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {7960#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {7961#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {7961#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {7961#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {7962#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {7962#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,715 INFO L273 TraceCheckUtils]: 23: Hoare triple {7962#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {7963#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {7963#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {7963#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {7964#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {7964#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {7964#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {7965#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {7965#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,720 INFO L273 TraceCheckUtils]: 32: Hoare triple {7965#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {7966#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {7966#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,722 INFO L273 TraceCheckUtils]: 35: Hoare triple {7966#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,722 INFO L273 TraceCheckUtils]: 36: Hoare triple {7967#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,723 INFO L273 TraceCheckUtils]: 37: Hoare triple {7967#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,724 INFO L273 TraceCheckUtils]: 38: Hoare triple {7967#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,724 INFO L273 TraceCheckUtils]: 39: Hoare triple {7968#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,725 INFO L273 TraceCheckUtils]: 40: Hoare triple {7968#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,725 INFO L273 TraceCheckUtils]: 41: Hoare triple {7968#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,726 INFO L273 TraceCheckUtils]: 42: Hoare triple {7969#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,727 INFO L273 TraceCheckUtils]: 43: Hoare triple {7969#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {7969#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,728 INFO L273 TraceCheckUtils]: 45: Hoare triple {7970#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {7970#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {7970#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,729 INFO L273 TraceCheckUtils]: 48: Hoare triple {7971#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,730 INFO L273 TraceCheckUtils]: 49: Hoare triple {7971#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {7971#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {7972#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,732 INFO L273 TraceCheckUtils]: 52: Hoare triple {7972#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,732 INFO L273 TraceCheckUtils]: 53: Hoare triple {7972#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:33,733 INFO L273 TraceCheckUtils]: 54: Hoare triple {7973#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:33,733 INFO L273 TraceCheckUtils]: 55: Hoare triple {7973#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:33,734 INFO L273 TraceCheckUtils]: 56: Hoare triple {7973#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:33,735 INFO L273 TraceCheckUtils]: 57: Hoare triple {7974#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:33,735 INFO L273 TraceCheckUtils]: 58: Hoare triple {7974#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:33,736 INFO L273 TraceCheckUtils]: 59: Hoare triple {7974#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:33,736 INFO L273 TraceCheckUtils]: 60: Hoare triple {7975#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:33,737 INFO L273 TraceCheckUtils]: 61: Hoare triple {7975#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:33,738 INFO L273 TraceCheckUtils]: 62: Hoare triple {7975#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:33,738 INFO L273 TraceCheckUtils]: 63: Hoare triple {7976#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:33,739 INFO L273 TraceCheckUtils]: 64: Hoare triple {7976#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:33,739 INFO L273 TraceCheckUtils]: 65: Hoare triple {7976#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {7977#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:33,740 INFO L273 TraceCheckUtils]: 66: Hoare triple {7977#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7956#false} is VALID [2018-11-23 12:05:33,740 INFO L273 TraceCheckUtils]: 67: Hoare triple {7956#false} havoc ~x~0;~x~0 := 0; {7956#false} is VALID [2018-11-23 12:05:33,740 INFO L273 TraceCheckUtils]: 68: Hoare triple {7956#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7956#false} is VALID [2018-11-23 12:05:33,741 INFO L256 TraceCheckUtils]: 69: Hoare triple {7956#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {7956#false} is VALID [2018-11-23 12:05:33,741 INFO L273 TraceCheckUtils]: 70: Hoare triple {7956#false} ~cond := #in~cond; {7956#false} is VALID [2018-11-23 12:05:33,741 INFO L273 TraceCheckUtils]: 71: Hoare triple {7956#false} assume 0 == ~cond; {7956#false} is VALID [2018-11-23 12:05:33,741 INFO L273 TraceCheckUtils]: 72: Hoare triple {7956#false} assume !false; {7956#false} is VALID [2018-11-23 12:05:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:33,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:33,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:05:33,767 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-23 12:05:33,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:33,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:05:33,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:33,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:05:33,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:05:33,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:05:33,844 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 24 states. [2018-11-23 12:05:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,227 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-23 12:05:34,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:05:34,227 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-23 12:05:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2018-11-23 12:05:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2018-11-23 12:05:34,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 118 transitions. [2018-11-23 12:05:34,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:34,339 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:05:34,339 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:05:34,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:05:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:05:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:05:34,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:34,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:05:34,383 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:05:34,383 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:05:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,384 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 12:05:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 12:05:34,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:34,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:34,385 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:05:34,385 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:05:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,386 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 12:05:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 12:05:34,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:34,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:34,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:34,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:05:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2018-11-23 12:05:34,389 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 73 [2018-11-23 12:05:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:34,389 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2018-11-23 12:05:34,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:05:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2018-11-23 12:05:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:05:34,390 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:34,390 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:34,391 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:34,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:34,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2003734685, now seen corresponding path program 21 times [2018-11-23 12:05:34,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:34,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:34,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:34,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:34,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:34,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {8599#true} call ULTIMATE.init(); {8599#true} is VALID [2018-11-23 12:05:34,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {8599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8599#true} is VALID [2018-11-23 12:05:34,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {8599#true} assume true; {8599#true} is VALID [2018-11-23 12:05:34,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8599#true} {8599#true} #55#return; {8599#true} is VALID [2018-11-23 12:05:34,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {8599#true} call #t~ret4 := main(); {8599#true} is VALID [2018-11-23 12:05:34,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {8599#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {8601#(= main_~i~0 0)} is VALID [2018-11-23 12:05:34,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {8601#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8601#(= main_~i~0 0)} is VALID [2018-11-23 12:05:34,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {8601#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8601#(= main_~i~0 0)} is VALID [2018-11-23 12:05:34,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {8601#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:34,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {8602#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:34,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {8602#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:34,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {8602#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:34,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {8603#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:34,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {8603#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:34,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {8603#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:34,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {8604#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:34,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {8604#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:34,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {8604#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:34,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {8605#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:34,808 INFO L273 TraceCheckUtils]: 19: Hoare triple {8605#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:34,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {8605#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:34,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {8606#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:34,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {8606#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:34,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {8606#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:34,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {8607#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:34,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {8607#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:34,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {8607#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:34,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {8608#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:34,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {8608#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:34,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {8608#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:34,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {8609#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:34,815 INFO L273 TraceCheckUtils]: 31: Hoare triple {8609#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:34,816 INFO L273 TraceCheckUtils]: 32: Hoare triple {8609#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:34,816 INFO L273 TraceCheckUtils]: 33: Hoare triple {8610#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:34,817 INFO L273 TraceCheckUtils]: 34: Hoare triple {8610#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:34,818 INFO L273 TraceCheckUtils]: 35: Hoare triple {8610#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:34,818 INFO L273 TraceCheckUtils]: 36: Hoare triple {8611#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:34,818 INFO L273 TraceCheckUtils]: 37: Hoare triple {8611#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:34,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {8611#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:34,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {8612#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:34,820 INFO L273 TraceCheckUtils]: 40: Hoare triple {8612#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:34,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {8612#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:34,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {8613#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:34,822 INFO L273 TraceCheckUtils]: 43: Hoare triple {8613#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:34,823 INFO L273 TraceCheckUtils]: 44: Hoare triple {8613#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:34,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {8614#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:34,823 INFO L273 TraceCheckUtils]: 46: Hoare triple {8614#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:34,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {8614#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:34,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {8615#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:34,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {8615#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:34,826 INFO L273 TraceCheckUtils]: 50: Hoare triple {8615#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:34,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {8616#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:34,827 INFO L273 TraceCheckUtils]: 52: Hoare triple {8616#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:34,828 INFO L273 TraceCheckUtils]: 53: Hoare triple {8616#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:34,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {8617#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:34,829 INFO L273 TraceCheckUtils]: 55: Hoare triple {8617#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:34,829 INFO L273 TraceCheckUtils]: 56: Hoare triple {8617#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:34,830 INFO L273 TraceCheckUtils]: 57: Hoare triple {8618#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:34,830 INFO L273 TraceCheckUtils]: 58: Hoare triple {8618#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:34,831 INFO L273 TraceCheckUtils]: 59: Hoare triple {8618#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:34,832 INFO L273 TraceCheckUtils]: 60: Hoare triple {8619#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:34,832 INFO L273 TraceCheckUtils]: 61: Hoare triple {8619#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:34,833 INFO L273 TraceCheckUtils]: 62: Hoare triple {8619#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:34,833 INFO L273 TraceCheckUtils]: 63: Hoare triple {8620#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:34,834 INFO L273 TraceCheckUtils]: 64: Hoare triple {8620#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:34,835 INFO L273 TraceCheckUtils]: 65: Hoare triple {8620#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:34,835 INFO L273 TraceCheckUtils]: 66: Hoare triple {8621#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:34,836 INFO L273 TraceCheckUtils]: 67: Hoare triple {8621#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:34,836 INFO L273 TraceCheckUtils]: 68: Hoare triple {8621#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {8622#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:34,837 INFO L273 TraceCheckUtils]: 69: Hoare triple {8622#(<= main_~i~0 21)} assume !(~i~0 < 100000); {8600#false} is VALID [2018-11-23 12:05:34,837 INFO L273 TraceCheckUtils]: 70: Hoare triple {8600#false} havoc ~x~0;~x~0 := 0; {8600#false} is VALID [2018-11-23 12:05:34,838 INFO L273 TraceCheckUtils]: 71: Hoare triple {8600#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8600#false} is VALID [2018-11-23 12:05:34,838 INFO L256 TraceCheckUtils]: 72: Hoare triple {8600#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {8600#false} is VALID [2018-11-23 12:05:34,838 INFO L273 TraceCheckUtils]: 73: Hoare triple {8600#false} ~cond := #in~cond; {8600#false} is VALID [2018-11-23 12:05:34,838 INFO L273 TraceCheckUtils]: 74: Hoare triple {8600#false} assume 0 == ~cond; {8600#false} is VALID [2018-11-23 12:05:34,838 INFO L273 TraceCheckUtils]: 75: Hoare triple {8600#false} assume !false; {8600#false} is VALID [2018-11-23 12:05:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:34,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:34,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:34,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:34,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 12:05:34,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:34,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:35,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {8599#true} call ULTIMATE.init(); {8599#true} is VALID [2018-11-23 12:05:35,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {8599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8599#true} is VALID [2018-11-23 12:05:35,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {8599#true} assume true; {8599#true} is VALID [2018-11-23 12:05:35,260 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8599#true} {8599#true} #55#return; {8599#true} is VALID [2018-11-23 12:05:35,260 INFO L256 TraceCheckUtils]: 4: Hoare triple {8599#true} call #t~ret4 := main(); {8599#true} is VALID [2018-11-23 12:05:35,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {8599#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {8641#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:35,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {8641#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8641#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:35,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {8641#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8641#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:35,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {8641#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,263 INFO L273 TraceCheckUtils]: 9: Hoare triple {8602#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {8602#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {8602#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {8603#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {8603#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {8603#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {8604#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,314 INFO L273 TraceCheckUtils]: 16: Hoare triple {8604#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,315 INFO L273 TraceCheckUtils]: 17: Hoare triple {8604#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,315 INFO L273 TraceCheckUtils]: 18: Hoare triple {8605#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,316 INFO L273 TraceCheckUtils]: 19: Hoare triple {8605#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {8605#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {8606#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {8606#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {8606#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {8607#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {8607#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {8607#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {8608#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {8608#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {8608#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {8609#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {8609#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {8609#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {8610#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {8610#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,324 INFO L273 TraceCheckUtils]: 35: Hoare triple {8610#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,325 INFO L273 TraceCheckUtils]: 36: Hoare triple {8611#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {8611#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {8611#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {8612#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,327 INFO L273 TraceCheckUtils]: 40: Hoare triple {8612#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,328 INFO L273 TraceCheckUtils]: 41: Hoare triple {8612#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,328 INFO L273 TraceCheckUtils]: 42: Hoare triple {8613#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,329 INFO L273 TraceCheckUtils]: 43: Hoare triple {8613#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,330 INFO L273 TraceCheckUtils]: 44: Hoare triple {8613#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,330 INFO L273 TraceCheckUtils]: 45: Hoare triple {8614#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,331 INFO L273 TraceCheckUtils]: 46: Hoare triple {8614#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,331 INFO L273 TraceCheckUtils]: 47: Hoare triple {8614#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {8615#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,333 INFO L273 TraceCheckUtils]: 49: Hoare triple {8615#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,333 INFO L273 TraceCheckUtils]: 50: Hoare triple {8615#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:35,334 INFO L273 TraceCheckUtils]: 51: Hoare triple {8616#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:35,334 INFO L273 TraceCheckUtils]: 52: Hoare triple {8616#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:35,335 INFO L273 TraceCheckUtils]: 53: Hoare triple {8616#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:35,336 INFO L273 TraceCheckUtils]: 54: Hoare triple {8617#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:35,336 INFO L273 TraceCheckUtils]: 55: Hoare triple {8617#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:35,337 INFO L273 TraceCheckUtils]: 56: Hoare triple {8617#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:35,337 INFO L273 TraceCheckUtils]: 57: Hoare triple {8618#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:35,338 INFO L273 TraceCheckUtils]: 58: Hoare triple {8618#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:35,339 INFO L273 TraceCheckUtils]: 59: Hoare triple {8618#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:35,339 INFO L273 TraceCheckUtils]: 60: Hoare triple {8619#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:35,340 INFO L273 TraceCheckUtils]: 61: Hoare triple {8619#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:35,340 INFO L273 TraceCheckUtils]: 62: Hoare triple {8619#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:35,341 INFO L273 TraceCheckUtils]: 63: Hoare triple {8620#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:35,341 INFO L273 TraceCheckUtils]: 64: Hoare triple {8620#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:35,342 INFO L273 TraceCheckUtils]: 65: Hoare triple {8620#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:35,343 INFO L273 TraceCheckUtils]: 66: Hoare triple {8621#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:35,343 INFO L273 TraceCheckUtils]: 67: Hoare triple {8621#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:35,344 INFO L273 TraceCheckUtils]: 68: Hoare triple {8621#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {8622#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:35,345 INFO L273 TraceCheckUtils]: 69: Hoare triple {8622#(<= main_~i~0 21)} assume !(~i~0 < 100000); {8600#false} is VALID [2018-11-23 12:05:35,345 INFO L273 TraceCheckUtils]: 70: Hoare triple {8600#false} havoc ~x~0;~x~0 := 0; {8600#false} is VALID [2018-11-23 12:05:35,345 INFO L273 TraceCheckUtils]: 71: Hoare triple {8600#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8600#false} is VALID [2018-11-23 12:05:35,345 INFO L256 TraceCheckUtils]: 72: Hoare triple {8600#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {8600#false} is VALID [2018-11-23 12:05:35,346 INFO L273 TraceCheckUtils]: 73: Hoare triple {8600#false} ~cond := #in~cond; {8600#false} is VALID [2018-11-23 12:05:35,346 INFO L273 TraceCheckUtils]: 74: Hoare triple {8600#false} assume 0 == ~cond; {8600#false} is VALID [2018-11-23 12:05:35,346 INFO L273 TraceCheckUtils]: 75: Hoare triple {8600#false} assume !false; {8600#false} is VALID [2018-11-23 12:05:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:35,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:35,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:05:35,378 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-23 12:05:35,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:35,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:05:35,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:35,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:05:35,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:05:35,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:05:35,458 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand 25 states. [2018-11-23 12:05:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,083 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2018-11-23 12:05:36,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:05:36,083 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-23 12:05:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:05:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 122 transitions. [2018-11-23 12:05:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:05:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 122 transitions. [2018-11-23 12:05:36,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 122 transitions. [2018-11-23 12:05:36,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:36,200 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:05:36,201 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 12:05:36,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:05:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 12:05:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-23 12:05:36,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:36,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 84 states. [2018-11-23 12:05:36,223 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 84 states. [2018-11-23 12:05:36,223 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 84 states. [2018-11-23 12:05:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,226 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-23 12:05:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 12:05:36,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:36,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:36,226 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 86 states. [2018-11-23 12:05:36,227 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 86 states. [2018-11-23 12:05:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,228 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-23 12:05:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 12:05:36,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:36,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:36,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:36,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 12:05:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2018-11-23 12:05:36,231 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 76 [2018-11-23 12:05:36,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:36,231 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2018-11-23 12:05:36,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:05:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 12:05:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:05:36,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:36,232 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:36,232 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:36,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:36,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1535812089, now seen corresponding path program 22 times [2018-11-23 12:05:36,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:36,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:36,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:36,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:36,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {9267#true} call ULTIMATE.init(); {9267#true} is VALID [2018-11-23 12:05:36,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {9267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9267#true} is VALID [2018-11-23 12:05:36,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {9267#true} assume true; {9267#true} is VALID [2018-11-23 12:05:36,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9267#true} {9267#true} #55#return; {9267#true} is VALID [2018-11-23 12:05:36,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {9267#true} call #t~ret4 := main(); {9267#true} is VALID [2018-11-23 12:05:36,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {9267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {9269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:36,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {9269#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:36,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {9269#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:36,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {9269#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:36,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {9270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:36,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {9270#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:36,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {9270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:36,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {9271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:36,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {9271#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:36,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {9271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:36,737 INFO L273 TraceCheckUtils]: 15: Hoare triple {9272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:36,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {9272#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:36,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {9272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:36,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {9273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:36,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {9273#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:36,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {9273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:36,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {9274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:36,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {9274#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:36,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {9274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:36,743 INFO L273 TraceCheckUtils]: 24: Hoare triple {9275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:36,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {9275#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:36,744 INFO L273 TraceCheckUtils]: 26: Hoare triple {9275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:36,745 INFO L273 TraceCheckUtils]: 27: Hoare triple {9276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:36,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {9276#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:36,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {9276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:36,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {9277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:36,747 INFO L273 TraceCheckUtils]: 31: Hoare triple {9277#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:36,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {9277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:36,748 INFO L273 TraceCheckUtils]: 33: Hoare triple {9278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:36,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {9278#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:36,750 INFO L273 TraceCheckUtils]: 35: Hoare triple {9278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:36,750 INFO L273 TraceCheckUtils]: 36: Hoare triple {9279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:36,751 INFO L273 TraceCheckUtils]: 37: Hoare triple {9279#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:36,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {9279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:36,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {9280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:36,752 INFO L273 TraceCheckUtils]: 40: Hoare triple {9280#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:36,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {9280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:36,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {9281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:36,754 INFO L273 TraceCheckUtils]: 43: Hoare triple {9281#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:36,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {9281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:36,756 INFO L273 TraceCheckUtils]: 45: Hoare triple {9282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:36,756 INFO L273 TraceCheckUtils]: 46: Hoare triple {9282#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:36,757 INFO L273 TraceCheckUtils]: 47: Hoare triple {9282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:36,757 INFO L273 TraceCheckUtils]: 48: Hoare triple {9283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:36,758 INFO L273 TraceCheckUtils]: 49: Hoare triple {9283#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:36,759 INFO L273 TraceCheckUtils]: 50: Hoare triple {9283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:36,759 INFO L273 TraceCheckUtils]: 51: Hoare triple {9284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:36,760 INFO L273 TraceCheckUtils]: 52: Hoare triple {9284#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:36,761 INFO L273 TraceCheckUtils]: 53: Hoare triple {9284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:36,761 INFO L273 TraceCheckUtils]: 54: Hoare triple {9285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:36,762 INFO L273 TraceCheckUtils]: 55: Hoare triple {9285#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:36,762 INFO L273 TraceCheckUtils]: 56: Hoare triple {9285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:36,763 INFO L273 TraceCheckUtils]: 57: Hoare triple {9286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:36,763 INFO L273 TraceCheckUtils]: 58: Hoare triple {9286#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:36,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {9286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:36,765 INFO L273 TraceCheckUtils]: 60: Hoare triple {9287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:36,765 INFO L273 TraceCheckUtils]: 61: Hoare triple {9287#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:36,766 INFO L273 TraceCheckUtils]: 62: Hoare triple {9287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:36,767 INFO L273 TraceCheckUtils]: 63: Hoare triple {9288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:36,767 INFO L273 TraceCheckUtils]: 64: Hoare triple {9288#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:36,768 INFO L273 TraceCheckUtils]: 65: Hoare triple {9288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:36,768 INFO L273 TraceCheckUtils]: 66: Hoare triple {9289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:36,769 INFO L273 TraceCheckUtils]: 67: Hoare triple {9289#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:36,770 INFO L273 TraceCheckUtils]: 68: Hoare triple {9289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:36,770 INFO L273 TraceCheckUtils]: 69: Hoare triple {9290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:36,771 INFO L273 TraceCheckUtils]: 70: Hoare triple {9290#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:36,771 INFO L273 TraceCheckUtils]: 71: Hoare triple {9290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9291#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:36,772 INFO L273 TraceCheckUtils]: 72: Hoare triple {9291#(<= main_~i~0 22)} assume !(~i~0 < 100000); {9268#false} is VALID [2018-11-23 12:05:36,772 INFO L273 TraceCheckUtils]: 73: Hoare triple {9268#false} havoc ~x~0;~x~0 := 0; {9268#false} is VALID [2018-11-23 12:05:36,773 INFO L273 TraceCheckUtils]: 74: Hoare triple {9268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9268#false} is VALID [2018-11-23 12:05:36,773 INFO L256 TraceCheckUtils]: 75: Hoare triple {9268#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {9268#false} is VALID [2018-11-23 12:05:36,773 INFO L273 TraceCheckUtils]: 76: Hoare triple {9268#false} ~cond := #in~cond; {9268#false} is VALID [2018-11-23 12:05:36,773 INFO L273 TraceCheckUtils]: 77: Hoare triple {9268#false} assume 0 == ~cond; {9268#false} is VALID [2018-11-23 12:05:36,773 INFO L273 TraceCheckUtils]: 78: Hoare triple {9268#false} assume !false; {9268#false} is VALID [2018-11-23 12:05:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:36,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:36,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:36,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:36,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:36,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:36,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:37,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {9267#true} call ULTIMATE.init(); {9267#true} is VALID [2018-11-23 12:05:37,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {9267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9267#true} is VALID [2018-11-23 12:05:37,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {9267#true} assume true; {9267#true} is VALID [2018-11-23 12:05:37,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9267#true} {9267#true} #55#return; {9267#true} is VALID [2018-11-23 12:05:37,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {9267#true} call #t~ret4 := main(); {9267#true} is VALID [2018-11-23 12:05:37,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {9267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {9310#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:37,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {9310#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9310#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:37,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {9310#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9310#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:37,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {9310#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:37,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {9270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:37,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {9270#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:37,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {9270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:37,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {9271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:37,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {9271#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:37,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {9271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:37,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {9272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:37,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {9272#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:37,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {9272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:37,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {9273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:37,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {9273#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:37,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {9273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:37,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {9274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:37,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {9274#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:37,181 INFO L273 TraceCheckUtils]: 23: Hoare triple {9274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:37,181 INFO L273 TraceCheckUtils]: 24: Hoare triple {9275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:37,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {9275#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:37,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {9275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:37,186 INFO L273 TraceCheckUtils]: 27: Hoare triple {9276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:37,186 INFO L273 TraceCheckUtils]: 28: Hoare triple {9276#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:37,189 INFO L273 TraceCheckUtils]: 29: Hoare triple {9276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:37,189 INFO L273 TraceCheckUtils]: 30: Hoare triple {9277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:37,192 INFO L273 TraceCheckUtils]: 31: Hoare triple {9277#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:37,192 INFO L273 TraceCheckUtils]: 32: Hoare triple {9277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:37,195 INFO L273 TraceCheckUtils]: 33: Hoare triple {9278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:37,195 INFO L273 TraceCheckUtils]: 34: Hoare triple {9278#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:37,198 INFO L273 TraceCheckUtils]: 35: Hoare triple {9278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:37,198 INFO L273 TraceCheckUtils]: 36: Hoare triple {9279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:37,200 INFO L273 TraceCheckUtils]: 37: Hoare triple {9279#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:37,200 INFO L273 TraceCheckUtils]: 38: Hoare triple {9279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:37,202 INFO L273 TraceCheckUtils]: 39: Hoare triple {9280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:37,202 INFO L273 TraceCheckUtils]: 40: Hoare triple {9280#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:37,205 INFO L273 TraceCheckUtils]: 41: Hoare triple {9280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:37,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {9281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:37,207 INFO L273 TraceCheckUtils]: 43: Hoare triple {9281#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:37,207 INFO L273 TraceCheckUtils]: 44: Hoare triple {9281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:37,210 INFO L273 TraceCheckUtils]: 45: Hoare triple {9282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:37,210 INFO L273 TraceCheckUtils]: 46: Hoare triple {9282#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:37,212 INFO L273 TraceCheckUtils]: 47: Hoare triple {9282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:37,212 INFO L273 TraceCheckUtils]: 48: Hoare triple {9283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:37,215 INFO L273 TraceCheckUtils]: 49: Hoare triple {9283#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:37,215 INFO L273 TraceCheckUtils]: 50: Hoare triple {9283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:37,218 INFO L273 TraceCheckUtils]: 51: Hoare triple {9284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:37,218 INFO L273 TraceCheckUtils]: 52: Hoare triple {9284#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:37,221 INFO L273 TraceCheckUtils]: 53: Hoare triple {9284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:37,221 INFO L273 TraceCheckUtils]: 54: Hoare triple {9285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:37,224 INFO L273 TraceCheckUtils]: 55: Hoare triple {9285#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:37,224 INFO L273 TraceCheckUtils]: 56: Hoare triple {9285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:37,226 INFO L273 TraceCheckUtils]: 57: Hoare triple {9286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:37,226 INFO L273 TraceCheckUtils]: 58: Hoare triple {9286#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:37,228 INFO L273 TraceCheckUtils]: 59: Hoare triple {9286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:37,228 INFO L273 TraceCheckUtils]: 60: Hoare triple {9287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:37,231 INFO L273 TraceCheckUtils]: 61: Hoare triple {9287#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:37,231 INFO L273 TraceCheckUtils]: 62: Hoare triple {9287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:37,234 INFO L273 TraceCheckUtils]: 63: Hoare triple {9288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:37,234 INFO L273 TraceCheckUtils]: 64: Hoare triple {9288#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:37,237 INFO L273 TraceCheckUtils]: 65: Hoare triple {9288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:37,237 INFO L273 TraceCheckUtils]: 66: Hoare triple {9289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:37,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {9289#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:37,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {9289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:37,241 INFO L273 TraceCheckUtils]: 69: Hoare triple {9290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:37,241 INFO L273 TraceCheckUtils]: 70: Hoare triple {9290#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:37,243 INFO L273 TraceCheckUtils]: 71: Hoare triple {9290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9291#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:37,243 INFO L273 TraceCheckUtils]: 72: Hoare triple {9291#(<= main_~i~0 22)} assume !(~i~0 < 100000); {9268#false} is VALID [2018-11-23 12:05:37,243 INFO L273 TraceCheckUtils]: 73: Hoare triple {9268#false} havoc ~x~0;~x~0 := 0; {9268#false} is VALID [2018-11-23 12:05:37,243 INFO L273 TraceCheckUtils]: 74: Hoare triple {9268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9268#false} is VALID [2018-11-23 12:05:37,243 INFO L256 TraceCheckUtils]: 75: Hoare triple {9268#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {9268#false} is VALID [2018-11-23 12:05:37,244 INFO L273 TraceCheckUtils]: 76: Hoare triple {9268#false} ~cond := #in~cond; {9268#false} is VALID [2018-11-23 12:05:37,244 INFO L273 TraceCheckUtils]: 77: Hoare triple {9268#false} assume 0 == ~cond; {9268#false} is VALID [2018-11-23 12:05:37,244 INFO L273 TraceCheckUtils]: 78: Hoare triple {9268#false} assume !false; {9268#false} is VALID [2018-11-23 12:05:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:37,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:37,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:05:37,267 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-23 12:05:37,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:37,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:05:37,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:37,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:05:37,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:05:37,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:05:37,374 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand 26 states. [2018-11-23 12:05:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:37,912 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-11-23 12:05:37,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:05:37,913 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-23 12:05:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:05:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-23 12:05:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:05:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-23 12:05:37,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 126 transitions. [2018-11-23 12:05:38,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:38,036 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:05:38,036 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:05:38,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:05:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:05:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-11-23 12:05:38,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:38,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 87 states. [2018-11-23 12:05:38,060 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 87 states. [2018-11-23 12:05:38,060 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 87 states. [2018-11-23 12:05:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:38,061 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 12:05:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 12:05:38,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:38,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:38,062 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 89 states. [2018-11-23 12:05:38,062 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 89 states. [2018-11-23 12:05:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:38,064 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 12:05:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 12:05:38,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:38,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:38,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:38,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:05:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2018-11-23 12:05:38,066 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 79 [2018-11-23 12:05:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:38,066 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2018-11-23 12:05:38,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:05:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2018-11-23 12:05:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 12:05:38,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:38,068 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:38,068 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:38,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:38,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1863295069, now seen corresponding path program 23 times [2018-11-23 12:05:38,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:38,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:38,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:38,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:38,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:38,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {9959#true} call ULTIMATE.init(); {9959#true} is VALID [2018-11-23 12:05:38,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {9959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9959#true} is VALID [2018-11-23 12:05:38,680 INFO L273 TraceCheckUtils]: 2: Hoare triple {9959#true} assume true; {9959#true} is VALID [2018-11-23 12:05:38,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9959#true} {9959#true} #55#return; {9959#true} is VALID [2018-11-23 12:05:38,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {9959#true} call #t~ret4 := main(); {9959#true} is VALID [2018-11-23 12:05:38,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {9959#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {9961#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {9961#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9961#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {9961#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9961#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {9961#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {9962#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,683 INFO L273 TraceCheckUtils]: 10: Hoare triple {9962#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {9962#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,684 INFO L273 TraceCheckUtils]: 12: Hoare triple {9963#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {9963#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,685 INFO L273 TraceCheckUtils]: 14: Hoare triple {9963#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {9964#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,686 INFO L273 TraceCheckUtils]: 16: Hoare triple {9964#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,687 INFO L273 TraceCheckUtils]: 17: Hoare triple {9964#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {9965#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {9965#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {9965#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {9966#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {9966#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {9966#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,691 INFO L273 TraceCheckUtils]: 24: Hoare triple {9967#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,691 INFO L273 TraceCheckUtils]: 25: Hoare triple {9967#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,692 INFO L273 TraceCheckUtils]: 26: Hoare triple {9967#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,692 INFO L273 TraceCheckUtils]: 27: Hoare triple {9968#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,693 INFO L273 TraceCheckUtils]: 28: Hoare triple {9968#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {9968#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {9969#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {9969#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {9969#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,696 INFO L273 TraceCheckUtils]: 33: Hoare triple {9970#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,696 INFO L273 TraceCheckUtils]: 34: Hoare triple {9970#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,697 INFO L273 TraceCheckUtils]: 35: Hoare triple {9970#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,697 INFO L273 TraceCheckUtils]: 36: Hoare triple {9971#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,698 INFO L273 TraceCheckUtils]: 37: Hoare triple {9971#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,698 INFO L273 TraceCheckUtils]: 38: Hoare triple {9971#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,699 INFO L273 TraceCheckUtils]: 39: Hoare triple {9972#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,699 INFO L273 TraceCheckUtils]: 40: Hoare triple {9972#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,700 INFO L273 TraceCheckUtils]: 41: Hoare triple {9972#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,700 INFO L273 TraceCheckUtils]: 42: Hoare triple {9973#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,701 INFO L273 TraceCheckUtils]: 43: Hoare triple {9973#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {9973#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {9974#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 46: Hoare triple {9974#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 47: Hoare triple {9974#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:38,704 INFO L273 TraceCheckUtils]: 48: Hoare triple {9975#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:38,704 INFO L273 TraceCheckUtils]: 49: Hoare triple {9975#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 50: Hoare triple {9975#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 51: Hoare triple {9976#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:38,706 INFO L273 TraceCheckUtils]: 52: Hoare triple {9976#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 53: Hoare triple {9976#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 54: Hoare triple {9977#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 55: Hoare triple {9977#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 56: Hoare triple {9977#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 57: Hoare triple {9978#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 58: Hoare triple {9978#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:38,710 INFO L273 TraceCheckUtils]: 59: Hoare triple {9978#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 60: Hoare triple {9979#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 61: Hoare triple {9979#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 62: Hoare triple {9979#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 63: Hoare triple {9980#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:38,713 INFO L273 TraceCheckUtils]: 64: Hoare triple {9980#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 65: Hoare triple {9980#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 66: Hoare triple {9981#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:38,715 INFO L273 TraceCheckUtils]: 67: Hoare triple {9981#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:38,715 INFO L273 TraceCheckUtils]: 68: Hoare triple {9981#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:38,716 INFO L273 TraceCheckUtils]: 69: Hoare triple {9982#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:38,717 INFO L273 TraceCheckUtils]: 70: Hoare triple {9982#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:38,717 INFO L273 TraceCheckUtils]: 71: Hoare triple {9982#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:38,718 INFO L273 TraceCheckUtils]: 72: Hoare triple {9983#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:38,718 INFO L273 TraceCheckUtils]: 73: Hoare triple {9983#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:38,719 INFO L273 TraceCheckUtils]: 74: Hoare triple {9983#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {9984#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:38,720 INFO L273 TraceCheckUtils]: 75: Hoare triple {9984#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9960#false} is VALID [2018-11-23 12:05:38,720 INFO L273 TraceCheckUtils]: 76: Hoare triple {9960#false} havoc ~x~0;~x~0 := 0; {9960#false} is VALID [2018-11-23 12:05:38,720 INFO L273 TraceCheckUtils]: 77: Hoare triple {9960#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9960#false} is VALID [2018-11-23 12:05:38,720 INFO L256 TraceCheckUtils]: 78: Hoare triple {9960#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {9960#false} is VALID [2018-11-23 12:05:38,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {9960#false} ~cond := #in~cond; {9960#false} is VALID [2018-11-23 12:05:38,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {9960#false} assume 0 == ~cond; {9960#false} is VALID [2018-11-23 12:05:38,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {9960#false} assume !false; {9960#false} is VALID [2018-11-23 12:05:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:38,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:38,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:38,735 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:38,793 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 12:05:38,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:38,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:39,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {9959#true} call ULTIMATE.init(); {9959#true} is VALID [2018-11-23 12:05:39,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {9959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9959#true} is VALID [2018-11-23 12:05:39,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {9959#true} assume true; {9959#true} is VALID [2018-11-23 12:05:39,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9959#true} {9959#true} #55#return; {9959#true} is VALID [2018-11-23 12:05:39,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {9959#true} call #t~ret4 := main(); {9959#true} is VALID [2018-11-23 12:05:39,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {9959#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {10003#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:39,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {10003#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10003#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:39,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {10003#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10003#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:39,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {10003#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:39,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {9962#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:39,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {9962#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:39,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {9962#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:39,054 INFO L273 TraceCheckUtils]: 12: Hoare triple {9963#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:39,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {9963#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:39,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {9963#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:39,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {9964#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:39,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {9964#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:39,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {9964#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:39,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {9965#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:39,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {9965#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:39,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {9965#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:39,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {9966#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:39,060 INFO L273 TraceCheckUtils]: 22: Hoare triple {9966#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:39,061 INFO L273 TraceCheckUtils]: 23: Hoare triple {9966#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:39,061 INFO L273 TraceCheckUtils]: 24: Hoare triple {9967#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:39,062 INFO L273 TraceCheckUtils]: 25: Hoare triple {9967#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:39,062 INFO L273 TraceCheckUtils]: 26: Hoare triple {9967#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:39,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {9968#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:39,063 INFO L273 TraceCheckUtils]: 28: Hoare triple {9968#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:39,064 INFO L273 TraceCheckUtils]: 29: Hoare triple {9968#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:39,065 INFO L273 TraceCheckUtils]: 30: Hoare triple {9969#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:39,065 INFO L273 TraceCheckUtils]: 31: Hoare triple {9969#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:39,066 INFO L273 TraceCheckUtils]: 32: Hoare triple {9969#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:39,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {9970#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:39,067 INFO L273 TraceCheckUtils]: 34: Hoare triple {9970#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:39,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {9970#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:39,068 INFO L273 TraceCheckUtils]: 36: Hoare triple {9971#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:39,069 INFO L273 TraceCheckUtils]: 37: Hoare triple {9971#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:39,069 INFO L273 TraceCheckUtils]: 38: Hoare triple {9971#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:39,070 INFO L273 TraceCheckUtils]: 39: Hoare triple {9972#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:39,070 INFO L273 TraceCheckUtils]: 40: Hoare triple {9972#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:39,071 INFO L273 TraceCheckUtils]: 41: Hoare triple {9972#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:39,072 INFO L273 TraceCheckUtils]: 42: Hoare triple {9973#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:39,072 INFO L273 TraceCheckUtils]: 43: Hoare triple {9973#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:39,073 INFO L273 TraceCheckUtils]: 44: Hoare triple {9973#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:39,073 INFO L273 TraceCheckUtils]: 45: Hoare triple {9974#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:39,074 INFO L273 TraceCheckUtils]: 46: Hoare triple {9974#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:39,075 INFO L273 TraceCheckUtils]: 47: Hoare triple {9974#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:39,075 INFO L273 TraceCheckUtils]: 48: Hoare triple {9975#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:39,076 INFO L273 TraceCheckUtils]: 49: Hoare triple {9975#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:39,076 INFO L273 TraceCheckUtils]: 50: Hoare triple {9975#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:39,077 INFO L273 TraceCheckUtils]: 51: Hoare triple {9976#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:39,077 INFO L273 TraceCheckUtils]: 52: Hoare triple {9976#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:39,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {9976#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:39,079 INFO L273 TraceCheckUtils]: 54: Hoare triple {9977#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:39,079 INFO L273 TraceCheckUtils]: 55: Hoare triple {9977#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:39,080 INFO L273 TraceCheckUtils]: 56: Hoare triple {9977#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:39,080 INFO L273 TraceCheckUtils]: 57: Hoare triple {9978#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:39,081 INFO L273 TraceCheckUtils]: 58: Hoare triple {9978#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:39,082 INFO L273 TraceCheckUtils]: 59: Hoare triple {9978#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:39,082 INFO L273 TraceCheckUtils]: 60: Hoare triple {9979#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:39,082 INFO L273 TraceCheckUtils]: 61: Hoare triple {9979#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:39,083 INFO L273 TraceCheckUtils]: 62: Hoare triple {9979#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:39,084 INFO L273 TraceCheckUtils]: 63: Hoare triple {9980#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:39,084 INFO L273 TraceCheckUtils]: 64: Hoare triple {9980#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:39,085 INFO L273 TraceCheckUtils]: 65: Hoare triple {9980#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:39,085 INFO L273 TraceCheckUtils]: 66: Hoare triple {9981#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:39,086 INFO L273 TraceCheckUtils]: 67: Hoare triple {9981#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:39,086 INFO L273 TraceCheckUtils]: 68: Hoare triple {9981#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:39,087 INFO L273 TraceCheckUtils]: 69: Hoare triple {9982#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:39,087 INFO L273 TraceCheckUtils]: 70: Hoare triple {9982#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:39,088 INFO L273 TraceCheckUtils]: 71: Hoare triple {9982#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:39,089 INFO L273 TraceCheckUtils]: 72: Hoare triple {9983#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:39,089 INFO L273 TraceCheckUtils]: 73: Hoare triple {9983#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:39,090 INFO L273 TraceCheckUtils]: 74: Hoare triple {9983#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {9984#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:39,090 INFO L273 TraceCheckUtils]: 75: Hoare triple {9984#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9960#false} is VALID [2018-11-23 12:05:39,091 INFO L273 TraceCheckUtils]: 76: Hoare triple {9960#false} havoc ~x~0;~x~0 := 0; {9960#false} is VALID [2018-11-23 12:05:39,091 INFO L273 TraceCheckUtils]: 77: Hoare triple {9960#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9960#false} is VALID [2018-11-23 12:05:39,091 INFO L256 TraceCheckUtils]: 78: Hoare triple {9960#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {9960#false} is VALID [2018-11-23 12:05:39,091 INFO L273 TraceCheckUtils]: 79: Hoare triple {9960#false} ~cond := #in~cond; {9960#false} is VALID [2018-11-23 12:05:39,092 INFO L273 TraceCheckUtils]: 80: Hoare triple {9960#false} assume 0 == ~cond; {9960#false} is VALID [2018-11-23 12:05:39,092 INFO L273 TraceCheckUtils]: 81: Hoare triple {9960#false} assume !false; {9960#false} is VALID [2018-11-23 12:05:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:39,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:39,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:05:39,117 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-23 12:05:39,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:39,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:05:39,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:39,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:05:39,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:05:39,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:05:39,200 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand 27 states. [2018-11-23 12:05:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:39,474 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2018-11-23 12:05:39,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:05:39,474 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-23 12:05:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:05:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-23 12:05:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:05:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-23 12:05:39,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 130 transitions. [2018-11-23 12:05:39,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:39,609 INFO L225 Difference]: With dead ends: 103 [2018-11-23 12:05:39,610 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 12:05:39,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:05:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 12:05:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-23 12:05:39,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:39,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-23 12:05:39,630 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-23 12:05:39,630 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-23 12:05:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:39,632 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-11-23 12:05:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-23 12:05:39,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:39,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:39,633 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-23 12:05:39,633 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-23 12:05:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:39,634 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-11-23 12:05:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-23 12:05:39,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:39,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:39,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:39,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 12:05:39,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2018-11-23 12:05:39,636 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 82 [2018-11-23 12:05:39,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:39,636 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-11-23 12:05:39,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:05:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2018-11-23 12:05:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 12:05:39,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:39,637 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:39,637 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:39,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:39,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2074266041, now seen corresponding path program 24 times [2018-11-23 12:05:39,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:39,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:39,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:39,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:39,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:40,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {10675#true} call ULTIMATE.init(); {10675#true} is VALID [2018-11-23 12:05:40,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {10675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10675#true} is VALID [2018-11-23 12:05:40,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {10675#true} assume true; {10675#true} is VALID [2018-11-23 12:05:40,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10675#true} {10675#true} #55#return; {10675#true} is VALID [2018-11-23 12:05:40,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {10675#true} call #t~ret4 := main(); {10675#true} is VALID [2018-11-23 12:05:40,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {10675#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {10677#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {10677#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10677#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {10677#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10677#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {10677#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {10678#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {10678#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {10678#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {10679#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {10679#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {10679#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,635 INFO L273 TraceCheckUtils]: 15: Hoare triple {10680#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {10680#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {10680#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {10681#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {10681#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {10681#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,638 INFO L273 TraceCheckUtils]: 21: Hoare triple {10682#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {10682#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {10682#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,640 INFO L273 TraceCheckUtils]: 24: Hoare triple {10683#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {10683#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {10683#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {10684#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,642 INFO L273 TraceCheckUtils]: 28: Hoare triple {10684#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {10684#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {10685#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,644 INFO L273 TraceCheckUtils]: 31: Hoare triple {10685#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,645 INFO L273 TraceCheckUtils]: 32: Hoare triple {10685#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,645 INFO L273 TraceCheckUtils]: 33: Hoare triple {10686#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,646 INFO L273 TraceCheckUtils]: 34: Hoare triple {10686#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,646 INFO L273 TraceCheckUtils]: 35: Hoare triple {10686#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,647 INFO L273 TraceCheckUtils]: 36: Hoare triple {10687#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {10687#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,648 INFO L273 TraceCheckUtils]: 38: Hoare triple {10687#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,649 INFO L273 TraceCheckUtils]: 39: Hoare triple {10688#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {10688#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,650 INFO L273 TraceCheckUtils]: 41: Hoare triple {10688#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,650 INFO L273 TraceCheckUtils]: 42: Hoare triple {10689#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,651 INFO L273 TraceCheckUtils]: 43: Hoare triple {10689#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,652 INFO L273 TraceCheckUtils]: 44: Hoare triple {10689#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,652 INFO L273 TraceCheckUtils]: 45: Hoare triple {10690#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,653 INFO L273 TraceCheckUtils]: 46: Hoare triple {10690#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {10690#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,654 INFO L273 TraceCheckUtils]: 48: Hoare triple {10691#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,654 INFO L273 TraceCheckUtils]: 49: Hoare triple {10691#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,655 INFO L273 TraceCheckUtils]: 50: Hoare triple {10691#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:40,656 INFO L273 TraceCheckUtils]: 51: Hoare triple {10692#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:40,656 INFO L273 TraceCheckUtils]: 52: Hoare triple {10692#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:40,657 INFO L273 TraceCheckUtils]: 53: Hoare triple {10692#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:40,657 INFO L273 TraceCheckUtils]: 54: Hoare triple {10693#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:40,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {10693#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:40,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {10693#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:40,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {10694#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:40,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {10694#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:40,660 INFO L273 TraceCheckUtils]: 59: Hoare triple {10694#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:40,661 INFO L273 TraceCheckUtils]: 60: Hoare triple {10695#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:40,661 INFO L273 TraceCheckUtils]: 61: Hoare triple {10695#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:40,662 INFO L273 TraceCheckUtils]: 62: Hoare triple {10695#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:40,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {10696#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:40,663 INFO L273 TraceCheckUtils]: 64: Hoare triple {10696#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:40,664 INFO L273 TraceCheckUtils]: 65: Hoare triple {10696#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:40,664 INFO L273 TraceCheckUtils]: 66: Hoare triple {10697#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:40,665 INFO L273 TraceCheckUtils]: 67: Hoare triple {10697#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:40,665 INFO L273 TraceCheckUtils]: 68: Hoare triple {10697#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:40,666 INFO L273 TraceCheckUtils]: 69: Hoare triple {10698#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:40,666 INFO L273 TraceCheckUtils]: 70: Hoare triple {10698#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:40,667 INFO L273 TraceCheckUtils]: 71: Hoare triple {10698#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:40,668 INFO L273 TraceCheckUtils]: 72: Hoare triple {10699#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:40,668 INFO L273 TraceCheckUtils]: 73: Hoare triple {10699#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:40,669 INFO L273 TraceCheckUtils]: 74: Hoare triple {10699#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:40,669 INFO L273 TraceCheckUtils]: 75: Hoare triple {10700#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:40,670 INFO L273 TraceCheckUtils]: 76: Hoare triple {10700#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:40,671 INFO L273 TraceCheckUtils]: 77: Hoare triple {10700#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {10701#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:40,671 INFO L273 TraceCheckUtils]: 78: Hoare triple {10701#(<= main_~i~0 24)} assume !(~i~0 < 100000); {10676#false} is VALID [2018-11-23 12:05:40,672 INFO L273 TraceCheckUtils]: 79: Hoare triple {10676#false} havoc ~x~0;~x~0 := 0; {10676#false} is VALID [2018-11-23 12:05:40,672 INFO L273 TraceCheckUtils]: 80: Hoare triple {10676#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10676#false} is VALID [2018-11-23 12:05:40,672 INFO L256 TraceCheckUtils]: 81: Hoare triple {10676#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {10676#false} is VALID [2018-11-23 12:05:40,672 INFO L273 TraceCheckUtils]: 82: Hoare triple {10676#false} ~cond := #in~cond; {10676#false} is VALID [2018-11-23 12:05:40,672 INFO L273 TraceCheckUtils]: 83: Hoare triple {10676#false} assume 0 == ~cond; {10676#false} is VALID [2018-11-23 12:05:40,672 INFO L273 TraceCheckUtils]: 84: Hoare triple {10676#false} assume !false; {10676#false} is VALID [2018-11-23 12:05:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:40,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:40,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:40,686 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:40,741 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 12:05:40,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:40,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:40,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {10675#true} call ULTIMATE.init(); {10675#true} is VALID [2018-11-23 12:05:40,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {10675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10675#true} is VALID [2018-11-23 12:05:40,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {10675#true} assume true; {10675#true} is VALID [2018-11-23 12:05:40,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10675#true} {10675#true} #55#return; {10675#true} is VALID [2018-11-23 12:05:40,988 INFO L256 TraceCheckUtils]: 4: Hoare triple {10675#true} call #t~ret4 := main(); {10675#true} is VALID [2018-11-23 12:05:40,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {10675#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {10720#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:40,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {10720#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10720#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:40,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {10720#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10720#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:40,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {10720#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {10678#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {10678#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,991 INFO L273 TraceCheckUtils]: 11: Hoare triple {10678#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {10679#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {10679#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {10679#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {10680#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {10680#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {10680#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,995 INFO L273 TraceCheckUtils]: 18: Hoare triple {10681#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,996 INFO L273 TraceCheckUtils]: 19: Hoare triple {10681#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,996 INFO L273 TraceCheckUtils]: 20: Hoare triple {10681#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,997 INFO L273 TraceCheckUtils]: 21: Hoare triple {10682#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {10682#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,998 INFO L273 TraceCheckUtils]: 23: Hoare triple {10682#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,999 INFO L273 TraceCheckUtils]: 24: Hoare triple {10683#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {10683#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:41,000 INFO L273 TraceCheckUtils]: 26: Hoare triple {10683#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:41,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {10684#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:41,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {10684#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:41,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {10684#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:41,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {10685#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:41,003 INFO L273 TraceCheckUtils]: 31: Hoare triple {10685#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:41,003 INFO L273 TraceCheckUtils]: 32: Hoare triple {10685#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:41,004 INFO L273 TraceCheckUtils]: 33: Hoare triple {10686#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:41,005 INFO L273 TraceCheckUtils]: 34: Hoare triple {10686#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:41,005 INFO L273 TraceCheckUtils]: 35: Hoare triple {10686#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:41,006 INFO L273 TraceCheckUtils]: 36: Hoare triple {10687#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:41,006 INFO L273 TraceCheckUtils]: 37: Hoare triple {10687#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:41,007 INFO L273 TraceCheckUtils]: 38: Hoare triple {10687#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:41,008 INFO L273 TraceCheckUtils]: 39: Hoare triple {10688#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:41,008 INFO L273 TraceCheckUtils]: 40: Hoare triple {10688#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:41,009 INFO L273 TraceCheckUtils]: 41: Hoare triple {10688#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:41,009 INFO L273 TraceCheckUtils]: 42: Hoare triple {10689#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:41,010 INFO L273 TraceCheckUtils]: 43: Hoare triple {10689#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:41,011 INFO L273 TraceCheckUtils]: 44: Hoare triple {10689#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:41,011 INFO L273 TraceCheckUtils]: 45: Hoare triple {10690#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:41,012 INFO L273 TraceCheckUtils]: 46: Hoare triple {10690#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:41,012 INFO L273 TraceCheckUtils]: 47: Hoare triple {10690#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:41,013 INFO L273 TraceCheckUtils]: 48: Hoare triple {10691#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:41,013 INFO L273 TraceCheckUtils]: 49: Hoare triple {10691#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:41,014 INFO L273 TraceCheckUtils]: 50: Hoare triple {10691#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:41,015 INFO L273 TraceCheckUtils]: 51: Hoare triple {10692#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:41,015 INFO L273 TraceCheckUtils]: 52: Hoare triple {10692#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:41,016 INFO L273 TraceCheckUtils]: 53: Hoare triple {10692#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:41,016 INFO L273 TraceCheckUtils]: 54: Hoare triple {10693#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:41,017 INFO L273 TraceCheckUtils]: 55: Hoare triple {10693#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:41,018 INFO L273 TraceCheckUtils]: 56: Hoare triple {10693#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:41,018 INFO L273 TraceCheckUtils]: 57: Hoare triple {10694#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:41,019 INFO L273 TraceCheckUtils]: 58: Hoare triple {10694#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:41,019 INFO L273 TraceCheckUtils]: 59: Hoare triple {10694#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:41,020 INFO L273 TraceCheckUtils]: 60: Hoare triple {10695#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:41,020 INFO L273 TraceCheckUtils]: 61: Hoare triple {10695#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:41,021 INFO L273 TraceCheckUtils]: 62: Hoare triple {10695#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:41,022 INFO L273 TraceCheckUtils]: 63: Hoare triple {10696#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:41,022 INFO L273 TraceCheckUtils]: 64: Hoare triple {10696#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:41,023 INFO L273 TraceCheckUtils]: 65: Hoare triple {10696#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:41,024 INFO L273 TraceCheckUtils]: 66: Hoare triple {10697#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:41,024 INFO L273 TraceCheckUtils]: 67: Hoare triple {10697#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:41,025 INFO L273 TraceCheckUtils]: 68: Hoare triple {10697#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:41,025 INFO L273 TraceCheckUtils]: 69: Hoare triple {10698#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:41,026 INFO L273 TraceCheckUtils]: 70: Hoare triple {10698#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:41,027 INFO L273 TraceCheckUtils]: 71: Hoare triple {10698#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:41,027 INFO L273 TraceCheckUtils]: 72: Hoare triple {10699#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:41,028 INFO L273 TraceCheckUtils]: 73: Hoare triple {10699#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:41,028 INFO L273 TraceCheckUtils]: 74: Hoare triple {10699#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:41,029 INFO L273 TraceCheckUtils]: 75: Hoare triple {10700#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:41,029 INFO L273 TraceCheckUtils]: 76: Hoare triple {10700#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:41,030 INFO L273 TraceCheckUtils]: 77: Hoare triple {10700#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {10701#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:41,031 INFO L273 TraceCheckUtils]: 78: Hoare triple {10701#(<= main_~i~0 24)} assume !(~i~0 < 100000); {10676#false} is VALID [2018-11-23 12:05:41,031 INFO L273 TraceCheckUtils]: 79: Hoare triple {10676#false} havoc ~x~0;~x~0 := 0; {10676#false} is VALID [2018-11-23 12:05:41,031 INFO L273 TraceCheckUtils]: 80: Hoare triple {10676#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10676#false} is VALID [2018-11-23 12:05:41,031 INFO L256 TraceCheckUtils]: 81: Hoare triple {10676#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {10676#false} is VALID [2018-11-23 12:05:41,032 INFO L273 TraceCheckUtils]: 82: Hoare triple {10676#false} ~cond := #in~cond; {10676#false} is VALID [2018-11-23 12:05:41,032 INFO L273 TraceCheckUtils]: 83: Hoare triple {10676#false} assume 0 == ~cond; {10676#false} is VALID [2018-11-23 12:05:41,032 INFO L273 TraceCheckUtils]: 84: Hoare triple {10676#false} assume !false; {10676#false} is VALID [2018-11-23 12:05:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:41,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:41,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 12:05:41,059 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-23 12:05:41,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:41,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:05:41,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:41,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:05:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:05:41,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:05:41,147 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand 28 states. [2018-11-23 12:05:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:41,815 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2018-11-23 12:05:41,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:05:41,815 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-23 12:05:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:05:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 134 transitions. [2018-11-23 12:05:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:05:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 134 transitions. [2018-11-23 12:05:41,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 134 transitions. [2018-11-23 12:05:41,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:41,960 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:05:41,960 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:05:41,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:05:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:05:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:05:41,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:41,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:05:41,989 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:05:41,989 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:05:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:41,991 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-23 12:05:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 12:05:41,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:41,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:41,992 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:05:41,992 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:05:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:41,994 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-23 12:05:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 12:05:41,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:41,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:41,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:41,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:05:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 119 transitions. [2018-11-23 12:05:41,997 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 119 transitions. Word has length 85 [2018-11-23 12:05:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:41,998 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 119 transitions. [2018-11-23 12:05:41,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:05:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2018-11-23 12:05:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 12:05:41,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:41,999 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:41,999 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:41,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:41,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1810505699, now seen corresponding path program 25 times [2018-11-23 12:05:41,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:41,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:42,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:42,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:42,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:43,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {11415#true} call ULTIMATE.init(); {11415#true} is VALID [2018-11-23 12:05:43,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {11415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11415#true} is VALID [2018-11-23 12:05:43,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {11415#true} assume true; {11415#true} is VALID [2018-11-23 12:05:43,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11415#true} {11415#true} #55#return; {11415#true} is VALID [2018-11-23 12:05:43,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {11415#true} call #t~ret4 := main(); {11415#true} is VALID [2018-11-23 12:05:43,240 INFO L273 TraceCheckUtils]: 5: Hoare triple {11415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {11417#(= main_~i~0 0)} is VALID [2018-11-23 12:05:43,241 INFO L273 TraceCheckUtils]: 6: Hoare triple {11417#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11417#(= main_~i~0 0)} is VALID [2018-11-23 12:05:43,241 INFO L273 TraceCheckUtils]: 7: Hoare triple {11417#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11417#(= main_~i~0 0)} is VALID [2018-11-23 12:05:43,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {11417#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,242 INFO L273 TraceCheckUtils]: 9: Hoare triple {11418#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {11418#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {11418#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {11419#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {11419#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {11419#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,244 INFO L273 TraceCheckUtils]: 15: Hoare triple {11420#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {11420#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {11420#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,246 INFO L273 TraceCheckUtils]: 18: Hoare triple {11421#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,246 INFO L273 TraceCheckUtils]: 19: Hoare triple {11421#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {11421#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,247 INFO L273 TraceCheckUtils]: 21: Hoare triple {11422#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {11422#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {11422#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {11423#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,250 INFO L273 TraceCheckUtils]: 25: Hoare triple {11423#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,250 INFO L273 TraceCheckUtils]: 26: Hoare triple {11423#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {11424#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,251 INFO L273 TraceCheckUtils]: 28: Hoare triple {11424#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {11424#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {11425#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,253 INFO L273 TraceCheckUtils]: 31: Hoare triple {11425#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,254 INFO L273 TraceCheckUtils]: 32: Hoare triple {11425#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,254 INFO L273 TraceCheckUtils]: 33: Hoare triple {11426#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,255 INFO L273 TraceCheckUtils]: 34: Hoare triple {11426#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,255 INFO L273 TraceCheckUtils]: 35: Hoare triple {11426#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,256 INFO L273 TraceCheckUtils]: 36: Hoare triple {11427#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,256 INFO L273 TraceCheckUtils]: 37: Hoare triple {11427#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,257 INFO L273 TraceCheckUtils]: 38: Hoare triple {11427#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,257 INFO L273 TraceCheckUtils]: 39: Hoare triple {11428#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,258 INFO L273 TraceCheckUtils]: 40: Hoare triple {11428#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,259 INFO L273 TraceCheckUtils]: 41: Hoare triple {11428#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,259 INFO L273 TraceCheckUtils]: 42: Hoare triple {11429#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,260 INFO L273 TraceCheckUtils]: 43: Hoare triple {11429#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {11429#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,261 INFO L273 TraceCheckUtils]: 45: Hoare triple {11430#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,261 INFO L273 TraceCheckUtils]: 46: Hoare triple {11430#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,262 INFO L273 TraceCheckUtils]: 47: Hoare triple {11430#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,262 INFO L273 TraceCheckUtils]: 48: Hoare triple {11431#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,263 INFO L273 TraceCheckUtils]: 49: Hoare triple {11431#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,264 INFO L273 TraceCheckUtils]: 50: Hoare triple {11431#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:43,264 INFO L273 TraceCheckUtils]: 51: Hoare triple {11432#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:43,265 INFO L273 TraceCheckUtils]: 52: Hoare triple {11432#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:43,265 INFO L273 TraceCheckUtils]: 53: Hoare triple {11432#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:43,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {11433#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:43,266 INFO L273 TraceCheckUtils]: 55: Hoare triple {11433#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:43,267 INFO L273 TraceCheckUtils]: 56: Hoare triple {11433#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:43,267 INFO L273 TraceCheckUtils]: 57: Hoare triple {11434#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:43,268 INFO L273 TraceCheckUtils]: 58: Hoare triple {11434#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:43,269 INFO L273 TraceCheckUtils]: 59: Hoare triple {11434#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:43,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {11435#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:43,270 INFO L273 TraceCheckUtils]: 61: Hoare triple {11435#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:43,270 INFO L273 TraceCheckUtils]: 62: Hoare triple {11435#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:43,271 INFO L273 TraceCheckUtils]: 63: Hoare triple {11436#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:43,271 INFO L273 TraceCheckUtils]: 64: Hoare triple {11436#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:43,272 INFO L273 TraceCheckUtils]: 65: Hoare triple {11436#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:43,272 INFO L273 TraceCheckUtils]: 66: Hoare triple {11437#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:43,273 INFO L273 TraceCheckUtils]: 67: Hoare triple {11437#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:43,274 INFO L273 TraceCheckUtils]: 68: Hoare triple {11437#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:43,274 INFO L273 TraceCheckUtils]: 69: Hoare triple {11438#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:43,275 INFO L273 TraceCheckUtils]: 70: Hoare triple {11438#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:43,275 INFO L273 TraceCheckUtils]: 71: Hoare triple {11438#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:43,276 INFO L273 TraceCheckUtils]: 72: Hoare triple {11439#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:43,276 INFO L273 TraceCheckUtils]: 73: Hoare triple {11439#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:43,277 INFO L273 TraceCheckUtils]: 74: Hoare triple {11439#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:43,277 INFO L273 TraceCheckUtils]: 75: Hoare triple {11440#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:43,278 INFO L273 TraceCheckUtils]: 76: Hoare triple {11440#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:43,279 INFO L273 TraceCheckUtils]: 77: Hoare triple {11440#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:43,279 INFO L273 TraceCheckUtils]: 78: Hoare triple {11441#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:43,280 INFO L273 TraceCheckUtils]: 79: Hoare triple {11441#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:43,280 INFO L273 TraceCheckUtils]: 80: Hoare triple {11441#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {11442#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:43,281 INFO L273 TraceCheckUtils]: 81: Hoare triple {11442#(<= main_~i~0 25)} assume !(~i~0 < 100000); {11416#false} is VALID [2018-11-23 12:05:43,281 INFO L273 TraceCheckUtils]: 82: Hoare triple {11416#false} havoc ~x~0;~x~0 := 0; {11416#false} is VALID [2018-11-23 12:05:43,281 INFO L273 TraceCheckUtils]: 83: Hoare triple {11416#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11416#false} is VALID [2018-11-23 12:05:43,281 INFO L256 TraceCheckUtils]: 84: Hoare triple {11416#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {11416#false} is VALID [2018-11-23 12:05:43,282 INFO L273 TraceCheckUtils]: 85: Hoare triple {11416#false} ~cond := #in~cond; {11416#false} is VALID [2018-11-23 12:05:43,282 INFO L273 TraceCheckUtils]: 86: Hoare triple {11416#false} assume 0 == ~cond; {11416#false} is VALID [2018-11-23 12:05:43,282 INFO L273 TraceCheckUtils]: 87: Hoare triple {11416#false} assume !false; {11416#false} is VALID [2018-11-23 12:05:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:43,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:43,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:43,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:43,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:43,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {11415#true} call ULTIMATE.init(); {11415#true} is VALID [2018-11-23 12:05:43,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {11415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11415#true} is VALID [2018-11-23 12:05:43,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {11415#true} assume true; {11415#true} is VALID [2018-11-23 12:05:43,604 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11415#true} {11415#true} #55#return; {11415#true} is VALID [2018-11-23 12:05:43,604 INFO L256 TraceCheckUtils]: 4: Hoare triple {11415#true} call #t~ret4 := main(); {11415#true} is VALID [2018-11-23 12:05:43,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {11415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {11461#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:43,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {11461#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11461#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:43,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {11461#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11461#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:43,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {11461#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {11418#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {11418#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {11418#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {11419#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {11419#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {11419#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {11420#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {11420#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,611 INFO L273 TraceCheckUtils]: 17: Hoare triple {11420#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {11421#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,612 INFO L273 TraceCheckUtils]: 19: Hoare triple {11421#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {11421#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {11422#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {11422#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {11422#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,615 INFO L273 TraceCheckUtils]: 24: Hoare triple {11423#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {11423#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,616 INFO L273 TraceCheckUtils]: 26: Hoare triple {11423#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {11424#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {11424#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,618 INFO L273 TraceCheckUtils]: 29: Hoare triple {11424#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {11425#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,619 INFO L273 TraceCheckUtils]: 31: Hoare triple {11425#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,620 INFO L273 TraceCheckUtils]: 32: Hoare triple {11425#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {11426#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {11426#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {11426#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,622 INFO L273 TraceCheckUtils]: 36: Hoare triple {11427#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,622 INFO L273 TraceCheckUtils]: 37: Hoare triple {11427#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,623 INFO L273 TraceCheckUtils]: 38: Hoare triple {11427#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,624 INFO L273 TraceCheckUtils]: 39: Hoare triple {11428#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,624 INFO L273 TraceCheckUtils]: 40: Hoare triple {11428#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {11428#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {11429#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,626 INFO L273 TraceCheckUtils]: 43: Hoare triple {11429#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,627 INFO L273 TraceCheckUtils]: 44: Hoare triple {11429#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,627 INFO L273 TraceCheckUtils]: 45: Hoare triple {11430#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,628 INFO L273 TraceCheckUtils]: 46: Hoare triple {11430#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,628 INFO L273 TraceCheckUtils]: 47: Hoare triple {11430#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,629 INFO L273 TraceCheckUtils]: 48: Hoare triple {11431#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,630 INFO L273 TraceCheckUtils]: 49: Hoare triple {11431#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,630 INFO L273 TraceCheckUtils]: 50: Hoare triple {11431#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:43,631 INFO L273 TraceCheckUtils]: 51: Hoare triple {11432#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:43,631 INFO L273 TraceCheckUtils]: 52: Hoare triple {11432#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:43,632 INFO L273 TraceCheckUtils]: 53: Hoare triple {11432#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:43,633 INFO L273 TraceCheckUtils]: 54: Hoare triple {11433#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:43,633 INFO L273 TraceCheckUtils]: 55: Hoare triple {11433#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:43,634 INFO L273 TraceCheckUtils]: 56: Hoare triple {11433#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:43,634 INFO L273 TraceCheckUtils]: 57: Hoare triple {11434#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:43,635 INFO L273 TraceCheckUtils]: 58: Hoare triple {11434#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:43,636 INFO L273 TraceCheckUtils]: 59: Hoare triple {11434#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:43,636 INFO L273 TraceCheckUtils]: 60: Hoare triple {11435#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:43,637 INFO L273 TraceCheckUtils]: 61: Hoare triple {11435#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:43,637 INFO L273 TraceCheckUtils]: 62: Hoare triple {11435#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:43,638 INFO L273 TraceCheckUtils]: 63: Hoare triple {11436#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:43,638 INFO L273 TraceCheckUtils]: 64: Hoare triple {11436#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:43,639 INFO L273 TraceCheckUtils]: 65: Hoare triple {11436#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:43,640 INFO L273 TraceCheckUtils]: 66: Hoare triple {11437#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:43,640 INFO L273 TraceCheckUtils]: 67: Hoare triple {11437#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:43,641 INFO L273 TraceCheckUtils]: 68: Hoare triple {11437#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:43,641 INFO L273 TraceCheckUtils]: 69: Hoare triple {11438#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:43,642 INFO L273 TraceCheckUtils]: 70: Hoare triple {11438#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:43,643 INFO L273 TraceCheckUtils]: 71: Hoare triple {11438#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:43,643 INFO L273 TraceCheckUtils]: 72: Hoare triple {11439#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:43,644 INFO L273 TraceCheckUtils]: 73: Hoare triple {11439#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:43,644 INFO L273 TraceCheckUtils]: 74: Hoare triple {11439#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:43,645 INFO L273 TraceCheckUtils]: 75: Hoare triple {11440#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:43,645 INFO L273 TraceCheckUtils]: 76: Hoare triple {11440#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:43,646 INFO L273 TraceCheckUtils]: 77: Hoare triple {11440#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:43,647 INFO L273 TraceCheckUtils]: 78: Hoare triple {11441#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:43,647 INFO L273 TraceCheckUtils]: 79: Hoare triple {11441#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:43,648 INFO L273 TraceCheckUtils]: 80: Hoare triple {11441#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {11442#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:43,649 INFO L273 TraceCheckUtils]: 81: Hoare triple {11442#(<= main_~i~0 25)} assume !(~i~0 < 100000); {11416#false} is VALID [2018-11-23 12:05:43,649 INFO L273 TraceCheckUtils]: 82: Hoare triple {11416#false} havoc ~x~0;~x~0 := 0; {11416#false} is VALID [2018-11-23 12:05:43,649 INFO L273 TraceCheckUtils]: 83: Hoare triple {11416#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11416#false} is VALID [2018-11-23 12:05:43,649 INFO L256 TraceCheckUtils]: 84: Hoare triple {11416#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {11416#false} is VALID [2018-11-23 12:05:43,650 INFO L273 TraceCheckUtils]: 85: Hoare triple {11416#false} ~cond := #in~cond; {11416#false} is VALID [2018-11-23 12:05:43,650 INFO L273 TraceCheckUtils]: 86: Hoare triple {11416#false} assume 0 == ~cond; {11416#false} is VALID [2018-11-23 12:05:43,650 INFO L273 TraceCheckUtils]: 87: Hoare triple {11416#false} assume !false; {11416#false} is VALID [2018-11-23 12:05:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:43,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:43,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:05:43,675 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-23 12:05:43,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:43,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:05:43,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:43,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:05:43,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:05:43,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:05:43,764 INFO L87 Difference]: Start difference. First operand 93 states and 119 transitions. Second operand 29 states. [2018-11-23 12:05:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:44,377 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2018-11-23 12:05:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:05:44,377 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-23 12:05:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:05:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2018-11-23 12:05:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:05:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2018-11-23 12:05:44,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 138 transitions. [2018-11-23 12:05:44,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:44,503 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:05:44,503 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 12:05:44,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:05:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 12:05:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-23 12:05:44,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:44,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2018-11-23 12:05:44,537 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2018-11-23 12:05:44,537 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2018-11-23 12:05:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:44,540 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2018-11-23 12:05:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-11-23 12:05:44,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:44,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:44,540 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2018-11-23 12:05:44,540 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2018-11-23 12:05:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:44,541 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2018-11-23 12:05:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-11-23 12:05:44,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:44,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:44,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:44,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:05:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2018-11-23 12:05:44,543 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 88 [2018-11-23 12:05:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:44,543 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2018-11-23 12:05:44,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:05:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2018-11-23 12:05:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:05:44,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:44,544 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:44,544 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:44,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:44,545 INFO L82 PathProgramCache]: Analyzing trace with hash -378658439, now seen corresponding path program 26 times [2018-11-23 12:05:44,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:44,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:44,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:44,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:44,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:45,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {12179#true} call ULTIMATE.init(); {12179#true} is VALID [2018-11-23 12:05:45,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {12179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12179#true} is VALID [2018-11-23 12:05:45,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {12179#true} assume true; {12179#true} is VALID [2018-11-23 12:05:45,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12179#true} {12179#true} #55#return; {12179#true} is VALID [2018-11-23 12:05:45,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {12179#true} call #t~ret4 := main(); {12179#true} is VALID [2018-11-23 12:05:45,601 INFO L273 TraceCheckUtils]: 5: Hoare triple {12179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {12181#(= main_~i~0 0)} is VALID [2018-11-23 12:05:45,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {12181#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12181#(= main_~i~0 0)} is VALID [2018-11-23 12:05:45,602 INFO L273 TraceCheckUtils]: 7: Hoare triple {12181#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12181#(= main_~i~0 0)} is VALID [2018-11-23 12:05:45,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {12181#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {12182#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {12182#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {12182#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {12183#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {12183#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {12183#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {12184#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {12184#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {12184#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {12185#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {12185#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {12185#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {12186#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {12186#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {12186#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {12187#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {12187#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {12187#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {12188#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,613 INFO L273 TraceCheckUtils]: 28: Hoare triple {12188#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {12188#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,614 INFO L273 TraceCheckUtils]: 30: Hoare triple {12189#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {12189#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,615 INFO L273 TraceCheckUtils]: 32: Hoare triple {12189#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {12190#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {12190#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,617 INFO L273 TraceCheckUtils]: 35: Hoare triple {12190#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,618 INFO L273 TraceCheckUtils]: 36: Hoare triple {12191#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,618 INFO L273 TraceCheckUtils]: 37: Hoare triple {12191#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,619 INFO L273 TraceCheckUtils]: 38: Hoare triple {12191#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,619 INFO L273 TraceCheckUtils]: 39: Hoare triple {12192#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,620 INFO L273 TraceCheckUtils]: 40: Hoare triple {12192#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,620 INFO L273 TraceCheckUtils]: 41: Hoare triple {12192#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,621 INFO L273 TraceCheckUtils]: 42: Hoare triple {12193#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,621 INFO L273 TraceCheckUtils]: 43: Hoare triple {12193#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,622 INFO L273 TraceCheckUtils]: 44: Hoare triple {12193#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,623 INFO L273 TraceCheckUtils]: 45: Hoare triple {12194#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {12194#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,624 INFO L273 TraceCheckUtils]: 47: Hoare triple {12194#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,624 INFO L273 TraceCheckUtils]: 48: Hoare triple {12195#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,625 INFO L273 TraceCheckUtils]: 49: Hoare triple {12195#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,625 INFO L273 TraceCheckUtils]: 50: Hoare triple {12195#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,626 INFO L273 TraceCheckUtils]: 51: Hoare triple {12196#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,626 INFO L273 TraceCheckUtils]: 52: Hoare triple {12196#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,627 INFO L273 TraceCheckUtils]: 53: Hoare triple {12196#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:45,627 INFO L273 TraceCheckUtils]: 54: Hoare triple {12197#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:45,628 INFO L273 TraceCheckUtils]: 55: Hoare triple {12197#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:45,629 INFO L273 TraceCheckUtils]: 56: Hoare triple {12197#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:45,629 INFO L273 TraceCheckUtils]: 57: Hoare triple {12198#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:45,630 INFO L273 TraceCheckUtils]: 58: Hoare triple {12198#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:45,630 INFO L273 TraceCheckUtils]: 59: Hoare triple {12198#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:45,631 INFO L273 TraceCheckUtils]: 60: Hoare triple {12199#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:45,631 INFO L273 TraceCheckUtils]: 61: Hoare triple {12199#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:45,634 INFO L273 TraceCheckUtils]: 62: Hoare triple {12199#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:45,635 INFO L273 TraceCheckUtils]: 63: Hoare triple {12200#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:45,635 INFO L273 TraceCheckUtils]: 64: Hoare triple {12200#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:45,635 INFO L273 TraceCheckUtils]: 65: Hoare triple {12200#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:45,636 INFO L273 TraceCheckUtils]: 66: Hoare triple {12201#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:45,636 INFO L273 TraceCheckUtils]: 67: Hoare triple {12201#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:45,636 INFO L273 TraceCheckUtils]: 68: Hoare triple {12201#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:45,637 INFO L273 TraceCheckUtils]: 69: Hoare triple {12202#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:45,637 INFO L273 TraceCheckUtils]: 70: Hoare triple {12202#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:45,638 INFO L273 TraceCheckUtils]: 71: Hoare triple {12202#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:45,638 INFO L273 TraceCheckUtils]: 72: Hoare triple {12203#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:45,639 INFO L273 TraceCheckUtils]: 73: Hoare triple {12203#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:45,640 INFO L273 TraceCheckUtils]: 74: Hoare triple {12203#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:45,640 INFO L273 TraceCheckUtils]: 75: Hoare triple {12204#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:45,641 INFO L273 TraceCheckUtils]: 76: Hoare triple {12204#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:45,641 INFO L273 TraceCheckUtils]: 77: Hoare triple {12204#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:45,642 INFO L273 TraceCheckUtils]: 78: Hoare triple {12205#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:45,642 INFO L273 TraceCheckUtils]: 79: Hoare triple {12205#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:45,643 INFO L273 TraceCheckUtils]: 80: Hoare triple {12205#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:45,643 INFO L273 TraceCheckUtils]: 81: Hoare triple {12206#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:45,644 INFO L273 TraceCheckUtils]: 82: Hoare triple {12206#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:45,645 INFO L273 TraceCheckUtils]: 83: Hoare triple {12206#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12207#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:45,645 INFO L273 TraceCheckUtils]: 84: Hoare triple {12207#(<= main_~i~0 26)} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:05:45,645 INFO L273 TraceCheckUtils]: 85: Hoare triple {12180#false} havoc ~x~0;~x~0 := 0; {12180#false} is VALID [2018-11-23 12:05:45,646 INFO L273 TraceCheckUtils]: 86: Hoare triple {12180#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12180#false} is VALID [2018-11-23 12:05:45,646 INFO L256 TraceCheckUtils]: 87: Hoare triple {12180#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {12180#false} is VALID [2018-11-23 12:05:45,646 INFO L273 TraceCheckUtils]: 88: Hoare triple {12180#false} ~cond := #in~cond; {12180#false} is VALID [2018-11-23 12:05:45,646 INFO L273 TraceCheckUtils]: 89: Hoare triple {12180#false} assume 0 == ~cond; {12180#false} is VALID [2018-11-23 12:05:45,646 INFO L273 TraceCheckUtils]: 90: Hoare triple {12180#false} assume !false; {12180#false} is VALID [2018-11-23 12:05:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:45,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:45,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:45,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:45,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:45,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:45,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:45,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {12179#true} call ULTIMATE.init(); {12179#true} is VALID [2018-11-23 12:05:45,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {12179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12179#true} is VALID [2018-11-23 12:05:45,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {12179#true} assume true; {12179#true} is VALID [2018-11-23 12:05:45,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12179#true} {12179#true} #55#return; {12179#true} is VALID [2018-11-23 12:05:45,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {12179#true} call #t~ret4 := main(); {12179#true} is VALID [2018-11-23 12:05:45,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {12179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {12226#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:45,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {12226#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12226#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:45,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {12226#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12226#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:45,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {12226#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,958 INFO L273 TraceCheckUtils]: 9: Hoare triple {12182#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {12182#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {12182#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {12183#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {12183#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {12183#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {12184#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {12184#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {12184#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {12185#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {12185#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {12185#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {12186#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,964 INFO L273 TraceCheckUtils]: 22: Hoare triple {12186#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,967 INFO L273 TraceCheckUtils]: 23: Hoare triple {12186#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,967 INFO L273 TraceCheckUtils]: 24: Hoare triple {12187#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,968 INFO L273 TraceCheckUtils]: 25: Hoare triple {12187#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,968 INFO L273 TraceCheckUtils]: 26: Hoare triple {12187#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,968 INFO L273 TraceCheckUtils]: 27: Hoare triple {12188#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,969 INFO L273 TraceCheckUtils]: 28: Hoare triple {12188#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {12188#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,970 INFO L273 TraceCheckUtils]: 30: Hoare triple {12189#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {12189#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,970 INFO L273 TraceCheckUtils]: 32: Hoare triple {12189#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {12190#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,971 INFO L273 TraceCheckUtils]: 34: Hoare triple {12190#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {12190#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {12191#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,976 INFO L273 TraceCheckUtils]: 37: Hoare triple {12191#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {12191#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,976 INFO L273 TraceCheckUtils]: 39: Hoare triple {12192#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,977 INFO L273 TraceCheckUtils]: 40: Hoare triple {12192#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,977 INFO L273 TraceCheckUtils]: 41: Hoare triple {12192#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,977 INFO L273 TraceCheckUtils]: 42: Hoare triple {12193#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,978 INFO L273 TraceCheckUtils]: 43: Hoare triple {12193#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,978 INFO L273 TraceCheckUtils]: 44: Hoare triple {12193#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,979 INFO L273 TraceCheckUtils]: 45: Hoare triple {12194#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {12194#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,979 INFO L273 TraceCheckUtils]: 47: Hoare triple {12194#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,980 INFO L273 TraceCheckUtils]: 48: Hoare triple {12195#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,980 INFO L273 TraceCheckUtils]: 49: Hoare triple {12195#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,981 INFO L273 TraceCheckUtils]: 50: Hoare triple {12195#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,982 INFO L273 TraceCheckUtils]: 51: Hoare triple {12196#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,982 INFO L273 TraceCheckUtils]: 52: Hoare triple {12196#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,983 INFO L273 TraceCheckUtils]: 53: Hoare triple {12196#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:45,984 INFO L273 TraceCheckUtils]: 54: Hoare triple {12197#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:45,984 INFO L273 TraceCheckUtils]: 55: Hoare triple {12197#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:45,985 INFO L273 TraceCheckUtils]: 56: Hoare triple {12197#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:45,986 INFO L273 TraceCheckUtils]: 57: Hoare triple {12198#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:45,986 INFO L273 TraceCheckUtils]: 58: Hoare triple {12198#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:45,987 INFO L273 TraceCheckUtils]: 59: Hoare triple {12198#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:45,987 INFO L273 TraceCheckUtils]: 60: Hoare triple {12199#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:45,988 INFO L273 TraceCheckUtils]: 61: Hoare triple {12199#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:45,989 INFO L273 TraceCheckUtils]: 62: Hoare triple {12199#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:45,989 INFO L273 TraceCheckUtils]: 63: Hoare triple {12200#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:45,990 INFO L273 TraceCheckUtils]: 64: Hoare triple {12200#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:45,991 INFO L273 TraceCheckUtils]: 65: Hoare triple {12200#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:45,991 INFO L273 TraceCheckUtils]: 66: Hoare triple {12201#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:45,992 INFO L273 TraceCheckUtils]: 67: Hoare triple {12201#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:45,992 INFO L273 TraceCheckUtils]: 68: Hoare triple {12201#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:45,993 INFO L273 TraceCheckUtils]: 69: Hoare triple {12202#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:45,994 INFO L273 TraceCheckUtils]: 70: Hoare triple {12202#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:45,994 INFO L273 TraceCheckUtils]: 71: Hoare triple {12202#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:45,995 INFO L273 TraceCheckUtils]: 72: Hoare triple {12203#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:45,995 INFO L273 TraceCheckUtils]: 73: Hoare triple {12203#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:45,996 INFO L273 TraceCheckUtils]: 74: Hoare triple {12203#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:45,997 INFO L273 TraceCheckUtils]: 75: Hoare triple {12204#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:45,997 INFO L273 TraceCheckUtils]: 76: Hoare triple {12204#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:45,998 INFO L273 TraceCheckUtils]: 77: Hoare triple {12204#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:45,998 INFO L273 TraceCheckUtils]: 78: Hoare triple {12205#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:45,999 INFO L273 TraceCheckUtils]: 79: Hoare triple {12205#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:46,000 INFO L273 TraceCheckUtils]: 80: Hoare triple {12205#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:46,000 INFO L273 TraceCheckUtils]: 81: Hoare triple {12206#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:46,001 INFO L273 TraceCheckUtils]: 82: Hoare triple {12206#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:46,001 INFO L273 TraceCheckUtils]: 83: Hoare triple {12206#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12207#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:46,002 INFO L273 TraceCheckUtils]: 84: Hoare triple {12207#(<= main_~i~0 26)} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:05:46,002 INFO L273 TraceCheckUtils]: 85: Hoare triple {12180#false} havoc ~x~0;~x~0 := 0; {12180#false} is VALID [2018-11-23 12:05:46,003 INFO L273 TraceCheckUtils]: 86: Hoare triple {12180#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12180#false} is VALID [2018-11-23 12:05:46,003 INFO L256 TraceCheckUtils]: 87: Hoare triple {12180#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {12180#false} is VALID [2018-11-23 12:05:46,003 INFO L273 TraceCheckUtils]: 88: Hoare triple {12180#false} ~cond := #in~cond; {12180#false} is VALID [2018-11-23 12:05:46,003 INFO L273 TraceCheckUtils]: 89: Hoare triple {12180#false} assume 0 == ~cond; {12180#false} is VALID [2018-11-23 12:05:46,003 INFO L273 TraceCheckUtils]: 90: Hoare triple {12180#false} assume !false; {12180#false} is VALID [2018-11-23 12:05:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:46,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:46,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:05:46,028 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-23 12:05:46,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:46,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:05:46,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:46,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:05:46,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:05:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:05:46,121 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand 30 states. [2018-11-23 12:05:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:46,793 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2018-11-23 12:05:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:05:46,793 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-23 12:05:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:05:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2018-11-23 12:05:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:05:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2018-11-23 12:05:46,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 142 transitions. [2018-11-23 12:05:47,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:47,206 INFO L225 Difference]: With dead ends: 112 [2018-11-23 12:05:47,206 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:05:47,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:05:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:05:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:05:47,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:47,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:05:47,316 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:05:47,316 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:05:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:47,318 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2018-11-23 12:05:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2018-11-23 12:05:47,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:47,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:47,318 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:05:47,318 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:05:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:47,320 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2018-11-23 12:05:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2018-11-23 12:05:47,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:47,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:47,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:47,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:05:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2018-11-23 12:05:47,323 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 91 [2018-11-23 12:05:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:47,323 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2018-11-23 12:05:47,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:05:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2018-11-23 12:05:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 12:05:47,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:47,324 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:47,324 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:47,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:47,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1310896163, now seen corresponding path program 27 times [2018-11-23 12:05:47,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:47,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:47,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:47,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:47,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:48,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {12967#true} call ULTIMATE.init(); {12967#true} is VALID [2018-11-23 12:05:48,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {12967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12967#true} is VALID [2018-11-23 12:05:48,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {12967#true} assume true; {12967#true} is VALID [2018-11-23 12:05:48,031 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12967#true} {12967#true} #55#return; {12967#true} is VALID [2018-11-23 12:05:48,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {12967#true} call #t~ret4 := main(); {12967#true} is VALID [2018-11-23 12:05:48,032 INFO L273 TraceCheckUtils]: 5: Hoare triple {12967#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {12969#(= main_~i~0 0)} is VALID [2018-11-23 12:05:48,032 INFO L273 TraceCheckUtils]: 6: Hoare triple {12969#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12969#(= main_~i~0 0)} is VALID [2018-11-23 12:05:48,033 INFO L273 TraceCheckUtils]: 7: Hoare triple {12969#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12969#(= main_~i~0 0)} is VALID [2018-11-23 12:05:48,033 INFO L273 TraceCheckUtils]: 8: Hoare triple {12969#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,034 INFO L273 TraceCheckUtils]: 9: Hoare triple {12970#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,034 INFO L273 TraceCheckUtils]: 10: Hoare triple {12970#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,035 INFO L273 TraceCheckUtils]: 11: Hoare triple {12970#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {12971#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {12971#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,036 INFO L273 TraceCheckUtils]: 14: Hoare triple {12971#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {12972#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {12972#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,037 INFO L273 TraceCheckUtils]: 17: Hoare triple {12972#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,038 INFO L273 TraceCheckUtils]: 18: Hoare triple {12973#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,038 INFO L273 TraceCheckUtils]: 19: Hoare triple {12973#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {12973#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,040 INFO L273 TraceCheckUtils]: 21: Hoare triple {12974#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {12974#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {12974#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {12975#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {12975#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {12975#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {12976#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {12976#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {12976#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {12977#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {12977#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {12977#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {12978#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,047 INFO L273 TraceCheckUtils]: 34: Hoare triple {12978#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,048 INFO L273 TraceCheckUtils]: 35: Hoare triple {12978#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,049 INFO L273 TraceCheckUtils]: 36: Hoare triple {12979#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,049 INFO L273 TraceCheckUtils]: 37: Hoare triple {12979#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,050 INFO L273 TraceCheckUtils]: 38: Hoare triple {12979#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,050 INFO L273 TraceCheckUtils]: 39: Hoare triple {12980#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {12980#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,052 INFO L273 TraceCheckUtils]: 41: Hoare triple {12980#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,052 INFO L273 TraceCheckUtils]: 42: Hoare triple {12981#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {12981#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {12981#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,054 INFO L273 TraceCheckUtils]: 45: Hoare triple {12982#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {12982#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,055 INFO L273 TraceCheckUtils]: 47: Hoare triple {12982#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,056 INFO L273 TraceCheckUtils]: 48: Hoare triple {12983#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,056 INFO L273 TraceCheckUtils]: 49: Hoare triple {12983#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,057 INFO L273 TraceCheckUtils]: 50: Hoare triple {12983#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,057 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,058 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,059 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,059 INFO L273 TraceCheckUtils]: 54: Hoare triple {12985#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,060 INFO L273 TraceCheckUtils]: 55: Hoare triple {12985#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,060 INFO L273 TraceCheckUtils]: 56: Hoare triple {12985#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,061 INFO L273 TraceCheckUtils]: 57: Hoare triple {12986#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,061 INFO L273 TraceCheckUtils]: 58: Hoare triple {12986#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,062 INFO L273 TraceCheckUtils]: 59: Hoare triple {12986#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,063 INFO L273 TraceCheckUtils]: 60: Hoare triple {12987#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,063 INFO L273 TraceCheckUtils]: 61: Hoare triple {12987#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,064 INFO L273 TraceCheckUtils]: 62: Hoare triple {12987#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,065 INFO L273 TraceCheckUtils]: 63: Hoare triple {12988#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,065 INFO L273 TraceCheckUtils]: 64: Hoare triple {12988#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,066 INFO L273 TraceCheckUtils]: 65: Hoare triple {12988#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,066 INFO L273 TraceCheckUtils]: 66: Hoare triple {12989#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,067 INFO L273 TraceCheckUtils]: 67: Hoare triple {12989#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,068 INFO L273 TraceCheckUtils]: 68: Hoare triple {12989#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,068 INFO L273 TraceCheckUtils]: 69: Hoare triple {12990#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,069 INFO L273 TraceCheckUtils]: 70: Hoare triple {12990#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,069 INFO L273 TraceCheckUtils]: 71: Hoare triple {12990#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:48,070 INFO L273 TraceCheckUtils]: 72: Hoare triple {12991#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:48,070 INFO L273 TraceCheckUtils]: 73: Hoare triple {12991#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:48,071 INFO L273 TraceCheckUtils]: 74: Hoare triple {12991#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:48,072 INFO L273 TraceCheckUtils]: 75: Hoare triple {12992#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:48,072 INFO L273 TraceCheckUtils]: 76: Hoare triple {12992#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:48,073 INFO L273 TraceCheckUtils]: 77: Hoare triple {12992#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:48,073 INFO L273 TraceCheckUtils]: 78: Hoare triple {12993#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:48,074 INFO L273 TraceCheckUtils]: 79: Hoare triple {12993#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:48,075 INFO L273 TraceCheckUtils]: 80: Hoare triple {12993#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:48,075 INFO L273 TraceCheckUtils]: 81: Hoare triple {12994#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:48,076 INFO L273 TraceCheckUtils]: 82: Hoare triple {12994#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:48,076 INFO L273 TraceCheckUtils]: 83: Hoare triple {12994#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:48,077 INFO L273 TraceCheckUtils]: 84: Hoare triple {12995#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:48,077 INFO L273 TraceCheckUtils]: 85: Hoare triple {12995#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:48,078 INFO L273 TraceCheckUtils]: 86: Hoare triple {12995#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {12996#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:48,079 INFO L273 TraceCheckUtils]: 87: Hoare triple {12996#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12968#false} is VALID [2018-11-23 12:05:48,079 INFO L273 TraceCheckUtils]: 88: Hoare triple {12968#false} havoc ~x~0;~x~0 := 0; {12968#false} is VALID [2018-11-23 12:05:48,079 INFO L273 TraceCheckUtils]: 89: Hoare triple {12968#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12968#false} is VALID [2018-11-23 12:05:48,079 INFO L256 TraceCheckUtils]: 90: Hoare triple {12968#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {12968#false} is VALID [2018-11-23 12:05:48,080 INFO L273 TraceCheckUtils]: 91: Hoare triple {12968#false} ~cond := #in~cond; {12968#false} is VALID [2018-11-23 12:05:48,080 INFO L273 TraceCheckUtils]: 92: Hoare triple {12968#false} assume 0 == ~cond; {12968#false} is VALID [2018-11-23 12:05:48,080 INFO L273 TraceCheckUtils]: 93: Hoare triple {12968#false} assume !false; {12968#false} is VALID [2018-11-23 12:05:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:48,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:48,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:48,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:48,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 12:05:48,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:48,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:48,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {12967#true} call ULTIMATE.init(); {12967#true} is VALID [2018-11-23 12:05:48,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {12967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12967#true} is VALID [2018-11-23 12:05:48,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {12967#true} assume true; {12967#true} is VALID [2018-11-23 12:05:48,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12967#true} {12967#true} #55#return; {12967#true} is VALID [2018-11-23 12:05:48,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {12967#true} call #t~ret4 := main(); {12967#true} is VALID [2018-11-23 12:05:48,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {12967#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {13015#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:48,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {13015#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13015#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:48,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {13015#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13015#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:48,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {13015#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {12970#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {12970#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {12970#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {12971#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {12971#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {12971#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,397 INFO L273 TraceCheckUtils]: 15: Hoare triple {12972#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,397 INFO L273 TraceCheckUtils]: 16: Hoare triple {12972#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {12972#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {12973#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {12973#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {12973#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {12974#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {12974#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {12974#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {12975#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {12975#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {12975#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {12976#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {12976#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,405 INFO L273 TraceCheckUtils]: 29: Hoare triple {12976#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {12977#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {12977#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {12977#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {12978#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,408 INFO L273 TraceCheckUtils]: 34: Hoare triple {12978#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {12978#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,409 INFO L273 TraceCheckUtils]: 36: Hoare triple {12979#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,410 INFO L273 TraceCheckUtils]: 37: Hoare triple {12979#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {12979#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,411 INFO L273 TraceCheckUtils]: 39: Hoare triple {12980#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,411 INFO L273 TraceCheckUtils]: 40: Hoare triple {12980#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,412 INFO L273 TraceCheckUtils]: 41: Hoare triple {12980#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,413 INFO L273 TraceCheckUtils]: 42: Hoare triple {12981#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,413 INFO L273 TraceCheckUtils]: 43: Hoare triple {12981#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,414 INFO L273 TraceCheckUtils]: 44: Hoare triple {12981#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,414 INFO L273 TraceCheckUtils]: 45: Hoare triple {12982#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {12982#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,416 INFO L273 TraceCheckUtils]: 47: Hoare triple {12982#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,416 INFO L273 TraceCheckUtils]: 48: Hoare triple {12983#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {12983#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {12983#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,418 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,419 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,420 INFO L273 TraceCheckUtils]: 54: Hoare triple {12985#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,420 INFO L273 TraceCheckUtils]: 55: Hoare triple {12985#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,421 INFO L273 TraceCheckUtils]: 56: Hoare triple {12985#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,421 INFO L273 TraceCheckUtils]: 57: Hoare triple {12986#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,422 INFO L273 TraceCheckUtils]: 58: Hoare triple {12986#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,423 INFO L273 TraceCheckUtils]: 59: Hoare triple {12986#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,423 INFO L273 TraceCheckUtils]: 60: Hoare triple {12987#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,424 INFO L273 TraceCheckUtils]: 61: Hoare triple {12987#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,424 INFO L273 TraceCheckUtils]: 62: Hoare triple {12987#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,425 INFO L273 TraceCheckUtils]: 63: Hoare triple {12988#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,425 INFO L273 TraceCheckUtils]: 64: Hoare triple {12988#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,426 INFO L273 TraceCheckUtils]: 65: Hoare triple {12988#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,427 INFO L273 TraceCheckUtils]: 66: Hoare triple {12989#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,427 INFO L273 TraceCheckUtils]: 67: Hoare triple {12989#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,428 INFO L273 TraceCheckUtils]: 68: Hoare triple {12989#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,428 INFO L273 TraceCheckUtils]: 69: Hoare triple {12990#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,429 INFO L273 TraceCheckUtils]: 70: Hoare triple {12990#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,430 INFO L273 TraceCheckUtils]: 71: Hoare triple {12990#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:48,430 INFO L273 TraceCheckUtils]: 72: Hoare triple {12991#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:48,431 INFO L273 TraceCheckUtils]: 73: Hoare triple {12991#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:48,431 INFO L273 TraceCheckUtils]: 74: Hoare triple {12991#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:48,432 INFO L273 TraceCheckUtils]: 75: Hoare triple {12992#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:48,432 INFO L273 TraceCheckUtils]: 76: Hoare triple {12992#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:48,433 INFO L273 TraceCheckUtils]: 77: Hoare triple {12992#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:48,434 INFO L273 TraceCheckUtils]: 78: Hoare triple {12993#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:48,434 INFO L273 TraceCheckUtils]: 79: Hoare triple {12993#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:48,435 INFO L273 TraceCheckUtils]: 80: Hoare triple {12993#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:48,435 INFO L273 TraceCheckUtils]: 81: Hoare triple {12994#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:48,436 INFO L273 TraceCheckUtils]: 82: Hoare triple {12994#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:48,437 INFO L273 TraceCheckUtils]: 83: Hoare triple {12994#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:48,437 INFO L273 TraceCheckUtils]: 84: Hoare triple {12995#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:48,438 INFO L273 TraceCheckUtils]: 85: Hoare triple {12995#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:48,438 INFO L273 TraceCheckUtils]: 86: Hoare triple {12995#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {12996#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:48,439 INFO L273 TraceCheckUtils]: 87: Hoare triple {12996#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12968#false} is VALID [2018-11-23 12:05:48,439 INFO L273 TraceCheckUtils]: 88: Hoare triple {12968#false} havoc ~x~0;~x~0 := 0; {12968#false} is VALID [2018-11-23 12:05:48,440 INFO L273 TraceCheckUtils]: 89: Hoare triple {12968#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12968#false} is VALID [2018-11-23 12:05:48,440 INFO L256 TraceCheckUtils]: 90: Hoare triple {12968#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {12968#false} is VALID [2018-11-23 12:05:48,440 INFO L273 TraceCheckUtils]: 91: Hoare triple {12968#false} ~cond := #in~cond; {12968#false} is VALID [2018-11-23 12:05:48,440 INFO L273 TraceCheckUtils]: 92: Hoare triple {12968#false} assume 0 == ~cond; {12968#false} is VALID [2018-11-23 12:05:48,440 INFO L273 TraceCheckUtils]: 93: Hoare triple {12968#false} assume !false; {12968#false} is VALID [2018-11-23 12:05:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:48,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:05:48,468 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-23 12:05:48,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:48,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:05:48,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:48,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:05:48,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:05:48,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:05:48,561 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand 31 states. [2018-11-23 12:05:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,895 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2018-11-23 12:05:49,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:05:49,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-23 12:05:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:05:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 146 transitions. [2018-11-23 12:05:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:05:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 146 transitions. [2018-11-23 12:05:49,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 146 transitions. [2018-11-23 12:05:50,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:50,035 INFO L225 Difference]: With dead ends: 115 [2018-11-23 12:05:50,035 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:05:50,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:05:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:05:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-23 12:05:50,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:50,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-23 12:05:50,062 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-23 12:05:50,063 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-23 12:05:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:50,065 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 12:05:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 12:05:50,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:50,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:50,066 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-23 12:05:50,066 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-23 12:05:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:50,068 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 12:05:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 12:05:50,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:50,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:50,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:50,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 12:05:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2018-11-23 12:05:50,071 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 94 [2018-11-23 12:05:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:50,071 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2018-11-23 12:05:50,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:05:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2018-11-23 12:05:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:05:50,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:50,072 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:50,072 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:50,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:50,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2110302521, now seen corresponding path program 28 times [2018-11-23 12:05:50,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:50,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:50,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:50,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:50,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:50,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {13779#true} call ULTIMATE.init(); {13779#true} is VALID [2018-11-23 12:05:50,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {13779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13779#true} is VALID [2018-11-23 12:05:50,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {13779#true} assume true; {13779#true} is VALID [2018-11-23 12:05:50,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13779#true} {13779#true} #55#return; {13779#true} is VALID [2018-11-23 12:05:50,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {13779#true} call #t~ret4 := main(); {13779#true} is VALID [2018-11-23 12:05:50,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {13779#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {13781#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {13781#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13781#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {13781#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13781#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {13781#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {13782#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {13782#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {13782#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {13783#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {13783#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {13783#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {13784#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {13784#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {13784#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {13785#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {13785#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {13785#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {13786#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {13786#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,850 INFO L273 TraceCheckUtils]: 23: Hoare triple {13786#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {13787#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,851 INFO L273 TraceCheckUtils]: 25: Hoare triple {13787#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,852 INFO L273 TraceCheckUtils]: 26: Hoare triple {13787#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,853 INFO L273 TraceCheckUtils]: 27: Hoare triple {13788#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,853 INFO L273 TraceCheckUtils]: 28: Hoare triple {13788#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,854 INFO L273 TraceCheckUtils]: 29: Hoare triple {13788#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,854 INFO L273 TraceCheckUtils]: 30: Hoare triple {13789#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,855 INFO L273 TraceCheckUtils]: 31: Hoare triple {13789#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,856 INFO L273 TraceCheckUtils]: 32: Hoare triple {13789#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,856 INFO L273 TraceCheckUtils]: 33: Hoare triple {13790#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,857 INFO L273 TraceCheckUtils]: 34: Hoare triple {13790#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,857 INFO L273 TraceCheckUtils]: 35: Hoare triple {13790#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,858 INFO L273 TraceCheckUtils]: 36: Hoare triple {13791#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,858 INFO L273 TraceCheckUtils]: 37: Hoare triple {13791#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,859 INFO L273 TraceCheckUtils]: 38: Hoare triple {13791#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,859 INFO L273 TraceCheckUtils]: 39: Hoare triple {13792#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,860 INFO L273 TraceCheckUtils]: 40: Hoare triple {13792#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,861 INFO L273 TraceCheckUtils]: 41: Hoare triple {13792#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,861 INFO L273 TraceCheckUtils]: 42: Hoare triple {13793#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,862 INFO L273 TraceCheckUtils]: 43: Hoare triple {13793#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,862 INFO L273 TraceCheckUtils]: 44: Hoare triple {13793#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,863 INFO L273 TraceCheckUtils]: 45: Hoare triple {13794#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,863 INFO L273 TraceCheckUtils]: 46: Hoare triple {13794#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,864 INFO L273 TraceCheckUtils]: 47: Hoare triple {13794#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,865 INFO L273 TraceCheckUtils]: 48: Hoare triple {13795#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,865 INFO L273 TraceCheckUtils]: 49: Hoare triple {13795#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,866 INFO L273 TraceCheckUtils]: 50: Hoare triple {13795#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,866 INFO L273 TraceCheckUtils]: 51: Hoare triple {13796#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,867 INFO L273 TraceCheckUtils]: 52: Hoare triple {13796#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,868 INFO L273 TraceCheckUtils]: 53: Hoare triple {13796#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,868 INFO L273 TraceCheckUtils]: 54: Hoare triple {13797#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,869 INFO L273 TraceCheckUtils]: 55: Hoare triple {13797#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,869 INFO L273 TraceCheckUtils]: 56: Hoare triple {13797#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,870 INFO L273 TraceCheckUtils]: 57: Hoare triple {13798#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,870 INFO L273 TraceCheckUtils]: 58: Hoare triple {13798#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,871 INFO L273 TraceCheckUtils]: 59: Hoare triple {13798#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:50,872 INFO L273 TraceCheckUtils]: 60: Hoare triple {13799#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:50,872 INFO L273 TraceCheckUtils]: 61: Hoare triple {13799#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:50,873 INFO L273 TraceCheckUtils]: 62: Hoare triple {13799#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:50,873 INFO L273 TraceCheckUtils]: 63: Hoare triple {13800#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:50,874 INFO L273 TraceCheckUtils]: 64: Hoare triple {13800#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:50,875 INFO L273 TraceCheckUtils]: 65: Hoare triple {13800#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:50,875 INFO L273 TraceCheckUtils]: 66: Hoare triple {13801#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:50,876 INFO L273 TraceCheckUtils]: 67: Hoare triple {13801#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:50,876 INFO L273 TraceCheckUtils]: 68: Hoare triple {13801#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:50,877 INFO L273 TraceCheckUtils]: 69: Hoare triple {13802#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:50,877 INFO L273 TraceCheckUtils]: 70: Hoare triple {13802#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:50,878 INFO L273 TraceCheckUtils]: 71: Hoare triple {13802#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:50,879 INFO L273 TraceCheckUtils]: 72: Hoare triple {13803#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:50,879 INFO L273 TraceCheckUtils]: 73: Hoare triple {13803#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:50,880 INFO L273 TraceCheckUtils]: 74: Hoare triple {13803#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:50,880 INFO L273 TraceCheckUtils]: 75: Hoare triple {13804#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:50,881 INFO L273 TraceCheckUtils]: 76: Hoare triple {13804#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:50,882 INFO L273 TraceCheckUtils]: 77: Hoare triple {13804#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:50,882 INFO L273 TraceCheckUtils]: 78: Hoare triple {13805#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:50,883 INFO L273 TraceCheckUtils]: 79: Hoare triple {13805#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:50,883 INFO L273 TraceCheckUtils]: 80: Hoare triple {13805#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:50,884 INFO L273 TraceCheckUtils]: 81: Hoare triple {13806#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:50,884 INFO L273 TraceCheckUtils]: 82: Hoare triple {13806#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:50,885 INFO L273 TraceCheckUtils]: 83: Hoare triple {13806#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:50,885 INFO L273 TraceCheckUtils]: 84: Hoare triple {13807#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:50,905 INFO L273 TraceCheckUtils]: 85: Hoare triple {13807#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:50,921 INFO L273 TraceCheckUtils]: 86: Hoare triple {13807#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:50,929 INFO L273 TraceCheckUtils]: 87: Hoare triple {13808#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:50,934 INFO L273 TraceCheckUtils]: 88: Hoare triple {13808#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:50,935 INFO L273 TraceCheckUtils]: 89: Hoare triple {13808#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {13809#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:50,935 INFO L273 TraceCheckUtils]: 90: Hoare triple {13809#(<= main_~i~0 28)} assume !(~i~0 < 100000); {13780#false} is VALID [2018-11-23 12:05:50,935 INFO L273 TraceCheckUtils]: 91: Hoare triple {13780#false} havoc ~x~0;~x~0 := 0; {13780#false} is VALID [2018-11-23 12:05:50,936 INFO L273 TraceCheckUtils]: 92: Hoare triple {13780#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13780#false} is VALID [2018-11-23 12:05:50,936 INFO L256 TraceCheckUtils]: 93: Hoare triple {13780#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {13780#false} is VALID [2018-11-23 12:05:50,936 INFO L273 TraceCheckUtils]: 94: Hoare triple {13780#false} ~cond := #in~cond; {13780#false} is VALID [2018-11-23 12:05:50,936 INFO L273 TraceCheckUtils]: 95: Hoare triple {13780#false} assume 0 == ~cond; {13780#false} is VALID [2018-11-23 12:05:50,936 INFO L273 TraceCheckUtils]: 96: Hoare triple {13780#false} assume !false; {13780#false} is VALID [2018-11-23 12:05:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:50,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:50,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:50,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:50,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:50,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:51,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:51,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {13779#true} call ULTIMATE.init(); {13779#true} is VALID [2018-11-23 12:05:51,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {13779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13779#true} is VALID [2018-11-23 12:05:51,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {13779#true} assume true; {13779#true} is VALID [2018-11-23 12:05:51,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13779#true} {13779#true} #55#return; {13779#true} is VALID [2018-11-23 12:05:51,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {13779#true} call #t~ret4 := main(); {13779#true} is VALID [2018-11-23 12:05:51,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {13779#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {13828#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:51,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {13828#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13828#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:51,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {13828#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13828#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:51,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {13828#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:51,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {13782#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:51,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {13782#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:51,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {13782#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:51,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {13783#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:51,249 INFO L273 TraceCheckUtils]: 13: Hoare triple {13783#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:51,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {13783#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:51,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {13784#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:51,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {13784#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:51,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {13784#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:51,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {13785#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:51,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {13785#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:51,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {13785#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:51,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {13786#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:51,254 INFO L273 TraceCheckUtils]: 22: Hoare triple {13786#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:51,254 INFO L273 TraceCheckUtils]: 23: Hoare triple {13786#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:51,255 INFO L273 TraceCheckUtils]: 24: Hoare triple {13787#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:51,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {13787#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:51,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {13787#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:51,257 INFO L273 TraceCheckUtils]: 27: Hoare triple {13788#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:51,257 INFO L273 TraceCheckUtils]: 28: Hoare triple {13788#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:51,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {13788#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:51,258 INFO L273 TraceCheckUtils]: 30: Hoare triple {13789#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:51,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {13789#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:51,259 INFO L273 TraceCheckUtils]: 32: Hoare triple {13789#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:51,260 INFO L273 TraceCheckUtils]: 33: Hoare triple {13790#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:51,260 INFO L273 TraceCheckUtils]: 34: Hoare triple {13790#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:51,261 INFO L273 TraceCheckUtils]: 35: Hoare triple {13790#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:51,261 INFO L273 TraceCheckUtils]: 36: Hoare triple {13791#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:51,262 INFO L273 TraceCheckUtils]: 37: Hoare triple {13791#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:51,263 INFO L273 TraceCheckUtils]: 38: Hoare triple {13791#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:51,263 INFO L273 TraceCheckUtils]: 39: Hoare triple {13792#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:51,264 INFO L273 TraceCheckUtils]: 40: Hoare triple {13792#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:51,264 INFO L273 TraceCheckUtils]: 41: Hoare triple {13792#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:51,265 INFO L273 TraceCheckUtils]: 42: Hoare triple {13793#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:51,265 INFO L273 TraceCheckUtils]: 43: Hoare triple {13793#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:51,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {13793#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:51,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {13794#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:51,267 INFO L273 TraceCheckUtils]: 46: Hoare triple {13794#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:51,268 INFO L273 TraceCheckUtils]: 47: Hoare triple {13794#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:51,268 INFO L273 TraceCheckUtils]: 48: Hoare triple {13795#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:51,269 INFO L273 TraceCheckUtils]: 49: Hoare triple {13795#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:51,269 INFO L273 TraceCheckUtils]: 50: Hoare triple {13795#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:51,270 INFO L273 TraceCheckUtils]: 51: Hoare triple {13796#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:51,270 INFO L273 TraceCheckUtils]: 52: Hoare triple {13796#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:51,271 INFO L273 TraceCheckUtils]: 53: Hoare triple {13796#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:51,271 INFO L273 TraceCheckUtils]: 54: Hoare triple {13797#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:51,272 INFO L273 TraceCheckUtils]: 55: Hoare triple {13797#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:51,272 INFO L273 TraceCheckUtils]: 56: Hoare triple {13797#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:51,273 INFO L273 TraceCheckUtils]: 57: Hoare triple {13798#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:51,273 INFO L273 TraceCheckUtils]: 58: Hoare triple {13798#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:51,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {13798#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:51,275 INFO L273 TraceCheckUtils]: 60: Hoare triple {13799#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:51,275 INFO L273 TraceCheckUtils]: 61: Hoare triple {13799#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:51,276 INFO L273 TraceCheckUtils]: 62: Hoare triple {13799#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:51,276 INFO L273 TraceCheckUtils]: 63: Hoare triple {13800#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:51,277 INFO L273 TraceCheckUtils]: 64: Hoare triple {13800#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:51,277 INFO L273 TraceCheckUtils]: 65: Hoare triple {13800#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:51,278 INFO L273 TraceCheckUtils]: 66: Hoare triple {13801#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:51,278 INFO L273 TraceCheckUtils]: 67: Hoare triple {13801#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:51,279 INFO L273 TraceCheckUtils]: 68: Hoare triple {13801#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:51,280 INFO L273 TraceCheckUtils]: 69: Hoare triple {13802#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:51,280 INFO L273 TraceCheckUtils]: 70: Hoare triple {13802#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:51,281 INFO L273 TraceCheckUtils]: 71: Hoare triple {13802#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:51,281 INFO L273 TraceCheckUtils]: 72: Hoare triple {13803#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:51,282 INFO L273 TraceCheckUtils]: 73: Hoare triple {13803#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:51,282 INFO L273 TraceCheckUtils]: 74: Hoare triple {13803#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:51,283 INFO L273 TraceCheckUtils]: 75: Hoare triple {13804#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:51,283 INFO L273 TraceCheckUtils]: 76: Hoare triple {13804#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:51,284 INFO L273 TraceCheckUtils]: 77: Hoare triple {13804#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:51,284 INFO L273 TraceCheckUtils]: 78: Hoare triple {13805#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:51,285 INFO L273 TraceCheckUtils]: 79: Hoare triple {13805#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:51,286 INFO L273 TraceCheckUtils]: 80: Hoare triple {13805#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:51,286 INFO L273 TraceCheckUtils]: 81: Hoare triple {13806#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:51,287 INFO L273 TraceCheckUtils]: 82: Hoare triple {13806#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:51,287 INFO L273 TraceCheckUtils]: 83: Hoare triple {13806#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:51,288 INFO L273 TraceCheckUtils]: 84: Hoare triple {13807#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:51,288 INFO L273 TraceCheckUtils]: 85: Hoare triple {13807#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:51,294 INFO L273 TraceCheckUtils]: 86: Hoare triple {13807#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:51,294 INFO L273 TraceCheckUtils]: 87: Hoare triple {13808#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:51,295 INFO L273 TraceCheckUtils]: 88: Hoare triple {13808#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:51,295 INFO L273 TraceCheckUtils]: 89: Hoare triple {13808#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {13809#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:51,295 INFO L273 TraceCheckUtils]: 90: Hoare triple {13809#(<= main_~i~0 28)} assume !(~i~0 < 100000); {13780#false} is VALID [2018-11-23 12:05:51,296 INFO L273 TraceCheckUtils]: 91: Hoare triple {13780#false} havoc ~x~0;~x~0 := 0; {13780#false} is VALID [2018-11-23 12:05:51,296 INFO L273 TraceCheckUtils]: 92: Hoare triple {13780#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13780#false} is VALID [2018-11-23 12:05:51,296 INFO L256 TraceCheckUtils]: 93: Hoare triple {13780#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {13780#false} is VALID [2018-11-23 12:05:51,296 INFO L273 TraceCheckUtils]: 94: Hoare triple {13780#false} ~cond := #in~cond; {13780#false} is VALID [2018-11-23 12:05:51,296 INFO L273 TraceCheckUtils]: 95: Hoare triple {13780#false} assume 0 == ~cond; {13780#false} is VALID [2018-11-23 12:05:51,296 INFO L273 TraceCheckUtils]: 96: Hoare triple {13780#false} assume !false; {13780#false} is VALID [2018-11-23 12:05:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:51,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:51,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 12:05:51,321 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-23 12:05:51,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:51,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:05:51,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:51,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:05:51,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:05:51,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:05:51,444 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand 32 states. [2018-11-23 12:05:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:52,212 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2018-11-23 12:05:52,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:05:52,213 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-23 12:05:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 150 transitions. [2018-11-23 12:05:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 150 transitions. [2018-11-23 12:05:52,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 150 transitions. [2018-11-23 12:05:52,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:52,383 INFO L225 Difference]: With dead ends: 118 [2018-11-23 12:05:52,383 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:05:52,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:05:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:05:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-23 12:05:52,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:52,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 105 states. [2018-11-23 12:05:52,485 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 105 states. [2018-11-23 12:05:52,485 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 105 states. [2018-11-23 12:05:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:52,487 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2018-11-23 12:05:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2018-11-23 12:05:52,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:52,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:52,488 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 107 states. [2018-11-23 12:05:52,488 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 107 states. [2018-11-23 12:05:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:52,489 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2018-11-23 12:05:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2018-11-23 12:05:52,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:52,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:52,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:52,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:05:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-23 12:05:52,492 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 97 [2018-11-23 12:05:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:52,492 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-23 12:05:52,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:05:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-23 12:05:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:05:52,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:52,493 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:52,493 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:52,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1631457379, now seen corresponding path program 29 times [2018-11-23 12:05:52,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:52,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:52,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:53,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {14615#true} call ULTIMATE.init(); {14615#true} is VALID [2018-11-23 12:05:53,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {14615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14615#true} is VALID [2018-11-23 12:05:53,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {14615#true} assume true; {14615#true} is VALID [2018-11-23 12:05:53,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14615#true} {14615#true} #55#return; {14615#true} is VALID [2018-11-23 12:05:53,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {14615#true} call #t~ret4 := main(); {14615#true} is VALID [2018-11-23 12:05:53,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {14615#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {14617#(= main_~i~0 0)} is VALID [2018-11-23 12:05:53,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {14617#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14617#(= main_~i~0 0)} is VALID [2018-11-23 12:05:53,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {14617#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14617#(= main_~i~0 0)} is VALID [2018-11-23 12:05:53,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {14617#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:53,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {14618#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:53,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {14618#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:53,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {14618#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:53,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {14619#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:53,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {14619#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:53,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {14619#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:53,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {14620#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:53,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {14620#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:53,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {14620#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:53,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {14621#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:53,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {14621#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:53,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {14621#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:53,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {14622#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:53,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {14622#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:53,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {14622#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:53,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {14623#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:53,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {14623#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:53,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:53,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {14624#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:53,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:53,370 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:53,371 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:53,390 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:53,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {14625#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:53,402 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:53,402 INFO L273 TraceCheckUtils]: 34: Hoare triple {14626#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:53,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {14626#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:53,403 INFO L273 TraceCheckUtils]: 36: Hoare triple {14627#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:53,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {14627#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:53,404 INFO L273 TraceCheckUtils]: 38: Hoare triple {14627#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:53,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {14628#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:53,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {14628#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:53,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {14628#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:53,405 INFO L273 TraceCheckUtils]: 42: Hoare triple {14629#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:53,405 INFO L273 TraceCheckUtils]: 43: Hoare triple {14629#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:53,406 INFO L273 TraceCheckUtils]: 44: Hoare triple {14629#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:53,407 INFO L273 TraceCheckUtils]: 45: Hoare triple {14630#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:53,407 INFO L273 TraceCheckUtils]: 46: Hoare triple {14630#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:53,408 INFO L273 TraceCheckUtils]: 47: Hoare triple {14630#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:53,408 INFO L273 TraceCheckUtils]: 48: Hoare triple {14631#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:53,409 INFO L273 TraceCheckUtils]: 49: Hoare triple {14631#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:53,409 INFO L273 TraceCheckUtils]: 50: Hoare triple {14631#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:53,410 INFO L273 TraceCheckUtils]: 51: Hoare triple {14632#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:53,410 INFO L273 TraceCheckUtils]: 52: Hoare triple {14632#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:53,411 INFO L273 TraceCheckUtils]: 53: Hoare triple {14632#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:53,412 INFO L273 TraceCheckUtils]: 54: Hoare triple {14633#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:53,412 INFO L273 TraceCheckUtils]: 55: Hoare triple {14633#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:53,413 INFO L273 TraceCheckUtils]: 56: Hoare triple {14633#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:53,413 INFO L273 TraceCheckUtils]: 57: Hoare triple {14634#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:53,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {14634#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:53,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {14634#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:53,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {14635#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:53,415 INFO L273 TraceCheckUtils]: 61: Hoare triple {14635#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:53,416 INFO L273 TraceCheckUtils]: 62: Hoare triple {14635#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:53,416 INFO L273 TraceCheckUtils]: 63: Hoare triple {14636#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:53,417 INFO L273 TraceCheckUtils]: 64: Hoare triple {14636#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:53,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {14636#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:53,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {14637#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:53,419 INFO L273 TraceCheckUtils]: 67: Hoare triple {14637#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:53,419 INFO L273 TraceCheckUtils]: 68: Hoare triple {14637#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:53,420 INFO L273 TraceCheckUtils]: 69: Hoare triple {14638#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:53,420 INFO L273 TraceCheckUtils]: 70: Hoare triple {14638#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:53,421 INFO L273 TraceCheckUtils]: 71: Hoare triple {14638#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:53,421 INFO L273 TraceCheckUtils]: 72: Hoare triple {14639#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:53,422 INFO L273 TraceCheckUtils]: 73: Hoare triple {14639#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:53,422 INFO L273 TraceCheckUtils]: 74: Hoare triple {14639#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:53,423 INFO L273 TraceCheckUtils]: 75: Hoare triple {14640#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:53,423 INFO L273 TraceCheckUtils]: 76: Hoare triple {14640#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:53,424 INFO L273 TraceCheckUtils]: 77: Hoare triple {14640#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:53,425 INFO L273 TraceCheckUtils]: 78: Hoare triple {14641#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:53,425 INFO L273 TraceCheckUtils]: 79: Hoare triple {14641#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:53,426 INFO L273 TraceCheckUtils]: 80: Hoare triple {14641#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:53,426 INFO L273 TraceCheckUtils]: 81: Hoare triple {14642#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:53,427 INFO L273 TraceCheckUtils]: 82: Hoare triple {14642#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:53,427 INFO L273 TraceCheckUtils]: 83: Hoare triple {14642#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:53,428 INFO L273 TraceCheckUtils]: 84: Hoare triple {14643#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:53,445 INFO L273 TraceCheckUtils]: 85: Hoare triple {14643#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:53,454 INFO L273 TraceCheckUtils]: 86: Hoare triple {14643#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:53,468 INFO L273 TraceCheckUtils]: 87: Hoare triple {14644#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:53,476 INFO L273 TraceCheckUtils]: 88: Hoare triple {14644#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:53,486 INFO L273 TraceCheckUtils]: 89: Hoare triple {14644#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:53,494 INFO L273 TraceCheckUtils]: 90: Hoare triple {14645#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:53,508 INFO L273 TraceCheckUtils]: 91: Hoare triple {14645#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:53,516 INFO L273 TraceCheckUtils]: 92: Hoare triple {14645#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {14646#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:53,533 INFO L273 TraceCheckUtils]: 93: Hoare triple {14646#(<= main_~i~0 29)} assume !(~i~0 < 100000); {14616#false} is VALID [2018-11-23 12:05:53,533 INFO L273 TraceCheckUtils]: 94: Hoare triple {14616#false} havoc ~x~0;~x~0 := 0; {14616#false} is VALID [2018-11-23 12:05:53,533 INFO L273 TraceCheckUtils]: 95: Hoare triple {14616#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14616#false} is VALID [2018-11-23 12:05:53,533 INFO L256 TraceCheckUtils]: 96: Hoare triple {14616#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {14616#false} is VALID [2018-11-23 12:05:53,534 INFO L273 TraceCheckUtils]: 97: Hoare triple {14616#false} ~cond := #in~cond; {14616#false} is VALID [2018-11-23 12:05:53,534 INFO L273 TraceCheckUtils]: 98: Hoare triple {14616#false} assume 0 == ~cond; {14616#false} is VALID [2018-11-23 12:05:53,534 INFO L273 TraceCheckUtils]: 99: Hoare triple {14616#false} assume !false; {14616#false} is VALID [2018-11-23 12:05:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:53,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:53,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:53,559 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:53,760 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 12:05:53,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:53,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:54,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {14615#true} call ULTIMATE.init(); {14615#true} is VALID [2018-11-23 12:05:54,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {14615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14615#true} is VALID [2018-11-23 12:05:54,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {14615#true} assume true; {14615#true} is VALID [2018-11-23 12:05:54,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14615#true} {14615#true} #55#return; {14615#true} is VALID [2018-11-23 12:05:54,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {14615#true} call #t~ret4 := main(); {14615#true} is VALID [2018-11-23 12:05:54,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {14615#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {14665#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:54,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {14665#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14665#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:54,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {14665#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14665#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:54,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {14665#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {14618#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {14618#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {14618#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {14619#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {14619#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {14619#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,057 INFO L273 TraceCheckUtils]: 15: Hoare triple {14620#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,057 INFO L273 TraceCheckUtils]: 16: Hoare triple {14620#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {14620#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {14621#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,059 INFO L273 TraceCheckUtils]: 19: Hoare triple {14621#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {14621#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,060 INFO L273 TraceCheckUtils]: 21: Hoare triple {14622#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,061 INFO L273 TraceCheckUtils]: 22: Hoare triple {14622#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,061 INFO L273 TraceCheckUtils]: 23: Hoare triple {14622#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,062 INFO L273 TraceCheckUtils]: 24: Hoare triple {14623#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,062 INFO L273 TraceCheckUtils]: 25: Hoare triple {14623#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {14624#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,064 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,065 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,065 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,085 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {14625#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,094 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,094 INFO L273 TraceCheckUtils]: 34: Hoare triple {14626#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,095 INFO L273 TraceCheckUtils]: 35: Hoare triple {14626#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,095 INFO L273 TraceCheckUtils]: 36: Hoare triple {14627#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,095 INFO L273 TraceCheckUtils]: 37: Hoare triple {14627#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {14627#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,096 INFO L273 TraceCheckUtils]: 39: Hoare triple {14628#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,096 INFO L273 TraceCheckUtils]: 40: Hoare triple {14628#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,097 INFO L273 TraceCheckUtils]: 41: Hoare triple {14628#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {14629#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,098 INFO L273 TraceCheckUtils]: 43: Hoare triple {14629#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {14629#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,099 INFO L273 TraceCheckUtils]: 45: Hoare triple {14630#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,099 INFO L273 TraceCheckUtils]: 46: Hoare triple {14630#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,100 INFO L273 TraceCheckUtils]: 47: Hoare triple {14630#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,100 INFO L273 TraceCheckUtils]: 48: Hoare triple {14631#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,101 INFO L273 TraceCheckUtils]: 49: Hoare triple {14631#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,101 INFO L273 TraceCheckUtils]: 50: Hoare triple {14631#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,102 INFO L273 TraceCheckUtils]: 51: Hoare triple {14632#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,102 INFO L273 TraceCheckUtils]: 52: Hoare triple {14632#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,103 INFO L273 TraceCheckUtils]: 53: Hoare triple {14632#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,104 INFO L273 TraceCheckUtils]: 54: Hoare triple {14633#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {14633#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,105 INFO L273 TraceCheckUtils]: 56: Hoare triple {14633#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,105 INFO L273 TraceCheckUtils]: 57: Hoare triple {14634#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,106 INFO L273 TraceCheckUtils]: 58: Hoare triple {14634#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,106 INFO L273 TraceCheckUtils]: 59: Hoare triple {14634#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,107 INFO L273 TraceCheckUtils]: 60: Hoare triple {14635#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,107 INFO L273 TraceCheckUtils]: 61: Hoare triple {14635#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,108 INFO L273 TraceCheckUtils]: 62: Hoare triple {14635#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,108 INFO L273 TraceCheckUtils]: 63: Hoare triple {14636#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,109 INFO L273 TraceCheckUtils]: 64: Hoare triple {14636#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,109 INFO L273 TraceCheckUtils]: 65: Hoare triple {14636#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:54,110 INFO L273 TraceCheckUtils]: 66: Hoare triple {14637#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:54,110 INFO L273 TraceCheckUtils]: 67: Hoare triple {14637#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:54,111 INFO L273 TraceCheckUtils]: 68: Hoare triple {14637#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:54,112 INFO L273 TraceCheckUtils]: 69: Hoare triple {14638#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:54,112 INFO L273 TraceCheckUtils]: 70: Hoare triple {14638#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:54,113 INFO L273 TraceCheckUtils]: 71: Hoare triple {14638#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:54,113 INFO L273 TraceCheckUtils]: 72: Hoare triple {14639#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:54,114 INFO L273 TraceCheckUtils]: 73: Hoare triple {14639#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:54,114 INFO L273 TraceCheckUtils]: 74: Hoare triple {14639#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:54,115 INFO L273 TraceCheckUtils]: 75: Hoare triple {14640#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:54,115 INFO L273 TraceCheckUtils]: 76: Hoare triple {14640#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:54,116 INFO L273 TraceCheckUtils]: 77: Hoare triple {14640#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:54,116 INFO L273 TraceCheckUtils]: 78: Hoare triple {14641#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:54,117 INFO L273 TraceCheckUtils]: 79: Hoare triple {14641#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:54,118 INFO L273 TraceCheckUtils]: 80: Hoare triple {14641#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:54,118 INFO L273 TraceCheckUtils]: 81: Hoare triple {14642#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:54,119 INFO L273 TraceCheckUtils]: 82: Hoare triple {14642#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:54,119 INFO L273 TraceCheckUtils]: 83: Hoare triple {14642#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:54,120 INFO L273 TraceCheckUtils]: 84: Hoare triple {14643#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:54,120 INFO L273 TraceCheckUtils]: 85: Hoare triple {14643#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:54,121 INFO L273 TraceCheckUtils]: 86: Hoare triple {14643#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:54,121 INFO L273 TraceCheckUtils]: 87: Hoare triple {14644#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:54,122 INFO L273 TraceCheckUtils]: 88: Hoare triple {14644#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:54,122 INFO L273 TraceCheckUtils]: 89: Hoare triple {14644#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:54,123 INFO L273 TraceCheckUtils]: 90: Hoare triple {14645#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:54,123 INFO L273 TraceCheckUtils]: 91: Hoare triple {14645#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:54,124 INFO L273 TraceCheckUtils]: 92: Hoare triple {14645#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {14646#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:54,125 INFO L273 TraceCheckUtils]: 93: Hoare triple {14646#(<= main_~i~0 29)} assume !(~i~0 < 100000); {14616#false} is VALID [2018-11-23 12:05:54,125 INFO L273 TraceCheckUtils]: 94: Hoare triple {14616#false} havoc ~x~0;~x~0 := 0; {14616#false} is VALID [2018-11-23 12:05:54,125 INFO L273 TraceCheckUtils]: 95: Hoare triple {14616#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14616#false} is VALID [2018-11-23 12:05:54,125 INFO L256 TraceCheckUtils]: 96: Hoare triple {14616#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {14616#false} is VALID [2018-11-23 12:05:54,125 INFO L273 TraceCheckUtils]: 97: Hoare triple {14616#false} ~cond := #in~cond; {14616#false} is VALID [2018-11-23 12:05:54,126 INFO L273 TraceCheckUtils]: 98: Hoare triple {14616#false} assume 0 == ~cond; {14616#false} is VALID [2018-11-23 12:05:54,126 INFO L273 TraceCheckUtils]: 99: Hoare triple {14616#false} assume !false; {14616#false} is VALID [2018-11-23 12:05:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:54,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:54,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 12:05:54,153 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-23 12:05:54,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:54,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:05:54,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:54,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:05:54,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:05:54,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:05:54,253 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 33 states. [2018-11-23 12:05:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:55,024 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-11-23 12:05:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:05:55,024 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-23 12:05:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:05:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 154 transitions. [2018-11-23 12:05:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:05:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 154 transitions. [2018-11-23 12:05:55,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 154 transitions. [2018-11-23 12:05:55,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:55,178 INFO L225 Difference]: With dead ends: 121 [2018-11-23 12:05:55,179 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 12:05:55,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:05:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 12:05:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-11-23 12:05:55,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:55,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 108 states. [2018-11-23 12:05:55,206 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 108 states. [2018-11-23 12:05:55,206 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 108 states. [2018-11-23 12:05:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:55,208 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 12:05:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2018-11-23 12:05:55,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:55,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:55,209 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 110 states. [2018-11-23 12:05:55,209 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 110 states. [2018-11-23 12:05:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:55,211 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 12:05:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2018-11-23 12:05:55,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:55,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:55,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:55,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 12:05:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2018-11-23 12:05:55,214 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 100 [2018-11-23 12:05:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:55,214 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2018-11-23 12:05:55,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:05:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2018-11-23 12:05:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:05:55,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:55,215 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:55,215 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:55,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash -57777927, now seen corresponding path program 30 times [2018-11-23 12:05:55,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:55,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:55,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:55,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:55,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {15475#true} call ULTIMATE.init(); {15475#true} is VALID [2018-11-23 12:05:55,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {15475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15475#true} is VALID [2018-11-23 12:05:55,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-23 12:05:55,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15475#true} {15475#true} #55#return; {15475#true} is VALID [2018-11-23 12:05:55,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {15475#true} call #t~ret4 := main(); {15475#true} is VALID [2018-11-23 12:05:55,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {15475#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {15477#(= main_~i~0 0)} is VALID [2018-11-23 12:05:55,807 INFO L273 TraceCheckUtils]: 6: Hoare triple {15477#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15477#(= main_~i~0 0)} is VALID [2018-11-23 12:05:55,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {15477#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15477#(= main_~i~0 0)} is VALID [2018-11-23 12:05:55,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {15477#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,808 INFO L273 TraceCheckUtils]: 9: Hoare triple {15478#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {15478#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {15478#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {15479#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {15479#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {15479#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {15480#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {15480#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {15480#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:55,811 INFO L273 TraceCheckUtils]: 18: Hoare triple {15481#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:55,812 INFO L273 TraceCheckUtils]: 19: Hoare triple {15481#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:55,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {15481#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:55,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {15482#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:55,813 INFO L273 TraceCheckUtils]: 22: Hoare triple {15482#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:55,814 INFO L273 TraceCheckUtils]: 23: Hoare triple {15482#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:55,815 INFO L273 TraceCheckUtils]: 24: Hoare triple {15483#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:55,815 INFO L273 TraceCheckUtils]: 25: Hoare triple {15483#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:55,816 INFO L273 TraceCheckUtils]: 26: Hoare triple {15483#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:55,816 INFO L273 TraceCheckUtils]: 27: Hoare triple {15484#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:55,817 INFO L273 TraceCheckUtils]: 28: Hoare triple {15484#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:55,817 INFO L273 TraceCheckUtils]: 29: Hoare triple {15484#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:55,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {15485#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:55,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {15485#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:55,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {15485#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:55,820 INFO L273 TraceCheckUtils]: 33: Hoare triple {15486#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:55,820 INFO L273 TraceCheckUtils]: 34: Hoare triple {15486#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:55,821 INFO L273 TraceCheckUtils]: 35: Hoare triple {15486#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:55,821 INFO L273 TraceCheckUtils]: 36: Hoare triple {15487#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:55,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {15487#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:55,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {15487#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:55,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {15488#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:55,823 INFO L273 TraceCheckUtils]: 40: Hoare triple {15488#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:55,824 INFO L273 TraceCheckUtils]: 41: Hoare triple {15488#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:55,824 INFO L273 TraceCheckUtils]: 42: Hoare triple {15489#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:55,825 INFO L273 TraceCheckUtils]: 43: Hoare triple {15489#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:55,826 INFO L273 TraceCheckUtils]: 44: Hoare triple {15489#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:55,826 INFO L273 TraceCheckUtils]: 45: Hoare triple {15490#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:55,827 INFO L273 TraceCheckUtils]: 46: Hoare triple {15490#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:55,827 INFO L273 TraceCheckUtils]: 47: Hoare triple {15490#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:55,828 INFO L273 TraceCheckUtils]: 48: Hoare triple {15491#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:55,828 INFO L273 TraceCheckUtils]: 49: Hoare triple {15491#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:55,829 INFO L273 TraceCheckUtils]: 50: Hoare triple {15491#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:55,829 INFO L273 TraceCheckUtils]: 51: Hoare triple {15492#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:55,830 INFO L273 TraceCheckUtils]: 52: Hoare triple {15492#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:55,830 INFO L273 TraceCheckUtils]: 53: Hoare triple {15492#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:55,831 INFO L273 TraceCheckUtils]: 54: Hoare triple {15493#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:55,831 INFO L273 TraceCheckUtils]: 55: Hoare triple {15493#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:55,832 INFO L273 TraceCheckUtils]: 56: Hoare triple {15493#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:55,833 INFO L273 TraceCheckUtils]: 57: Hoare triple {15494#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:55,833 INFO L273 TraceCheckUtils]: 58: Hoare triple {15494#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:55,834 INFO L273 TraceCheckUtils]: 59: Hoare triple {15494#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:55,834 INFO L273 TraceCheckUtils]: 60: Hoare triple {15495#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:55,835 INFO L273 TraceCheckUtils]: 61: Hoare triple {15495#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:55,835 INFO L273 TraceCheckUtils]: 62: Hoare triple {15495#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:55,836 INFO L273 TraceCheckUtils]: 63: Hoare triple {15496#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:55,836 INFO L273 TraceCheckUtils]: 64: Hoare triple {15496#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:55,837 INFO L273 TraceCheckUtils]: 65: Hoare triple {15496#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:55,837 INFO L273 TraceCheckUtils]: 66: Hoare triple {15497#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:55,838 INFO L273 TraceCheckUtils]: 67: Hoare triple {15497#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:55,839 INFO L273 TraceCheckUtils]: 68: Hoare triple {15497#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:55,839 INFO L273 TraceCheckUtils]: 69: Hoare triple {15498#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:55,840 INFO L273 TraceCheckUtils]: 70: Hoare triple {15498#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:55,840 INFO L273 TraceCheckUtils]: 71: Hoare triple {15498#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:55,841 INFO L273 TraceCheckUtils]: 72: Hoare triple {15499#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:55,841 INFO L273 TraceCheckUtils]: 73: Hoare triple {15499#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:55,842 INFO L273 TraceCheckUtils]: 74: Hoare triple {15499#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:55,842 INFO L273 TraceCheckUtils]: 75: Hoare triple {15500#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:55,843 INFO L273 TraceCheckUtils]: 76: Hoare triple {15500#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:55,844 INFO L273 TraceCheckUtils]: 77: Hoare triple {15500#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:55,844 INFO L273 TraceCheckUtils]: 78: Hoare triple {15501#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:55,845 INFO L273 TraceCheckUtils]: 79: Hoare triple {15501#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:55,845 INFO L273 TraceCheckUtils]: 80: Hoare triple {15501#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:55,846 INFO L273 TraceCheckUtils]: 81: Hoare triple {15502#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:55,846 INFO L273 TraceCheckUtils]: 82: Hoare triple {15502#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:55,847 INFO L273 TraceCheckUtils]: 83: Hoare triple {15502#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:55,848 INFO L273 TraceCheckUtils]: 84: Hoare triple {15503#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:55,848 INFO L273 TraceCheckUtils]: 85: Hoare triple {15503#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:55,849 INFO L273 TraceCheckUtils]: 86: Hoare triple {15503#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:55,849 INFO L273 TraceCheckUtils]: 87: Hoare triple {15504#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:55,850 INFO L273 TraceCheckUtils]: 88: Hoare triple {15504#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:55,851 INFO L273 TraceCheckUtils]: 89: Hoare triple {15504#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:55,851 INFO L273 TraceCheckUtils]: 90: Hoare triple {15505#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:55,852 INFO L273 TraceCheckUtils]: 91: Hoare triple {15505#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:55,852 INFO L273 TraceCheckUtils]: 92: Hoare triple {15505#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:55,853 INFO L273 TraceCheckUtils]: 93: Hoare triple {15506#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:55,853 INFO L273 TraceCheckUtils]: 94: Hoare triple {15506#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:55,854 INFO L273 TraceCheckUtils]: 95: Hoare triple {15506#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {15507#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:55,855 INFO L273 TraceCheckUtils]: 96: Hoare triple {15507#(<= main_~i~0 30)} assume !(~i~0 < 100000); {15476#false} is VALID [2018-11-23 12:05:55,855 INFO L273 TraceCheckUtils]: 97: Hoare triple {15476#false} havoc ~x~0;~x~0 := 0; {15476#false} is VALID [2018-11-23 12:05:55,855 INFO L273 TraceCheckUtils]: 98: Hoare triple {15476#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15476#false} is VALID [2018-11-23 12:05:55,855 INFO L256 TraceCheckUtils]: 99: Hoare triple {15476#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {15476#false} is VALID [2018-11-23 12:05:55,855 INFO L273 TraceCheckUtils]: 100: Hoare triple {15476#false} ~cond := #in~cond; {15476#false} is VALID [2018-11-23 12:05:55,856 INFO L273 TraceCheckUtils]: 101: Hoare triple {15476#false} assume 0 == ~cond; {15476#false} is VALID [2018-11-23 12:05:55,856 INFO L273 TraceCheckUtils]: 102: Hoare triple {15476#false} assume !false; {15476#false} is VALID [2018-11-23 12:05:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:55,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:55,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:55,873 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:55,946 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 12:05:55,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:55,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:57,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {15475#true} call ULTIMATE.init(); {15475#true} is VALID [2018-11-23 12:05:57,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {15475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15475#true} is VALID [2018-11-23 12:05:57,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-23 12:05:57,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15475#true} {15475#true} #55#return; {15475#true} is VALID [2018-11-23 12:05:57,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {15475#true} call #t~ret4 := main(); {15475#true} is VALID [2018-11-23 12:05:57,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {15475#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {15526#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:57,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {15526#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15526#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:57,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {15526#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15526#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:57,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {15526#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:57,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {15478#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:57,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {15478#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:57,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {15478#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:57,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {15479#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:57,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {15479#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:57,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {15479#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:57,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {15480#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:57,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {15480#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:57,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {15480#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:57,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {15481#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:57,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {15481#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:57,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {15481#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:57,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {15482#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:57,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {15482#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:57,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {15482#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:57,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {15483#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:57,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {15483#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:57,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {15483#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:57,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {15484#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:57,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {15484#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:57,256 INFO L273 TraceCheckUtils]: 29: Hoare triple {15484#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:57,257 INFO L273 TraceCheckUtils]: 30: Hoare triple {15485#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:57,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {15485#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:57,258 INFO L273 TraceCheckUtils]: 32: Hoare triple {15485#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:57,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {15486#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:57,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {15486#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:57,260 INFO L273 TraceCheckUtils]: 35: Hoare triple {15486#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:57,260 INFO L273 TraceCheckUtils]: 36: Hoare triple {15487#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:57,261 INFO L273 TraceCheckUtils]: 37: Hoare triple {15487#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:57,261 INFO L273 TraceCheckUtils]: 38: Hoare triple {15487#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:57,262 INFO L273 TraceCheckUtils]: 39: Hoare triple {15488#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:57,262 INFO L273 TraceCheckUtils]: 40: Hoare triple {15488#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:57,263 INFO L273 TraceCheckUtils]: 41: Hoare triple {15488#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:57,264 INFO L273 TraceCheckUtils]: 42: Hoare triple {15489#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:57,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {15489#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:57,265 INFO L273 TraceCheckUtils]: 44: Hoare triple {15489#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:57,265 INFO L273 TraceCheckUtils]: 45: Hoare triple {15490#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:57,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {15490#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:57,267 INFO L273 TraceCheckUtils]: 47: Hoare triple {15490#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:57,267 INFO L273 TraceCheckUtils]: 48: Hoare triple {15491#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:57,268 INFO L273 TraceCheckUtils]: 49: Hoare triple {15491#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:57,268 INFO L273 TraceCheckUtils]: 50: Hoare triple {15491#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:57,269 INFO L273 TraceCheckUtils]: 51: Hoare triple {15492#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:57,269 INFO L273 TraceCheckUtils]: 52: Hoare triple {15492#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:57,270 INFO L273 TraceCheckUtils]: 53: Hoare triple {15492#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:57,271 INFO L273 TraceCheckUtils]: 54: Hoare triple {15493#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:57,271 INFO L273 TraceCheckUtils]: 55: Hoare triple {15493#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:57,272 INFO L273 TraceCheckUtils]: 56: Hoare triple {15493#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:57,272 INFO L273 TraceCheckUtils]: 57: Hoare triple {15494#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:57,273 INFO L273 TraceCheckUtils]: 58: Hoare triple {15494#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:57,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {15494#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:57,274 INFO L273 TraceCheckUtils]: 60: Hoare triple {15495#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:57,275 INFO L273 TraceCheckUtils]: 61: Hoare triple {15495#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:57,275 INFO L273 TraceCheckUtils]: 62: Hoare triple {15495#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:57,276 INFO L273 TraceCheckUtils]: 63: Hoare triple {15496#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:57,276 INFO L273 TraceCheckUtils]: 64: Hoare triple {15496#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:57,277 INFO L273 TraceCheckUtils]: 65: Hoare triple {15496#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:57,278 INFO L273 TraceCheckUtils]: 66: Hoare triple {15497#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:57,278 INFO L273 TraceCheckUtils]: 67: Hoare triple {15497#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:57,279 INFO L273 TraceCheckUtils]: 68: Hoare triple {15497#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:57,279 INFO L273 TraceCheckUtils]: 69: Hoare triple {15498#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:57,280 INFO L273 TraceCheckUtils]: 70: Hoare triple {15498#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:57,281 INFO L273 TraceCheckUtils]: 71: Hoare triple {15498#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:57,281 INFO L273 TraceCheckUtils]: 72: Hoare triple {15499#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:57,282 INFO L273 TraceCheckUtils]: 73: Hoare triple {15499#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:57,282 INFO L273 TraceCheckUtils]: 74: Hoare triple {15499#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:57,283 INFO L273 TraceCheckUtils]: 75: Hoare triple {15500#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:57,283 INFO L273 TraceCheckUtils]: 76: Hoare triple {15500#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:57,284 INFO L273 TraceCheckUtils]: 77: Hoare triple {15500#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:57,285 INFO L273 TraceCheckUtils]: 78: Hoare triple {15501#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:57,285 INFO L273 TraceCheckUtils]: 79: Hoare triple {15501#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:57,286 INFO L273 TraceCheckUtils]: 80: Hoare triple {15501#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:57,286 INFO L273 TraceCheckUtils]: 81: Hoare triple {15502#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:57,287 INFO L273 TraceCheckUtils]: 82: Hoare triple {15502#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:57,288 INFO L273 TraceCheckUtils]: 83: Hoare triple {15502#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:57,288 INFO L273 TraceCheckUtils]: 84: Hoare triple {15503#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:57,289 INFO L273 TraceCheckUtils]: 85: Hoare triple {15503#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:57,289 INFO L273 TraceCheckUtils]: 86: Hoare triple {15503#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:57,290 INFO L273 TraceCheckUtils]: 87: Hoare triple {15504#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:57,290 INFO L273 TraceCheckUtils]: 88: Hoare triple {15504#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:57,291 INFO L273 TraceCheckUtils]: 89: Hoare triple {15504#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:57,291 INFO L273 TraceCheckUtils]: 90: Hoare triple {15505#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:57,292 INFO L273 TraceCheckUtils]: 91: Hoare triple {15505#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:57,293 INFO L273 TraceCheckUtils]: 92: Hoare triple {15505#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:57,293 INFO L273 TraceCheckUtils]: 93: Hoare triple {15506#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:57,294 INFO L273 TraceCheckUtils]: 94: Hoare triple {15506#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:57,294 INFO L273 TraceCheckUtils]: 95: Hoare triple {15506#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {15507#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:57,295 INFO L273 TraceCheckUtils]: 96: Hoare triple {15507#(<= main_~i~0 30)} assume !(~i~0 < 100000); {15476#false} is VALID [2018-11-23 12:05:57,295 INFO L273 TraceCheckUtils]: 97: Hoare triple {15476#false} havoc ~x~0;~x~0 := 0; {15476#false} is VALID [2018-11-23 12:05:57,296 INFO L273 TraceCheckUtils]: 98: Hoare triple {15476#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15476#false} is VALID [2018-11-23 12:05:57,296 INFO L256 TraceCheckUtils]: 99: Hoare triple {15476#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {15476#false} is VALID [2018-11-23 12:05:57,296 INFO L273 TraceCheckUtils]: 100: Hoare triple {15476#false} ~cond := #in~cond; {15476#false} is VALID [2018-11-23 12:05:57,296 INFO L273 TraceCheckUtils]: 101: Hoare triple {15476#false} assume 0 == ~cond; {15476#false} is VALID [2018-11-23 12:05:57,296 INFO L273 TraceCheckUtils]: 102: Hoare triple {15476#false} assume !false; {15476#false} is VALID [2018-11-23 12:05:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:57,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:57,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 12:05:57,325 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-23 12:05:57,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:57,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:05:57,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:57,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:05:57,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:05:57,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:05:57,446 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand 34 states. [2018-11-23 12:05:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:58,361 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-23 12:05:58,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:05:58,362 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-23 12:05:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:05:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 158 transitions. [2018-11-23 12:05:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:05:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 158 transitions. [2018-11-23 12:05:58,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 158 transitions. [2018-11-23 12:05:58,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:58,551 INFO L225 Difference]: With dead ends: 124 [2018-11-23 12:05:58,551 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:05:58,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:05:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:05:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:05:58,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:58,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:05:58,596 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:05:58,597 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:05:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:58,599 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2018-11-23 12:05:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-11-23 12:05:58,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:58,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:58,599 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:05:58,600 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:05:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:58,601 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2018-11-23 12:05:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-11-23 12:05:58,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:58,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:58,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:58,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:05:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2018-11-23 12:05:58,603 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 103 [2018-11-23 12:05:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:58,604 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2018-11-23 12:05:58,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:05:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2018-11-23 12:05:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 12:05:58,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:58,605 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:58,605 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:58,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash 65028259, now seen corresponding path program 31 times [2018-11-23 12:05:58,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:58,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:58,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:59,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {16359#true} call ULTIMATE.init(); {16359#true} is VALID [2018-11-23 12:05:59,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {16359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16359#true} is VALID [2018-11-23 12:05:59,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {16359#true} assume true; {16359#true} is VALID [2018-11-23 12:05:59,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16359#true} {16359#true} #55#return; {16359#true} is VALID [2018-11-23 12:05:59,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {16359#true} call #t~ret4 := main(); {16359#true} is VALID [2018-11-23 12:05:59,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {16359#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {16361#(= main_~i~0 0)} is VALID [2018-11-23 12:05:59,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {16361#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16361#(= main_~i~0 0)} is VALID [2018-11-23 12:05:59,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {16361#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16361#(= main_~i~0 0)} is VALID [2018-11-23 12:05:59,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {16361#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {16362#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {16362#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {16362#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {16363#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {16363#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {16363#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {16364#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {16364#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {16364#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {16365#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {16365#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {16365#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {16366#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {16366#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,321 INFO L273 TraceCheckUtils]: 23: Hoare triple {16366#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,321 INFO L273 TraceCheckUtils]: 24: Hoare triple {16367#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,322 INFO L273 TraceCheckUtils]: 25: Hoare triple {16367#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,322 INFO L273 TraceCheckUtils]: 26: Hoare triple {16367#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {16368#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,323 INFO L273 TraceCheckUtils]: 28: Hoare triple {16368#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,324 INFO L273 TraceCheckUtils]: 29: Hoare triple {16368#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {16369#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,325 INFO L273 TraceCheckUtils]: 31: Hoare triple {16369#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {16369#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,326 INFO L273 TraceCheckUtils]: 33: Hoare triple {16370#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,327 INFO L273 TraceCheckUtils]: 34: Hoare triple {16370#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,328 INFO L273 TraceCheckUtils]: 35: Hoare triple {16370#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,328 INFO L273 TraceCheckUtils]: 36: Hoare triple {16371#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,329 INFO L273 TraceCheckUtils]: 37: Hoare triple {16371#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,329 INFO L273 TraceCheckUtils]: 38: Hoare triple {16371#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,330 INFO L273 TraceCheckUtils]: 39: Hoare triple {16372#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,330 INFO L273 TraceCheckUtils]: 40: Hoare triple {16372#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {16372#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,332 INFO L273 TraceCheckUtils]: 42: Hoare triple {16373#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,332 INFO L273 TraceCheckUtils]: 43: Hoare triple {16373#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,333 INFO L273 TraceCheckUtils]: 44: Hoare triple {16373#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {16374#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,334 INFO L273 TraceCheckUtils]: 46: Hoare triple {16374#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {16374#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,335 INFO L273 TraceCheckUtils]: 48: Hoare triple {16375#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,335 INFO L273 TraceCheckUtils]: 49: Hoare triple {16375#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,336 INFO L273 TraceCheckUtils]: 50: Hoare triple {16375#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,337 INFO L273 TraceCheckUtils]: 51: Hoare triple {16376#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,337 INFO L273 TraceCheckUtils]: 52: Hoare triple {16376#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,338 INFO L273 TraceCheckUtils]: 53: Hoare triple {16376#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,338 INFO L273 TraceCheckUtils]: 54: Hoare triple {16377#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,339 INFO L273 TraceCheckUtils]: 55: Hoare triple {16377#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,339 INFO L273 TraceCheckUtils]: 56: Hoare triple {16377#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,340 INFO L273 TraceCheckUtils]: 57: Hoare triple {16378#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,340 INFO L273 TraceCheckUtils]: 58: Hoare triple {16378#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,341 INFO L273 TraceCheckUtils]: 59: Hoare triple {16378#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,341 INFO L273 TraceCheckUtils]: 60: Hoare triple {16379#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,342 INFO L273 TraceCheckUtils]: 61: Hoare triple {16379#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,343 INFO L273 TraceCheckUtils]: 62: Hoare triple {16379#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,343 INFO L273 TraceCheckUtils]: 63: Hoare triple {16380#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,344 INFO L273 TraceCheckUtils]: 64: Hoare triple {16380#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,344 INFO L273 TraceCheckUtils]: 65: Hoare triple {16380#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,345 INFO L273 TraceCheckUtils]: 66: Hoare triple {16381#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,345 INFO L273 TraceCheckUtils]: 67: Hoare triple {16381#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,346 INFO L273 TraceCheckUtils]: 68: Hoare triple {16381#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,346 INFO L273 TraceCheckUtils]: 69: Hoare triple {16382#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,347 INFO L273 TraceCheckUtils]: 70: Hoare triple {16382#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,347 INFO L273 TraceCheckUtils]: 71: Hoare triple {16382#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,348 INFO L273 TraceCheckUtils]: 72: Hoare triple {16383#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,348 INFO L273 TraceCheckUtils]: 73: Hoare triple {16383#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,349 INFO L273 TraceCheckUtils]: 74: Hoare triple {16383#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,350 INFO L273 TraceCheckUtils]: 75: Hoare triple {16384#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,350 INFO L273 TraceCheckUtils]: 76: Hoare triple {16384#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,351 INFO L273 TraceCheckUtils]: 77: Hoare triple {16384#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,351 INFO L273 TraceCheckUtils]: 78: Hoare triple {16385#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,352 INFO L273 TraceCheckUtils]: 79: Hoare triple {16385#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,352 INFO L273 TraceCheckUtils]: 80: Hoare triple {16385#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,353 INFO L273 TraceCheckUtils]: 81: Hoare triple {16386#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,353 INFO L273 TraceCheckUtils]: 82: Hoare triple {16386#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,354 INFO L273 TraceCheckUtils]: 83: Hoare triple {16386#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,354 INFO L273 TraceCheckUtils]: 84: Hoare triple {16387#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,355 INFO L273 TraceCheckUtils]: 85: Hoare triple {16387#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,356 INFO L273 TraceCheckUtils]: 86: Hoare triple {16387#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,356 INFO L273 TraceCheckUtils]: 87: Hoare triple {16388#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,357 INFO L273 TraceCheckUtils]: 88: Hoare triple {16388#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,357 INFO L273 TraceCheckUtils]: 89: Hoare triple {16388#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,358 INFO L273 TraceCheckUtils]: 90: Hoare triple {16389#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,358 INFO L273 TraceCheckUtils]: 91: Hoare triple {16389#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,359 INFO L273 TraceCheckUtils]: 92: Hoare triple {16389#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,359 INFO L273 TraceCheckUtils]: 93: Hoare triple {16390#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,360 INFO L273 TraceCheckUtils]: 94: Hoare triple {16390#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,361 INFO L273 TraceCheckUtils]: 95: Hoare triple {16390#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,361 INFO L273 TraceCheckUtils]: 96: Hoare triple {16391#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,362 INFO L273 TraceCheckUtils]: 97: Hoare triple {16391#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,362 INFO L273 TraceCheckUtils]: 98: Hoare triple {16391#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {16392#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:59,363 INFO L273 TraceCheckUtils]: 99: Hoare triple {16392#(<= main_~i~0 31)} assume !(~i~0 < 100000); {16360#false} is VALID [2018-11-23 12:05:59,363 INFO L273 TraceCheckUtils]: 100: Hoare triple {16360#false} havoc ~x~0;~x~0 := 0; {16360#false} is VALID [2018-11-23 12:05:59,364 INFO L273 TraceCheckUtils]: 101: Hoare triple {16360#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16360#false} is VALID [2018-11-23 12:05:59,364 INFO L256 TraceCheckUtils]: 102: Hoare triple {16360#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {16360#false} is VALID [2018-11-23 12:05:59,364 INFO L273 TraceCheckUtils]: 103: Hoare triple {16360#false} ~cond := #in~cond; {16360#false} is VALID [2018-11-23 12:05:59,364 INFO L273 TraceCheckUtils]: 104: Hoare triple {16360#false} assume 0 == ~cond; {16360#false} is VALID [2018-11-23 12:05:59,364 INFO L273 TraceCheckUtils]: 105: Hoare triple {16360#false} assume !false; {16360#false} is VALID [2018-11-23 12:05:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:59,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:59,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:59,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:59,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:59,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {16359#true} call ULTIMATE.init(); {16359#true} is VALID [2018-11-23 12:05:59,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {16359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16359#true} is VALID [2018-11-23 12:05:59,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {16359#true} assume true; {16359#true} is VALID [2018-11-23 12:05:59,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16359#true} {16359#true} #55#return; {16359#true} is VALID [2018-11-23 12:05:59,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {16359#true} call #t~ret4 := main(); {16359#true} is VALID [2018-11-23 12:05:59,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {16359#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {16411#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:59,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {16411#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16411#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:59,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {16411#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16411#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:59,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {16411#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {16362#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {16362#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {16362#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {16363#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {16363#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {16363#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {16364#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {16364#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {16364#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {16365#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {16365#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {16365#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {16366#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {16366#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {16366#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {16367#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {16367#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,691 INFO L273 TraceCheckUtils]: 26: Hoare triple {16367#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,692 INFO L273 TraceCheckUtils]: 27: Hoare triple {16368#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,692 INFO L273 TraceCheckUtils]: 28: Hoare triple {16368#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {16368#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,693 INFO L273 TraceCheckUtils]: 30: Hoare triple {16369#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {16369#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {16369#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,695 INFO L273 TraceCheckUtils]: 33: Hoare triple {16370#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,695 INFO L273 TraceCheckUtils]: 34: Hoare triple {16370#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {16370#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,696 INFO L273 TraceCheckUtils]: 36: Hoare triple {16371#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,697 INFO L273 TraceCheckUtils]: 37: Hoare triple {16371#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,698 INFO L273 TraceCheckUtils]: 38: Hoare triple {16371#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,698 INFO L273 TraceCheckUtils]: 39: Hoare triple {16372#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,699 INFO L273 TraceCheckUtils]: 40: Hoare triple {16372#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,699 INFO L273 TraceCheckUtils]: 41: Hoare triple {16372#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,700 INFO L273 TraceCheckUtils]: 42: Hoare triple {16373#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,700 INFO L273 TraceCheckUtils]: 43: Hoare triple {16373#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,701 INFO L273 TraceCheckUtils]: 44: Hoare triple {16373#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,701 INFO L273 TraceCheckUtils]: 45: Hoare triple {16374#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,702 INFO L273 TraceCheckUtils]: 46: Hoare triple {16374#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,703 INFO L273 TraceCheckUtils]: 47: Hoare triple {16374#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,703 INFO L273 TraceCheckUtils]: 48: Hoare triple {16375#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {16375#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,704 INFO L273 TraceCheckUtils]: 50: Hoare triple {16375#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,705 INFO L273 TraceCheckUtils]: 51: Hoare triple {16376#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,705 INFO L273 TraceCheckUtils]: 52: Hoare triple {16376#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,706 INFO L273 TraceCheckUtils]: 53: Hoare triple {16376#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,706 INFO L273 TraceCheckUtils]: 54: Hoare triple {16377#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,707 INFO L273 TraceCheckUtils]: 55: Hoare triple {16377#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,707 INFO L273 TraceCheckUtils]: 56: Hoare triple {16377#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,708 INFO L273 TraceCheckUtils]: 57: Hoare triple {16378#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,708 INFO L273 TraceCheckUtils]: 58: Hoare triple {16378#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,709 INFO L273 TraceCheckUtils]: 59: Hoare triple {16378#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,709 INFO L273 TraceCheckUtils]: 60: Hoare triple {16379#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,710 INFO L273 TraceCheckUtils]: 61: Hoare triple {16379#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,711 INFO L273 TraceCheckUtils]: 62: Hoare triple {16379#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,711 INFO L273 TraceCheckUtils]: 63: Hoare triple {16380#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,712 INFO L273 TraceCheckUtils]: 64: Hoare triple {16380#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,712 INFO L273 TraceCheckUtils]: 65: Hoare triple {16380#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,713 INFO L273 TraceCheckUtils]: 66: Hoare triple {16381#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,713 INFO L273 TraceCheckUtils]: 67: Hoare triple {16381#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,734 INFO L273 TraceCheckUtils]: 68: Hoare triple {16381#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,745 INFO L273 TraceCheckUtils]: 69: Hoare triple {16382#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,746 INFO L273 TraceCheckUtils]: 70: Hoare triple {16382#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,746 INFO L273 TraceCheckUtils]: 71: Hoare triple {16382#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,746 INFO L273 TraceCheckUtils]: 72: Hoare triple {16383#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,747 INFO L273 TraceCheckUtils]: 73: Hoare triple {16383#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,747 INFO L273 TraceCheckUtils]: 74: Hoare triple {16383#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,747 INFO L273 TraceCheckUtils]: 75: Hoare triple {16384#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,748 INFO L273 TraceCheckUtils]: 76: Hoare triple {16384#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,748 INFO L273 TraceCheckUtils]: 77: Hoare triple {16384#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,749 INFO L273 TraceCheckUtils]: 78: Hoare triple {16385#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,749 INFO L273 TraceCheckUtils]: 79: Hoare triple {16385#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,749 INFO L273 TraceCheckUtils]: 80: Hoare triple {16385#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,750 INFO L273 TraceCheckUtils]: 81: Hoare triple {16386#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,750 INFO L273 TraceCheckUtils]: 82: Hoare triple {16386#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,751 INFO L273 TraceCheckUtils]: 83: Hoare triple {16386#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,751 INFO L273 TraceCheckUtils]: 84: Hoare triple {16387#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,752 INFO L273 TraceCheckUtils]: 85: Hoare triple {16387#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,752 INFO L273 TraceCheckUtils]: 86: Hoare triple {16387#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,753 INFO L273 TraceCheckUtils]: 87: Hoare triple {16388#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,753 INFO L273 TraceCheckUtils]: 88: Hoare triple {16388#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,754 INFO L273 TraceCheckUtils]: 89: Hoare triple {16388#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,755 INFO L273 TraceCheckUtils]: 90: Hoare triple {16389#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,755 INFO L273 TraceCheckUtils]: 91: Hoare triple {16389#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,756 INFO L273 TraceCheckUtils]: 92: Hoare triple {16389#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,756 INFO L273 TraceCheckUtils]: 93: Hoare triple {16390#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,757 INFO L273 TraceCheckUtils]: 94: Hoare triple {16390#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,758 INFO L273 TraceCheckUtils]: 95: Hoare triple {16390#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,758 INFO L273 TraceCheckUtils]: 96: Hoare triple {16391#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,759 INFO L273 TraceCheckUtils]: 97: Hoare triple {16391#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,759 INFO L273 TraceCheckUtils]: 98: Hoare triple {16391#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {16392#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:59,760 INFO L273 TraceCheckUtils]: 99: Hoare triple {16392#(<= main_~i~0 31)} assume !(~i~0 < 100000); {16360#false} is VALID [2018-11-23 12:05:59,760 INFO L273 TraceCheckUtils]: 100: Hoare triple {16360#false} havoc ~x~0;~x~0 := 0; {16360#false} is VALID [2018-11-23 12:05:59,760 INFO L273 TraceCheckUtils]: 101: Hoare triple {16360#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16360#false} is VALID [2018-11-23 12:05:59,761 INFO L256 TraceCheckUtils]: 102: Hoare triple {16360#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {16360#false} is VALID [2018-11-23 12:05:59,761 INFO L273 TraceCheckUtils]: 103: Hoare triple {16360#false} ~cond := #in~cond; {16360#false} is VALID [2018-11-23 12:05:59,761 INFO L273 TraceCheckUtils]: 104: Hoare triple {16360#false} assume 0 == ~cond; {16360#false} is VALID [2018-11-23 12:05:59,761 INFO L273 TraceCheckUtils]: 105: Hoare triple {16360#false} assume !false; {16360#false} is VALID [2018-11-23 12:05:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:59,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:59,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:05:59,788 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-23 12:05:59,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:59,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:05:59,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:59,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:05:59,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:05:59,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:05:59,890 INFO L87 Difference]: Start difference. First operand 111 states and 143 transitions. Second operand 35 states. [2018-11-23 12:06:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:00,381 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-23 12:06:00,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:06:00,381 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-23 12:06:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:06:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 162 transitions. [2018-11-23 12:06:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:06:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 162 transitions. [2018-11-23 12:06:00,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 162 transitions. [2018-11-23 12:06:00,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:00,579 INFO L225 Difference]: With dead ends: 127 [2018-11-23 12:06:00,580 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 12:06:00,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:06:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 12:06:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-11-23 12:06:00,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:00,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 114 states. [2018-11-23 12:06:00,619 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 114 states. [2018-11-23 12:06:00,619 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 114 states. [2018-11-23 12:06:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:00,622 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2018-11-23 12:06:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2018-11-23 12:06:00,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:00,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:00,623 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 116 states. [2018-11-23 12:06:00,623 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 116 states. [2018-11-23 12:06:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:00,625 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2018-11-23 12:06:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2018-11-23 12:06:00,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:00,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:00,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:00,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 12:06:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2018-11-23 12:06:00,627 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 106 [2018-11-23 12:06:00,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:00,627 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2018-11-23 12:06:00,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:06:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2018-11-23 12:06:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 12:06:00,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:00,628 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:00,629 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:00,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash -728020807, now seen corresponding path program 32 times [2018-11-23 12:06:00,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:00,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:00,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:00,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:00,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:02,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {17267#true} call ULTIMATE.init(); {17267#true} is VALID [2018-11-23 12:06:02,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {17267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17267#true} is VALID [2018-11-23 12:06:02,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {17267#true} assume true; {17267#true} is VALID [2018-11-23 12:06:02,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17267#true} {17267#true} #55#return; {17267#true} is VALID [2018-11-23 12:06:02,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {17267#true} call #t~ret4 := main(); {17267#true} is VALID [2018-11-23 12:06:02,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {17267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {17269#(= main_~i~0 0)} is VALID [2018-11-23 12:06:02,130 INFO L273 TraceCheckUtils]: 6: Hoare triple {17269#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17269#(= main_~i~0 0)} is VALID [2018-11-23 12:06:02,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {17269#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17269#(= main_~i~0 0)} is VALID [2018-11-23 12:06:02,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {17269#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {17270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {17270#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,133 INFO L273 TraceCheckUtils]: 11: Hoare triple {17270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {17271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {17271#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {17271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {17272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {17272#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,136 INFO L273 TraceCheckUtils]: 17: Hoare triple {17272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,137 INFO L273 TraceCheckUtils]: 18: Hoare triple {17273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,137 INFO L273 TraceCheckUtils]: 19: Hoare triple {17273#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {17273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,138 INFO L273 TraceCheckUtils]: 21: Hoare triple {17274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,139 INFO L273 TraceCheckUtils]: 22: Hoare triple {17274#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,140 INFO L273 TraceCheckUtils]: 23: Hoare triple {17274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,140 INFO L273 TraceCheckUtils]: 24: Hoare triple {17275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,141 INFO L273 TraceCheckUtils]: 25: Hoare triple {17275#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {17275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,142 INFO L273 TraceCheckUtils]: 27: Hoare triple {17276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {17276#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,143 INFO L273 TraceCheckUtils]: 29: Hoare triple {17276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {17277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {17277#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {17277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {17278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,145 INFO L273 TraceCheckUtils]: 34: Hoare triple {17278#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {17278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,146 INFO L273 TraceCheckUtils]: 36: Hoare triple {17279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {17279#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,148 INFO L273 TraceCheckUtils]: 38: Hoare triple {17279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,148 INFO L273 TraceCheckUtils]: 39: Hoare triple {17280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,149 INFO L273 TraceCheckUtils]: 40: Hoare triple {17280#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,149 INFO L273 TraceCheckUtils]: 41: Hoare triple {17280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {17281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,150 INFO L273 TraceCheckUtils]: 43: Hoare triple {17281#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {17281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {17282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {17282#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,152 INFO L273 TraceCheckUtils]: 47: Hoare triple {17282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {17283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,153 INFO L273 TraceCheckUtils]: 49: Hoare triple {17283#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,154 INFO L273 TraceCheckUtils]: 50: Hoare triple {17283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,155 INFO L273 TraceCheckUtils]: 51: Hoare triple {17284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,155 INFO L273 TraceCheckUtils]: 52: Hoare triple {17284#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,156 INFO L273 TraceCheckUtils]: 53: Hoare triple {17284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,156 INFO L273 TraceCheckUtils]: 54: Hoare triple {17285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,157 INFO L273 TraceCheckUtils]: 55: Hoare triple {17285#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,157 INFO L273 TraceCheckUtils]: 56: Hoare triple {17285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,158 INFO L273 TraceCheckUtils]: 57: Hoare triple {17286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,158 INFO L273 TraceCheckUtils]: 58: Hoare triple {17286#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,159 INFO L273 TraceCheckUtils]: 59: Hoare triple {17286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,159 INFO L273 TraceCheckUtils]: 60: Hoare triple {17287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,160 INFO L273 TraceCheckUtils]: 61: Hoare triple {17287#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,160 INFO L273 TraceCheckUtils]: 62: Hoare triple {17287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,161 INFO L273 TraceCheckUtils]: 63: Hoare triple {17288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,161 INFO L273 TraceCheckUtils]: 64: Hoare triple {17288#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,162 INFO L273 TraceCheckUtils]: 65: Hoare triple {17288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,163 INFO L273 TraceCheckUtils]: 66: Hoare triple {17289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,163 INFO L273 TraceCheckUtils]: 67: Hoare triple {17289#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,164 INFO L273 TraceCheckUtils]: 68: Hoare triple {17289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,164 INFO L273 TraceCheckUtils]: 69: Hoare triple {17290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,165 INFO L273 TraceCheckUtils]: 70: Hoare triple {17290#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,165 INFO L273 TraceCheckUtils]: 71: Hoare triple {17290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,166 INFO L273 TraceCheckUtils]: 72: Hoare triple {17291#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,166 INFO L273 TraceCheckUtils]: 73: Hoare triple {17291#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,167 INFO L273 TraceCheckUtils]: 74: Hoare triple {17291#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:02,167 INFO L273 TraceCheckUtils]: 75: Hoare triple {17292#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:02,168 INFO L273 TraceCheckUtils]: 76: Hoare triple {17292#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:02,169 INFO L273 TraceCheckUtils]: 77: Hoare triple {17292#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:02,169 INFO L273 TraceCheckUtils]: 78: Hoare triple {17293#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:02,170 INFO L273 TraceCheckUtils]: 79: Hoare triple {17293#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:02,170 INFO L273 TraceCheckUtils]: 80: Hoare triple {17293#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:02,171 INFO L273 TraceCheckUtils]: 81: Hoare triple {17294#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:02,171 INFO L273 TraceCheckUtils]: 82: Hoare triple {17294#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:02,172 INFO L273 TraceCheckUtils]: 83: Hoare triple {17294#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:02,172 INFO L273 TraceCheckUtils]: 84: Hoare triple {17295#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:02,173 INFO L273 TraceCheckUtils]: 85: Hoare triple {17295#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:02,174 INFO L273 TraceCheckUtils]: 86: Hoare triple {17295#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:02,174 INFO L273 TraceCheckUtils]: 87: Hoare triple {17296#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:02,175 INFO L273 TraceCheckUtils]: 88: Hoare triple {17296#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:02,175 INFO L273 TraceCheckUtils]: 89: Hoare triple {17296#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:02,176 INFO L273 TraceCheckUtils]: 90: Hoare triple {17297#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:02,176 INFO L273 TraceCheckUtils]: 91: Hoare triple {17297#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:02,177 INFO L273 TraceCheckUtils]: 92: Hoare triple {17297#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:02,177 INFO L273 TraceCheckUtils]: 93: Hoare triple {17298#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:02,178 INFO L273 TraceCheckUtils]: 94: Hoare triple {17298#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:02,179 INFO L273 TraceCheckUtils]: 95: Hoare triple {17298#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:02,179 INFO L273 TraceCheckUtils]: 96: Hoare triple {17299#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:02,180 INFO L273 TraceCheckUtils]: 97: Hoare triple {17299#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:02,180 INFO L273 TraceCheckUtils]: 98: Hoare triple {17299#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:02,181 INFO L273 TraceCheckUtils]: 99: Hoare triple {17300#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:02,181 INFO L273 TraceCheckUtils]: 100: Hoare triple {17300#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:02,182 INFO L273 TraceCheckUtils]: 101: Hoare triple {17300#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {17301#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:02,183 INFO L273 TraceCheckUtils]: 102: Hoare triple {17301#(<= main_~i~0 32)} assume !(~i~0 < 100000); {17268#false} is VALID [2018-11-23 12:06:02,183 INFO L273 TraceCheckUtils]: 103: Hoare triple {17268#false} havoc ~x~0;~x~0 := 0; {17268#false} is VALID [2018-11-23 12:06:02,183 INFO L273 TraceCheckUtils]: 104: Hoare triple {17268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {17268#false} is VALID [2018-11-23 12:06:02,183 INFO L256 TraceCheckUtils]: 105: Hoare triple {17268#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {17268#false} is VALID [2018-11-23 12:06:02,183 INFO L273 TraceCheckUtils]: 106: Hoare triple {17268#false} ~cond := #in~cond; {17268#false} is VALID [2018-11-23 12:06:02,183 INFO L273 TraceCheckUtils]: 107: Hoare triple {17268#false} assume 0 == ~cond; {17268#false} is VALID [2018-11-23 12:06:02,184 INFO L273 TraceCheckUtils]: 108: Hoare triple {17268#false} assume !false; {17268#false} is VALID [2018-11-23 12:06:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:02,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:02,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:02,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:02,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:02,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:02,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:02,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {17267#true} call ULTIMATE.init(); {17267#true} is VALID [2018-11-23 12:06:02,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {17267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17267#true} is VALID [2018-11-23 12:06:02,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {17267#true} assume true; {17267#true} is VALID [2018-11-23 12:06:02,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17267#true} {17267#true} #55#return; {17267#true} is VALID [2018-11-23 12:06:02,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {17267#true} call #t~ret4 := main(); {17267#true} is VALID [2018-11-23 12:06:02,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {17267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {17320#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:02,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {17320#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17320#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:02,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {17320#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17320#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:02,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {17320#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {17270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {17270#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {17270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {17271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {17271#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {17271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {17272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {17272#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,514 INFO L273 TraceCheckUtils]: 17: Hoare triple {17272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {17273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,515 INFO L273 TraceCheckUtils]: 19: Hoare triple {17273#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {17273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {17274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {17274#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,517 INFO L273 TraceCheckUtils]: 23: Hoare triple {17274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {17275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {17275#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {17275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {17276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {17276#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {17276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,521 INFO L273 TraceCheckUtils]: 30: Hoare triple {17277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,522 INFO L273 TraceCheckUtils]: 31: Hoare triple {17277#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,523 INFO L273 TraceCheckUtils]: 32: Hoare triple {17277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,523 INFO L273 TraceCheckUtils]: 33: Hoare triple {17278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {17278#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,524 INFO L273 TraceCheckUtils]: 35: Hoare triple {17278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,525 INFO L273 TraceCheckUtils]: 36: Hoare triple {17279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,525 INFO L273 TraceCheckUtils]: 37: Hoare triple {17279#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {17279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,527 INFO L273 TraceCheckUtils]: 39: Hoare triple {17280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,527 INFO L273 TraceCheckUtils]: 40: Hoare triple {17280#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,528 INFO L273 TraceCheckUtils]: 41: Hoare triple {17280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,528 INFO L273 TraceCheckUtils]: 42: Hoare triple {17281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,529 INFO L273 TraceCheckUtils]: 43: Hoare triple {17281#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {17281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,530 INFO L273 TraceCheckUtils]: 45: Hoare triple {17282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,531 INFO L273 TraceCheckUtils]: 46: Hoare triple {17282#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,531 INFO L273 TraceCheckUtils]: 47: Hoare triple {17282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {17283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,532 INFO L273 TraceCheckUtils]: 49: Hoare triple {17283#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,533 INFO L273 TraceCheckUtils]: 50: Hoare triple {17283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {17284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,534 INFO L273 TraceCheckUtils]: 52: Hoare triple {17284#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,535 INFO L273 TraceCheckUtils]: 53: Hoare triple {17284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,535 INFO L273 TraceCheckUtils]: 54: Hoare triple {17285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,536 INFO L273 TraceCheckUtils]: 55: Hoare triple {17285#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,537 INFO L273 TraceCheckUtils]: 56: Hoare triple {17285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,537 INFO L273 TraceCheckUtils]: 57: Hoare triple {17286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,538 INFO L273 TraceCheckUtils]: 58: Hoare triple {17286#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,538 INFO L273 TraceCheckUtils]: 59: Hoare triple {17286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,539 INFO L273 TraceCheckUtils]: 60: Hoare triple {17287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,539 INFO L273 TraceCheckUtils]: 61: Hoare triple {17287#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,540 INFO L273 TraceCheckUtils]: 62: Hoare triple {17287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {17288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,541 INFO L273 TraceCheckUtils]: 64: Hoare triple {17288#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,545 INFO L273 TraceCheckUtils]: 65: Hoare triple {17288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,546 INFO L273 TraceCheckUtils]: 66: Hoare triple {17289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,546 INFO L273 TraceCheckUtils]: 67: Hoare triple {17289#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,547 INFO L273 TraceCheckUtils]: 68: Hoare triple {17289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,547 INFO L273 TraceCheckUtils]: 69: Hoare triple {17290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,547 INFO L273 TraceCheckUtils]: 70: Hoare triple {17290#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,551 INFO L273 TraceCheckUtils]: 71: Hoare triple {17290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,552 INFO L273 TraceCheckUtils]: 72: Hoare triple {17291#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,552 INFO L273 TraceCheckUtils]: 73: Hoare triple {17291#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,552 INFO L273 TraceCheckUtils]: 74: Hoare triple {17291#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:02,553 INFO L273 TraceCheckUtils]: 75: Hoare triple {17292#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:02,553 INFO L273 TraceCheckUtils]: 76: Hoare triple {17292#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:02,554 INFO L273 TraceCheckUtils]: 77: Hoare triple {17292#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:02,554 INFO L273 TraceCheckUtils]: 78: Hoare triple {17293#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:02,555 INFO L273 TraceCheckUtils]: 79: Hoare triple {17293#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:02,555 INFO L273 TraceCheckUtils]: 80: Hoare triple {17293#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:02,556 INFO L273 TraceCheckUtils]: 81: Hoare triple {17294#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:02,556 INFO L273 TraceCheckUtils]: 82: Hoare triple {17294#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:02,558 INFO L273 TraceCheckUtils]: 83: Hoare triple {17294#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:02,558 INFO L273 TraceCheckUtils]: 84: Hoare triple {17295#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:02,579 INFO L273 TraceCheckUtils]: 85: Hoare triple {17295#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:02,592 INFO L273 TraceCheckUtils]: 86: Hoare triple {17295#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:02,594 INFO L273 TraceCheckUtils]: 87: Hoare triple {17296#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:02,599 INFO L273 TraceCheckUtils]: 88: Hoare triple {17296#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:02,601 INFO L273 TraceCheckUtils]: 89: Hoare triple {17296#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:02,601 INFO L273 TraceCheckUtils]: 90: Hoare triple {17297#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:02,603 INFO L273 TraceCheckUtils]: 91: Hoare triple {17297#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:02,604 INFO L273 TraceCheckUtils]: 92: Hoare triple {17297#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:02,606 INFO L273 TraceCheckUtils]: 93: Hoare triple {17298#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:02,606 INFO L273 TraceCheckUtils]: 94: Hoare triple {17298#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:02,608 INFO L273 TraceCheckUtils]: 95: Hoare triple {17298#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:02,608 INFO L273 TraceCheckUtils]: 96: Hoare triple {17299#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:02,610 INFO L273 TraceCheckUtils]: 97: Hoare triple {17299#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:02,610 INFO L273 TraceCheckUtils]: 98: Hoare triple {17299#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:02,612 INFO L273 TraceCheckUtils]: 99: Hoare triple {17300#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:02,612 INFO L273 TraceCheckUtils]: 100: Hoare triple {17300#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:02,614 INFO L273 TraceCheckUtils]: 101: Hoare triple {17300#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {17301#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:02,614 INFO L273 TraceCheckUtils]: 102: Hoare triple {17301#(<= main_~i~0 32)} assume !(~i~0 < 100000); {17268#false} is VALID [2018-11-23 12:06:02,614 INFO L273 TraceCheckUtils]: 103: Hoare triple {17268#false} havoc ~x~0;~x~0 := 0; {17268#false} is VALID [2018-11-23 12:06:02,614 INFO L273 TraceCheckUtils]: 104: Hoare triple {17268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {17268#false} is VALID [2018-11-23 12:06:02,614 INFO L256 TraceCheckUtils]: 105: Hoare triple {17268#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {17268#false} is VALID [2018-11-23 12:06:02,615 INFO L273 TraceCheckUtils]: 106: Hoare triple {17268#false} ~cond := #in~cond; {17268#false} is VALID [2018-11-23 12:06:02,615 INFO L273 TraceCheckUtils]: 107: Hoare triple {17268#false} assume 0 == ~cond; {17268#false} is VALID [2018-11-23 12:06:02,615 INFO L273 TraceCheckUtils]: 108: Hoare triple {17268#false} assume !false; {17268#false} is VALID [2018-11-23 12:06:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:02,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:02,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:06:02,643 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-23 12:06:02,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:02,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:06:02,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:02,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:06:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:06:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:06:02,789 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand 36 states. [2018-11-23 12:06:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:03,482 INFO L93 Difference]: Finished difference Result 130 states and 166 transitions. [2018-11-23 12:06:03,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:06:03,482 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-23 12:06:03,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:06:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 166 transitions. [2018-11-23 12:06:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:06:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 166 transitions. [2018-11-23 12:06:03,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 166 transitions. [2018-11-23 12:06:03,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:03,639 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:06:03,639 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 12:06:03,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:06:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 12:06:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 12:06:03,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:03,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-23 12:06:03,670 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-23 12:06:03,670 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-23 12:06:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:03,672 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-11-23 12:06:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-23 12:06:03,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:03,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:03,672 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-23 12:06:03,673 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-23 12:06:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:03,675 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-11-23 12:06:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-23 12:06:03,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:03,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:03,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:03,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 12:06:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2018-11-23 12:06:03,678 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 109 [2018-11-23 12:06:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:03,678 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2018-11-23 12:06:03,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:06:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2018-11-23 12:06:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 12:06:03,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:03,679 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:03,679 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:03,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash 162349283, now seen corresponding path program 33 times [2018-11-23 12:06:03,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:03,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:03,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:03,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:03,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:04,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {18199#true} call ULTIMATE.init(); {18199#true} is VALID [2018-11-23 12:06:04,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {18199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18199#true} is VALID [2018-11-23 12:06:04,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {18199#true} assume true; {18199#true} is VALID [2018-11-23 12:06:04,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18199#true} {18199#true} #55#return; {18199#true} is VALID [2018-11-23 12:06:04,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {18199#true} call #t~ret4 := main(); {18199#true} is VALID [2018-11-23 12:06:04,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {18199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {18201#(= main_~i~0 0)} is VALID [2018-11-23 12:06:04,347 INFO L273 TraceCheckUtils]: 6: Hoare triple {18201#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18201#(= main_~i~0 0)} is VALID [2018-11-23 12:06:04,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {18201#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18201#(= main_~i~0 0)} is VALID [2018-11-23 12:06:04,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {18201#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:04,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {18202#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:04,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {18202#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:04,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {18202#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:04,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {18203#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:04,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {18203#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:04,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {18203#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:04,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {18204#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:04,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {18204#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:04,352 INFO L273 TraceCheckUtils]: 17: Hoare triple {18204#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:04,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {18205#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:04,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {18205#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:04,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {18205#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:04,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {18206#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:04,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {18206#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:04,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {18206#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:04,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {18207#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:04,357 INFO L273 TraceCheckUtils]: 25: Hoare triple {18207#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:04,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {18207#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:04,359 INFO L273 TraceCheckUtils]: 27: Hoare triple {18208#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:04,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {18208#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:04,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {18208#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:04,360 INFO L273 TraceCheckUtils]: 30: Hoare triple {18209#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:04,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {18209#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:04,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {18209#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:04,362 INFO L273 TraceCheckUtils]: 33: Hoare triple {18210#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:04,362 INFO L273 TraceCheckUtils]: 34: Hoare triple {18210#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:04,363 INFO L273 TraceCheckUtils]: 35: Hoare triple {18210#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:04,363 INFO L273 TraceCheckUtils]: 36: Hoare triple {18211#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:04,364 INFO L273 TraceCheckUtils]: 37: Hoare triple {18211#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:04,365 INFO L273 TraceCheckUtils]: 38: Hoare triple {18211#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:04,365 INFO L273 TraceCheckUtils]: 39: Hoare triple {18212#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:04,367 INFO L273 TraceCheckUtils]: 40: Hoare triple {18212#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:04,368 INFO L273 TraceCheckUtils]: 41: Hoare triple {18212#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:04,368 INFO L273 TraceCheckUtils]: 42: Hoare triple {18213#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:04,369 INFO L273 TraceCheckUtils]: 43: Hoare triple {18213#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:04,369 INFO L273 TraceCheckUtils]: 44: Hoare triple {18213#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:04,369 INFO L273 TraceCheckUtils]: 45: Hoare triple {18214#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:04,370 INFO L273 TraceCheckUtils]: 46: Hoare triple {18214#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:04,370 INFO L273 TraceCheckUtils]: 47: Hoare triple {18214#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:04,371 INFO L273 TraceCheckUtils]: 48: Hoare triple {18215#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:04,371 INFO L273 TraceCheckUtils]: 49: Hoare triple {18215#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:04,372 INFO L273 TraceCheckUtils]: 50: Hoare triple {18215#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:04,372 INFO L273 TraceCheckUtils]: 51: Hoare triple {18216#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:04,373 INFO L273 TraceCheckUtils]: 52: Hoare triple {18216#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:04,373 INFO L273 TraceCheckUtils]: 53: Hoare triple {18216#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:04,374 INFO L273 TraceCheckUtils]: 54: Hoare triple {18217#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:04,374 INFO L273 TraceCheckUtils]: 55: Hoare triple {18217#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:04,375 INFO L273 TraceCheckUtils]: 56: Hoare triple {18217#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:04,375 INFO L273 TraceCheckUtils]: 57: Hoare triple {18218#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:04,376 INFO L273 TraceCheckUtils]: 58: Hoare triple {18218#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:04,377 INFO L273 TraceCheckUtils]: 59: Hoare triple {18218#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:04,377 INFO L273 TraceCheckUtils]: 60: Hoare triple {18219#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:04,377 INFO L273 TraceCheckUtils]: 61: Hoare triple {18219#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:04,378 INFO L273 TraceCheckUtils]: 62: Hoare triple {18219#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:04,379 INFO L273 TraceCheckUtils]: 63: Hoare triple {18220#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:04,379 INFO L273 TraceCheckUtils]: 64: Hoare triple {18220#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:04,380 INFO L273 TraceCheckUtils]: 65: Hoare triple {18220#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:04,380 INFO L273 TraceCheckUtils]: 66: Hoare triple {18221#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:04,381 INFO L273 TraceCheckUtils]: 67: Hoare triple {18221#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:04,381 INFO L273 TraceCheckUtils]: 68: Hoare triple {18221#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:04,382 INFO L273 TraceCheckUtils]: 69: Hoare triple {18222#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:04,382 INFO L273 TraceCheckUtils]: 70: Hoare triple {18222#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:04,383 INFO L273 TraceCheckUtils]: 71: Hoare triple {18222#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:04,383 INFO L273 TraceCheckUtils]: 72: Hoare triple {18223#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:04,384 INFO L273 TraceCheckUtils]: 73: Hoare triple {18223#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:04,385 INFO L273 TraceCheckUtils]: 74: Hoare triple {18223#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:04,385 INFO L273 TraceCheckUtils]: 75: Hoare triple {18224#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:04,385 INFO L273 TraceCheckUtils]: 76: Hoare triple {18224#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:04,386 INFO L273 TraceCheckUtils]: 77: Hoare triple {18224#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:04,387 INFO L273 TraceCheckUtils]: 78: Hoare triple {18225#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:04,387 INFO L273 TraceCheckUtils]: 79: Hoare triple {18225#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:04,388 INFO L273 TraceCheckUtils]: 80: Hoare triple {18225#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:04,388 INFO L273 TraceCheckUtils]: 81: Hoare triple {18226#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:04,389 INFO L273 TraceCheckUtils]: 82: Hoare triple {18226#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:04,389 INFO L273 TraceCheckUtils]: 83: Hoare triple {18226#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:04,390 INFO L273 TraceCheckUtils]: 84: Hoare triple {18227#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:04,390 INFO L273 TraceCheckUtils]: 85: Hoare triple {18227#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:04,391 INFO L273 TraceCheckUtils]: 86: Hoare triple {18227#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:04,392 INFO L273 TraceCheckUtils]: 87: Hoare triple {18228#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:04,392 INFO L273 TraceCheckUtils]: 88: Hoare triple {18228#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:04,393 INFO L273 TraceCheckUtils]: 89: Hoare triple {18228#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:04,393 INFO L273 TraceCheckUtils]: 90: Hoare triple {18229#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:04,394 INFO L273 TraceCheckUtils]: 91: Hoare triple {18229#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:04,394 INFO L273 TraceCheckUtils]: 92: Hoare triple {18229#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:04,395 INFO L273 TraceCheckUtils]: 93: Hoare triple {18230#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:04,395 INFO L273 TraceCheckUtils]: 94: Hoare triple {18230#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:04,396 INFO L273 TraceCheckUtils]: 95: Hoare triple {18230#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:04,396 INFO L273 TraceCheckUtils]: 96: Hoare triple {18231#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:04,397 INFO L273 TraceCheckUtils]: 97: Hoare triple {18231#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:04,397 INFO L273 TraceCheckUtils]: 98: Hoare triple {18231#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:04,398 INFO L273 TraceCheckUtils]: 99: Hoare triple {18232#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:04,398 INFO L273 TraceCheckUtils]: 100: Hoare triple {18232#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:04,399 INFO L273 TraceCheckUtils]: 101: Hoare triple {18232#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:04,400 INFO L273 TraceCheckUtils]: 102: Hoare triple {18233#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:04,400 INFO L273 TraceCheckUtils]: 103: Hoare triple {18233#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:04,401 INFO L273 TraceCheckUtils]: 104: Hoare triple {18233#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {18234#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:04,401 INFO L273 TraceCheckUtils]: 105: Hoare triple {18234#(<= main_~i~0 33)} assume !(~i~0 < 100000); {18200#false} is VALID [2018-11-23 12:06:04,402 INFO L273 TraceCheckUtils]: 106: Hoare triple {18200#false} havoc ~x~0;~x~0 := 0; {18200#false} is VALID [2018-11-23 12:06:04,402 INFO L273 TraceCheckUtils]: 107: Hoare triple {18200#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {18200#false} is VALID [2018-11-23 12:06:04,402 INFO L256 TraceCheckUtils]: 108: Hoare triple {18200#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {18200#false} is VALID [2018-11-23 12:06:04,402 INFO L273 TraceCheckUtils]: 109: Hoare triple {18200#false} ~cond := #in~cond; {18200#false} is VALID [2018-11-23 12:06:04,402 INFO L273 TraceCheckUtils]: 110: Hoare triple {18200#false} assume 0 == ~cond; {18200#false} is VALID [2018-11-23 12:06:04,402 INFO L273 TraceCheckUtils]: 111: Hoare triple {18200#false} assume !false; {18200#false} is VALID [2018-11-23 12:06:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:04,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:04,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:04,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:04,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 12:06:04,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:04,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:04,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {18199#true} call ULTIMATE.init(); {18199#true} is VALID [2018-11-23 12:06:04,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {18199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18199#true} is VALID [2018-11-23 12:06:04,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {18199#true} assume true; {18199#true} is VALID [2018-11-23 12:06:04,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18199#true} {18199#true} #55#return; {18199#true} is VALID [2018-11-23 12:06:04,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {18199#true} call #t~ret4 := main(); {18199#true} is VALID [2018-11-23 12:06:04,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {18199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {18253#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:04,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {18253#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18253#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:04,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {18253#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18253#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:04,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {18253#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:04,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {18202#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:04,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {18202#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:04,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {18202#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:04,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {18203#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:04,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {18203#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:04,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {18203#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:04,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {18204#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:04,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {18204#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:04,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {18204#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:04,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {18205#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:04,808 INFO L273 TraceCheckUtils]: 19: Hoare triple {18205#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:04,808 INFO L273 TraceCheckUtils]: 20: Hoare triple {18205#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:04,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {18206#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:04,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {18206#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:04,810 INFO L273 TraceCheckUtils]: 23: Hoare triple {18206#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:04,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {18207#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:04,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {18207#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:04,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {18207#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:04,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {18208#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:04,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {18208#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:04,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {18208#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:04,814 INFO L273 TraceCheckUtils]: 30: Hoare triple {18209#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:04,815 INFO L273 TraceCheckUtils]: 31: Hoare triple {18209#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:04,815 INFO L273 TraceCheckUtils]: 32: Hoare triple {18209#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:04,816 INFO L273 TraceCheckUtils]: 33: Hoare triple {18210#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:04,816 INFO L273 TraceCheckUtils]: 34: Hoare triple {18210#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:04,817 INFO L273 TraceCheckUtils]: 35: Hoare triple {18210#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:04,818 INFO L273 TraceCheckUtils]: 36: Hoare triple {18211#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:04,818 INFO L273 TraceCheckUtils]: 37: Hoare triple {18211#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:04,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {18211#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:04,819 INFO L273 TraceCheckUtils]: 39: Hoare triple {18212#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:04,820 INFO L273 TraceCheckUtils]: 40: Hoare triple {18212#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:04,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {18212#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:04,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {18213#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:04,822 INFO L273 TraceCheckUtils]: 43: Hoare triple {18213#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:04,822 INFO L273 TraceCheckUtils]: 44: Hoare triple {18213#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:04,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {18214#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:04,823 INFO L273 TraceCheckUtils]: 46: Hoare triple {18214#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:04,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {18214#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:04,824 INFO L273 TraceCheckUtils]: 48: Hoare triple {18215#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:04,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {18215#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:04,826 INFO L273 TraceCheckUtils]: 50: Hoare triple {18215#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:04,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {18216#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:04,827 INFO L273 TraceCheckUtils]: 52: Hoare triple {18216#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:04,827 INFO L273 TraceCheckUtils]: 53: Hoare triple {18216#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:04,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {18217#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:04,828 INFO L273 TraceCheckUtils]: 55: Hoare triple {18217#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:04,829 INFO L273 TraceCheckUtils]: 56: Hoare triple {18217#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:04,830 INFO L273 TraceCheckUtils]: 57: Hoare triple {18218#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:04,830 INFO L273 TraceCheckUtils]: 58: Hoare triple {18218#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:04,831 INFO L273 TraceCheckUtils]: 59: Hoare triple {18218#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:04,831 INFO L273 TraceCheckUtils]: 60: Hoare triple {18219#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:04,832 INFO L273 TraceCheckUtils]: 61: Hoare triple {18219#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:04,833 INFO L273 TraceCheckUtils]: 62: Hoare triple {18219#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:04,833 INFO L273 TraceCheckUtils]: 63: Hoare triple {18220#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:04,834 INFO L273 TraceCheckUtils]: 64: Hoare triple {18220#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:04,834 INFO L273 TraceCheckUtils]: 65: Hoare triple {18220#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:04,835 INFO L273 TraceCheckUtils]: 66: Hoare triple {18221#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:04,835 INFO L273 TraceCheckUtils]: 67: Hoare triple {18221#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:04,836 INFO L273 TraceCheckUtils]: 68: Hoare triple {18221#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:04,837 INFO L273 TraceCheckUtils]: 69: Hoare triple {18222#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:04,837 INFO L273 TraceCheckUtils]: 70: Hoare triple {18222#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:04,838 INFO L273 TraceCheckUtils]: 71: Hoare triple {18222#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:04,838 INFO L273 TraceCheckUtils]: 72: Hoare triple {18223#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:04,839 INFO L273 TraceCheckUtils]: 73: Hoare triple {18223#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:04,840 INFO L273 TraceCheckUtils]: 74: Hoare triple {18223#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:04,840 INFO L273 TraceCheckUtils]: 75: Hoare triple {18224#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:04,841 INFO L273 TraceCheckUtils]: 76: Hoare triple {18224#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:04,841 INFO L273 TraceCheckUtils]: 77: Hoare triple {18224#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:04,842 INFO L273 TraceCheckUtils]: 78: Hoare triple {18225#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:04,842 INFO L273 TraceCheckUtils]: 79: Hoare triple {18225#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:04,843 INFO L273 TraceCheckUtils]: 80: Hoare triple {18225#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:04,843 INFO L273 TraceCheckUtils]: 81: Hoare triple {18226#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:04,844 INFO L273 TraceCheckUtils]: 82: Hoare triple {18226#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:04,845 INFO L273 TraceCheckUtils]: 83: Hoare triple {18226#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:04,845 INFO L273 TraceCheckUtils]: 84: Hoare triple {18227#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:04,846 INFO L273 TraceCheckUtils]: 85: Hoare triple {18227#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:04,846 INFO L273 TraceCheckUtils]: 86: Hoare triple {18227#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:04,847 INFO L273 TraceCheckUtils]: 87: Hoare triple {18228#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:04,847 INFO L273 TraceCheckUtils]: 88: Hoare triple {18228#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:04,848 INFO L273 TraceCheckUtils]: 89: Hoare triple {18228#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:04,849 INFO L273 TraceCheckUtils]: 90: Hoare triple {18229#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:04,849 INFO L273 TraceCheckUtils]: 91: Hoare triple {18229#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:04,850 INFO L273 TraceCheckUtils]: 92: Hoare triple {18229#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:04,850 INFO L273 TraceCheckUtils]: 93: Hoare triple {18230#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:04,851 INFO L273 TraceCheckUtils]: 94: Hoare triple {18230#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:04,851 INFO L273 TraceCheckUtils]: 95: Hoare triple {18230#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:04,852 INFO L273 TraceCheckUtils]: 96: Hoare triple {18231#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:04,852 INFO L273 TraceCheckUtils]: 97: Hoare triple {18231#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:04,853 INFO L273 TraceCheckUtils]: 98: Hoare triple {18231#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:04,854 INFO L273 TraceCheckUtils]: 99: Hoare triple {18232#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:04,854 INFO L273 TraceCheckUtils]: 100: Hoare triple {18232#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:04,855 INFO L273 TraceCheckUtils]: 101: Hoare triple {18232#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:04,855 INFO L273 TraceCheckUtils]: 102: Hoare triple {18233#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:04,856 INFO L273 TraceCheckUtils]: 103: Hoare triple {18233#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:04,857 INFO L273 TraceCheckUtils]: 104: Hoare triple {18233#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {18234#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:04,857 INFO L273 TraceCheckUtils]: 105: Hoare triple {18234#(<= main_~i~0 33)} assume !(~i~0 < 100000); {18200#false} is VALID [2018-11-23 12:06:04,857 INFO L273 TraceCheckUtils]: 106: Hoare triple {18200#false} havoc ~x~0;~x~0 := 0; {18200#false} is VALID [2018-11-23 12:06:04,858 INFO L273 TraceCheckUtils]: 107: Hoare triple {18200#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {18200#false} is VALID [2018-11-23 12:06:04,858 INFO L256 TraceCheckUtils]: 108: Hoare triple {18200#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {18200#false} is VALID [2018-11-23 12:06:04,858 INFO L273 TraceCheckUtils]: 109: Hoare triple {18200#false} ~cond := #in~cond; {18200#false} is VALID [2018-11-23 12:06:04,858 INFO L273 TraceCheckUtils]: 110: Hoare triple {18200#false} assume 0 == ~cond; {18200#false} is VALID [2018-11-23 12:06:04,858 INFO L273 TraceCheckUtils]: 111: Hoare triple {18200#false} assume !false; {18200#false} is VALID [2018-11-23 12:06:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:04,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:04,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:06:04,887 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2018-11-23 12:06:04,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:04,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:06:04,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:04,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:06:04,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:06:04,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:06:04,998 INFO L87 Difference]: Start difference. First operand 117 states and 151 transitions. Second operand 37 states. [2018-11-23 12:06:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:05,717 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2018-11-23 12:06:05,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:06:05,717 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2018-11-23 12:06:05,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:06:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 170 transitions. [2018-11-23 12:06:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:06:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 170 transitions. [2018-11-23 12:06:05,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 170 transitions. [2018-11-23 12:06:05,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:05,870 INFO L225 Difference]: With dead ends: 133 [2018-11-23 12:06:05,870 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 12:06:05,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:06:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 12:06:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-23 12:06:05,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:05,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 120 states. [2018-11-23 12:06:05,904 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 120 states. [2018-11-23 12:06:05,904 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 120 states. [2018-11-23 12:06:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:05,907 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2018-11-23 12:06:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2018-11-23 12:06:05,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:05,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:05,908 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 122 states. [2018-11-23 12:06:05,908 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 122 states. [2018-11-23 12:06:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:05,910 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2018-11-23 12:06:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2018-11-23 12:06:05,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:05,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:05,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:05,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 12:06:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2018-11-23 12:06:05,913 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 155 transitions. Word has length 112 [2018-11-23 12:06:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:05,913 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 155 transitions. [2018-11-23 12:06:05,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:06:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 155 transitions. [2018-11-23 12:06:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 12:06:05,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:05,914 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:05,915 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:05,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:05,915 INFO L82 PathProgramCache]: Analyzing trace with hash -540319623, now seen corresponding path program 34 times [2018-11-23 12:06:05,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:05,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:05,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:05,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:05,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:06,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {19155#true} call ULTIMATE.init(); {19155#true} is VALID [2018-11-23 12:06:06,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {19155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19155#true} is VALID [2018-11-23 12:06:06,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {19155#true} assume true; {19155#true} is VALID [2018-11-23 12:06:06,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19155#true} {19155#true} #55#return; {19155#true} is VALID [2018-11-23 12:06:06,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {19155#true} call #t~ret4 := main(); {19155#true} is VALID [2018-11-23 12:06:06,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {19155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {19157#(= main_~i~0 0)} is VALID [2018-11-23 12:06:06,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {19157#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19157#(= main_~i~0 0)} is VALID [2018-11-23 12:06:06,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {19157#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19157#(= main_~i~0 0)} is VALID [2018-11-23 12:06:06,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {19157#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {19158#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {19158#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {19158#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {19159#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {19159#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {19159#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {19160#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,576 INFO L273 TraceCheckUtils]: 16: Hoare triple {19160#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,576 INFO L273 TraceCheckUtils]: 17: Hoare triple {19160#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {19161#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,577 INFO L273 TraceCheckUtils]: 19: Hoare triple {19161#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {19161#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {19162#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {19162#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {19162#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,580 INFO L273 TraceCheckUtils]: 24: Hoare triple {19163#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,581 INFO L273 TraceCheckUtils]: 25: Hoare triple {19163#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,582 INFO L273 TraceCheckUtils]: 26: Hoare triple {19163#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {19164#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,583 INFO L273 TraceCheckUtils]: 28: Hoare triple {19164#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {19164#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,584 INFO L273 TraceCheckUtils]: 30: Hoare triple {19165#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,584 INFO L273 TraceCheckUtils]: 31: Hoare triple {19165#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {19165#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,586 INFO L273 TraceCheckUtils]: 33: Hoare triple {19166#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,586 INFO L273 TraceCheckUtils]: 34: Hoare triple {19166#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,587 INFO L273 TraceCheckUtils]: 35: Hoare triple {19166#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {19167#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {19167#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,588 INFO L273 TraceCheckUtils]: 38: Hoare triple {19167#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {19168#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,589 INFO L273 TraceCheckUtils]: 40: Hoare triple {19168#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,590 INFO L273 TraceCheckUtils]: 41: Hoare triple {19168#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,591 INFO L273 TraceCheckUtils]: 42: Hoare triple {19169#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,591 INFO L273 TraceCheckUtils]: 43: Hoare triple {19169#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,592 INFO L273 TraceCheckUtils]: 44: Hoare triple {19169#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,592 INFO L273 TraceCheckUtils]: 45: Hoare triple {19170#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,593 INFO L273 TraceCheckUtils]: 46: Hoare triple {19170#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,594 INFO L273 TraceCheckUtils]: 47: Hoare triple {19170#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,594 INFO L273 TraceCheckUtils]: 48: Hoare triple {19171#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,595 INFO L273 TraceCheckUtils]: 49: Hoare triple {19171#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,595 INFO L273 TraceCheckUtils]: 50: Hoare triple {19171#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,596 INFO L273 TraceCheckUtils]: 51: Hoare triple {19172#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,596 INFO L273 TraceCheckUtils]: 52: Hoare triple {19172#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,597 INFO L273 TraceCheckUtils]: 53: Hoare triple {19172#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,598 INFO L273 TraceCheckUtils]: 54: Hoare triple {19173#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,598 INFO L273 TraceCheckUtils]: 55: Hoare triple {19173#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,599 INFO L273 TraceCheckUtils]: 56: Hoare triple {19173#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,599 INFO L273 TraceCheckUtils]: 57: Hoare triple {19174#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,600 INFO L273 TraceCheckUtils]: 58: Hoare triple {19174#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,601 INFO L273 TraceCheckUtils]: 59: Hoare triple {19174#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,601 INFO L273 TraceCheckUtils]: 60: Hoare triple {19175#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,602 INFO L273 TraceCheckUtils]: 61: Hoare triple {19175#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,602 INFO L273 TraceCheckUtils]: 62: Hoare triple {19175#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:06,603 INFO L273 TraceCheckUtils]: 63: Hoare triple {19176#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:06,603 INFO L273 TraceCheckUtils]: 64: Hoare triple {19176#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:06,604 INFO L273 TraceCheckUtils]: 65: Hoare triple {19176#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:06,604 INFO L273 TraceCheckUtils]: 66: Hoare triple {19177#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:06,605 INFO L273 TraceCheckUtils]: 67: Hoare triple {19177#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:06,606 INFO L273 TraceCheckUtils]: 68: Hoare triple {19177#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:06,606 INFO L273 TraceCheckUtils]: 69: Hoare triple {19178#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:06,607 INFO L273 TraceCheckUtils]: 70: Hoare triple {19178#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:06,607 INFO L273 TraceCheckUtils]: 71: Hoare triple {19178#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:06,608 INFO L273 TraceCheckUtils]: 72: Hoare triple {19179#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:06,608 INFO L273 TraceCheckUtils]: 73: Hoare triple {19179#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:06,609 INFO L273 TraceCheckUtils]: 74: Hoare triple {19179#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:06,610 INFO L273 TraceCheckUtils]: 75: Hoare triple {19180#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:06,610 INFO L273 TraceCheckUtils]: 76: Hoare triple {19180#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:06,611 INFO L273 TraceCheckUtils]: 77: Hoare triple {19180#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:06,611 INFO L273 TraceCheckUtils]: 78: Hoare triple {19181#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:06,612 INFO L273 TraceCheckUtils]: 79: Hoare triple {19181#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:06,613 INFO L273 TraceCheckUtils]: 80: Hoare triple {19181#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:06,613 INFO L273 TraceCheckUtils]: 81: Hoare triple {19182#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:06,614 INFO L273 TraceCheckUtils]: 82: Hoare triple {19182#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:06,614 INFO L273 TraceCheckUtils]: 83: Hoare triple {19182#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:06,615 INFO L273 TraceCheckUtils]: 84: Hoare triple {19183#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:06,615 INFO L273 TraceCheckUtils]: 85: Hoare triple {19183#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:06,616 INFO L273 TraceCheckUtils]: 86: Hoare triple {19183#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:06,617 INFO L273 TraceCheckUtils]: 87: Hoare triple {19184#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:06,617 INFO L273 TraceCheckUtils]: 88: Hoare triple {19184#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:06,618 INFO L273 TraceCheckUtils]: 89: Hoare triple {19184#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:06,618 INFO L273 TraceCheckUtils]: 90: Hoare triple {19185#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:06,619 INFO L273 TraceCheckUtils]: 91: Hoare triple {19185#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:06,619 INFO L273 TraceCheckUtils]: 92: Hoare triple {19185#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:06,620 INFO L273 TraceCheckUtils]: 93: Hoare triple {19186#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:06,620 INFO L273 TraceCheckUtils]: 94: Hoare triple {19186#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:06,621 INFO L273 TraceCheckUtils]: 95: Hoare triple {19186#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:06,622 INFO L273 TraceCheckUtils]: 96: Hoare triple {19187#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:06,622 INFO L273 TraceCheckUtils]: 97: Hoare triple {19187#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:06,623 INFO L273 TraceCheckUtils]: 98: Hoare triple {19187#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:06,623 INFO L273 TraceCheckUtils]: 99: Hoare triple {19188#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:06,624 INFO L273 TraceCheckUtils]: 100: Hoare triple {19188#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:06,625 INFO L273 TraceCheckUtils]: 101: Hoare triple {19188#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:06,625 INFO L273 TraceCheckUtils]: 102: Hoare triple {19189#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:06,626 INFO L273 TraceCheckUtils]: 103: Hoare triple {19189#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:06,626 INFO L273 TraceCheckUtils]: 104: Hoare triple {19189#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:06,627 INFO L273 TraceCheckUtils]: 105: Hoare triple {19190#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:06,627 INFO L273 TraceCheckUtils]: 106: Hoare triple {19190#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:06,628 INFO L273 TraceCheckUtils]: 107: Hoare triple {19190#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {19191#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:06,629 INFO L273 TraceCheckUtils]: 108: Hoare triple {19191#(<= main_~i~0 34)} assume !(~i~0 < 100000); {19156#false} is VALID [2018-11-23 12:06:06,629 INFO L273 TraceCheckUtils]: 109: Hoare triple {19156#false} havoc ~x~0;~x~0 := 0; {19156#false} is VALID [2018-11-23 12:06:06,629 INFO L273 TraceCheckUtils]: 110: Hoare triple {19156#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {19156#false} is VALID [2018-11-23 12:06:06,629 INFO L256 TraceCheckUtils]: 111: Hoare triple {19156#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {19156#false} is VALID [2018-11-23 12:06:06,629 INFO L273 TraceCheckUtils]: 112: Hoare triple {19156#false} ~cond := #in~cond; {19156#false} is VALID [2018-11-23 12:06:06,630 INFO L273 TraceCheckUtils]: 113: Hoare triple {19156#false} assume 0 == ~cond; {19156#false} is VALID [2018-11-23 12:06:06,630 INFO L273 TraceCheckUtils]: 114: Hoare triple {19156#false} assume !false; {19156#false} is VALID [2018-11-23 12:06:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:06,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:06,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:06,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:06,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:06,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:06,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:07,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {19155#true} call ULTIMATE.init(); {19155#true} is VALID [2018-11-23 12:06:07,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {19155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19155#true} is VALID [2018-11-23 12:06:07,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {19155#true} assume true; {19155#true} is VALID [2018-11-23 12:06:07,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19155#true} {19155#true} #55#return; {19155#true} is VALID [2018-11-23 12:06:07,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {19155#true} call #t~ret4 := main(); {19155#true} is VALID [2018-11-23 12:06:07,034 INFO L273 TraceCheckUtils]: 5: Hoare triple {19155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {19210#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:07,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {19210#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19210#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:07,035 INFO L273 TraceCheckUtils]: 7: Hoare triple {19210#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19210#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:07,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {19210#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:07,036 INFO L273 TraceCheckUtils]: 9: Hoare triple {19158#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:07,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {19158#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:07,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {19158#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:07,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {19159#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:07,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {19159#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:07,038 INFO L273 TraceCheckUtils]: 14: Hoare triple {19159#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:07,038 INFO L273 TraceCheckUtils]: 15: Hoare triple {19160#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:07,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {19160#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:07,039 INFO L273 TraceCheckUtils]: 17: Hoare triple {19160#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:07,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {19161#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:07,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {19161#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:07,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {19161#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:07,042 INFO L273 TraceCheckUtils]: 21: Hoare triple {19162#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:07,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {19162#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:07,043 INFO L273 TraceCheckUtils]: 23: Hoare triple {19162#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:07,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {19163#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:07,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {19163#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:07,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {19163#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:07,045 INFO L273 TraceCheckUtils]: 27: Hoare triple {19164#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:07,046 INFO L273 TraceCheckUtils]: 28: Hoare triple {19164#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:07,046 INFO L273 TraceCheckUtils]: 29: Hoare triple {19164#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:07,047 INFO L273 TraceCheckUtils]: 30: Hoare triple {19165#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:07,047 INFO L273 TraceCheckUtils]: 31: Hoare triple {19165#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:07,048 INFO L273 TraceCheckUtils]: 32: Hoare triple {19165#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:07,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {19166#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:07,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {19166#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:07,049 INFO L273 TraceCheckUtils]: 35: Hoare triple {19166#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:07,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {19167#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:07,050 INFO L273 TraceCheckUtils]: 37: Hoare triple {19167#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:07,051 INFO L273 TraceCheckUtils]: 38: Hoare triple {19167#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:07,052 INFO L273 TraceCheckUtils]: 39: Hoare triple {19168#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:07,052 INFO L273 TraceCheckUtils]: 40: Hoare triple {19168#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:07,053 INFO L273 TraceCheckUtils]: 41: Hoare triple {19168#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:07,053 INFO L273 TraceCheckUtils]: 42: Hoare triple {19169#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:07,054 INFO L273 TraceCheckUtils]: 43: Hoare triple {19169#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:07,055 INFO L273 TraceCheckUtils]: 44: Hoare triple {19169#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:07,055 INFO L273 TraceCheckUtils]: 45: Hoare triple {19170#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:07,055 INFO L273 TraceCheckUtils]: 46: Hoare triple {19170#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:07,056 INFO L273 TraceCheckUtils]: 47: Hoare triple {19170#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:07,057 INFO L273 TraceCheckUtils]: 48: Hoare triple {19171#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:07,057 INFO L273 TraceCheckUtils]: 49: Hoare triple {19171#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:07,058 INFO L273 TraceCheckUtils]: 50: Hoare triple {19171#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:07,058 INFO L273 TraceCheckUtils]: 51: Hoare triple {19172#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:07,059 INFO L273 TraceCheckUtils]: 52: Hoare triple {19172#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:07,060 INFO L273 TraceCheckUtils]: 53: Hoare triple {19172#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:07,060 INFO L273 TraceCheckUtils]: 54: Hoare triple {19173#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:07,061 INFO L273 TraceCheckUtils]: 55: Hoare triple {19173#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:07,061 INFO L273 TraceCheckUtils]: 56: Hoare triple {19173#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:07,062 INFO L273 TraceCheckUtils]: 57: Hoare triple {19174#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:07,062 INFO L273 TraceCheckUtils]: 58: Hoare triple {19174#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:07,063 INFO L273 TraceCheckUtils]: 59: Hoare triple {19174#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:07,064 INFO L273 TraceCheckUtils]: 60: Hoare triple {19175#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:07,064 INFO L273 TraceCheckUtils]: 61: Hoare triple {19175#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:07,065 INFO L273 TraceCheckUtils]: 62: Hoare triple {19175#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:07,065 INFO L273 TraceCheckUtils]: 63: Hoare triple {19176#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:07,066 INFO L273 TraceCheckUtils]: 64: Hoare triple {19176#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:07,066 INFO L273 TraceCheckUtils]: 65: Hoare triple {19176#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:07,067 INFO L273 TraceCheckUtils]: 66: Hoare triple {19177#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:07,067 INFO L273 TraceCheckUtils]: 67: Hoare triple {19177#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:07,068 INFO L273 TraceCheckUtils]: 68: Hoare triple {19177#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:07,068 INFO L273 TraceCheckUtils]: 69: Hoare triple {19178#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:07,069 INFO L273 TraceCheckUtils]: 70: Hoare triple {19178#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:07,069 INFO L273 TraceCheckUtils]: 71: Hoare triple {19178#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:07,070 INFO L273 TraceCheckUtils]: 72: Hoare triple {19179#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:07,070 INFO L273 TraceCheckUtils]: 73: Hoare triple {19179#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:07,071 INFO L273 TraceCheckUtils]: 74: Hoare triple {19179#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:07,072 INFO L273 TraceCheckUtils]: 75: Hoare triple {19180#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:07,072 INFO L273 TraceCheckUtils]: 76: Hoare triple {19180#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:07,073 INFO L273 TraceCheckUtils]: 77: Hoare triple {19180#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:07,073 INFO L273 TraceCheckUtils]: 78: Hoare triple {19181#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:07,074 INFO L273 TraceCheckUtils]: 79: Hoare triple {19181#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:07,074 INFO L273 TraceCheckUtils]: 80: Hoare triple {19181#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:07,075 INFO L273 TraceCheckUtils]: 81: Hoare triple {19182#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:07,075 INFO L273 TraceCheckUtils]: 82: Hoare triple {19182#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:07,076 INFO L273 TraceCheckUtils]: 83: Hoare triple {19182#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:07,076 INFO L273 TraceCheckUtils]: 84: Hoare triple {19183#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:07,077 INFO L273 TraceCheckUtils]: 85: Hoare triple {19183#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:07,078 INFO L273 TraceCheckUtils]: 86: Hoare triple {19183#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:07,078 INFO L273 TraceCheckUtils]: 87: Hoare triple {19184#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:07,079 INFO L273 TraceCheckUtils]: 88: Hoare triple {19184#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:07,079 INFO L273 TraceCheckUtils]: 89: Hoare triple {19184#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:07,080 INFO L273 TraceCheckUtils]: 90: Hoare triple {19185#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:07,080 INFO L273 TraceCheckUtils]: 91: Hoare triple {19185#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:07,081 INFO L273 TraceCheckUtils]: 92: Hoare triple {19185#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:07,081 INFO L273 TraceCheckUtils]: 93: Hoare triple {19186#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:07,082 INFO L273 TraceCheckUtils]: 94: Hoare triple {19186#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:07,082 INFO L273 TraceCheckUtils]: 95: Hoare triple {19186#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:07,083 INFO L273 TraceCheckUtils]: 96: Hoare triple {19187#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:07,083 INFO L273 TraceCheckUtils]: 97: Hoare triple {19187#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:07,084 INFO L273 TraceCheckUtils]: 98: Hoare triple {19187#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:07,085 INFO L273 TraceCheckUtils]: 99: Hoare triple {19188#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:07,085 INFO L273 TraceCheckUtils]: 100: Hoare triple {19188#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:07,086 INFO L273 TraceCheckUtils]: 101: Hoare triple {19188#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:07,086 INFO L273 TraceCheckUtils]: 102: Hoare triple {19189#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:07,087 INFO L273 TraceCheckUtils]: 103: Hoare triple {19189#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:07,087 INFO L273 TraceCheckUtils]: 104: Hoare triple {19189#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:07,088 INFO L273 TraceCheckUtils]: 105: Hoare triple {19190#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:07,088 INFO L273 TraceCheckUtils]: 106: Hoare triple {19190#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:07,089 INFO L273 TraceCheckUtils]: 107: Hoare triple {19190#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {19191#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:07,089 INFO L273 TraceCheckUtils]: 108: Hoare triple {19191#(<= main_~i~0 34)} assume !(~i~0 < 100000); {19156#false} is VALID [2018-11-23 12:06:07,090 INFO L273 TraceCheckUtils]: 109: Hoare triple {19156#false} havoc ~x~0;~x~0 := 0; {19156#false} is VALID [2018-11-23 12:06:07,090 INFO L273 TraceCheckUtils]: 110: Hoare triple {19156#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {19156#false} is VALID [2018-11-23 12:06:07,090 INFO L256 TraceCheckUtils]: 111: Hoare triple {19156#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {19156#false} is VALID [2018-11-23 12:06:07,090 INFO L273 TraceCheckUtils]: 112: Hoare triple {19156#false} ~cond := #in~cond; {19156#false} is VALID [2018-11-23 12:06:07,090 INFO L273 TraceCheckUtils]: 113: Hoare triple {19156#false} assume 0 == ~cond; {19156#false} is VALID [2018-11-23 12:06:07,091 INFO L273 TraceCheckUtils]: 114: Hoare triple {19156#false} assume !false; {19156#false} is VALID [2018-11-23 12:06:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:07,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:07,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 12:06:07,120 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2018-11-23 12:06:07,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:07,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:06:07,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:07,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:06:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:06:07,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:06:07,234 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand 38 states. [2018-11-23 12:06:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,189 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2018-11-23 12:06:08,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:06:08,189 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2018-11-23 12:06:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:06:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 174 transitions. [2018-11-23 12:06:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:06:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 174 transitions. [2018-11-23 12:06:08,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 174 transitions. [2018-11-23 12:06:08,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:08,651 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:06:08,651 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:06:08,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:06:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:06:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:06:08,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:08,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:06:08,684 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:06:08,684 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:06:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,688 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2018-11-23 12:06:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2018-11-23 12:06:08,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:08,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:08,689 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:06:08,689 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:06:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,690 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2018-11-23 12:06:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2018-11-23 12:06:08,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:08,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:08,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:08,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:06:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 159 transitions. [2018-11-23 12:06:08,693 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 159 transitions. Word has length 115 [2018-11-23 12:06:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:08,693 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 159 transitions. [2018-11-23 12:06:08,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:06:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 159 transitions. [2018-11-23 12:06:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:06:08,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:08,694 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:08,694 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:08,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:08,694 INFO L82 PathProgramCache]: Analyzing trace with hash -79097565, now seen corresponding path program 35 times [2018-11-23 12:06:08,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:08,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:08,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:08,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:08,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:09,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {20135#true} call ULTIMATE.init(); {20135#true} is VALID [2018-11-23 12:06:09,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {20135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20135#true} is VALID [2018-11-23 12:06:09,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {20135#true} assume true; {20135#true} is VALID [2018-11-23 12:06:09,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20135#true} {20135#true} #55#return; {20135#true} is VALID [2018-11-23 12:06:09,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {20135#true} call #t~ret4 := main(); {20135#true} is VALID [2018-11-23 12:06:09,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {20135#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {20137#(= main_~i~0 0)} is VALID [2018-11-23 12:06:09,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {20137#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20137#(= main_~i~0 0)} is VALID [2018-11-23 12:06:09,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {20137#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20137#(= main_~i~0 0)} is VALID [2018-11-23 12:06:09,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {20137#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {20138#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {20138#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {20138#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {20139#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {20139#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {20139#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {20140#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {20140#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {20140#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {20141#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {20141#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {20142#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,405 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {20142#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,407 INFO L273 TraceCheckUtils]: 25: Hoare triple {20143#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,408 INFO L273 TraceCheckUtils]: 26: Hoare triple {20143#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,408 INFO L273 TraceCheckUtils]: 27: Hoare triple {20144#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,409 INFO L273 TraceCheckUtils]: 28: Hoare triple {20144#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {20144#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,410 INFO L273 TraceCheckUtils]: 30: Hoare triple {20145#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {20145#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {20145#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,412 INFO L273 TraceCheckUtils]: 33: Hoare triple {20146#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,412 INFO L273 TraceCheckUtils]: 34: Hoare triple {20146#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,413 INFO L273 TraceCheckUtils]: 35: Hoare triple {20146#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {20147#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,414 INFO L273 TraceCheckUtils]: 37: Hoare triple {20147#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {20147#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {20148#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,416 INFO L273 TraceCheckUtils]: 40: Hoare triple {20148#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,416 INFO L273 TraceCheckUtils]: 41: Hoare triple {20148#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,417 INFO L273 TraceCheckUtils]: 42: Hoare triple {20149#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,417 INFO L273 TraceCheckUtils]: 43: Hoare triple {20149#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,418 INFO L273 TraceCheckUtils]: 44: Hoare triple {20149#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,419 INFO L273 TraceCheckUtils]: 45: Hoare triple {20150#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,419 INFO L273 TraceCheckUtils]: 46: Hoare triple {20150#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,420 INFO L273 TraceCheckUtils]: 47: Hoare triple {20150#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,420 INFO L273 TraceCheckUtils]: 48: Hoare triple {20151#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {20151#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,421 INFO L273 TraceCheckUtils]: 50: Hoare triple {20151#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,422 INFO L273 TraceCheckUtils]: 51: Hoare triple {20152#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {20152#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,423 INFO L273 TraceCheckUtils]: 53: Hoare triple {20152#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {20153#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,424 INFO L273 TraceCheckUtils]: 55: Hoare triple {20153#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,425 INFO L273 TraceCheckUtils]: 56: Hoare triple {20153#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,425 INFO L273 TraceCheckUtils]: 57: Hoare triple {20154#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,426 INFO L273 TraceCheckUtils]: 58: Hoare triple {20154#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,427 INFO L273 TraceCheckUtils]: 59: Hoare triple {20154#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,427 INFO L273 TraceCheckUtils]: 60: Hoare triple {20155#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {20155#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,428 INFO L273 TraceCheckUtils]: 62: Hoare triple {20155#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {20156#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,429 INFO L273 TraceCheckUtils]: 64: Hoare triple {20156#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,430 INFO L273 TraceCheckUtils]: 65: Hoare triple {20156#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,430 INFO L273 TraceCheckUtils]: 66: Hoare triple {20157#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,431 INFO L273 TraceCheckUtils]: 67: Hoare triple {20157#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,432 INFO L273 TraceCheckUtils]: 68: Hoare triple {20157#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,432 INFO L273 TraceCheckUtils]: 69: Hoare triple {20158#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,433 INFO L273 TraceCheckUtils]: 70: Hoare triple {20158#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,433 INFO L273 TraceCheckUtils]: 71: Hoare triple {20158#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,434 INFO L273 TraceCheckUtils]: 72: Hoare triple {20159#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,434 INFO L273 TraceCheckUtils]: 73: Hoare triple {20159#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,435 INFO L273 TraceCheckUtils]: 74: Hoare triple {20159#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,435 INFO L273 TraceCheckUtils]: 75: Hoare triple {20160#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,436 INFO L273 TraceCheckUtils]: 76: Hoare triple {20160#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,437 INFO L273 TraceCheckUtils]: 77: Hoare triple {20160#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:09,437 INFO L273 TraceCheckUtils]: 78: Hoare triple {20161#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:09,438 INFO L273 TraceCheckUtils]: 79: Hoare triple {20161#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:09,438 INFO L273 TraceCheckUtils]: 80: Hoare triple {20161#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:09,439 INFO L273 TraceCheckUtils]: 81: Hoare triple {20162#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:09,439 INFO L273 TraceCheckUtils]: 82: Hoare triple {20162#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:09,440 INFO L273 TraceCheckUtils]: 83: Hoare triple {20162#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:09,440 INFO L273 TraceCheckUtils]: 84: Hoare triple {20163#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:09,441 INFO L273 TraceCheckUtils]: 85: Hoare triple {20163#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:09,441 INFO L273 TraceCheckUtils]: 86: Hoare triple {20163#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:09,442 INFO L273 TraceCheckUtils]: 87: Hoare triple {20164#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:09,442 INFO L273 TraceCheckUtils]: 88: Hoare triple {20164#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:09,443 INFO L273 TraceCheckUtils]: 89: Hoare triple {20164#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:09,444 INFO L273 TraceCheckUtils]: 90: Hoare triple {20165#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:09,444 INFO L273 TraceCheckUtils]: 91: Hoare triple {20165#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:09,445 INFO L273 TraceCheckUtils]: 92: Hoare triple {20165#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:09,445 INFO L273 TraceCheckUtils]: 93: Hoare triple {20166#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:09,446 INFO L273 TraceCheckUtils]: 94: Hoare triple {20166#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:09,447 INFO L273 TraceCheckUtils]: 95: Hoare triple {20166#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:09,447 INFO L273 TraceCheckUtils]: 96: Hoare triple {20167#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:09,448 INFO L273 TraceCheckUtils]: 97: Hoare triple {20167#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:09,448 INFO L273 TraceCheckUtils]: 98: Hoare triple {20167#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:09,449 INFO L273 TraceCheckUtils]: 99: Hoare triple {20168#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:09,449 INFO L273 TraceCheckUtils]: 100: Hoare triple {20168#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:09,450 INFO L273 TraceCheckUtils]: 101: Hoare triple {20168#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:09,450 INFO L273 TraceCheckUtils]: 102: Hoare triple {20169#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:09,451 INFO L273 TraceCheckUtils]: 103: Hoare triple {20169#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:09,451 INFO L273 TraceCheckUtils]: 104: Hoare triple {20169#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:09,452 INFO L273 TraceCheckUtils]: 105: Hoare triple {20170#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:09,452 INFO L273 TraceCheckUtils]: 106: Hoare triple {20170#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:09,453 INFO L273 TraceCheckUtils]: 107: Hoare triple {20170#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:09,454 INFO L273 TraceCheckUtils]: 108: Hoare triple {20171#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:09,454 INFO L273 TraceCheckUtils]: 109: Hoare triple {20171#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:09,455 INFO L273 TraceCheckUtils]: 110: Hoare triple {20171#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {20172#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:09,456 INFO L273 TraceCheckUtils]: 111: Hoare triple {20172#(<= main_~i~0 35)} assume !(~i~0 < 100000); {20136#false} is VALID [2018-11-23 12:06:09,456 INFO L273 TraceCheckUtils]: 112: Hoare triple {20136#false} havoc ~x~0;~x~0 := 0; {20136#false} is VALID [2018-11-23 12:06:09,456 INFO L273 TraceCheckUtils]: 113: Hoare triple {20136#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {20136#false} is VALID [2018-11-23 12:06:09,456 INFO L256 TraceCheckUtils]: 114: Hoare triple {20136#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {20136#false} is VALID [2018-11-23 12:06:09,456 INFO L273 TraceCheckUtils]: 115: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2018-11-23 12:06:09,456 INFO L273 TraceCheckUtils]: 116: Hoare triple {20136#false} assume 0 == ~cond; {20136#false} is VALID [2018-11-23 12:06:09,457 INFO L273 TraceCheckUtils]: 117: Hoare triple {20136#false} assume !false; {20136#false} is VALID [2018-11-23 12:06:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:09,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:09,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:09,476 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:09,553 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 12:06:09,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:09,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:09,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {20135#true} call ULTIMATE.init(); {20135#true} is VALID [2018-11-23 12:06:09,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {20135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20135#true} is VALID [2018-11-23 12:06:09,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {20135#true} assume true; {20135#true} is VALID [2018-11-23 12:06:09,832 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20135#true} {20135#true} #55#return; {20135#true} is VALID [2018-11-23 12:06:09,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {20135#true} call #t~ret4 := main(); {20135#true} is VALID [2018-11-23 12:06:09,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {20135#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {20191#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:09,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {20191#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20191#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:09,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {20191#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20191#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:09,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {20191#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {20138#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {20138#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {20138#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {20139#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {20139#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {20139#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {20140#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {20140#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {20140#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,839 INFO L273 TraceCheckUtils]: 18: Hoare triple {20141#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {20141#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,840 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {20142#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,841 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {20142#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,843 INFO L273 TraceCheckUtils]: 25: Hoare triple {20143#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {20143#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {20144#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {20144#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {20144#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,846 INFO L273 TraceCheckUtils]: 30: Hoare triple {20145#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {20145#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,847 INFO L273 TraceCheckUtils]: 32: Hoare triple {20145#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,848 INFO L273 TraceCheckUtils]: 33: Hoare triple {20146#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,848 INFO L273 TraceCheckUtils]: 34: Hoare triple {20146#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {20146#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,849 INFO L273 TraceCheckUtils]: 36: Hoare triple {20147#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {20147#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {20147#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,851 INFO L273 TraceCheckUtils]: 39: Hoare triple {20148#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {20148#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {20148#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,853 INFO L273 TraceCheckUtils]: 42: Hoare triple {20149#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {20149#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,854 INFO L273 TraceCheckUtils]: 44: Hoare triple {20149#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,855 INFO L273 TraceCheckUtils]: 45: Hoare triple {20150#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,855 INFO L273 TraceCheckUtils]: 46: Hoare triple {20150#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,856 INFO L273 TraceCheckUtils]: 47: Hoare triple {20150#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,856 INFO L273 TraceCheckUtils]: 48: Hoare triple {20151#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,857 INFO L273 TraceCheckUtils]: 49: Hoare triple {20151#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,857 INFO L273 TraceCheckUtils]: 50: Hoare triple {20151#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,858 INFO L273 TraceCheckUtils]: 51: Hoare triple {20152#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,858 INFO L273 TraceCheckUtils]: 52: Hoare triple {20152#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,859 INFO L273 TraceCheckUtils]: 53: Hoare triple {20152#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,860 INFO L273 TraceCheckUtils]: 54: Hoare triple {20153#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,860 INFO L273 TraceCheckUtils]: 55: Hoare triple {20153#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,861 INFO L273 TraceCheckUtils]: 56: Hoare triple {20153#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,861 INFO L273 TraceCheckUtils]: 57: Hoare triple {20154#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,862 INFO L273 TraceCheckUtils]: 58: Hoare triple {20154#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,863 INFO L273 TraceCheckUtils]: 59: Hoare triple {20154#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,863 INFO L273 TraceCheckUtils]: 60: Hoare triple {20155#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,864 INFO L273 TraceCheckUtils]: 61: Hoare triple {20155#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,864 INFO L273 TraceCheckUtils]: 62: Hoare triple {20155#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,865 INFO L273 TraceCheckUtils]: 63: Hoare triple {20156#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,865 INFO L273 TraceCheckUtils]: 64: Hoare triple {20156#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,866 INFO L273 TraceCheckUtils]: 65: Hoare triple {20156#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,867 INFO L273 TraceCheckUtils]: 66: Hoare triple {20157#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,867 INFO L273 TraceCheckUtils]: 67: Hoare triple {20157#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,868 INFO L273 TraceCheckUtils]: 68: Hoare triple {20157#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,868 INFO L273 TraceCheckUtils]: 69: Hoare triple {20158#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,869 INFO L273 TraceCheckUtils]: 70: Hoare triple {20158#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,870 INFO L273 TraceCheckUtils]: 71: Hoare triple {20158#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,870 INFO L273 TraceCheckUtils]: 72: Hoare triple {20159#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,871 INFO L273 TraceCheckUtils]: 73: Hoare triple {20159#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,871 INFO L273 TraceCheckUtils]: 74: Hoare triple {20159#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,872 INFO L273 TraceCheckUtils]: 75: Hoare triple {20160#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,872 INFO L273 TraceCheckUtils]: 76: Hoare triple {20160#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,873 INFO L273 TraceCheckUtils]: 77: Hoare triple {20160#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:09,874 INFO L273 TraceCheckUtils]: 78: Hoare triple {20161#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:09,874 INFO L273 TraceCheckUtils]: 79: Hoare triple {20161#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:09,875 INFO L273 TraceCheckUtils]: 80: Hoare triple {20161#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:09,875 INFO L273 TraceCheckUtils]: 81: Hoare triple {20162#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:09,876 INFO L273 TraceCheckUtils]: 82: Hoare triple {20162#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:09,876 INFO L273 TraceCheckUtils]: 83: Hoare triple {20162#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:09,877 INFO L273 TraceCheckUtils]: 84: Hoare triple {20163#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:09,878 INFO L273 TraceCheckUtils]: 85: Hoare triple {20163#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:09,878 INFO L273 TraceCheckUtils]: 86: Hoare triple {20163#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:09,879 INFO L273 TraceCheckUtils]: 87: Hoare triple {20164#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:09,879 INFO L273 TraceCheckUtils]: 88: Hoare triple {20164#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:09,880 INFO L273 TraceCheckUtils]: 89: Hoare triple {20164#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:09,880 INFO L273 TraceCheckUtils]: 90: Hoare triple {20165#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:09,881 INFO L273 TraceCheckUtils]: 91: Hoare triple {20165#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:09,882 INFO L273 TraceCheckUtils]: 92: Hoare triple {20165#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:09,882 INFO L273 TraceCheckUtils]: 93: Hoare triple {20166#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:09,883 INFO L273 TraceCheckUtils]: 94: Hoare triple {20166#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:09,883 INFO L273 TraceCheckUtils]: 95: Hoare triple {20166#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:09,884 INFO L273 TraceCheckUtils]: 96: Hoare triple {20167#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:09,884 INFO L273 TraceCheckUtils]: 97: Hoare triple {20167#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:09,885 INFO L273 TraceCheckUtils]: 98: Hoare triple {20167#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:09,886 INFO L273 TraceCheckUtils]: 99: Hoare triple {20168#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:09,886 INFO L273 TraceCheckUtils]: 100: Hoare triple {20168#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:09,887 INFO L273 TraceCheckUtils]: 101: Hoare triple {20168#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:09,887 INFO L273 TraceCheckUtils]: 102: Hoare triple {20169#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:09,888 INFO L273 TraceCheckUtils]: 103: Hoare triple {20169#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:09,889 INFO L273 TraceCheckUtils]: 104: Hoare triple {20169#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:09,889 INFO L273 TraceCheckUtils]: 105: Hoare triple {20170#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:09,890 INFO L273 TraceCheckUtils]: 106: Hoare triple {20170#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:09,890 INFO L273 TraceCheckUtils]: 107: Hoare triple {20170#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:09,891 INFO L273 TraceCheckUtils]: 108: Hoare triple {20171#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:09,891 INFO L273 TraceCheckUtils]: 109: Hoare triple {20171#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:09,892 INFO L273 TraceCheckUtils]: 110: Hoare triple {20171#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {20172#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:09,893 INFO L273 TraceCheckUtils]: 111: Hoare triple {20172#(<= main_~i~0 35)} assume !(~i~0 < 100000); {20136#false} is VALID [2018-11-23 12:06:09,893 INFO L273 TraceCheckUtils]: 112: Hoare triple {20136#false} havoc ~x~0;~x~0 := 0; {20136#false} is VALID [2018-11-23 12:06:09,893 INFO L273 TraceCheckUtils]: 113: Hoare triple {20136#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {20136#false} is VALID [2018-11-23 12:06:09,893 INFO L256 TraceCheckUtils]: 114: Hoare triple {20136#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {20136#false} is VALID [2018-11-23 12:06:09,894 INFO L273 TraceCheckUtils]: 115: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2018-11-23 12:06:09,894 INFO L273 TraceCheckUtils]: 116: Hoare triple {20136#false} assume 0 == ~cond; {20136#false} is VALID [2018-11-23 12:06:09,894 INFO L273 TraceCheckUtils]: 117: Hoare triple {20136#false} assume !false; {20136#false} is VALID [2018-11-23 12:06:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:09,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:09,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 12:06:09,924 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2018-11-23 12:06:09,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:09,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:06:10,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:10,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:06:10,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:06:10,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:06:10,101 INFO L87 Difference]: Start difference. First operand 123 states and 159 transitions. Second operand 39 states. [2018-11-23 12:06:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,623 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2018-11-23 12:06:10,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:06:10,623 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2018-11-23 12:06:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:06:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2018-11-23 12:06:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:06:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2018-11-23 12:06:10,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 178 transitions. [2018-11-23 12:06:10,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:10,798 INFO L225 Difference]: With dead ends: 139 [2018-11-23 12:06:10,799 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:06:10,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:06:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:06:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-23 12:06:10,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:10,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 126 states. [2018-11-23 12:06:10,870 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 126 states. [2018-11-23 12:06:10,870 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 126 states. [2018-11-23 12:06:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,872 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-11-23 12:06:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2018-11-23 12:06:10,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:10,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:10,873 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 128 states. [2018-11-23 12:06:10,873 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 128 states. [2018-11-23 12:06:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,875 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-11-23 12:06:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2018-11-23 12:06:10,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:10,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:10,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:10,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 12:06:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2018-11-23 12:06:10,879 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 118 [2018-11-23 12:06:10,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:10,879 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2018-11-23 12:06:10,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:06:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2018-11-23 12:06:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 12:06:10,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:10,881 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:10,881 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:10,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:10,881 INFO L82 PathProgramCache]: Analyzing trace with hash 586852409, now seen corresponding path program 36 times [2018-11-23 12:06:10,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:10,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:10,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:10,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:10,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:12,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {21139#true} call ULTIMATE.init(); {21139#true} is VALID [2018-11-23 12:06:12,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {21139#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21139#true} is VALID [2018-11-23 12:06:12,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {21139#true} assume true; {21139#true} is VALID [2018-11-23 12:06:12,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21139#true} {21139#true} #55#return; {21139#true} is VALID [2018-11-23 12:06:12,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {21139#true} call #t~ret4 := main(); {21139#true} is VALID [2018-11-23 12:06:12,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {21139#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {21141#(= main_~i~0 0)} is VALID [2018-11-23 12:06:12,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {21141#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21141#(= main_~i~0 0)} is VALID [2018-11-23 12:06:12,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {21141#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21141#(= main_~i~0 0)} is VALID [2018-11-23 12:06:12,221 INFO L273 TraceCheckUtils]: 8: Hoare triple {21141#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:12,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {21142#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:12,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {21142#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:12,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {21142#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:12,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {21143#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:12,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {21143#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:12,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {21143#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:12,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {21144#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:12,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {21144#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:12,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {21144#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:12,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {21145#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:12,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {21145#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:12,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {21145#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:12,227 INFO L273 TraceCheckUtils]: 21: Hoare triple {21146#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:12,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {21146#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:12,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {21146#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:12,229 INFO L273 TraceCheckUtils]: 24: Hoare triple {21147#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:12,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {21147#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:12,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {21147#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:12,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {21148#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:12,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {21148#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:12,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {21148#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:12,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {21149#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:12,233 INFO L273 TraceCheckUtils]: 31: Hoare triple {21149#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:12,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {21149#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:12,234 INFO L273 TraceCheckUtils]: 33: Hoare triple {21150#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:12,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {21150#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:12,235 INFO L273 TraceCheckUtils]: 35: Hoare triple {21150#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:12,235 INFO L273 TraceCheckUtils]: 36: Hoare triple {21151#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:12,236 INFO L273 TraceCheckUtils]: 37: Hoare triple {21151#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:12,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {21151#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:12,237 INFO L273 TraceCheckUtils]: 39: Hoare triple {21152#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:12,237 INFO L273 TraceCheckUtils]: 40: Hoare triple {21152#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:12,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {21152#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:12,239 INFO L273 TraceCheckUtils]: 42: Hoare triple {21153#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:12,239 INFO L273 TraceCheckUtils]: 43: Hoare triple {21153#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:12,240 INFO L273 TraceCheckUtils]: 44: Hoare triple {21153#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:12,240 INFO L273 TraceCheckUtils]: 45: Hoare triple {21154#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:12,241 INFO L273 TraceCheckUtils]: 46: Hoare triple {21154#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:12,242 INFO L273 TraceCheckUtils]: 47: Hoare triple {21154#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:12,242 INFO L273 TraceCheckUtils]: 48: Hoare triple {21155#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:12,243 INFO L273 TraceCheckUtils]: 49: Hoare triple {21155#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:12,243 INFO L273 TraceCheckUtils]: 50: Hoare triple {21155#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:12,244 INFO L273 TraceCheckUtils]: 51: Hoare triple {21156#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:12,244 INFO L273 TraceCheckUtils]: 52: Hoare triple {21156#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:12,245 INFO L273 TraceCheckUtils]: 53: Hoare triple {21156#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:12,246 INFO L273 TraceCheckUtils]: 54: Hoare triple {21157#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:12,246 INFO L273 TraceCheckUtils]: 55: Hoare triple {21157#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:12,247 INFO L273 TraceCheckUtils]: 56: Hoare triple {21157#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:12,247 INFO L273 TraceCheckUtils]: 57: Hoare triple {21158#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:12,248 INFO L273 TraceCheckUtils]: 58: Hoare triple {21158#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:12,249 INFO L273 TraceCheckUtils]: 59: Hoare triple {21158#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:12,249 INFO L273 TraceCheckUtils]: 60: Hoare triple {21159#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:12,250 INFO L273 TraceCheckUtils]: 61: Hoare triple {21159#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:12,250 INFO L273 TraceCheckUtils]: 62: Hoare triple {21159#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:12,251 INFO L273 TraceCheckUtils]: 63: Hoare triple {21160#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:12,251 INFO L273 TraceCheckUtils]: 64: Hoare triple {21160#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:12,252 INFO L273 TraceCheckUtils]: 65: Hoare triple {21160#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:12,252 INFO L273 TraceCheckUtils]: 66: Hoare triple {21161#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:12,253 INFO L273 TraceCheckUtils]: 67: Hoare triple {21161#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:12,254 INFO L273 TraceCheckUtils]: 68: Hoare triple {21161#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:12,254 INFO L273 TraceCheckUtils]: 69: Hoare triple {21162#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:12,255 INFO L273 TraceCheckUtils]: 70: Hoare triple {21162#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:12,255 INFO L273 TraceCheckUtils]: 71: Hoare triple {21162#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:12,256 INFO L273 TraceCheckUtils]: 72: Hoare triple {21163#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:12,256 INFO L273 TraceCheckUtils]: 73: Hoare triple {21163#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:12,257 INFO L273 TraceCheckUtils]: 74: Hoare triple {21163#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:12,257 INFO L273 TraceCheckUtils]: 75: Hoare triple {21164#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:12,258 INFO L273 TraceCheckUtils]: 76: Hoare triple {21164#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:12,258 INFO L273 TraceCheckUtils]: 77: Hoare triple {21164#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:12,259 INFO L273 TraceCheckUtils]: 78: Hoare triple {21165#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:12,259 INFO L273 TraceCheckUtils]: 79: Hoare triple {21165#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:12,260 INFO L273 TraceCheckUtils]: 80: Hoare triple {21165#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:12,261 INFO L273 TraceCheckUtils]: 81: Hoare triple {21166#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:12,261 INFO L273 TraceCheckUtils]: 82: Hoare triple {21166#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:12,262 INFO L273 TraceCheckUtils]: 83: Hoare triple {21166#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:12,262 INFO L273 TraceCheckUtils]: 84: Hoare triple {21167#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:12,263 INFO L273 TraceCheckUtils]: 85: Hoare triple {21167#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:12,263 INFO L273 TraceCheckUtils]: 86: Hoare triple {21167#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:12,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {21168#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:12,264 INFO L273 TraceCheckUtils]: 88: Hoare triple {21168#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:12,265 INFO L273 TraceCheckUtils]: 89: Hoare triple {21168#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:12,265 INFO L273 TraceCheckUtils]: 90: Hoare triple {21169#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:12,266 INFO L273 TraceCheckUtils]: 91: Hoare triple {21169#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:12,267 INFO L273 TraceCheckUtils]: 92: Hoare triple {21169#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:12,267 INFO L273 TraceCheckUtils]: 93: Hoare triple {21170#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:12,268 INFO L273 TraceCheckUtils]: 94: Hoare triple {21170#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:12,268 INFO L273 TraceCheckUtils]: 95: Hoare triple {21170#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:12,269 INFO L273 TraceCheckUtils]: 96: Hoare triple {21171#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:12,269 INFO L273 TraceCheckUtils]: 97: Hoare triple {21171#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:12,270 INFO L273 TraceCheckUtils]: 98: Hoare triple {21171#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:12,270 INFO L273 TraceCheckUtils]: 99: Hoare triple {21172#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:12,271 INFO L273 TraceCheckUtils]: 100: Hoare triple {21172#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:12,271 INFO L273 TraceCheckUtils]: 101: Hoare triple {21172#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:12,272 INFO L273 TraceCheckUtils]: 102: Hoare triple {21173#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:12,272 INFO L273 TraceCheckUtils]: 103: Hoare triple {21173#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:12,273 INFO L273 TraceCheckUtils]: 104: Hoare triple {21173#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:12,274 INFO L273 TraceCheckUtils]: 105: Hoare triple {21174#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:12,274 INFO L273 TraceCheckUtils]: 106: Hoare triple {21174#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:12,275 INFO L273 TraceCheckUtils]: 107: Hoare triple {21174#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:12,275 INFO L273 TraceCheckUtils]: 108: Hoare triple {21175#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:12,276 INFO L273 TraceCheckUtils]: 109: Hoare triple {21175#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:12,276 INFO L273 TraceCheckUtils]: 110: Hoare triple {21175#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:12,277 INFO L273 TraceCheckUtils]: 111: Hoare triple {21176#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:12,277 INFO L273 TraceCheckUtils]: 112: Hoare triple {21176#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:12,278 INFO L273 TraceCheckUtils]: 113: Hoare triple {21176#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {21177#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:12,279 INFO L273 TraceCheckUtils]: 114: Hoare triple {21177#(<= main_~i~0 36)} assume !(~i~0 < 100000); {21140#false} is VALID [2018-11-23 12:06:12,279 INFO L273 TraceCheckUtils]: 115: Hoare triple {21140#false} havoc ~x~0;~x~0 := 0; {21140#false} is VALID [2018-11-23 12:06:12,279 INFO L273 TraceCheckUtils]: 116: Hoare triple {21140#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {21140#false} is VALID [2018-11-23 12:06:12,279 INFO L256 TraceCheckUtils]: 117: Hoare triple {21140#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {21140#false} is VALID [2018-11-23 12:06:12,279 INFO L273 TraceCheckUtils]: 118: Hoare triple {21140#false} ~cond := #in~cond; {21140#false} is VALID [2018-11-23 12:06:12,280 INFO L273 TraceCheckUtils]: 119: Hoare triple {21140#false} assume 0 == ~cond; {21140#false} is VALID [2018-11-23 12:06:12,280 INFO L273 TraceCheckUtils]: 120: Hoare triple {21140#false} assume !false; {21140#false} is VALID [2018-11-23 12:06:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:12,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:12,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:12,298 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:12,385 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 12:06:12,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:12,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:13,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {21139#true} call ULTIMATE.init(); {21139#true} is VALID [2018-11-23 12:06:13,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {21139#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21139#true} is VALID [2018-11-23 12:06:13,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {21139#true} assume true; {21139#true} is VALID [2018-11-23 12:06:13,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21139#true} {21139#true} #55#return; {21139#true} is VALID [2018-11-23 12:06:13,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {21139#true} call #t~ret4 := main(); {21139#true} is VALID [2018-11-23 12:06:13,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {21139#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {21196#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:13,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {21196#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21196#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:13,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {21196#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21196#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:13,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {21196#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:13,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {21142#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:13,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {21142#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:13,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {21142#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:13,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {21143#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:13,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {21143#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:13,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {21143#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:13,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {21144#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:13,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {21144#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:13,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {21144#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:13,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {21145#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:13,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {21145#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:13,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {21145#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:13,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {21146#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:13,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {21146#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:13,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {21146#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:13,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {21147#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:13,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {21147#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:13,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {21147#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:13,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {21148#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:13,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {21148#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:13,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {21148#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:13,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {21149#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:13,234 INFO L273 TraceCheckUtils]: 31: Hoare triple {21149#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:13,234 INFO L273 TraceCheckUtils]: 32: Hoare triple {21149#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:13,235 INFO L273 TraceCheckUtils]: 33: Hoare triple {21150#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:13,235 INFO L273 TraceCheckUtils]: 34: Hoare triple {21150#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:13,236 INFO L273 TraceCheckUtils]: 35: Hoare triple {21150#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:13,237 INFO L273 TraceCheckUtils]: 36: Hoare triple {21151#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:13,237 INFO L273 TraceCheckUtils]: 37: Hoare triple {21151#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:13,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {21151#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:13,238 INFO L273 TraceCheckUtils]: 39: Hoare triple {21152#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:13,239 INFO L273 TraceCheckUtils]: 40: Hoare triple {21152#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:13,239 INFO L273 TraceCheckUtils]: 41: Hoare triple {21152#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:13,240 INFO L273 TraceCheckUtils]: 42: Hoare triple {21153#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:13,240 INFO L273 TraceCheckUtils]: 43: Hoare triple {21153#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:13,241 INFO L273 TraceCheckUtils]: 44: Hoare triple {21153#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:13,242 INFO L273 TraceCheckUtils]: 45: Hoare triple {21154#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:13,242 INFO L273 TraceCheckUtils]: 46: Hoare triple {21154#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:13,243 INFO L273 TraceCheckUtils]: 47: Hoare triple {21154#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:13,243 INFO L273 TraceCheckUtils]: 48: Hoare triple {21155#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:13,244 INFO L273 TraceCheckUtils]: 49: Hoare triple {21155#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:13,245 INFO L273 TraceCheckUtils]: 50: Hoare triple {21155#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:13,245 INFO L273 TraceCheckUtils]: 51: Hoare triple {21156#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:13,246 INFO L273 TraceCheckUtils]: 52: Hoare triple {21156#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:13,246 INFO L273 TraceCheckUtils]: 53: Hoare triple {21156#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:13,247 INFO L273 TraceCheckUtils]: 54: Hoare triple {21157#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:13,247 INFO L273 TraceCheckUtils]: 55: Hoare triple {21157#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:13,248 INFO L273 TraceCheckUtils]: 56: Hoare triple {21157#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:13,249 INFO L273 TraceCheckUtils]: 57: Hoare triple {21158#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:13,249 INFO L273 TraceCheckUtils]: 58: Hoare triple {21158#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:13,250 INFO L273 TraceCheckUtils]: 59: Hoare triple {21158#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:13,250 INFO L273 TraceCheckUtils]: 60: Hoare triple {21159#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:13,251 INFO L273 TraceCheckUtils]: 61: Hoare triple {21159#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:13,252 INFO L273 TraceCheckUtils]: 62: Hoare triple {21159#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:13,252 INFO L273 TraceCheckUtils]: 63: Hoare triple {21160#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:13,253 INFO L273 TraceCheckUtils]: 64: Hoare triple {21160#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:13,253 INFO L273 TraceCheckUtils]: 65: Hoare triple {21160#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:13,254 INFO L273 TraceCheckUtils]: 66: Hoare triple {21161#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:13,254 INFO L273 TraceCheckUtils]: 67: Hoare triple {21161#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:13,255 INFO L273 TraceCheckUtils]: 68: Hoare triple {21161#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:13,255 INFO L273 TraceCheckUtils]: 69: Hoare triple {21162#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:13,256 INFO L273 TraceCheckUtils]: 70: Hoare triple {21162#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:13,257 INFO L273 TraceCheckUtils]: 71: Hoare triple {21162#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:13,257 INFO L273 TraceCheckUtils]: 72: Hoare triple {21163#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:13,258 INFO L273 TraceCheckUtils]: 73: Hoare triple {21163#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:13,258 INFO L273 TraceCheckUtils]: 74: Hoare triple {21163#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:13,259 INFO L273 TraceCheckUtils]: 75: Hoare triple {21164#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:13,259 INFO L273 TraceCheckUtils]: 76: Hoare triple {21164#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:13,260 INFO L273 TraceCheckUtils]: 77: Hoare triple {21164#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:13,261 INFO L273 TraceCheckUtils]: 78: Hoare triple {21165#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:13,261 INFO L273 TraceCheckUtils]: 79: Hoare triple {21165#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:13,262 INFO L273 TraceCheckUtils]: 80: Hoare triple {21165#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:13,262 INFO L273 TraceCheckUtils]: 81: Hoare triple {21166#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:13,263 INFO L273 TraceCheckUtils]: 82: Hoare triple {21166#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:13,264 INFO L273 TraceCheckUtils]: 83: Hoare triple {21166#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:13,264 INFO L273 TraceCheckUtils]: 84: Hoare triple {21167#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:13,265 INFO L273 TraceCheckUtils]: 85: Hoare triple {21167#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:13,265 INFO L273 TraceCheckUtils]: 86: Hoare triple {21167#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:13,266 INFO L273 TraceCheckUtils]: 87: Hoare triple {21168#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:13,266 INFO L273 TraceCheckUtils]: 88: Hoare triple {21168#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:13,267 INFO L273 TraceCheckUtils]: 89: Hoare triple {21168#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:13,268 INFO L273 TraceCheckUtils]: 90: Hoare triple {21169#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:13,268 INFO L273 TraceCheckUtils]: 91: Hoare triple {21169#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:13,269 INFO L273 TraceCheckUtils]: 92: Hoare triple {21169#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:13,269 INFO L273 TraceCheckUtils]: 93: Hoare triple {21170#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:13,270 INFO L273 TraceCheckUtils]: 94: Hoare triple {21170#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:13,270 INFO L273 TraceCheckUtils]: 95: Hoare triple {21170#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:13,271 INFO L273 TraceCheckUtils]: 96: Hoare triple {21171#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:13,271 INFO L273 TraceCheckUtils]: 97: Hoare triple {21171#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:13,272 INFO L273 TraceCheckUtils]: 98: Hoare triple {21171#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:13,273 INFO L273 TraceCheckUtils]: 99: Hoare triple {21172#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:13,273 INFO L273 TraceCheckUtils]: 100: Hoare triple {21172#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:13,274 INFO L273 TraceCheckUtils]: 101: Hoare triple {21172#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:13,274 INFO L273 TraceCheckUtils]: 102: Hoare triple {21173#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:13,275 INFO L273 TraceCheckUtils]: 103: Hoare triple {21173#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:13,276 INFO L273 TraceCheckUtils]: 104: Hoare triple {21173#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:13,276 INFO L273 TraceCheckUtils]: 105: Hoare triple {21174#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:13,277 INFO L273 TraceCheckUtils]: 106: Hoare triple {21174#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:13,277 INFO L273 TraceCheckUtils]: 107: Hoare triple {21174#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:13,278 INFO L273 TraceCheckUtils]: 108: Hoare triple {21175#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:13,278 INFO L273 TraceCheckUtils]: 109: Hoare triple {21175#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:13,279 INFO L273 TraceCheckUtils]: 110: Hoare triple {21175#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:13,280 INFO L273 TraceCheckUtils]: 111: Hoare triple {21176#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:13,280 INFO L273 TraceCheckUtils]: 112: Hoare triple {21176#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:13,281 INFO L273 TraceCheckUtils]: 113: Hoare triple {21176#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {21177#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:13,281 INFO L273 TraceCheckUtils]: 114: Hoare triple {21177#(<= main_~i~0 36)} assume !(~i~0 < 100000); {21140#false} is VALID [2018-11-23 12:06:13,282 INFO L273 TraceCheckUtils]: 115: Hoare triple {21140#false} havoc ~x~0;~x~0 := 0; {21140#false} is VALID [2018-11-23 12:06:13,282 INFO L273 TraceCheckUtils]: 116: Hoare triple {21140#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {21140#false} is VALID [2018-11-23 12:06:13,282 INFO L256 TraceCheckUtils]: 117: Hoare triple {21140#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {21140#false} is VALID [2018-11-23 12:06:13,282 INFO L273 TraceCheckUtils]: 118: Hoare triple {21140#false} ~cond := #in~cond; {21140#false} is VALID [2018-11-23 12:06:13,282 INFO L273 TraceCheckUtils]: 119: Hoare triple {21140#false} assume 0 == ~cond; {21140#false} is VALID [2018-11-23 12:06:13,283 INFO L273 TraceCheckUtils]: 120: Hoare triple {21140#false} assume !false; {21140#false} is VALID [2018-11-23 12:06:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:13,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:13,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 12:06:13,314 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-11-23 12:06:13,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:13,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:06:13,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:13,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:06:13,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:06:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:06:13,431 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 40 states. [2018-11-23 12:06:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:14,172 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2018-11-23 12:06:14,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:06:14,172 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-11-23 12:06:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:06:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 182 transitions. [2018-11-23 12:06:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:06:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 182 transitions. [2018-11-23 12:06:14,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 182 transitions. [2018-11-23 12:06:14,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:14,347 INFO L225 Difference]: With dead ends: 142 [2018-11-23 12:06:14,347 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 12:06:14,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:06:14,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 12:06:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-11-23 12:06:14,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:14,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 129 states. [2018-11-23 12:06:14,717 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 129 states. [2018-11-23 12:06:14,717 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 129 states. [2018-11-23 12:06:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:14,719 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2018-11-23 12:06:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2018-11-23 12:06:14,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:14,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:14,719 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 131 states. [2018-11-23 12:06:14,719 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 131 states. [2018-11-23 12:06:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:14,721 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2018-11-23 12:06:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2018-11-23 12:06:14,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:14,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:14,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:14,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 12:06:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2018-11-23 12:06:14,723 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 121 [2018-11-23 12:06:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:14,723 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2018-11-23 12:06:14,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:06:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2018-11-23 12:06:14,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:06:14,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:14,724 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:14,724 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:14,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:14,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1448587619, now seen corresponding path program 37 times [2018-11-23 12:06:14,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:14,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:14,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:14,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:14,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:15,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {22167#true} call ULTIMATE.init(); {22167#true} is VALID [2018-11-23 12:06:15,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {22167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22167#true} is VALID [2018-11-23 12:06:15,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {22167#true} assume true; {22167#true} is VALID [2018-11-23 12:06:15,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22167#true} {22167#true} #55#return; {22167#true} is VALID [2018-11-23 12:06:15,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {22167#true} call #t~ret4 := main(); {22167#true} is VALID [2018-11-23 12:06:15,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {22167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {22169#(= main_~i~0 0)} is VALID [2018-11-23 12:06:15,829 INFO L273 TraceCheckUtils]: 6: Hoare triple {22169#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22169#(= main_~i~0 0)} is VALID [2018-11-23 12:06:15,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {22169#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22169#(= main_~i~0 0)} is VALID [2018-11-23 12:06:15,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {22169#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {22170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {22170#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {22170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,832 INFO L273 TraceCheckUtils]: 12: Hoare triple {22171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {22171#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,833 INFO L273 TraceCheckUtils]: 14: Hoare triple {22171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {22172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,834 INFO L273 TraceCheckUtils]: 16: Hoare triple {22172#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {22172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,836 INFO L273 TraceCheckUtils]: 18: Hoare triple {22173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,836 INFO L273 TraceCheckUtils]: 19: Hoare triple {22173#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {22173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,837 INFO L273 TraceCheckUtils]: 21: Hoare triple {22174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {22174#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {22174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {22175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {22175#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {22175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,841 INFO L273 TraceCheckUtils]: 27: Hoare triple {22176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,841 INFO L273 TraceCheckUtils]: 28: Hoare triple {22176#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,842 INFO L273 TraceCheckUtils]: 29: Hoare triple {22176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,842 INFO L273 TraceCheckUtils]: 30: Hoare triple {22177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,843 INFO L273 TraceCheckUtils]: 31: Hoare triple {22177#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,844 INFO L273 TraceCheckUtils]: 32: Hoare triple {22177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {22178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {22178#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {22178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {22179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {22179#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,847 INFO L273 TraceCheckUtils]: 38: Hoare triple {22179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,848 INFO L273 TraceCheckUtils]: 39: Hoare triple {22180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,848 INFO L273 TraceCheckUtils]: 40: Hoare triple {22180#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {22180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,849 INFO L273 TraceCheckUtils]: 42: Hoare triple {22181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {22181#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,851 INFO L273 TraceCheckUtils]: 44: Hoare triple {22181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,851 INFO L273 TraceCheckUtils]: 45: Hoare triple {22182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,852 INFO L273 TraceCheckUtils]: 46: Hoare triple {22182#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,852 INFO L273 TraceCheckUtils]: 47: Hoare triple {22182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,853 INFO L273 TraceCheckUtils]: 48: Hoare triple {22183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,853 INFO L273 TraceCheckUtils]: 49: Hoare triple {22183#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,854 INFO L273 TraceCheckUtils]: 50: Hoare triple {22183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,855 INFO L273 TraceCheckUtils]: 51: Hoare triple {22184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,855 INFO L273 TraceCheckUtils]: 52: Hoare triple {22184#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,856 INFO L273 TraceCheckUtils]: 53: Hoare triple {22184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,856 INFO L273 TraceCheckUtils]: 54: Hoare triple {22185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,857 INFO L273 TraceCheckUtils]: 55: Hoare triple {22185#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,858 INFO L273 TraceCheckUtils]: 56: Hoare triple {22185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,858 INFO L273 TraceCheckUtils]: 57: Hoare triple {22186#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,859 INFO L273 TraceCheckUtils]: 58: Hoare triple {22186#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,859 INFO L273 TraceCheckUtils]: 59: Hoare triple {22186#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,860 INFO L273 TraceCheckUtils]: 60: Hoare triple {22187#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,860 INFO L273 TraceCheckUtils]: 61: Hoare triple {22187#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,861 INFO L273 TraceCheckUtils]: 62: Hoare triple {22187#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,861 INFO L273 TraceCheckUtils]: 63: Hoare triple {22188#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,862 INFO L273 TraceCheckUtils]: 64: Hoare triple {22188#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,863 INFO L273 TraceCheckUtils]: 65: Hoare triple {22188#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,863 INFO L273 TraceCheckUtils]: 66: Hoare triple {22189#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,864 INFO L273 TraceCheckUtils]: 67: Hoare triple {22189#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,864 INFO L273 TraceCheckUtils]: 68: Hoare triple {22189#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,865 INFO L273 TraceCheckUtils]: 69: Hoare triple {22190#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,865 INFO L273 TraceCheckUtils]: 70: Hoare triple {22190#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,866 INFO L273 TraceCheckUtils]: 71: Hoare triple {22190#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,867 INFO L273 TraceCheckUtils]: 72: Hoare triple {22191#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,867 INFO L273 TraceCheckUtils]: 73: Hoare triple {22191#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,868 INFO L273 TraceCheckUtils]: 74: Hoare triple {22191#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,868 INFO L273 TraceCheckUtils]: 75: Hoare triple {22192#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,869 INFO L273 TraceCheckUtils]: 76: Hoare triple {22192#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,870 INFO L273 TraceCheckUtils]: 77: Hoare triple {22192#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,870 INFO L273 TraceCheckUtils]: 78: Hoare triple {22193#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,871 INFO L273 TraceCheckUtils]: 79: Hoare triple {22193#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,871 INFO L273 TraceCheckUtils]: 80: Hoare triple {22193#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,872 INFO L273 TraceCheckUtils]: 81: Hoare triple {22194#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,872 INFO L273 TraceCheckUtils]: 82: Hoare triple {22194#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,873 INFO L273 TraceCheckUtils]: 83: Hoare triple {22194#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,874 INFO L273 TraceCheckUtils]: 84: Hoare triple {22195#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,874 INFO L273 TraceCheckUtils]: 85: Hoare triple {22195#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,875 INFO L273 TraceCheckUtils]: 86: Hoare triple {22195#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,875 INFO L273 TraceCheckUtils]: 87: Hoare triple {22196#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,876 INFO L273 TraceCheckUtils]: 88: Hoare triple {22196#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,876 INFO L273 TraceCheckUtils]: 89: Hoare triple {22196#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,877 INFO L273 TraceCheckUtils]: 90: Hoare triple {22197#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,877 INFO L273 TraceCheckUtils]: 91: Hoare triple {22197#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,878 INFO L273 TraceCheckUtils]: 92: Hoare triple {22197#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:15,879 INFO L273 TraceCheckUtils]: 93: Hoare triple {22198#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:15,879 INFO L273 TraceCheckUtils]: 94: Hoare triple {22198#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:15,880 INFO L273 TraceCheckUtils]: 95: Hoare triple {22198#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:15,880 INFO L273 TraceCheckUtils]: 96: Hoare triple {22199#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:15,881 INFO L273 TraceCheckUtils]: 97: Hoare triple {22199#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:15,882 INFO L273 TraceCheckUtils]: 98: Hoare triple {22199#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:15,882 INFO L273 TraceCheckUtils]: 99: Hoare triple {22200#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:15,883 INFO L273 TraceCheckUtils]: 100: Hoare triple {22200#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:15,883 INFO L273 TraceCheckUtils]: 101: Hoare triple {22200#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:15,884 INFO L273 TraceCheckUtils]: 102: Hoare triple {22201#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:15,884 INFO L273 TraceCheckUtils]: 103: Hoare triple {22201#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:15,885 INFO L273 TraceCheckUtils]: 104: Hoare triple {22201#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:15,886 INFO L273 TraceCheckUtils]: 105: Hoare triple {22202#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:15,886 INFO L273 TraceCheckUtils]: 106: Hoare triple {22202#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:15,887 INFO L273 TraceCheckUtils]: 107: Hoare triple {22202#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:15,887 INFO L273 TraceCheckUtils]: 108: Hoare triple {22203#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:15,888 INFO L273 TraceCheckUtils]: 109: Hoare triple {22203#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:15,889 INFO L273 TraceCheckUtils]: 110: Hoare triple {22203#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:15,889 INFO L273 TraceCheckUtils]: 111: Hoare triple {22204#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:15,890 INFO L273 TraceCheckUtils]: 112: Hoare triple {22204#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:15,890 INFO L273 TraceCheckUtils]: 113: Hoare triple {22204#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:15,891 INFO L273 TraceCheckUtils]: 114: Hoare triple {22205#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:15,891 INFO L273 TraceCheckUtils]: 115: Hoare triple {22205#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:15,892 INFO L273 TraceCheckUtils]: 116: Hoare triple {22205#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {22206#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:15,893 INFO L273 TraceCheckUtils]: 117: Hoare triple {22206#(<= main_~i~0 37)} assume !(~i~0 < 100000); {22168#false} is VALID [2018-11-23 12:06:15,893 INFO L273 TraceCheckUtils]: 118: Hoare triple {22168#false} havoc ~x~0;~x~0 := 0; {22168#false} is VALID [2018-11-23 12:06:15,893 INFO L273 TraceCheckUtils]: 119: Hoare triple {22168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {22168#false} is VALID [2018-11-23 12:06:15,893 INFO L256 TraceCheckUtils]: 120: Hoare triple {22168#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {22168#false} is VALID [2018-11-23 12:06:15,893 INFO L273 TraceCheckUtils]: 121: Hoare triple {22168#false} ~cond := #in~cond; {22168#false} is VALID [2018-11-23 12:06:15,894 INFO L273 TraceCheckUtils]: 122: Hoare triple {22168#false} assume 0 == ~cond; {22168#false} is VALID [2018-11-23 12:06:15,894 INFO L273 TraceCheckUtils]: 123: Hoare triple {22168#false} assume !false; {22168#false} is VALID [2018-11-23 12:06:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:15,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:15,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:15,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:15,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:16,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {22167#true} call ULTIMATE.init(); {22167#true} is VALID [2018-11-23 12:06:16,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {22167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22167#true} is VALID [2018-11-23 12:06:16,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {22167#true} assume true; {22167#true} is VALID [2018-11-23 12:06:16,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22167#true} {22167#true} #55#return; {22167#true} is VALID [2018-11-23 12:06:16,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {22167#true} call #t~ret4 := main(); {22167#true} is VALID [2018-11-23 12:06:16,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {22167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {22225#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:16,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {22225#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22225#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:16,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {22225#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22225#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:16,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {22225#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:16,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {22170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:16,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {22170#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:16,284 INFO L273 TraceCheckUtils]: 11: Hoare triple {22170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:16,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {22171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:16,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {22171#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:16,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {22171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:16,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {22172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:16,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {22172#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:16,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {22172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:16,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {22173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:16,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {22173#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:16,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {22173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:16,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {22174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:16,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {22174#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:16,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {22174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:16,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {22175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:16,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {22175#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:16,293 INFO L273 TraceCheckUtils]: 26: Hoare triple {22175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:16,293 INFO L273 TraceCheckUtils]: 27: Hoare triple {22176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:16,294 INFO L273 TraceCheckUtils]: 28: Hoare triple {22176#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:16,295 INFO L273 TraceCheckUtils]: 29: Hoare triple {22176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:16,295 INFO L273 TraceCheckUtils]: 30: Hoare triple {22177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:16,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {22177#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:16,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {22177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:16,297 INFO L273 TraceCheckUtils]: 33: Hoare triple {22178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:16,297 INFO L273 TraceCheckUtils]: 34: Hoare triple {22178#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:16,298 INFO L273 TraceCheckUtils]: 35: Hoare triple {22178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:16,299 INFO L273 TraceCheckUtils]: 36: Hoare triple {22179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:16,299 INFO L273 TraceCheckUtils]: 37: Hoare triple {22179#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:16,300 INFO L273 TraceCheckUtils]: 38: Hoare triple {22179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:16,300 INFO L273 TraceCheckUtils]: 39: Hoare triple {22180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:16,301 INFO L273 TraceCheckUtils]: 40: Hoare triple {22180#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:16,302 INFO L273 TraceCheckUtils]: 41: Hoare triple {22180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:16,302 INFO L273 TraceCheckUtils]: 42: Hoare triple {22181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:16,303 INFO L273 TraceCheckUtils]: 43: Hoare triple {22181#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:16,303 INFO L273 TraceCheckUtils]: 44: Hoare triple {22181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:16,304 INFO L273 TraceCheckUtils]: 45: Hoare triple {22182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:16,304 INFO L273 TraceCheckUtils]: 46: Hoare triple {22182#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:16,305 INFO L273 TraceCheckUtils]: 47: Hoare triple {22182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:16,305 INFO L273 TraceCheckUtils]: 48: Hoare triple {22183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:16,306 INFO L273 TraceCheckUtils]: 49: Hoare triple {22183#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:16,307 INFO L273 TraceCheckUtils]: 50: Hoare triple {22183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:16,307 INFO L273 TraceCheckUtils]: 51: Hoare triple {22184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:16,308 INFO L273 TraceCheckUtils]: 52: Hoare triple {22184#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:16,308 INFO L273 TraceCheckUtils]: 53: Hoare triple {22184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:16,309 INFO L273 TraceCheckUtils]: 54: Hoare triple {22185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:16,309 INFO L273 TraceCheckUtils]: 55: Hoare triple {22185#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:16,310 INFO L273 TraceCheckUtils]: 56: Hoare triple {22185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:16,311 INFO L273 TraceCheckUtils]: 57: Hoare triple {22186#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:16,311 INFO L273 TraceCheckUtils]: 58: Hoare triple {22186#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:16,312 INFO L273 TraceCheckUtils]: 59: Hoare triple {22186#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:16,312 INFO L273 TraceCheckUtils]: 60: Hoare triple {22187#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:16,313 INFO L273 TraceCheckUtils]: 61: Hoare triple {22187#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:16,314 INFO L273 TraceCheckUtils]: 62: Hoare triple {22187#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:16,314 INFO L273 TraceCheckUtils]: 63: Hoare triple {22188#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:16,315 INFO L273 TraceCheckUtils]: 64: Hoare triple {22188#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:16,315 INFO L273 TraceCheckUtils]: 65: Hoare triple {22188#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:16,316 INFO L273 TraceCheckUtils]: 66: Hoare triple {22189#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:16,316 INFO L273 TraceCheckUtils]: 67: Hoare triple {22189#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:16,317 INFO L273 TraceCheckUtils]: 68: Hoare triple {22189#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:16,318 INFO L273 TraceCheckUtils]: 69: Hoare triple {22190#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:16,318 INFO L273 TraceCheckUtils]: 70: Hoare triple {22190#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:16,319 INFO L273 TraceCheckUtils]: 71: Hoare triple {22190#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:16,319 INFO L273 TraceCheckUtils]: 72: Hoare triple {22191#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:16,320 INFO L273 TraceCheckUtils]: 73: Hoare triple {22191#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:16,320 INFO L273 TraceCheckUtils]: 74: Hoare triple {22191#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:16,321 INFO L273 TraceCheckUtils]: 75: Hoare triple {22192#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:16,321 INFO L273 TraceCheckUtils]: 76: Hoare triple {22192#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:16,322 INFO L273 TraceCheckUtils]: 77: Hoare triple {22192#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:16,323 INFO L273 TraceCheckUtils]: 78: Hoare triple {22193#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:16,323 INFO L273 TraceCheckUtils]: 79: Hoare triple {22193#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:16,324 INFO L273 TraceCheckUtils]: 80: Hoare triple {22193#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:16,324 INFO L273 TraceCheckUtils]: 81: Hoare triple {22194#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:16,325 INFO L273 TraceCheckUtils]: 82: Hoare triple {22194#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:16,326 INFO L273 TraceCheckUtils]: 83: Hoare triple {22194#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:16,326 INFO L273 TraceCheckUtils]: 84: Hoare triple {22195#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:16,327 INFO L273 TraceCheckUtils]: 85: Hoare triple {22195#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:16,327 INFO L273 TraceCheckUtils]: 86: Hoare triple {22195#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:16,328 INFO L273 TraceCheckUtils]: 87: Hoare triple {22196#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:16,328 INFO L273 TraceCheckUtils]: 88: Hoare triple {22196#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:16,329 INFO L273 TraceCheckUtils]: 89: Hoare triple {22196#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:16,330 INFO L273 TraceCheckUtils]: 90: Hoare triple {22197#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:16,330 INFO L273 TraceCheckUtils]: 91: Hoare triple {22197#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:16,331 INFO L273 TraceCheckUtils]: 92: Hoare triple {22197#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:16,331 INFO L273 TraceCheckUtils]: 93: Hoare triple {22198#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:16,332 INFO L273 TraceCheckUtils]: 94: Hoare triple {22198#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:16,332 INFO L273 TraceCheckUtils]: 95: Hoare triple {22198#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:16,333 INFO L273 TraceCheckUtils]: 96: Hoare triple {22199#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:16,333 INFO L273 TraceCheckUtils]: 97: Hoare triple {22199#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:16,334 INFO L273 TraceCheckUtils]: 98: Hoare triple {22199#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:16,335 INFO L273 TraceCheckUtils]: 99: Hoare triple {22200#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:16,335 INFO L273 TraceCheckUtils]: 100: Hoare triple {22200#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:16,336 INFO L273 TraceCheckUtils]: 101: Hoare triple {22200#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:16,336 INFO L273 TraceCheckUtils]: 102: Hoare triple {22201#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:16,337 INFO L273 TraceCheckUtils]: 103: Hoare triple {22201#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:16,338 INFO L273 TraceCheckUtils]: 104: Hoare triple {22201#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:16,338 INFO L273 TraceCheckUtils]: 105: Hoare triple {22202#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:16,339 INFO L273 TraceCheckUtils]: 106: Hoare triple {22202#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:16,339 INFO L273 TraceCheckUtils]: 107: Hoare triple {22202#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:16,340 INFO L273 TraceCheckUtils]: 108: Hoare triple {22203#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:16,340 INFO L273 TraceCheckUtils]: 109: Hoare triple {22203#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:16,341 INFO L273 TraceCheckUtils]: 110: Hoare triple {22203#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:16,342 INFO L273 TraceCheckUtils]: 111: Hoare triple {22204#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:16,342 INFO L273 TraceCheckUtils]: 112: Hoare triple {22204#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:16,343 INFO L273 TraceCheckUtils]: 113: Hoare triple {22204#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:16,343 INFO L273 TraceCheckUtils]: 114: Hoare triple {22205#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:16,344 INFO L273 TraceCheckUtils]: 115: Hoare triple {22205#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:16,344 INFO L273 TraceCheckUtils]: 116: Hoare triple {22205#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {22206#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:16,345 INFO L273 TraceCheckUtils]: 117: Hoare triple {22206#(<= main_~i~0 37)} assume !(~i~0 < 100000); {22168#false} is VALID [2018-11-23 12:06:16,345 INFO L273 TraceCheckUtils]: 118: Hoare triple {22168#false} havoc ~x~0;~x~0 := 0; {22168#false} is VALID [2018-11-23 12:06:16,346 INFO L273 TraceCheckUtils]: 119: Hoare triple {22168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {22168#false} is VALID [2018-11-23 12:06:16,346 INFO L256 TraceCheckUtils]: 120: Hoare triple {22168#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {22168#false} is VALID [2018-11-23 12:06:16,346 INFO L273 TraceCheckUtils]: 121: Hoare triple {22168#false} ~cond := #in~cond; {22168#false} is VALID [2018-11-23 12:06:16,346 INFO L273 TraceCheckUtils]: 122: Hoare triple {22168#false} assume 0 == ~cond; {22168#false} is VALID [2018-11-23 12:06:16,346 INFO L273 TraceCheckUtils]: 123: Hoare triple {22168#false} assume !false; {22168#false} is VALID [2018-11-23 12:06:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:16,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:16,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:06:16,375 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-11-23 12:06:16,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:16,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:06:16,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:16,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:06:16,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:06:16,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:06:16,511 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand 41 states. [2018-11-23 12:06:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,317 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2018-11-23 12:06:17,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:06:17,317 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-11-23 12:06:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:06:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 186 transitions. [2018-11-23 12:06:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:06:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 186 transitions. [2018-11-23 12:06:17,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 186 transitions. [2018-11-23 12:06:17,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:17,504 INFO L225 Difference]: With dead ends: 145 [2018-11-23 12:06:17,504 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 12:06:17,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:06:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 12:06:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-11-23 12:06:17,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:17,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 132 states. [2018-11-23 12:06:17,536 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 132 states. [2018-11-23 12:06:17,536 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 132 states. [2018-11-23 12:06:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,539 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2018-11-23 12:06:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2018-11-23 12:06:17,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,539 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 134 states. [2018-11-23 12:06:17,539 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 134 states. [2018-11-23 12:06:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,542 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2018-11-23 12:06:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2018-11-23 12:06:17,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:17,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 12:06:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-11-23 12:06:17,544 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 124 [2018-11-23 12:06:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:17,545 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-11-23 12:06:17,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:06:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2018-11-23 12:06:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 12:06:17,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:17,546 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:17,546 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:17,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:17,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1912266759, now seen corresponding path program 38 times [2018-11-23 12:06:17,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:17,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:17,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:17,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:17,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:19,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {23219#true} call ULTIMATE.init(); {23219#true} is VALID [2018-11-23 12:06:19,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {23219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23219#true} is VALID [2018-11-23 12:06:19,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {23219#true} assume true; {23219#true} is VALID [2018-11-23 12:06:19,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23219#true} {23219#true} #55#return; {23219#true} is VALID [2018-11-23 12:06:19,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {23219#true} call #t~ret4 := main(); {23219#true} is VALID [2018-11-23 12:06:19,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {23219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {23221#(= main_~i~0 0)} is VALID [2018-11-23 12:06:19,230 INFO L273 TraceCheckUtils]: 6: Hoare triple {23221#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23221#(= main_~i~0 0)} is VALID [2018-11-23 12:06:19,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {23221#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23221#(= main_~i~0 0)} is VALID [2018-11-23 12:06:19,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {23221#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:19,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {23222#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:19,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {23222#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:19,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {23222#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:19,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {23223#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:19,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {23223#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:19,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {23223#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:19,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {23224#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:19,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {23224#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:19,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {23224#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:19,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {23225#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:19,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {23225#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:19,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {23225#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:19,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {23226#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:19,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {23226#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:19,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {23226#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:19,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {23227#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:19,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {23227#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:19,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {23227#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:19,241 INFO L273 TraceCheckUtils]: 27: Hoare triple {23228#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:19,242 INFO L273 TraceCheckUtils]: 28: Hoare triple {23228#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:19,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {23228#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:19,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {23229#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:19,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {23229#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:19,244 INFO L273 TraceCheckUtils]: 32: Hoare triple {23229#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:19,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {23230#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:19,245 INFO L273 TraceCheckUtils]: 34: Hoare triple {23230#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:19,246 INFO L273 TraceCheckUtils]: 35: Hoare triple {23230#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:19,246 INFO L273 TraceCheckUtils]: 36: Hoare triple {23231#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:19,247 INFO L273 TraceCheckUtils]: 37: Hoare triple {23231#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:19,248 INFO L273 TraceCheckUtils]: 38: Hoare triple {23231#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:19,248 INFO L273 TraceCheckUtils]: 39: Hoare triple {23232#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:19,249 INFO L273 TraceCheckUtils]: 40: Hoare triple {23232#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:19,249 INFO L273 TraceCheckUtils]: 41: Hoare triple {23232#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:19,250 INFO L273 TraceCheckUtils]: 42: Hoare triple {23233#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:19,250 INFO L273 TraceCheckUtils]: 43: Hoare triple {23233#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:19,251 INFO L273 TraceCheckUtils]: 44: Hoare triple {23233#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:19,252 INFO L273 TraceCheckUtils]: 45: Hoare triple {23234#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:19,252 INFO L273 TraceCheckUtils]: 46: Hoare triple {23234#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:19,253 INFO L273 TraceCheckUtils]: 47: Hoare triple {23234#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:19,253 INFO L273 TraceCheckUtils]: 48: Hoare triple {23235#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:19,254 INFO L273 TraceCheckUtils]: 49: Hoare triple {23235#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:19,254 INFO L273 TraceCheckUtils]: 50: Hoare triple {23235#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:19,255 INFO L273 TraceCheckUtils]: 51: Hoare triple {23236#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:19,256 INFO L273 TraceCheckUtils]: 52: Hoare triple {23236#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:19,256 INFO L273 TraceCheckUtils]: 53: Hoare triple {23236#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:19,257 INFO L273 TraceCheckUtils]: 54: Hoare triple {23237#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:19,257 INFO L273 TraceCheckUtils]: 55: Hoare triple {23237#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:19,258 INFO L273 TraceCheckUtils]: 56: Hoare triple {23237#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:19,259 INFO L273 TraceCheckUtils]: 57: Hoare triple {23238#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:19,259 INFO L273 TraceCheckUtils]: 58: Hoare triple {23238#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:19,260 INFO L273 TraceCheckUtils]: 59: Hoare triple {23238#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:19,260 INFO L273 TraceCheckUtils]: 60: Hoare triple {23239#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:19,261 INFO L273 TraceCheckUtils]: 61: Hoare triple {23239#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:19,262 INFO L273 TraceCheckUtils]: 62: Hoare triple {23239#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:19,262 INFO L273 TraceCheckUtils]: 63: Hoare triple {23240#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:19,263 INFO L273 TraceCheckUtils]: 64: Hoare triple {23240#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:19,263 INFO L273 TraceCheckUtils]: 65: Hoare triple {23240#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:19,264 INFO L273 TraceCheckUtils]: 66: Hoare triple {23241#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:19,264 INFO L273 TraceCheckUtils]: 67: Hoare triple {23241#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:19,265 INFO L273 TraceCheckUtils]: 68: Hoare triple {23241#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:19,266 INFO L273 TraceCheckUtils]: 69: Hoare triple {23242#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:19,266 INFO L273 TraceCheckUtils]: 70: Hoare triple {23242#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:19,267 INFO L273 TraceCheckUtils]: 71: Hoare triple {23242#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:19,267 INFO L273 TraceCheckUtils]: 72: Hoare triple {23243#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:19,268 INFO L273 TraceCheckUtils]: 73: Hoare triple {23243#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:19,269 INFO L273 TraceCheckUtils]: 74: Hoare triple {23243#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:19,269 INFO L273 TraceCheckUtils]: 75: Hoare triple {23244#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:19,270 INFO L273 TraceCheckUtils]: 76: Hoare triple {23244#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:19,270 INFO L273 TraceCheckUtils]: 77: Hoare triple {23244#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:19,271 INFO L273 TraceCheckUtils]: 78: Hoare triple {23245#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:19,271 INFO L273 TraceCheckUtils]: 79: Hoare triple {23245#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:19,272 INFO L273 TraceCheckUtils]: 80: Hoare triple {23245#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:19,273 INFO L273 TraceCheckUtils]: 81: Hoare triple {23246#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:19,273 INFO L273 TraceCheckUtils]: 82: Hoare triple {23246#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:19,274 INFO L273 TraceCheckUtils]: 83: Hoare triple {23246#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:19,274 INFO L273 TraceCheckUtils]: 84: Hoare triple {23247#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:19,275 INFO L273 TraceCheckUtils]: 85: Hoare triple {23247#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:19,276 INFO L273 TraceCheckUtils]: 86: Hoare triple {23247#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:19,276 INFO L273 TraceCheckUtils]: 87: Hoare triple {23248#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:19,277 INFO L273 TraceCheckUtils]: 88: Hoare triple {23248#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:19,277 INFO L273 TraceCheckUtils]: 89: Hoare triple {23248#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:19,278 INFO L273 TraceCheckUtils]: 90: Hoare triple {23249#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:19,279 INFO L273 TraceCheckUtils]: 91: Hoare triple {23249#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:19,279 INFO L273 TraceCheckUtils]: 92: Hoare triple {23249#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:19,280 INFO L273 TraceCheckUtils]: 93: Hoare triple {23250#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:19,280 INFO L273 TraceCheckUtils]: 94: Hoare triple {23250#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:19,281 INFO L273 TraceCheckUtils]: 95: Hoare triple {23250#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:19,282 INFO L273 TraceCheckUtils]: 96: Hoare triple {23251#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:19,282 INFO L273 TraceCheckUtils]: 97: Hoare triple {23251#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:19,283 INFO L273 TraceCheckUtils]: 98: Hoare triple {23251#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:19,283 INFO L273 TraceCheckUtils]: 99: Hoare triple {23252#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:19,284 INFO L273 TraceCheckUtils]: 100: Hoare triple {23252#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:19,285 INFO L273 TraceCheckUtils]: 101: Hoare triple {23252#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:19,285 INFO L273 TraceCheckUtils]: 102: Hoare triple {23253#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:19,286 INFO L273 TraceCheckUtils]: 103: Hoare triple {23253#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:19,286 INFO L273 TraceCheckUtils]: 104: Hoare triple {23253#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:19,287 INFO L273 TraceCheckUtils]: 105: Hoare triple {23254#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:19,287 INFO L273 TraceCheckUtils]: 106: Hoare triple {23254#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:19,288 INFO L273 TraceCheckUtils]: 107: Hoare triple {23254#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:19,289 INFO L273 TraceCheckUtils]: 108: Hoare triple {23255#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:19,289 INFO L273 TraceCheckUtils]: 109: Hoare triple {23255#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:19,290 INFO L273 TraceCheckUtils]: 110: Hoare triple {23255#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:19,290 INFO L273 TraceCheckUtils]: 111: Hoare triple {23256#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:19,291 INFO L273 TraceCheckUtils]: 112: Hoare triple {23256#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:19,292 INFO L273 TraceCheckUtils]: 113: Hoare triple {23256#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:19,292 INFO L273 TraceCheckUtils]: 114: Hoare triple {23257#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:19,293 INFO L273 TraceCheckUtils]: 115: Hoare triple {23257#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:19,293 INFO L273 TraceCheckUtils]: 116: Hoare triple {23257#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:19,294 INFO L273 TraceCheckUtils]: 117: Hoare triple {23258#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:19,294 INFO L273 TraceCheckUtils]: 118: Hoare triple {23258#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:19,295 INFO L273 TraceCheckUtils]: 119: Hoare triple {23258#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {23259#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:19,296 INFO L273 TraceCheckUtils]: 120: Hoare triple {23259#(<= main_~i~0 38)} assume !(~i~0 < 100000); {23220#false} is VALID [2018-11-23 12:06:19,296 INFO L273 TraceCheckUtils]: 121: Hoare triple {23220#false} havoc ~x~0;~x~0 := 0; {23220#false} is VALID [2018-11-23 12:06:19,296 INFO L273 TraceCheckUtils]: 122: Hoare triple {23220#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {23220#false} is VALID [2018-11-23 12:06:19,296 INFO L256 TraceCheckUtils]: 123: Hoare triple {23220#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {23220#false} is VALID [2018-11-23 12:06:19,297 INFO L273 TraceCheckUtils]: 124: Hoare triple {23220#false} ~cond := #in~cond; {23220#false} is VALID [2018-11-23 12:06:19,297 INFO L273 TraceCheckUtils]: 125: Hoare triple {23220#false} assume 0 == ~cond; {23220#false} is VALID [2018-11-23 12:06:19,297 INFO L273 TraceCheckUtils]: 126: Hoare triple {23220#false} assume !false; {23220#false} is VALID [2018-11-23 12:06:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:19,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:19,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:19,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:19,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:19,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:19,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:19,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {23219#true} call ULTIMATE.init(); {23219#true} is VALID [2018-11-23 12:06:19,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {23219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23219#true} is VALID [2018-11-23 12:06:19,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {23219#true} assume true; {23219#true} is VALID [2018-11-23 12:06:19,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23219#true} {23219#true} #55#return; {23219#true} is VALID [2018-11-23 12:06:19,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {23219#true} call #t~ret4 := main(); {23219#true} is VALID [2018-11-23 12:06:19,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {23219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {23278#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:19,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {23278#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23278#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:19,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {23278#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23278#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:19,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {23278#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:19,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {23222#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:19,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {23222#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:19,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {23222#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:19,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {23223#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:19,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {23223#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:19,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {23223#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:19,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {23224#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:19,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {23224#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:19,828 INFO L273 TraceCheckUtils]: 17: Hoare triple {23224#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:19,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {23225#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:19,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {23225#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:19,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {23225#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:19,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {23226#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:19,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {23226#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:19,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {23226#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:19,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {23227#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:19,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {23227#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:19,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {23227#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:19,833 INFO L273 TraceCheckUtils]: 27: Hoare triple {23228#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:19,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {23228#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:19,834 INFO L273 TraceCheckUtils]: 29: Hoare triple {23228#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:19,835 INFO L273 TraceCheckUtils]: 30: Hoare triple {23229#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:19,835 INFO L273 TraceCheckUtils]: 31: Hoare triple {23229#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:19,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {23229#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:19,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {23230#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:19,837 INFO L273 TraceCheckUtils]: 34: Hoare triple {23230#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:19,838 INFO L273 TraceCheckUtils]: 35: Hoare triple {23230#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:19,838 INFO L273 TraceCheckUtils]: 36: Hoare triple {23231#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:19,839 INFO L273 TraceCheckUtils]: 37: Hoare triple {23231#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:19,840 INFO L273 TraceCheckUtils]: 38: Hoare triple {23231#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:19,840 INFO L273 TraceCheckUtils]: 39: Hoare triple {23232#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:19,841 INFO L273 TraceCheckUtils]: 40: Hoare triple {23232#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:19,841 INFO L273 TraceCheckUtils]: 41: Hoare triple {23232#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:19,862 INFO L273 TraceCheckUtils]: 42: Hoare triple {23233#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:19,870 INFO L273 TraceCheckUtils]: 43: Hoare triple {23233#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:19,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {23233#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:19,890 INFO L273 TraceCheckUtils]: 45: Hoare triple {23234#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:19,890 INFO L273 TraceCheckUtils]: 46: Hoare triple {23234#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:19,891 INFO L273 TraceCheckUtils]: 47: Hoare triple {23234#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:19,891 INFO L273 TraceCheckUtils]: 48: Hoare triple {23235#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:19,891 INFO L273 TraceCheckUtils]: 49: Hoare triple {23235#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:19,892 INFO L273 TraceCheckUtils]: 50: Hoare triple {23235#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:19,892 INFO L273 TraceCheckUtils]: 51: Hoare triple {23236#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:19,892 INFO L273 TraceCheckUtils]: 52: Hoare triple {23236#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:19,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {23236#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:19,894 INFO L273 TraceCheckUtils]: 54: Hoare triple {23237#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:19,894 INFO L273 TraceCheckUtils]: 55: Hoare triple {23237#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:19,895 INFO L273 TraceCheckUtils]: 56: Hoare triple {23237#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:19,895 INFO L273 TraceCheckUtils]: 57: Hoare triple {23238#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:19,896 INFO L273 TraceCheckUtils]: 58: Hoare triple {23238#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:19,896 INFO L273 TraceCheckUtils]: 59: Hoare triple {23238#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:19,897 INFO L273 TraceCheckUtils]: 60: Hoare triple {23239#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:19,898 INFO L273 TraceCheckUtils]: 61: Hoare triple {23239#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:19,898 INFO L273 TraceCheckUtils]: 62: Hoare triple {23239#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:19,899 INFO L273 TraceCheckUtils]: 63: Hoare triple {23240#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:19,899 INFO L273 TraceCheckUtils]: 64: Hoare triple {23240#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:19,900 INFO L273 TraceCheckUtils]: 65: Hoare triple {23240#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:19,900 INFO L273 TraceCheckUtils]: 66: Hoare triple {23241#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:19,901 INFO L273 TraceCheckUtils]: 67: Hoare triple {23241#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:19,902 INFO L273 TraceCheckUtils]: 68: Hoare triple {23241#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:19,902 INFO L273 TraceCheckUtils]: 69: Hoare triple {23242#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:19,903 INFO L273 TraceCheckUtils]: 70: Hoare triple {23242#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:19,903 INFO L273 TraceCheckUtils]: 71: Hoare triple {23242#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:19,904 INFO L273 TraceCheckUtils]: 72: Hoare triple {23243#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:19,904 INFO L273 TraceCheckUtils]: 73: Hoare triple {23243#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:19,905 INFO L273 TraceCheckUtils]: 74: Hoare triple {23243#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:19,906 INFO L273 TraceCheckUtils]: 75: Hoare triple {23244#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:19,906 INFO L273 TraceCheckUtils]: 76: Hoare triple {23244#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:19,907 INFO L273 TraceCheckUtils]: 77: Hoare triple {23244#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:19,907 INFO L273 TraceCheckUtils]: 78: Hoare triple {23245#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:19,908 INFO L273 TraceCheckUtils]: 79: Hoare triple {23245#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:19,909 INFO L273 TraceCheckUtils]: 80: Hoare triple {23245#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:19,909 INFO L273 TraceCheckUtils]: 81: Hoare triple {23246#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:19,910 INFO L273 TraceCheckUtils]: 82: Hoare triple {23246#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:19,910 INFO L273 TraceCheckUtils]: 83: Hoare triple {23246#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:19,911 INFO L273 TraceCheckUtils]: 84: Hoare triple {23247#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:19,911 INFO L273 TraceCheckUtils]: 85: Hoare triple {23247#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:19,912 INFO L273 TraceCheckUtils]: 86: Hoare triple {23247#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:19,913 INFO L273 TraceCheckUtils]: 87: Hoare triple {23248#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:19,913 INFO L273 TraceCheckUtils]: 88: Hoare triple {23248#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:19,914 INFO L273 TraceCheckUtils]: 89: Hoare triple {23248#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:19,914 INFO L273 TraceCheckUtils]: 90: Hoare triple {23249#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:19,915 INFO L273 TraceCheckUtils]: 91: Hoare triple {23249#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:19,916 INFO L273 TraceCheckUtils]: 92: Hoare triple {23249#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:19,916 INFO L273 TraceCheckUtils]: 93: Hoare triple {23250#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:19,917 INFO L273 TraceCheckUtils]: 94: Hoare triple {23250#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:19,917 INFO L273 TraceCheckUtils]: 95: Hoare triple {23250#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:19,918 INFO L273 TraceCheckUtils]: 96: Hoare triple {23251#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:19,918 INFO L273 TraceCheckUtils]: 97: Hoare triple {23251#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:19,919 INFO L273 TraceCheckUtils]: 98: Hoare triple {23251#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:19,920 INFO L273 TraceCheckUtils]: 99: Hoare triple {23252#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:19,920 INFO L273 TraceCheckUtils]: 100: Hoare triple {23252#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:19,921 INFO L273 TraceCheckUtils]: 101: Hoare triple {23252#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:19,921 INFO L273 TraceCheckUtils]: 102: Hoare triple {23253#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:19,922 INFO L273 TraceCheckUtils]: 103: Hoare triple {23253#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:19,922 INFO L273 TraceCheckUtils]: 104: Hoare triple {23253#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:19,923 INFO L273 TraceCheckUtils]: 105: Hoare triple {23254#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:19,923 INFO L273 TraceCheckUtils]: 106: Hoare triple {23254#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:19,924 INFO L273 TraceCheckUtils]: 107: Hoare triple {23254#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:19,925 INFO L273 TraceCheckUtils]: 108: Hoare triple {23255#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:19,925 INFO L273 TraceCheckUtils]: 109: Hoare triple {23255#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:19,926 INFO L273 TraceCheckUtils]: 110: Hoare triple {23255#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:19,926 INFO L273 TraceCheckUtils]: 111: Hoare triple {23256#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:19,927 INFO L273 TraceCheckUtils]: 112: Hoare triple {23256#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:19,928 INFO L273 TraceCheckUtils]: 113: Hoare triple {23256#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:19,928 INFO L273 TraceCheckUtils]: 114: Hoare triple {23257#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:19,929 INFO L273 TraceCheckUtils]: 115: Hoare triple {23257#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:19,929 INFO L273 TraceCheckUtils]: 116: Hoare triple {23257#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:19,930 INFO L273 TraceCheckUtils]: 117: Hoare triple {23258#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:19,930 INFO L273 TraceCheckUtils]: 118: Hoare triple {23258#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:19,931 INFO L273 TraceCheckUtils]: 119: Hoare triple {23258#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {23259#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:19,932 INFO L273 TraceCheckUtils]: 120: Hoare triple {23259#(<= main_~i~0 38)} assume !(~i~0 < 100000); {23220#false} is VALID [2018-11-23 12:06:19,932 INFO L273 TraceCheckUtils]: 121: Hoare triple {23220#false} havoc ~x~0;~x~0 := 0; {23220#false} is VALID [2018-11-23 12:06:19,932 INFO L273 TraceCheckUtils]: 122: Hoare triple {23220#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {23220#false} is VALID [2018-11-23 12:06:19,932 INFO L256 TraceCheckUtils]: 123: Hoare triple {23220#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {23220#false} is VALID [2018-11-23 12:06:19,933 INFO L273 TraceCheckUtils]: 124: Hoare triple {23220#false} ~cond := #in~cond; {23220#false} is VALID [2018-11-23 12:06:19,933 INFO L273 TraceCheckUtils]: 125: Hoare triple {23220#false} assume 0 == ~cond; {23220#false} is VALID [2018-11-23 12:06:19,933 INFO L273 TraceCheckUtils]: 126: Hoare triple {23220#false} assume !false; {23220#false} is VALID [2018-11-23 12:06:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:19,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:19,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:06:19,963 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2018-11-23 12:06:19,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:19,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:06:20,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:20,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:06:20,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:06:20,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:06:20,116 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand 42 states. [2018-11-23 12:06:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,805 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2018-11-23 12:06:20,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:06:20,805 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2018-11-23 12:06:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:06:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 190 transitions. [2018-11-23 12:06:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:06:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 190 transitions. [2018-11-23 12:06:20,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 190 transitions. [2018-11-23 12:06:20,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:20,988 INFO L225 Difference]: With dead ends: 148 [2018-11-23 12:06:20,988 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:06:20,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:06:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:06:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:06:21,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:21,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:06:21,024 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:06:21,024 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:06:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:21,026 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2018-11-23 12:06:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2018-11-23 12:06:21,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:21,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:21,026 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:06:21,026 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:06:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:21,028 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2018-11-23 12:06:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2018-11-23 12:06:21,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:21,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:21,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:21,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:06:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2018-11-23 12:06:21,030 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 127 [2018-11-23 12:06:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:21,030 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2018-11-23 12:06:21,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:06:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2018-11-23 12:06:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:06:21,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:21,031 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:21,031 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:21,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:21,032 INFO L82 PathProgramCache]: Analyzing trace with hash -847437405, now seen corresponding path program 39 times [2018-11-23 12:06:21,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:21,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:21,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:21,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:21,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,893 INFO L256 TraceCheckUtils]: 0: Hoare triple {24295#true} call ULTIMATE.init(); {24295#true} is VALID [2018-11-23 12:06:21,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {24295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24295#true} is VALID [2018-11-23 12:06:21,894 INFO L273 TraceCheckUtils]: 2: Hoare triple {24295#true} assume true; {24295#true} is VALID [2018-11-23 12:06:21,894 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24295#true} {24295#true} #55#return; {24295#true} is VALID [2018-11-23 12:06:21,894 INFO L256 TraceCheckUtils]: 4: Hoare triple {24295#true} call #t~ret4 := main(); {24295#true} is VALID [2018-11-23 12:06:21,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {24295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {24297#(= main_~i~0 0)} is VALID [2018-11-23 12:06:21,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {24297#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24297#(= main_~i~0 0)} is VALID [2018-11-23 12:06:21,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {24297#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24297#(= main_~i~0 0)} is VALID [2018-11-23 12:06:21,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {24297#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {24298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {24298#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {24298#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {24299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {24299#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,898 INFO L273 TraceCheckUtils]: 14: Hoare triple {24299#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,899 INFO L273 TraceCheckUtils]: 15: Hoare triple {24300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {24300#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,900 INFO L273 TraceCheckUtils]: 17: Hoare triple {24300#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {24301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,901 INFO L273 TraceCheckUtils]: 19: Hoare triple {24301#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {24301#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,902 INFO L273 TraceCheckUtils]: 21: Hoare triple {24302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {24302#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,903 INFO L273 TraceCheckUtils]: 23: Hoare triple {24302#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {24303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,904 INFO L273 TraceCheckUtils]: 25: Hoare triple {24303#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,905 INFO L273 TraceCheckUtils]: 26: Hoare triple {24303#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {24304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,906 INFO L273 TraceCheckUtils]: 28: Hoare triple {24304#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,907 INFO L273 TraceCheckUtils]: 29: Hoare triple {24304#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,907 INFO L273 TraceCheckUtils]: 30: Hoare triple {24305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {24305#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,908 INFO L273 TraceCheckUtils]: 32: Hoare triple {24305#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,909 INFO L273 TraceCheckUtils]: 33: Hoare triple {24306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,909 INFO L273 TraceCheckUtils]: 34: Hoare triple {24306#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,910 INFO L273 TraceCheckUtils]: 35: Hoare triple {24306#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,910 INFO L273 TraceCheckUtils]: 36: Hoare triple {24307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,911 INFO L273 TraceCheckUtils]: 37: Hoare triple {24307#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,911 INFO L273 TraceCheckUtils]: 38: Hoare triple {24307#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,912 INFO L273 TraceCheckUtils]: 39: Hoare triple {24308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,912 INFO L273 TraceCheckUtils]: 40: Hoare triple {24308#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,913 INFO L273 TraceCheckUtils]: 41: Hoare triple {24308#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,913 INFO L273 TraceCheckUtils]: 42: Hoare triple {24309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,914 INFO L273 TraceCheckUtils]: 43: Hoare triple {24309#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,916 INFO L273 TraceCheckUtils]: 44: Hoare triple {24309#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,917 INFO L273 TraceCheckUtils]: 45: Hoare triple {24310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,917 INFO L273 TraceCheckUtils]: 46: Hoare triple {24310#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,918 INFO L273 TraceCheckUtils]: 47: Hoare triple {24310#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,918 INFO L273 TraceCheckUtils]: 48: Hoare triple {24311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,919 INFO L273 TraceCheckUtils]: 49: Hoare triple {24311#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,919 INFO L273 TraceCheckUtils]: 50: Hoare triple {24311#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,920 INFO L273 TraceCheckUtils]: 51: Hoare triple {24312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,920 INFO L273 TraceCheckUtils]: 52: Hoare triple {24312#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,920 INFO L273 TraceCheckUtils]: 53: Hoare triple {24312#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,921 INFO L273 TraceCheckUtils]: 54: Hoare triple {24313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,921 INFO L273 TraceCheckUtils]: 55: Hoare triple {24313#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,922 INFO L273 TraceCheckUtils]: 56: Hoare triple {24313#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,922 INFO L273 TraceCheckUtils]: 57: Hoare triple {24314#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,923 INFO L273 TraceCheckUtils]: 58: Hoare triple {24314#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,924 INFO L273 TraceCheckUtils]: 59: Hoare triple {24314#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,924 INFO L273 TraceCheckUtils]: 60: Hoare triple {24315#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,925 INFO L273 TraceCheckUtils]: 61: Hoare triple {24315#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,925 INFO L273 TraceCheckUtils]: 62: Hoare triple {24315#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,926 INFO L273 TraceCheckUtils]: 63: Hoare triple {24316#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,926 INFO L273 TraceCheckUtils]: 64: Hoare triple {24316#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,927 INFO L273 TraceCheckUtils]: 65: Hoare triple {24316#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,928 INFO L273 TraceCheckUtils]: 66: Hoare triple {24317#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,928 INFO L273 TraceCheckUtils]: 67: Hoare triple {24317#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,929 INFO L273 TraceCheckUtils]: 68: Hoare triple {24317#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,929 INFO L273 TraceCheckUtils]: 69: Hoare triple {24318#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,930 INFO L273 TraceCheckUtils]: 70: Hoare triple {24318#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,930 INFO L273 TraceCheckUtils]: 71: Hoare triple {24318#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,931 INFO L273 TraceCheckUtils]: 72: Hoare triple {24319#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,931 INFO L273 TraceCheckUtils]: 73: Hoare triple {24319#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,932 INFO L273 TraceCheckUtils]: 74: Hoare triple {24319#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,932 INFO L273 TraceCheckUtils]: 75: Hoare triple {24320#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,933 INFO L273 TraceCheckUtils]: 76: Hoare triple {24320#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,934 INFO L273 TraceCheckUtils]: 77: Hoare triple {24320#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,934 INFO L273 TraceCheckUtils]: 78: Hoare triple {24321#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,935 INFO L273 TraceCheckUtils]: 79: Hoare triple {24321#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,935 INFO L273 TraceCheckUtils]: 80: Hoare triple {24321#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:21,936 INFO L273 TraceCheckUtils]: 81: Hoare triple {24322#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:21,936 INFO L273 TraceCheckUtils]: 82: Hoare triple {24322#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:21,937 INFO L273 TraceCheckUtils]: 83: Hoare triple {24322#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:21,937 INFO L273 TraceCheckUtils]: 84: Hoare triple {24323#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:21,938 INFO L273 TraceCheckUtils]: 85: Hoare triple {24323#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:21,938 INFO L273 TraceCheckUtils]: 86: Hoare triple {24323#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:21,939 INFO L273 TraceCheckUtils]: 87: Hoare triple {24324#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:21,939 INFO L273 TraceCheckUtils]: 88: Hoare triple {24324#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:21,940 INFO L273 TraceCheckUtils]: 89: Hoare triple {24324#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:21,941 INFO L273 TraceCheckUtils]: 90: Hoare triple {24325#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:21,941 INFO L273 TraceCheckUtils]: 91: Hoare triple {24325#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:21,942 INFO L273 TraceCheckUtils]: 92: Hoare triple {24325#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:21,942 INFO L273 TraceCheckUtils]: 93: Hoare triple {24326#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:21,943 INFO L273 TraceCheckUtils]: 94: Hoare triple {24326#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:21,943 INFO L273 TraceCheckUtils]: 95: Hoare triple {24326#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:21,944 INFO L273 TraceCheckUtils]: 96: Hoare triple {24327#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:21,944 INFO L273 TraceCheckUtils]: 97: Hoare triple {24327#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:21,945 INFO L273 TraceCheckUtils]: 98: Hoare triple {24327#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:21,945 INFO L273 TraceCheckUtils]: 99: Hoare triple {24328#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:21,946 INFO L273 TraceCheckUtils]: 100: Hoare triple {24328#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:21,947 INFO L273 TraceCheckUtils]: 101: Hoare triple {24328#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:21,947 INFO L273 TraceCheckUtils]: 102: Hoare triple {24329#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:21,947 INFO L273 TraceCheckUtils]: 103: Hoare triple {24329#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:21,948 INFO L273 TraceCheckUtils]: 104: Hoare triple {24329#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:21,949 INFO L273 TraceCheckUtils]: 105: Hoare triple {24330#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:21,949 INFO L273 TraceCheckUtils]: 106: Hoare triple {24330#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:21,950 INFO L273 TraceCheckUtils]: 107: Hoare triple {24330#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:21,950 INFO L273 TraceCheckUtils]: 108: Hoare triple {24331#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:21,951 INFO L273 TraceCheckUtils]: 109: Hoare triple {24331#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:21,951 INFO L273 TraceCheckUtils]: 110: Hoare triple {24331#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:21,952 INFO L273 TraceCheckUtils]: 111: Hoare triple {24332#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:21,952 INFO L273 TraceCheckUtils]: 112: Hoare triple {24332#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:21,953 INFO L273 TraceCheckUtils]: 113: Hoare triple {24332#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:21,954 INFO L273 TraceCheckUtils]: 114: Hoare triple {24333#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:21,954 INFO L273 TraceCheckUtils]: 115: Hoare triple {24333#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:21,955 INFO L273 TraceCheckUtils]: 116: Hoare triple {24333#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:21,955 INFO L273 TraceCheckUtils]: 117: Hoare triple {24334#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:21,956 INFO L273 TraceCheckUtils]: 118: Hoare triple {24334#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:21,956 INFO L273 TraceCheckUtils]: 119: Hoare triple {24334#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:21,957 INFO L273 TraceCheckUtils]: 120: Hoare triple {24335#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:21,957 INFO L273 TraceCheckUtils]: 121: Hoare triple {24335#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:21,958 INFO L273 TraceCheckUtils]: 122: Hoare triple {24335#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {24336#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:21,959 INFO L273 TraceCheckUtils]: 123: Hoare triple {24336#(<= main_~i~0 39)} assume !(~i~0 < 100000); {24296#false} is VALID [2018-11-23 12:06:21,959 INFO L273 TraceCheckUtils]: 124: Hoare triple {24296#false} havoc ~x~0;~x~0 := 0; {24296#false} is VALID [2018-11-23 12:06:21,959 INFO L273 TraceCheckUtils]: 125: Hoare triple {24296#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {24296#false} is VALID [2018-11-23 12:06:21,959 INFO L256 TraceCheckUtils]: 126: Hoare triple {24296#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {24296#false} is VALID [2018-11-23 12:06:21,959 INFO L273 TraceCheckUtils]: 127: Hoare triple {24296#false} ~cond := #in~cond; {24296#false} is VALID [2018-11-23 12:06:21,960 INFO L273 TraceCheckUtils]: 128: Hoare triple {24296#false} assume 0 == ~cond; {24296#false} is VALID [2018-11-23 12:06:21,960 INFO L273 TraceCheckUtils]: 129: Hoare triple {24296#false} assume !false; {24296#false} is VALID [2018-11-23 12:06:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:21,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:21,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:21,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:22,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-23 12:06:22,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:22,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:22,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {24295#true} call ULTIMATE.init(); {24295#true} is VALID [2018-11-23 12:06:22,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {24295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24295#true} is VALID [2018-11-23 12:06:22,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {24295#true} assume true; {24295#true} is VALID [2018-11-23 12:06:22,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24295#true} {24295#true} #55#return; {24295#true} is VALID [2018-11-23 12:06:22,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {24295#true} call #t~ret4 := main(); {24295#true} is VALID [2018-11-23 12:06:22,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {24295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {24355#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:22,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {24355#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24355#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:22,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {24355#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24355#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:22,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {24355#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:22,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {24298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:22,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {24298#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:22,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {24298#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:22,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {24299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:22,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {24299#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:22,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {24299#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:22,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {24300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:22,498 INFO L273 TraceCheckUtils]: 16: Hoare triple {24300#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:22,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {24300#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:22,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {24301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:22,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {24301#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:22,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {24301#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:22,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {24302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:22,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {24302#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:22,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {24302#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:22,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {24303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:22,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {24303#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:22,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {24303#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:22,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {24304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:22,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {24304#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:22,505 INFO L273 TraceCheckUtils]: 29: Hoare triple {24304#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:22,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {24305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:22,506 INFO L273 TraceCheckUtils]: 31: Hoare triple {24305#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:22,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {24305#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:22,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {24306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:22,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {24306#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:22,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {24306#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:22,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {24307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:22,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {24307#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:22,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {24307#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:22,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {24308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:22,511 INFO L273 TraceCheckUtils]: 40: Hoare triple {24308#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:22,512 INFO L273 TraceCheckUtils]: 41: Hoare triple {24308#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:22,532 INFO L273 TraceCheckUtils]: 42: Hoare triple {24309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:22,547 INFO L273 TraceCheckUtils]: 43: Hoare triple {24309#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:22,555 INFO L273 TraceCheckUtils]: 44: Hoare triple {24309#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:22,559 INFO L273 TraceCheckUtils]: 45: Hoare triple {24310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:22,559 INFO L273 TraceCheckUtils]: 46: Hoare triple {24310#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:22,560 INFO L273 TraceCheckUtils]: 47: Hoare triple {24310#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:22,560 INFO L273 TraceCheckUtils]: 48: Hoare triple {24311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:22,560 INFO L273 TraceCheckUtils]: 49: Hoare triple {24311#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:22,561 INFO L273 TraceCheckUtils]: 50: Hoare triple {24311#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:22,561 INFO L273 TraceCheckUtils]: 51: Hoare triple {24312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:22,561 INFO L273 TraceCheckUtils]: 52: Hoare triple {24312#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:22,562 INFO L273 TraceCheckUtils]: 53: Hoare triple {24312#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:22,562 INFO L273 TraceCheckUtils]: 54: Hoare triple {24313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:22,562 INFO L273 TraceCheckUtils]: 55: Hoare triple {24313#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:22,563 INFO L273 TraceCheckUtils]: 56: Hoare triple {24313#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:22,563 INFO L273 TraceCheckUtils]: 57: Hoare triple {24314#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:22,564 INFO L273 TraceCheckUtils]: 58: Hoare triple {24314#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:22,565 INFO L273 TraceCheckUtils]: 59: Hoare triple {24314#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:22,565 INFO L273 TraceCheckUtils]: 60: Hoare triple {24315#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:22,566 INFO L273 TraceCheckUtils]: 61: Hoare triple {24315#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:22,566 INFO L273 TraceCheckUtils]: 62: Hoare triple {24315#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:22,567 INFO L273 TraceCheckUtils]: 63: Hoare triple {24316#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:22,567 INFO L273 TraceCheckUtils]: 64: Hoare triple {24316#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:22,568 INFO L273 TraceCheckUtils]: 65: Hoare triple {24316#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:22,568 INFO L273 TraceCheckUtils]: 66: Hoare triple {24317#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:22,569 INFO L273 TraceCheckUtils]: 67: Hoare triple {24317#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:22,570 INFO L273 TraceCheckUtils]: 68: Hoare triple {24317#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:22,570 INFO L273 TraceCheckUtils]: 69: Hoare triple {24318#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:22,571 INFO L273 TraceCheckUtils]: 70: Hoare triple {24318#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:22,571 INFO L273 TraceCheckUtils]: 71: Hoare triple {24318#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:22,572 INFO L273 TraceCheckUtils]: 72: Hoare triple {24319#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:22,572 INFO L273 TraceCheckUtils]: 73: Hoare triple {24319#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:22,573 INFO L273 TraceCheckUtils]: 74: Hoare triple {24319#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:22,574 INFO L273 TraceCheckUtils]: 75: Hoare triple {24320#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:22,574 INFO L273 TraceCheckUtils]: 76: Hoare triple {24320#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:22,575 INFO L273 TraceCheckUtils]: 77: Hoare triple {24320#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:22,575 INFO L273 TraceCheckUtils]: 78: Hoare triple {24321#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:22,576 INFO L273 TraceCheckUtils]: 79: Hoare triple {24321#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:22,576 INFO L273 TraceCheckUtils]: 80: Hoare triple {24321#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:22,577 INFO L273 TraceCheckUtils]: 81: Hoare triple {24322#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:22,577 INFO L273 TraceCheckUtils]: 82: Hoare triple {24322#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:22,578 INFO L273 TraceCheckUtils]: 83: Hoare triple {24322#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:22,579 INFO L273 TraceCheckUtils]: 84: Hoare triple {24323#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:22,579 INFO L273 TraceCheckUtils]: 85: Hoare triple {24323#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:22,580 INFO L273 TraceCheckUtils]: 86: Hoare triple {24323#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:22,580 INFO L273 TraceCheckUtils]: 87: Hoare triple {24324#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:22,581 INFO L273 TraceCheckUtils]: 88: Hoare triple {24324#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:22,581 INFO L273 TraceCheckUtils]: 89: Hoare triple {24324#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:22,582 INFO L273 TraceCheckUtils]: 90: Hoare triple {24325#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:22,582 INFO L273 TraceCheckUtils]: 91: Hoare triple {24325#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:22,583 INFO L273 TraceCheckUtils]: 92: Hoare triple {24325#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:22,584 INFO L273 TraceCheckUtils]: 93: Hoare triple {24326#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:22,584 INFO L273 TraceCheckUtils]: 94: Hoare triple {24326#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:22,585 INFO L273 TraceCheckUtils]: 95: Hoare triple {24326#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:22,585 INFO L273 TraceCheckUtils]: 96: Hoare triple {24327#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:22,586 INFO L273 TraceCheckUtils]: 97: Hoare triple {24327#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:22,586 INFO L273 TraceCheckUtils]: 98: Hoare triple {24327#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:22,587 INFO L273 TraceCheckUtils]: 99: Hoare triple {24328#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:22,587 INFO L273 TraceCheckUtils]: 100: Hoare triple {24328#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:22,588 INFO L273 TraceCheckUtils]: 101: Hoare triple {24328#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:22,589 INFO L273 TraceCheckUtils]: 102: Hoare triple {24329#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:22,589 INFO L273 TraceCheckUtils]: 103: Hoare triple {24329#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:22,590 INFO L273 TraceCheckUtils]: 104: Hoare triple {24329#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:22,591 INFO L273 TraceCheckUtils]: 105: Hoare triple {24330#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:22,592 INFO L273 TraceCheckUtils]: 106: Hoare triple {24330#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:22,593 INFO L273 TraceCheckUtils]: 107: Hoare triple {24330#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:22,593 INFO L273 TraceCheckUtils]: 108: Hoare triple {24331#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:22,594 INFO L273 TraceCheckUtils]: 109: Hoare triple {24331#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:22,594 INFO L273 TraceCheckUtils]: 110: Hoare triple {24331#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:22,595 INFO L273 TraceCheckUtils]: 111: Hoare triple {24332#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:22,595 INFO L273 TraceCheckUtils]: 112: Hoare triple {24332#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:22,596 INFO L273 TraceCheckUtils]: 113: Hoare triple {24332#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:22,597 INFO L273 TraceCheckUtils]: 114: Hoare triple {24333#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:22,597 INFO L273 TraceCheckUtils]: 115: Hoare triple {24333#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:22,598 INFO L273 TraceCheckUtils]: 116: Hoare triple {24333#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:22,598 INFO L273 TraceCheckUtils]: 117: Hoare triple {24334#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:22,599 INFO L273 TraceCheckUtils]: 118: Hoare triple {24334#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:22,599 INFO L273 TraceCheckUtils]: 119: Hoare triple {24334#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:22,600 INFO L273 TraceCheckUtils]: 120: Hoare triple {24335#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:22,600 INFO L273 TraceCheckUtils]: 121: Hoare triple {24335#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:22,601 INFO L273 TraceCheckUtils]: 122: Hoare triple {24335#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {24336#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:22,602 INFO L273 TraceCheckUtils]: 123: Hoare triple {24336#(<= main_~i~0 39)} assume !(~i~0 < 100000); {24296#false} is VALID [2018-11-23 12:06:22,602 INFO L273 TraceCheckUtils]: 124: Hoare triple {24296#false} havoc ~x~0;~x~0 := 0; {24296#false} is VALID [2018-11-23 12:06:22,602 INFO L273 TraceCheckUtils]: 125: Hoare triple {24296#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {24296#false} is VALID [2018-11-23 12:06:22,602 INFO L256 TraceCheckUtils]: 126: Hoare triple {24296#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {24296#false} is VALID [2018-11-23 12:06:22,602 INFO L273 TraceCheckUtils]: 127: Hoare triple {24296#false} ~cond := #in~cond; {24296#false} is VALID [2018-11-23 12:06:22,603 INFO L273 TraceCheckUtils]: 128: Hoare triple {24296#false} assume 0 == ~cond; {24296#false} is VALID [2018-11-23 12:06:22,603 INFO L273 TraceCheckUtils]: 129: Hoare triple {24296#false} assume !false; {24296#false} is VALID [2018-11-23 12:06:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:22,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:22,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 12:06:22,633 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2018-11-23 12:06:22,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:22,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:06:22,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:22,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:06:22,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:06:22,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:06:22,764 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 43 states. [2018-11-23 12:06:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:23,558 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2018-11-23 12:06:23,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:06:23,558 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2018-11-23 12:06:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:06:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 194 transitions. [2018-11-23 12:06:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:06:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 194 transitions. [2018-11-23 12:06:23,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 194 transitions. [2018-11-23 12:06:23,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:23,737 INFO L225 Difference]: With dead ends: 151 [2018-11-23 12:06:23,737 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 12:06:23,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:06:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 12:06:23,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-11-23 12:06:23,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:23,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 138 states. [2018-11-23 12:06:23,797 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 138 states. [2018-11-23 12:06:23,797 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 138 states. [2018-11-23 12:06:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:23,799 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2018-11-23 12:06:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 12:06:23,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:23,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:23,799 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 140 states. [2018-11-23 12:06:23,799 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 140 states. [2018-11-23 12:06:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:23,801 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2018-11-23 12:06:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 12:06:23,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:23,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:23,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:23,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 12:06:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2018-11-23 12:06:23,803 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 130 [2018-11-23 12:06:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:23,804 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2018-11-23 12:06:23,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:06:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2018-11-23 12:06:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 12:06:23,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:23,804 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:23,804 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:23,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1144600647, now seen corresponding path program 40 times [2018-11-23 12:06:23,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:23,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:23,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:23,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {25395#true} call ULTIMATE.init(); {25395#true} is VALID [2018-11-23 12:06:24,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {25395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25395#true} is VALID [2018-11-23 12:06:24,659 INFO L273 TraceCheckUtils]: 2: Hoare triple {25395#true} assume true; {25395#true} is VALID [2018-11-23 12:06:24,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25395#true} {25395#true} #55#return; {25395#true} is VALID [2018-11-23 12:06:24,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {25395#true} call #t~ret4 := main(); {25395#true} is VALID [2018-11-23 12:06:24,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {25395#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {25397#(= main_~i~0 0)} is VALID [2018-11-23 12:06:24,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {25397#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25397#(= main_~i~0 0)} is VALID [2018-11-23 12:06:24,661 INFO L273 TraceCheckUtils]: 7: Hoare triple {25397#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25397#(= main_~i~0 0)} is VALID [2018-11-23 12:06:24,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {25397#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {25398#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {25398#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {25398#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {25399#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {25399#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {25399#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {25400#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {25400#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,666 INFO L273 TraceCheckUtils]: 17: Hoare triple {25400#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {25401#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,667 INFO L273 TraceCheckUtils]: 19: Hoare triple {25401#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {25401#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,668 INFO L273 TraceCheckUtils]: 21: Hoare triple {25402#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,669 INFO L273 TraceCheckUtils]: 22: Hoare triple {25402#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {25402#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {25403#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,670 INFO L273 TraceCheckUtils]: 25: Hoare triple {25403#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,671 INFO L273 TraceCheckUtils]: 26: Hoare triple {25403#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,672 INFO L273 TraceCheckUtils]: 27: Hoare triple {25404#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,672 INFO L273 TraceCheckUtils]: 28: Hoare triple {25404#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,673 INFO L273 TraceCheckUtils]: 29: Hoare triple {25404#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,673 INFO L273 TraceCheckUtils]: 30: Hoare triple {25405#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,674 INFO L273 TraceCheckUtils]: 31: Hoare triple {25405#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {25405#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,675 INFO L273 TraceCheckUtils]: 33: Hoare triple {25406#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {25406#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {25406#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,677 INFO L273 TraceCheckUtils]: 36: Hoare triple {25407#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,677 INFO L273 TraceCheckUtils]: 37: Hoare triple {25407#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,678 INFO L273 TraceCheckUtils]: 38: Hoare triple {25407#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,678 INFO L273 TraceCheckUtils]: 39: Hoare triple {25408#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,679 INFO L273 TraceCheckUtils]: 40: Hoare triple {25408#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,680 INFO L273 TraceCheckUtils]: 41: Hoare triple {25408#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,680 INFO L273 TraceCheckUtils]: 42: Hoare triple {25409#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,681 INFO L273 TraceCheckUtils]: 43: Hoare triple {25409#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,681 INFO L273 TraceCheckUtils]: 44: Hoare triple {25409#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,682 INFO L273 TraceCheckUtils]: 45: Hoare triple {25410#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,682 INFO L273 TraceCheckUtils]: 46: Hoare triple {25410#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,683 INFO L273 TraceCheckUtils]: 47: Hoare triple {25410#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,684 INFO L273 TraceCheckUtils]: 48: Hoare triple {25411#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,684 INFO L273 TraceCheckUtils]: 49: Hoare triple {25411#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,685 INFO L273 TraceCheckUtils]: 50: Hoare triple {25411#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,685 INFO L273 TraceCheckUtils]: 51: Hoare triple {25412#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,686 INFO L273 TraceCheckUtils]: 52: Hoare triple {25412#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,686 INFO L273 TraceCheckUtils]: 53: Hoare triple {25412#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,687 INFO L273 TraceCheckUtils]: 54: Hoare triple {25413#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,687 INFO L273 TraceCheckUtils]: 55: Hoare triple {25413#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,688 INFO L273 TraceCheckUtils]: 56: Hoare triple {25413#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,689 INFO L273 TraceCheckUtils]: 57: Hoare triple {25414#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,689 INFO L273 TraceCheckUtils]: 58: Hoare triple {25414#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,690 INFO L273 TraceCheckUtils]: 59: Hoare triple {25414#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,690 INFO L273 TraceCheckUtils]: 60: Hoare triple {25415#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,691 INFO L273 TraceCheckUtils]: 61: Hoare triple {25415#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,692 INFO L273 TraceCheckUtils]: 62: Hoare triple {25415#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,692 INFO L273 TraceCheckUtils]: 63: Hoare triple {25416#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,693 INFO L273 TraceCheckUtils]: 64: Hoare triple {25416#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,693 INFO L273 TraceCheckUtils]: 65: Hoare triple {25416#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,694 INFO L273 TraceCheckUtils]: 66: Hoare triple {25417#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,694 INFO L273 TraceCheckUtils]: 67: Hoare triple {25417#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,695 INFO L273 TraceCheckUtils]: 68: Hoare triple {25417#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,695 INFO L273 TraceCheckUtils]: 69: Hoare triple {25418#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,696 INFO L273 TraceCheckUtils]: 70: Hoare triple {25418#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,697 INFO L273 TraceCheckUtils]: 71: Hoare triple {25418#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,697 INFO L273 TraceCheckUtils]: 72: Hoare triple {25419#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,698 INFO L273 TraceCheckUtils]: 73: Hoare triple {25419#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,698 INFO L273 TraceCheckUtils]: 74: Hoare triple {25419#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,699 INFO L273 TraceCheckUtils]: 75: Hoare triple {25420#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,699 INFO L273 TraceCheckUtils]: 76: Hoare triple {25420#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,700 INFO L273 TraceCheckUtils]: 77: Hoare triple {25420#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,700 INFO L273 TraceCheckUtils]: 78: Hoare triple {25421#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,701 INFO L273 TraceCheckUtils]: 79: Hoare triple {25421#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,702 INFO L273 TraceCheckUtils]: 80: Hoare triple {25421#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,702 INFO L273 TraceCheckUtils]: 81: Hoare triple {25422#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,702 INFO L273 TraceCheckUtils]: 82: Hoare triple {25422#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,703 INFO L273 TraceCheckUtils]: 83: Hoare triple {25422#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,704 INFO L273 TraceCheckUtils]: 84: Hoare triple {25423#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,704 INFO L273 TraceCheckUtils]: 85: Hoare triple {25423#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,705 INFO L273 TraceCheckUtils]: 86: Hoare triple {25423#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,705 INFO L273 TraceCheckUtils]: 87: Hoare triple {25424#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,706 INFO L273 TraceCheckUtils]: 88: Hoare triple {25424#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,706 INFO L273 TraceCheckUtils]: 89: Hoare triple {25424#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:24,707 INFO L273 TraceCheckUtils]: 90: Hoare triple {25425#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:24,707 INFO L273 TraceCheckUtils]: 91: Hoare triple {25425#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:24,708 INFO L273 TraceCheckUtils]: 92: Hoare triple {25425#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:24,708 INFO L273 TraceCheckUtils]: 93: Hoare triple {25426#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:24,709 INFO L273 TraceCheckUtils]: 94: Hoare triple {25426#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:24,710 INFO L273 TraceCheckUtils]: 95: Hoare triple {25426#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:24,710 INFO L273 TraceCheckUtils]: 96: Hoare triple {25427#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:24,710 INFO L273 TraceCheckUtils]: 97: Hoare triple {25427#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:24,711 INFO L273 TraceCheckUtils]: 98: Hoare triple {25427#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:24,712 INFO L273 TraceCheckUtils]: 99: Hoare triple {25428#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:24,712 INFO L273 TraceCheckUtils]: 100: Hoare triple {25428#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:24,713 INFO L273 TraceCheckUtils]: 101: Hoare triple {25428#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:24,713 INFO L273 TraceCheckUtils]: 102: Hoare triple {25429#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:24,714 INFO L273 TraceCheckUtils]: 103: Hoare triple {25429#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:24,714 INFO L273 TraceCheckUtils]: 104: Hoare triple {25429#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:24,715 INFO L273 TraceCheckUtils]: 105: Hoare triple {25430#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:24,715 INFO L273 TraceCheckUtils]: 106: Hoare triple {25430#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:24,716 INFO L273 TraceCheckUtils]: 107: Hoare triple {25430#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:24,716 INFO L273 TraceCheckUtils]: 108: Hoare triple {25431#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:24,717 INFO L273 TraceCheckUtils]: 109: Hoare triple {25431#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:24,718 INFO L273 TraceCheckUtils]: 110: Hoare triple {25431#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:24,718 INFO L273 TraceCheckUtils]: 111: Hoare triple {25432#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:24,719 INFO L273 TraceCheckUtils]: 112: Hoare triple {25432#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:24,719 INFO L273 TraceCheckUtils]: 113: Hoare triple {25432#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:24,720 INFO L273 TraceCheckUtils]: 114: Hoare triple {25433#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:24,720 INFO L273 TraceCheckUtils]: 115: Hoare triple {25433#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:24,721 INFO L273 TraceCheckUtils]: 116: Hoare triple {25433#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:24,721 INFO L273 TraceCheckUtils]: 117: Hoare triple {25434#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:24,722 INFO L273 TraceCheckUtils]: 118: Hoare triple {25434#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:24,722 INFO L273 TraceCheckUtils]: 119: Hoare triple {25434#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:24,723 INFO L273 TraceCheckUtils]: 120: Hoare triple {25435#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:24,723 INFO L273 TraceCheckUtils]: 121: Hoare triple {25435#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:24,724 INFO L273 TraceCheckUtils]: 122: Hoare triple {25435#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:24,725 INFO L273 TraceCheckUtils]: 123: Hoare triple {25436#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:24,725 INFO L273 TraceCheckUtils]: 124: Hoare triple {25436#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:24,726 INFO L273 TraceCheckUtils]: 125: Hoare triple {25436#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {25437#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:24,726 INFO L273 TraceCheckUtils]: 126: Hoare triple {25437#(<= main_~i~0 40)} assume !(~i~0 < 100000); {25396#false} is VALID [2018-11-23 12:06:24,726 INFO L273 TraceCheckUtils]: 127: Hoare triple {25396#false} havoc ~x~0;~x~0 := 0; {25396#false} is VALID [2018-11-23 12:06:24,727 INFO L273 TraceCheckUtils]: 128: Hoare triple {25396#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {25396#false} is VALID [2018-11-23 12:06:24,727 INFO L256 TraceCheckUtils]: 129: Hoare triple {25396#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {25396#false} is VALID [2018-11-23 12:06:24,727 INFO L273 TraceCheckUtils]: 130: Hoare triple {25396#false} ~cond := #in~cond; {25396#false} is VALID [2018-11-23 12:06:24,727 INFO L273 TraceCheckUtils]: 131: Hoare triple {25396#false} assume 0 == ~cond; {25396#false} is VALID [2018-11-23 12:06:24,727 INFO L273 TraceCheckUtils]: 132: Hoare triple {25396#false} assume !false; {25396#false} is VALID [2018-11-23 12:06:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:24,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:24,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:24,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:24,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:24,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:25,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {25395#true} call ULTIMATE.init(); {25395#true} is VALID [2018-11-23 12:06:25,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {25395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25395#true} is VALID [2018-11-23 12:06:25,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {25395#true} assume true; {25395#true} is VALID [2018-11-23 12:06:25,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25395#true} {25395#true} #55#return; {25395#true} is VALID [2018-11-23 12:06:25,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {25395#true} call #t~ret4 := main(); {25395#true} is VALID [2018-11-23 12:06:25,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {25395#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {25456#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:25,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {25456#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25456#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:25,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {25456#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25456#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:25,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {25456#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:25,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {25398#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:25,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {25398#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:25,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {25398#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:25,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {25399#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:25,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {25399#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:25,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {25399#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:25,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {25400#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:25,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {25400#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:25,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {25400#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:25,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {25401#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:25,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {25401#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:25,122 INFO L273 TraceCheckUtils]: 20: Hoare triple {25401#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:25,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {25402#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:25,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {25402#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:25,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {25402#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:25,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {25403#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:25,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {25403#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:25,125 INFO L273 TraceCheckUtils]: 26: Hoare triple {25403#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:25,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {25404#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:25,126 INFO L273 TraceCheckUtils]: 28: Hoare triple {25404#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:25,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {25404#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:25,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {25405#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:25,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {25405#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:25,129 INFO L273 TraceCheckUtils]: 32: Hoare triple {25405#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:25,129 INFO L273 TraceCheckUtils]: 33: Hoare triple {25406#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:25,130 INFO L273 TraceCheckUtils]: 34: Hoare triple {25406#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:25,130 INFO L273 TraceCheckUtils]: 35: Hoare triple {25406#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:25,131 INFO L273 TraceCheckUtils]: 36: Hoare triple {25407#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:25,131 INFO L273 TraceCheckUtils]: 37: Hoare triple {25407#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:25,132 INFO L273 TraceCheckUtils]: 38: Hoare triple {25407#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:25,133 INFO L273 TraceCheckUtils]: 39: Hoare triple {25408#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:25,133 INFO L273 TraceCheckUtils]: 40: Hoare triple {25408#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:25,134 INFO L273 TraceCheckUtils]: 41: Hoare triple {25408#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:25,134 INFO L273 TraceCheckUtils]: 42: Hoare triple {25409#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:25,135 INFO L273 TraceCheckUtils]: 43: Hoare triple {25409#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:25,136 INFO L273 TraceCheckUtils]: 44: Hoare triple {25409#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:25,136 INFO L273 TraceCheckUtils]: 45: Hoare triple {25410#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:25,137 INFO L273 TraceCheckUtils]: 46: Hoare triple {25410#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:25,137 INFO L273 TraceCheckUtils]: 47: Hoare triple {25410#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:25,138 INFO L273 TraceCheckUtils]: 48: Hoare triple {25411#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:25,138 INFO L273 TraceCheckUtils]: 49: Hoare triple {25411#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:25,139 INFO L273 TraceCheckUtils]: 50: Hoare triple {25411#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:25,139 INFO L273 TraceCheckUtils]: 51: Hoare triple {25412#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:25,140 INFO L273 TraceCheckUtils]: 52: Hoare triple {25412#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:25,141 INFO L273 TraceCheckUtils]: 53: Hoare triple {25412#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:25,141 INFO L273 TraceCheckUtils]: 54: Hoare triple {25413#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:25,142 INFO L273 TraceCheckUtils]: 55: Hoare triple {25413#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:25,142 INFO L273 TraceCheckUtils]: 56: Hoare triple {25413#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:25,143 INFO L273 TraceCheckUtils]: 57: Hoare triple {25414#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:25,143 INFO L273 TraceCheckUtils]: 58: Hoare triple {25414#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:25,144 INFO L273 TraceCheckUtils]: 59: Hoare triple {25414#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:25,145 INFO L273 TraceCheckUtils]: 60: Hoare triple {25415#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:25,145 INFO L273 TraceCheckUtils]: 61: Hoare triple {25415#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:25,146 INFO L273 TraceCheckUtils]: 62: Hoare triple {25415#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:25,146 INFO L273 TraceCheckUtils]: 63: Hoare triple {25416#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:25,147 INFO L273 TraceCheckUtils]: 64: Hoare triple {25416#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:25,147 INFO L273 TraceCheckUtils]: 65: Hoare triple {25416#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:25,148 INFO L273 TraceCheckUtils]: 66: Hoare triple {25417#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:25,148 INFO L273 TraceCheckUtils]: 67: Hoare triple {25417#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:25,149 INFO L273 TraceCheckUtils]: 68: Hoare triple {25417#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:25,150 INFO L273 TraceCheckUtils]: 69: Hoare triple {25418#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:25,150 INFO L273 TraceCheckUtils]: 70: Hoare triple {25418#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:25,151 INFO L273 TraceCheckUtils]: 71: Hoare triple {25418#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:25,151 INFO L273 TraceCheckUtils]: 72: Hoare triple {25419#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:25,152 INFO L273 TraceCheckUtils]: 73: Hoare triple {25419#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:25,153 INFO L273 TraceCheckUtils]: 74: Hoare triple {25419#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:25,153 INFO L273 TraceCheckUtils]: 75: Hoare triple {25420#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:25,154 INFO L273 TraceCheckUtils]: 76: Hoare triple {25420#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:25,154 INFO L273 TraceCheckUtils]: 77: Hoare triple {25420#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:25,155 INFO L273 TraceCheckUtils]: 78: Hoare triple {25421#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:25,155 INFO L273 TraceCheckUtils]: 79: Hoare triple {25421#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:25,156 INFO L273 TraceCheckUtils]: 80: Hoare triple {25421#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:25,156 INFO L273 TraceCheckUtils]: 81: Hoare triple {25422#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:25,157 INFO L273 TraceCheckUtils]: 82: Hoare triple {25422#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:25,158 INFO L273 TraceCheckUtils]: 83: Hoare triple {25422#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:25,158 INFO L273 TraceCheckUtils]: 84: Hoare triple {25423#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:25,159 INFO L273 TraceCheckUtils]: 85: Hoare triple {25423#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:25,159 INFO L273 TraceCheckUtils]: 86: Hoare triple {25423#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:25,160 INFO L273 TraceCheckUtils]: 87: Hoare triple {25424#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:25,160 INFO L273 TraceCheckUtils]: 88: Hoare triple {25424#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:25,161 INFO L273 TraceCheckUtils]: 89: Hoare triple {25424#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:25,162 INFO L273 TraceCheckUtils]: 90: Hoare triple {25425#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:25,162 INFO L273 TraceCheckUtils]: 91: Hoare triple {25425#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:25,163 INFO L273 TraceCheckUtils]: 92: Hoare triple {25425#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:25,163 INFO L273 TraceCheckUtils]: 93: Hoare triple {25426#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:25,164 INFO L273 TraceCheckUtils]: 94: Hoare triple {25426#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:25,164 INFO L273 TraceCheckUtils]: 95: Hoare triple {25426#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:25,165 INFO L273 TraceCheckUtils]: 96: Hoare triple {25427#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:25,165 INFO L273 TraceCheckUtils]: 97: Hoare triple {25427#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:25,166 INFO L273 TraceCheckUtils]: 98: Hoare triple {25427#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:25,167 INFO L273 TraceCheckUtils]: 99: Hoare triple {25428#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:25,167 INFO L273 TraceCheckUtils]: 100: Hoare triple {25428#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:25,168 INFO L273 TraceCheckUtils]: 101: Hoare triple {25428#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:25,168 INFO L273 TraceCheckUtils]: 102: Hoare triple {25429#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:25,169 INFO L273 TraceCheckUtils]: 103: Hoare triple {25429#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:25,170 INFO L273 TraceCheckUtils]: 104: Hoare triple {25429#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:25,170 INFO L273 TraceCheckUtils]: 105: Hoare triple {25430#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:25,171 INFO L273 TraceCheckUtils]: 106: Hoare triple {25430#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:25,171 INFO L273 TraceCheckUtils]: 107: Hoare triple {25430#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:25,172 INFO L273 TraceCheckUtils]: 108: Hoare triple {25431#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:25,172 INFO L273 TraceCheckUtils]: 109: Hoare triple {25431#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:25,173 INFO L273 TraceCheckUtils]: 110: Hoare triple {25431#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:25,173 INFO L273 TraceCheckUtils]: 111: Hoare triple {25432#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:25,174 INFO L273 TraceCheckUtils]: 112: Hoare triple {25432#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:25,175 INFO L273 TraceCheckUtils]: 113: Hoare triple {25432#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:25,175 INFO L273 TraceCheckUtils]: 114: Hoare triple {25433#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:25,176 INFO L273 TraceCheckUtils]: 115: Hoare triple {25433#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:25,176 INFO L273 TraceCheckUtils]: 116: Hoare triple {25433#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:25,177 INFO L273 TraceCheckUtils]: 117: Hoare triple {25434#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:25,177 INFO L273 TraceCheckUtils]: 118: Hoare triple {25434#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:25,178 INFO L273 TraceCheckUtils]: 119: Hoare triple {25434#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:25,179 INFO L273 TraceCheckUtils]: 120: Hoare triple {25435#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:25,179 INFO L273 TraceCheckUtils]: 121: Hoare triple {25435#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:25,180 INFO L273 TraceCheckUtils]: 122: Hoare triple {25435#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:25,180 INFO L273 TraceCheckUtils]: 123: Hoare triple {25436#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:25,181 INFO L273 TraceCheckUtils]: 124: Hoare triple {25436#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:25,182 INFO L273 TraceCheckUtils]: 125: Hoare triple {25436#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {25437#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:25,182 INFO L273 TraceCheckUtils]: 126: Hoare triple {25437#(<= main_~i~0 40)} assume !(~i~0 < 100000); {25396#false} is VALID [2018-11-23 12:06:25,182 INFO L273 TraceCheckUtils]: 127: Hoare triple {25396#false} havoc ~x~0;~x~0 := 0; {25396#false} is VALID [2018-11-23 12:06:25,183 INFO L273 TraceCheckUtils]: 128: Hoare triple {25396#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {25396#false} is VALID [2018-11-23 12:06:25,183 INFO L256 TraceCheckUtils]: 129: Hoare triple {25396#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {25396#false} is VALID [2018-11-23 12:06:25,183 INFO L273 TraceCheckUtils]: 130: Hoare triple {25396#false} ~cond := #in~cond; {25396#false} is VALID [2018-11-23 12:06:25,183 INFO L273 TraceCheckUtils]: 131: Hoare triple {25396#false} assume 0 == ~cond; {25396#false} is VALID [2018-11-23 12:06:25,183 INFO L273 TraceCheckUtils]: 132: Hoare triple {25396#false} assume !false; {25396#false} is VALID [2018-11-23 12:06:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:25,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:25,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 12:06:25,213 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2018-11-23 12:06:25,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:25,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:06:25,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:25,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:06:25,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:06:25,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:06:25,343 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand 44 states. [2018-11-23 12:06:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,365 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2018-11-23 12:06:26,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:06:26,365 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2018-11-23 12:06:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:06:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 198 transitions. [2018-11-23 12:06:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:06:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 198 transitions. [2018-11-23 12:06:26,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 198 transitions. [2018-11-23 12:06:26,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:26,558 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:06:26,558 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 12:06:26,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:06:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 12:06:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-23 12:06:26,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:26,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 141 states. [2018-11-23 12:06:26,597 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 141 states. [2018-11-23 12:06:26,597 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 141 states. [2018-11-23 12:06:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,599 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2018-11-23 12:06:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2018-11-23 12:06:26,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:26,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:26,600 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 143 states. [2018-11-23 12:06:26,600 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 143 states. [2018-11-23 12:06:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,602 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2018-11-23 12:06:26,602 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2018-11-23 12:06:26,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:26,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:26,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:26,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 12:06:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2018-11-23 12:06:26,604 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 133 [2018-11-23 12:06:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:26,604 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2018-11-23 12:06:26,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:06:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2018-11-23 12:06:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 12:06:26,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:26,605 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:26,605 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:26,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:26,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2007146013, now seen corresponding path program 41 times [2018-11-23 12:06:26,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:26,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:26,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:26,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:26,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:28,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {26519#true} call ULTIMATE.init(); {26519#true} is VALID [2018-11-23 12:06:28,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {26519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26519#true} is VALID [2018-11-23 12:06:28,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {26519#true} assume true; {26519#true} is VALID [2018-11-23 12:06:28,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26519#true} {26519#true} #55#return; {26519#true} is VALID [2018-11-23 12:06:28,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {26519#true} call #t~ret4 := main(); {26519#true} is VALID [2018-11-23 12:06:28,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {26519#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {26521#(= main_~i~0 0)} is VALID [2018-11-23 12:06:28,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {26521#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26521#(= main_~i~0 0)} is VALID [2018-11-23 12:06:28,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {26521#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26521#(= main_~i~0 0)} is VALID [2018-11-23 12:06:28,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {26521#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:28,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {26522#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:28,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {26522#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:28,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {26522#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:28,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {26523#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:28,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {26523#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:28,734 INFO L273 TraceCheckUtils]: 14: Hoare triple {26523#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:28,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {26524#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:28,735 INFO L273 TraceCheckUtils]: 16: Hoare triple {26524#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:28,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {26524#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:28,736 INFO L273 TraceCheckUtils]: 18: Hoare triple {26525#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:28,737 INFO L273 TraceCheckUtils]: 19: Hoare triple {26525#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:28,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {26525#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:28,738 INFO L273 TraceCheckUtils]: 21: Hoare triple {26526#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:28,738 INFO L273 TraceCheckUtils]: 22: Hoare triple {26526#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:28,739 INFO L273 TraceCheckUtils]: 23: Hoare triple {26526#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:28,739 INFO L273 TraceCheckUtils]: 24: Hoare triple {26527#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:28,740 INFO L273 TraceCheckUtils]: 25: Hoare triple {26527#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:28,740 INFO L273 TraceCheckUtils]: 26: Hoare triple {26527#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:28,741 INFO L273 TraceCheckUtils]: 27: Hoare triple {26528#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:28,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {26528#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:28,742 INFO L273 TraceCheckUtils]: 29: Hoare triple {26528#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:28,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {26529#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:28,743 INFO L273 TraceCheckUtils]: 31: Hoare triple {26529#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:28,744 INFO L273 TraceCheckUtils]: 32: Hoare triple {26529#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:28,744 INFO L273 TraceCheckUtils]: 33: Hoare triple {26530#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:28,745 INFO L273 TraceCheckUtils]: 34: Hoare triple {26530#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:28,745 INFO L273 TraceCheckUtils]: 35: Hoare triple {26530#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:28,746 INFO L273 TraceCheckUtils]: 36: Hoare triple {26531#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:28,746 INFO L273 TraceCheckUtils]: 37: Hoare triple {26531#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:28,747 INFO L273 TraceCheckUtils]: 38: Hoare triple {26531#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:28,747 INFO L273 TraceCheckUtils]: 39: Hoare triple {26532#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:28,748 INFO L273 TraceCheckUtils]: 40: Hoare triple {26532#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:28,748 INFO L273 TraceCheckUtils]: 41: Hoare triple {26532#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:28,749 INFO L273 TraceCheckUtils]: 42: Hoare triple {26533#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:28,749 INFO L273 TraceCheckUtils]: 43: Hoare triple {26533#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:28,750 INFO L273 TraceCheckUtils]: 44: Hoare triple {26533#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:28,751 INFO L273 TraceCheckUtils]: 45: Hoare triple {26534#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:28,751 INFO L273 TraceCheckUtils]: 46: Hoare triple {26534#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:28,752 INFO L273 TraceCheckUtils]: 47: Hoare triple {26534#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:28,752 INFO L273 TraceCheckUtils]: 48: Hoare triple {26535#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:28,753 INFO L273 TraceCheckUtils]: 49: Hoare triple {26535#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:28,753 INFO L273 TraceCheckUtils]: 50: Hoare triple {26535#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:28,754 INFO L273 TraceCheckUtils]: 51: Hoare triple {26536#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:28,754 INFO L273 TraceCheckUtils]: 52: Hoare triple {26536#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:28,755 INFO L273 TraceCheckUtils]: 53: Hoare triple {26536#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:28,755 INFO L273 TraceCheckUtils]: 54: Hoare triple {26537#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:28,756 INFO L273 TraceCheckUtils]: 55: Hoare triple {26537#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:28,756 INFO L273 TraceCheckUtils]: 56: Hoare triple {26537#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:28,757 INFO L273 TraceCheckUtils]: 57: Hoare triple {26538#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:28,757 INFO L273 TraceCheckUtils]: 58: Hoare triple {26538#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:28,758 INFO L273 TraceCheckUtils]: 59: Hoare triple {26538#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:28,759 INFO L273 TraceCheckUtils]: 60: Hoare triple {26539#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:28,759 INFO L273 TraceCheckUtils]: 61: Hoare triple {26539#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:28,760 INFO L273 TraceCheckUtils]: 62: Hoare triple {26539#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:28,760 INFO L273 TraceCheckUtils]: 63: Hoare triple {26540#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:28,761 INFO L273 TraceCheckUtils]: 64: Hoare triple {26540#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:28,761 INFO L273 TraceCheckUtils]: 65: Hoare triple {26540#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:28,762 INFO L273 TraceCheckUtils]: 66: Hoare triple {26541#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:28,762 INFO L273 TraceCheckUtils]: 67: Hoare triple {26541#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:28,763 INFO L273 TraceCheckUtils]: 68: Hoare triple {26541#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:28,763 INFO L273 TraceCheckUtils]: 69: Hoare triple {26542#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:28,764 INFO L273 TraceCheckUtils]: 70: Hoare triple {26542#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:28,765 INFO L273 TraceCheckUtils]: 71: Hoare triple {26542#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:28,765 INFO L273 TraceCheckUtils]: 72: Hoare triple {26543#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:28,766 INFO L273 TraceCheckUtils]: 73: Hoare triple {26543#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:28,766 INFO L273 TraceCheckUtils]: 74: Hoare triple {26543#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:28,767 INFO L273 TraceCheckUtils]: 75: Hoare triple {26544#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:28,767 INFO L273 TraceCheckUtils]: 76: Hoare triple {26544#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:28,768 INFO L273 TraceCheckUtils]: 77: Hoare triple {26544#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:28,768 INFO L273 TraceCheckUtils]: 78: Hoare triple {26545#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:28,769 INFO L273 TraceCheckUtils]: 79: Hoare triple {26545#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:28,769 INFO L273 TraceCheckUtils]: 80: Hoare triple {26545#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:28,770 INFO L273 TraceCheckUtils]: 81: Hoare triple {26546#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:28,770 INFO L273 TraceCheckUtils]: 82: Hoare triple {26546#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:28,771 INFO L273 TraceCheckUtils]: 83: Hoare triple {26546#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:28,771 INFO L273 TraceCheckUtils]: 84: Hoare triple {26547#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:28,772 INFO L273 TraceCheckUtils]: 85: Hoare triple {26547#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:28,773 INFO L273 TraceCheckUtils]: 86: Hoare triple {26547#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:28,773 INFO L273 TraceCheckUtils]: 87: Hoare triple {26548#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:28,774 INFO L273 TraceCheckUtils]: 88: Hoare triple {26548#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:28,774 INFO L273 TraceCheckUtils]: 89: Hoare triple {26548#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:28,775 INFO L273 TraceCheckUtils]: 90: Hoare triple {26549#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:28,775 INFO L273 TraceCheckUtils]: 91: Hoare triple {26549#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:28,776 INFO L273 TraceCheckUtils]: 92: Hoare triple {26549#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:28,776 INFO L273 TraceCheckUtils]: 93: Hoare triple {26550#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:28,777 INFO L273 TraceCheckUtils]: 94: Hoare triple {26550#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:28,777 INFO L273 TraceCheckUtils]: 95: Hoare triple {26550#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:28,778 INFO L273 TraceCheckUtils]: 96: Hoare triple {26551#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:28,778 INFO L273 TraceCheckUtils]: 97: Hoare triple {26551#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:28,779 INFO L273 TraceCheckUtils]: 98: Hoare triple {26551#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:28,780 INFO L273 TraceCheckUtils]: 99: Hoare triple {26552#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:28,780 INFO L273 TraceCheckUtils]: 100: Hoare triple {26552#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:28,781 INFO L273 TraceCheckUtils]: 101: Hoare triple {26552#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:28,781 INFO L273 TraceCheckUtils]: 102: Hoare triple {26553#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:28,782 INFO L273 TraceCheckUtils]: 103: Hoare triple {26553#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:28,782 INFO L273 TraceCheckUtils]: 104: Hoare triple {26553#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:28,783 INFO L273 TraceCheckUtils]: 105: Hoare triple {26554#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:28,783 INFO L273 TraceCheckUtils]: 106: Hoare triple {26554#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:28,784 INFO L273 TraceCheckUtils]: 107: Hoare triple {26554#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:28,784 INFO L273 TraceCheckUtils]: 108: Hoare triple {26555#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:28,785 INFO L273 TraceCheckUtils]: 109: Hoare triple {26555#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:28,785 INFO L273 TraceCheckUtils]: 110: Hoare triple {26555#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:28,786 INFO L273 TraceCheckUtils]: 111: Hoare triple {26556#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:28,786 INFO L273 TraceCheckUtils]: 112: Hoare triple {26556#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:28,787 INFO L273 TraceCheckUtils]: 113: Hoare triple {26556#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:28,788 INFO L273 TraceCheckUtils]: 114: Hoare triple {26557#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:28,788 INFO L273 TraceCheckUtils]: 115: Hoare triple {26557#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:28,789 INFO L273 TraceCheckUtils]: 116: Hoare triple {26557#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:28,789 INFO L273 TraceCheckUtils]: 117: Hoare triple {26558#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:28,790 INFO L273 TraceCheckUtils]: 118: Hoare triple {26558#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:28,790 INFO L273 TraceCheckUtils]: 119: Hoare triple {26558#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:28,791 INFO L273 TraceCheckUtils]: 120: Hoare triple {26559#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:28,791 INFO L273 TraceCheckUtils]: 121: Hoare triple {26559#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:28,792 INFO L273 TraceCheckUtils]: 122: Hoare triple {26559#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:28,792 INFO L273 TraceCheckUtils]: 123: Hoare triple {26560#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:28,793 INFO L273 TraceCheckUtils]: 124: Hoare triple {26560#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:28,793 INFO L273 TraceCheckUtils]: 125: Hoare triple {26560#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:28,794 INFO L273 TraceCheckUtils]: 126: Hoare triple {26561#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:28,794 INFO L273 TraceCheckUtils]: 127: Hoare triple {26561#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:28,795 INFO L273 TraceCheckUtils]: 128: Hoare triple {26561#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {26562#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:28,796 INFO L273 TraceCheckUtils]: 129: Hoare triple {26562#(<= main_~i~0 41)} assume !(~i~0 < 100000); {26520#false} is VALID [2018-11-23 12:06:28,796 INFO L273 TraceCheckUtils]: 130: Hoare triple {26520#false} havoc ~x~0;~x~0 := 0; {26520#false} is VALID [2018-11-23 12:06:28,796 INFO L273 TraceCheckUtils]: 131: Hoare triple {26520#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {26520#false} is VALID [2018-11-23 12:06:28,796 INFO L256 TraceCheckUtils]: 132: Hoare triple {26520#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {26520#false} is VALID [2018-11-23 12:06:28,796 INFO L273 TraceCheckUtils]: 133: Hoare triple {26520#false} ~cond := #in~cond; {26520#false} is VALID [2018-11-23 12:06:28,797 INFO L273 TraceCheckUtils]: 134: Hoare triple {26520#false} assume 0 == ~cond; {26520#false} is VALID [2018-11-23 12:06:28,797 INFO L273 TraceCheckUtils]: 135: Hoare triple {26520#false} assume !false; {26520#false} is VALID [2018-11-23 12:06:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:28,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:28,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:28,818 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:28,908 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-11-23 12:06:28,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:28,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:29,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {26519#true} call ULTIMATE.init(); {26519#true} is VALID [2018-11-23 12:06:29,221 INFO L273 TraceCheckUtils]: 1: Hoare triple {26519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26519#true} is VALID [2018-11-23 12:06:29,221 INFO L273 TraceCheckUtils]: 2: Hoare triple {26519#true} assume true; {26519#true} is VALID [2018-11-23 12:06:29,221 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26519#true} {26519#true} #55#return; {26519#true} is VALID [2018-11-23 12:06:29,221 INFO L256 TraceCheckUtils]: 4: Hoare triple {26519#true} call #t~ret4 := main(); {26519#true} is VALID [2018-11-23 12:06:29,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {26519#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {26581#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:29,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {26581#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26581#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:29,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {26581#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26581#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:29,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {26581#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:29,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {26522#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:29,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {26522#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:29,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {26522#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:29,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {26523#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:29,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {26523#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:29,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {26523#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:29,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {26524#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:29,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {26524#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:29,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {26524#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:29,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {26525#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:29,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {26525#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:29,230 INFO L273 TraceCheckUtils]: 20: Hoare triple {26525#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:29,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {26526#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:29,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {26526#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:29,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {26526#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:29,232 INFO L273 TraceCheckUtils]: 24: Hoare triple {26527#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:29,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {26527#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:29,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {26527#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:29,234 INFO L273 TraceCheckUtils]: 27: Hoare triple {26528#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:29,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {26528#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:29,235 INFO L273 TraceCheckUtils]: 29: Hoare triple {26528#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:29,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {26529#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:29,236 INFO L273 TraceCheckUtils]: 31: Hoare triple {26529#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:29,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {26529#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:29,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {26530#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:29,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {26530#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:29,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {26530#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:29,238 INFO L273 TraceCheckUtils]: 36: Hoare triple {26531#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:29,239 INFO L273 TraceCheckUtils]: 37: Hoare triple {26531#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:29,239 INFO L273 TraceCheckUtils]: 38: Hoare triple {26531#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:29,240 INFO L273 TraceCheckUtils]: 39: Hoare triple {26532#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:29,240 INFO L273 TraceCheckUtils]: 40: Hoare triple {26532#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:29,241 INFO L273 TraceCheckUtils]: 41: Hoare triple {26532#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:29,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {26533#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:29,242 INFO L273 TraceCheckUtils]: 43: Hoare triple {26533#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:29,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {26533#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:29,243 INFO L273 TraceCheckUtils]: 45: Hoare triple {26534#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:29,244 INFO L273 TraceCheckUtils]: 46: Hoare triple {26534#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:29,244 INFO L273 TraceCheckUtils]: 47: Hoare triple {26534#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:29,245 INFO L273 TraceCheckUtils]: 48: Hoare triple {26535#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:29,245 INFO L273 TraceCheckUtils]: 49: Hoare triple {26535#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:29,246 INFO L273 TraceCheckUtils]: 50: Hoare triple {26535#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:29,246 INFO L273 TraceCheckUtils]: 51: Hoare triple {26536#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:29,247 INFO L273 TraceCheckUtils]: 52: Hoare triple {26536#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:29,248 INFO L273 TraceCheckUtils]: 53: Hoare triple {26536#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:29,248 INFO L273 TraceCheckUtils]: 54: Hoare triple {26537#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:29,248 INFO L273 TraceCheckUtils]: 55: Hoare triple {26537#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:29,249 INFO L273 TraceCheckUtils]: 56: Hoare triple {26537#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:29,250 INFO L273 TraceCheckUtils]: 57: Hoare triple {26538#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:29,250 INFO L273 TraceCheckUtils]: 58: Hoare triple {26538#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:29,251 INFO L273 TraceCheckUtils]: 59: Hoare triple {26538#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:29,251 INFO L273 TraceCheckUtils]: 60: Hoare triple {26539#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:29,252 INFO L273 TraceCheckUtils]: 61: Hoare triple {26539#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:29,252 INFO L273 TraceCheckUtils]: 62: Hoare triple {26539#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:29,253 INFO L273 TraceCheckUtils]: 63: Hoare triple {26540#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:29,253 INFO L273 TraceCheckUtils]: 64: Hoare triple {26540#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:29,254 INFO L273 TraceCheckUtils]: 65: Hoare triple {26540#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:29,254 INFO L273 TraceCheckUtils]: 66: Hoare triple {26541#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:29,255 INFO L273 TraceCheckUtils]: 67: Hoare triple {26541#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:29,256 INFO L273 TraceCheckUtils]: 68: Hoare triple {26541#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:29,256 INFO L273 TraceCheckUtils]: 69: Hoare triple {26542#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:29,257 INFO L273 TraceCheckUtils]: 70: Hoare triple {26542#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:29,257 INFO L273 TraceCheckUtils]: 71: Hoare triple {26542#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:29,258 INFO L273 TraceCheckUtils]: 72: Hoare triple {26543#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:29,258 INFO L273 TraceCheckUtils]: 73: Hoare triple {26543#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:29,259 INFO L273 TraceCheckUtils]: 74: Hoare triple {26543#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:29,259 INFO L273 TraceCheckUtils]: 75: Hoare triple {26544#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:29,260 INFO L273 TraceCheckUtils]: 76: Hoare triple {26544#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:29,260 INFO L273 TraceCheckUtils]: 77: Hoare triple {26544#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:29,261 INFO L273 TraceCheckUtils]: 78: Hoare triple {26545#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:29,261 INFO L273 TraceCheckUtils]: 79: Hoare triple {26545#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:29,262 INFO L273 TraceCheckUtils]: 80: Hoare triple {26545#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:29,263 INFO L273 TraceCheckUtils]: 81: Hoare triple {26546#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:29,263 INFO L273 TraceCheckUtils]: 82: Hoare triple {26546#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:29,264 INFO L273 TraceCheckUtils]: 83: Hoare triple {26546#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:29,264 INFO L273 TraceCheckUtils]: 84: Hoare triple {26547#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:29,265 INFO L273 TraceCheckUtils]: 85: Hoare triple {26547#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:29,265 INFO L273 TraceCheckUtils]: 86: Hoare triple {26547#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:29,266 INFO L273 TraceCheckUtils]: 87: Hoare triple {26548#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:29,266 INFO L273 TraceCheckUtils]: 88: Hoare triple {26548#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:29,267 INFO L273 TraceCheckUtils]: 89: Hoare triple {26548#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:29,267 INFO L273 TraceCheckUtils]: 90: Hoare triple {26549#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:29,268 INFO L273 TraceCheckUtils]: 91: Hoare triple {26549#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:29,268 INFO L273 TraceCheckUtils]: 92: Hoare triple {26549#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:29,269 INFO L273 TraceCheckUtils]: 93: Hoare triple {26550#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:29,269 INFO L273 TraceCheckUtils]: 94: Hoare triple {26550#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:29,270 INFO L273 TraceCheckUtils]: 95: Hoare triple {26550#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:29,271 INFO L273 TraceCheckUtils]: 96: Hoare triple {26551#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:29,271 INFO L273 TraceCheckUtils]: 97: Hoare triple {26551#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:29,272 INFO L273 TraceCheckUtils]: 98: Hoare triple {26551#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:29,272 INFO L273 TraceCheckUtils]: 99: Hoare triple {26552#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:29,273 INFO L273 TraceCheckUtils]: 100: Hoare triple {26552#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:29,273 INFO L273 TraceCheckUtils]: 101: Hoare triple {26552#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:29,274 INFO L273 TraceCheckUtils]: 102: Hoare triple {26553#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:29,274 INFO L273 TraceCheckUtils]: 103: Hoare triple {26553#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:29,275 INFO L273 TraceCheckUtils]: 104: Hoare triple {26553#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:29,275 INFO L273 TraceCheckUtils]: 105: Hoare triple {26554#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:29,276 INFO L273 TraceCheckUtils]: 106: Hoare triple {26554#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:29,277 INFO L273 TraceCheckUtils]: 107: Hoare triple {26554#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:29,277 INFO L273 TraceCheckUtils]: 108: Hoare triple {26555#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:29,278 INFO L273 TraceCheckUtils]: 109: Hoare triple {26555#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:29,278 INFO L273 TraceCheckUtils]: 110: Hoare triple {26555#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:29,279 INFO L273 TraceCheckUtils]: 111: Hoare triple {26556#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:29,279 INFO L273 TraceCheckUtils]: 112: Hoare triple {26556#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:29,280 INFO L273 TraceCheckUtils]: 113: Hoare triple {26556#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:29,281 INFO L273 TraceCheckUtils]: 114: Hoare triple {26557#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:29,281 INFO L273 TraceCheckUtils]: 115: Hoare triple {26557#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:29,282 INFO L273 TraceCheckUtils]: 116: Hoare triple {26557#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:29,282 INFO L273 TraceCheckUtils]: 117: Hoare triple {26558#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:29,283 INFO L273 TraceCheckUtils]: 118: Hoare triple {26558#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:29,283 INFO L273 TraceCheckUtils]: 119: Hoare triple {26558#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:29,284 INFO L273 TraceCheckUtils]: 120: Hoare triple {26559#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:29,284 INFO L273 TraceCheckUtils]: 121: Hoare triple {26559#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:29,285 INFO L273 TraceCheckUtils]: 122: Hoare triple {26559#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:29,286 INFO L273 TraceCheckUtils]: 123: Hoare triple {26560#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:29,286 INFO L273 TraceCheckUtils]: 124: Hoare triple {26560#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:29,287 INFO L273 TraceCheckUtils]: 125: Hoare triple {26560#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:29,287 INFO L273 TraceCheckUtils]: 126: Hoare triple {26561#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:29,288 INFO L273 TraceCheckUtils]: 127: Hoare triple {26561#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:29,289 INFO L273 TraceCheckUtils]: 128: Hoare triple {26561#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {26562#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:29,289 INFO L273 TraceCheckUtils]: 129: Hoare triple {26562#(<= main_~i~0 41)} assume !(~i~0 < 100000); {26520#false} is VALID [2018-11-23 12:06:29,290 INFO L273 TraceCheckUtils]: 130: Hoare triple {26520#false} havoc ~x~0;~x~0 := 0; {26520#false} is VALID [2018-11-23 12:06:29,290 INFO L273 TraceCheckUtils]: 131: Hoare triple {26520#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {26520#false} is VALID [2018-11-23 12:06:29,290 INFO L256 TraceCheckUtils]: 132: Hoare triple {26520#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {26520#false} is VALID [2018-11-23 12:06:29,290 INFO L273 TraceCheckUtils]: 133: Hoare triple {26520#false} ~cond := #in~cond; {26520#false} is VALID [2018-11-23 12:06:29,290 INFO L273 TraceCheckUtils]: 134: Hoare triple {26520#false} assume 0 == ~cond; {26520#false} is VALID [2018-11-23 12:06:29,290 INFO L273 TraceCheckUtils]: 135: Hoare triple {26520#false} assume !false; {26520#false} is VALID [2018-11-23 12:06:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:29,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:29,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 12:06:29,323 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2018-11-23 12:06:29,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:29,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:06:29,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:29,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:06:29,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:06:29,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:06:29,482 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand 45 states. [2018-11-23 12:06:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,979 INFO L93 Difference]: Finished difference Result 157 states and 202 transitions. [2018-11-23 12:06:29,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 12:06:29,979 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2018-11-23 12:06:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:06:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 202 transitions. [2018-11-23 12:06:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:06:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 202 transitions. [2018-11-23 12:06:29,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 202 transitions. [2018-11-23 12:06:30,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:30,174 INFO L225 Difference]: With dead ends: 157 [2018-11-23 12:06:30,175 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:06:30,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:06:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:06:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-11-23 12:06:30,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:30,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 144 states. [2018-11-23 12:06:30,210 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 144 states. [2018-11-23 12:06:30,210 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 144 states. [2018-11-23 12:06:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:30,212 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2018-11-23 12:06:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-23 12:06:30,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:30,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:30,213 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 146 states. [2018-11-23 12:06:30,213 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 146 states. [2018-11-23 12:06:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:30,216 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2018-11-23 12:06:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-23 12:06:30,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:30,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:30,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:30,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 12:06:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2018-11-23 12:06:30,219 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 136 [2018-11-23 12:06:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:30,220 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2018-11-23 12:06:30,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:06:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2018-11-23 12:06:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 12:06:30,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:30,221 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:30,221 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:30,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:30,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1306812551, now seen corresponding path program 42 times [2018-11-23 12:06:30,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:30,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:30,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:31,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {27667#true} call ULTIMATE.init(); {27667#true} is VALID [2018-11-23 12:06:31,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {27667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27667#true} is VALID [2018-11-23 12:06:31,260 INFO L273 TraceCheckUtils]: 2: Hoare triple {27667#true} assume true; {27667#true} is VALID [2018-11-23 12:06:31,260 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27667#true} {27667#true} #55#return; {27667#true} is VALID [2018-11-23 12:06:31,260 INFO L256 TraceCheckUtils]: 4: Hoare triple {27667#true} call #t~ret4 := main(); {27667#true} is VALID [2018-11-23 12:06:31,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {27667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {27669#(= main_~i~0 0)} is VALID [2018-11-23 12:06:31,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {27669#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27669#(= main_~i~0 0)} is VALID [2018-11-23 12:06:31,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {27669#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27669#(= main_~i~0 0)} is VALID [2018-11-23 12:06:31,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {27669#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:31,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {27670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:31,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {27670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:31,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {27670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:31,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {27671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:31,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {27671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:31,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {27671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:31,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {27672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:31,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {27672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:31,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {27672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:31,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {27673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:31,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {27673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:31,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {27673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:31,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {27674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:31,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {27674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:31,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {27674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:31,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {27675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:31,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {27675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:31,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {27675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:31,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {27676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:31,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {27676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:31,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {27676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:31,274 INFO L273 TraceCheckUtils]: 30: Hoare triple {27677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:31,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {27677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:31,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {27677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:31,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {27678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:31,276 INFO L273 TraceCheckUtils]: 34: Hoare triple {27678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:31,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {27678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:31,277 INFO L273 TraceCheckUtils]: 36: Hoare triple {27679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:31,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {27679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:31,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {27679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {27680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {27680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {27680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,280 INFO L273 TraceCheckUtils]: 42: Hoare triple {27681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,281 INFO L273 TraceCheckUtils]: 43: Hoare triple {27681#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {27681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {27682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {27682#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,283 INFO L273 TraceCheckUtils]: 47: Hoare triple {27682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,284 INFO L273 TraceCheckUtils]: 48: Hoare triple {27683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,284 INFO L273 TraceCheckUtils]: 49: Hoare triple {27683#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,285 INFO L273 TraceCheckUtils]: 50: Hoare triple {27683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,285 INFO L273 TraceCheckUtils]: 51: Hoare triple {27684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,286 INFO L273 TraceCheckUtils]: 52: Hoare triple {27684#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,286 INFO L273 TraceCheckUtils]: 53: Hoare triple {27684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:31,287 INFO L273 TraceCheckUtils]: 54: Hoare triple {27685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:31,287 INFO L273 TraceCheckUtils]: 55: Hoare triple {27685#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:31,288 INFO L273 TraceCheckUtils]: 56: Hoare triple {27685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:31,288 INFO L273 TraceCheckUtils]: 57: Hoare triple {27686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:31,289 INFO L273 TraceCheckUtils]: 58: Hoare triple {27686#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:31,290 INFO L273 TraceCheckUtils]: 59: Hoare triple {27686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:31,290 INFO L273 TraceCheckUtils]: 60: Hoare triple {27687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:31,291 INFO L273 TraceCheckUtils]: 61: Hoare triple {27687#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:31,291 INFO L273 TraceCheckUtils]: 62: Hoare triple {27687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:31,292 INFO L273 TraceCheckUtils]: 63: Hoare triple {27688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:31,292 INFO L273 TraceCheckUtils]: 64: Hoare triple {27688#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:31,293 INFO L273 TraceCheckUtils]: 65: Hoare triple {27688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:31,293 INFO L273 TraceCheckUtils]: 66: Hoare triple {27689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:31,294 INFO L273 TraceCheckUtils]: 67: Hoare triple {27689#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:31,294 INFO L273 TraceCheckUtils]: 68: Hoare triple {27689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:31,295 INFO L273 TraceCheckUtils]: 69: Hoare triple {27690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:31,295 INFO L273 TraceCheckUtils]: 70: Hoare triple {27690#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:31,296 INFO L273 TraceCheckUtils]: 71: Hoare triple {27690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:31,297 INFO L273 TraceCheckUtils]: 72: Hoare triple {27691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:31,297 INFO L273 TraceCheckUtils]: 73: Hoare triple {27691#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:31,298 INFO L273 TraceCheckUtils]: 74: Hoare triple {27691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:31,298 INFO L273 TraceCheckUtils]: 75: Hoare triple {27692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:31,299 INFO L273 TraceCheckUtils]: 76: Hoare triple {27692#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:31,299 INFO L273 TraceCheckUtils]: 77: Hoare triple {27692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:31,300 INFO L273 TraceCheckUtils]: 78: Hoare triple {27693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:31,300 INFO L273 TraceCheckUtils]: 79: Hoare triple {27693#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:31,301 INFO L273 TraceCheckUtils]: 80: Hoare triple {27693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:31,301 INFO L273 TraceCheckUtils]: 81: Hoare triple {27694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:31,302 INFO L273 TraceCheckUtils]: 82: Hoare triple {27694#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:31,303 INFO L273 TraceCheckUtils]: 83: Hoare triple {27694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:31,303 INFO L273 TraceCheckUtils]: 84: Hoare triple {27695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:31,304 INFO L273 TraceCheckUtils]: 85: Hoare triple {27695#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:31,304 INFO L273 TraceCheckUtils]: 86: Hoare triple {27695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:31,305 INFO L273 TraceCheckUtils]: 87: Hoare triple {27696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:31,305 INFO L273 TraceCheckUtils]: 88: Hoare triple {27696#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:31,306 INFO L273 TraceCheckUtils]: 89: Hoare triple {27696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:31,307 INFO L273 TraceCheckUtils]: 90: Hoare triple {27697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:31,307 INFO L273 TraceCheckUtils]: 91: Hoare triple {27697#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:31,308 INFO L273 TraceCheckUtils]: 92: Hoare triple {27697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:31,308 INFO L273 TraceCheckUtils]: 93: Hoare triple {27698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:31,309 INFO L273 TraceCheckUtils]: 94: Hoare triple {27698#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:31,319 INFO L273 TraceCheckUtils]: 95: Hoare triple {27698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:31,319 INFO L273 TraceCheckUtils]: 96: Hoare triple {27699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:31,320 INFO L273 TraceCheckUtils]: 97: Hoare triple {27699#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:31,320 INFO L273 TraceCheckUtils]: 98: Hoare triple {27699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:31,320 INFO L273 TraceCheckUtils]: 99: Hoare triple {27700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:31,321 INFO L273 TraceCheckUtils]: 100: Hoare triple {27700#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:31,321 INFO L273 TraceCheckUtils]: 101: Hoare triple {27700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:31,322 INFO L273 TraceCheckUtils]: 102: Hoare triple {27701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:31,322 INFO L273 TraceCheckUtils]: 103: Hoare triple {27701#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:31,322 INFO L273 TraceCheckUtils]: 104: Hoare triple {27701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:31,323 INFO L273 TraceCheckUtils]: 105: Hoare triple {27702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:31,323 INFO L273 TraceCheckUtils]: 106: Hoare triple {27702#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:31,323 INFO L273 TraceCheckUtils]: 107: Hoare triple {27702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:31,324 INFO L273 TraceCheckUtils]: 108: Hoare triple {27703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:31,324 INFO L273 TraceCheckUtils]: 109: Hoare triple {27703#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:31,325 INFO L273 TraceCheckUtils]: 110: Hoare triple {27703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:31,326 INFO L273 TraceCheckUtils]: 111: Hoare triple {27704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:31,326 INFO L273 TraceCheckUtils]: 112: Hoare triple {27704#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:31,327 INFO L273 TraceCheckUtils]: 113: Hoare triple {27704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:31,327 INFO L273 TraceCheckUtils]: 114: Hoare triple {27705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:31,328 INFO L273 TraceCheckUtils]: 115: Hoare triple {27705#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:31,329 INFO L273 TraceCheckUtils]: 116: Hoare triple {27705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:31,329 INFO L273 TraceCheckUtils]: 117: Hoare triple {27706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:31,330 INFO L273 TraceCheckUtils]: 118: Hoare triple {27706#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:31,330 INFO L273 TraceCheckUtils]: 119: Hoare triple {27706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:31,331 INFO L273 TraceCheckUtils]: 120: Hoare triple {27707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:31,331 INFO L273 TraceCheckUtils]: 121: Hoare triple {27707#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:31,332 INFO L273 TraceCheckUtils]: 122: Hoare triple {27707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:31,333 INFO L273 TraceCheckUtils]: 123: Hoare triple {27708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:31,333 INFO L273 TraceCheckUtils]: 124: Hoare triple {27708#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:31,334 INFO L273 TraceCheckUtils]: 125: Hoare triple {27708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:31,334 INFO L273 TraceCheckUtils]: 126: Hoare triple {27709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:31,335 INFO L273 TraceCheckUtils]: 127: Hoare triple {27709#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:31,335 INFO L273 TraceCheckUtils]: 128: Hoare triple {27709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:31,336 INFO L273 TraceCheckUtils]: 129: Hoare triple {27710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:31,336 INFO L273 TraceCheckUtils]: 130: Hoare triple {27710#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:31,337 INFO L273 TraceCheckUtils]: 131: Hoare triple {27710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {27711#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:31,338 INFO L273 TraceCheckUtils]: 132: Hoare triple {27711#(<= main_~i~0 42)} assume !(~i~0 < 100000); {27668#false} is VALID [2018-11-23 12:06:31,338 INFO L273 TraceCheckUtils]: 133: Hoare triple {27668#false} havoc ~x~0;~x~0 := 0; {27668#false} is VALID [2018-11-23 12:06:31,338 INFO L273 TraceCheckUtils]: 134: Hoare triple {27668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {27668#false} is VALID [2018-11-23 12:06:31,338 INFO L256 TraceCheckUtils]: 135: Hoare triple {27668#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {27668#false} is VALID [2018-11-23 12:06:31,339 INFO L273 TraceCheckUtils]: 136: Hoare triple {27668#false} ~cond := #in~cond; {27668#false} is VALID [2018-11-23 12:06:31,339 INFO L273 TraceCheckUtils]: 137: Hoare triple {27668#false} assume 0 == ~cond; {27668#false} is VALID [2018-11-23 12:06:31,339 INFO L273 TraceCheckUtils]: 138: Hoare triple {27668#false} assume !false; {27668#false} is VALID [2018-11-23 12:06:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:31,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:31,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:31,360 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:31,462 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-11-23 12:06:31,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:31,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:31,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {27667#true} call ULTIMATE.init(); {27667#true} is VALID [2018-11-23 12:06:31,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {27667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27667#true} is VALID [2018-11-23 12:06:31,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {27667#true} assume true; {27667#true} is VALID [2018-11-23 12:06:31,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27667#true} {27667#true} #55#return; {27667#true} is VALID [2018-11-23 12:06:31,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {27667#true} call #t~ret4 := main(); {27667#true} is VALID [2018-11-23 12:06:31,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {27667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {27730#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:31,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {27730#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27730#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:31,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {27730#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27730#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:31,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {27730#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:31,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {27670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:31,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {27670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:31,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {27670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:31,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {27671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:31,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {27671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:31,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {27671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:31,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {27672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:31,816 INFO L273 TraceCheckUtils]: 16: Hoare triple {27672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:31,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {27672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:31,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {27673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:31,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {27673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:31,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {27673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:31,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {27674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:31,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {27674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:31,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {27674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:31,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {27675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:31,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {27675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:31,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {27675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:31,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {27676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:31,822 INFO L273 TraceCheckUtils]: 28: Hoare triple {27676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:31,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {27676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:31,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {27677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:31,824 INFO L273 TraceCheckUtils]: 31: Hoare triple {27677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:31,825 INFO L273 TraceCheckUtils]: 32: Hoare triple {27677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:31,825 INFO L273 TraceCheckUtils]: 33: Hoare triple {27678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:31,826 INFO L273 TraceCheckUtils]: 34: Hoare triple {27678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:31,826 INFO L273 TraceCheckUtils]: 35: Hoare triple {27678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:31,827 INFO L273 TraceCheckUtils]: 36: Hoare triple {27679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:31,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {27679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:31,828 INFO L273 TraceCheckUtils]: 38: Hoare triple {27679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,828 INFO L273 TraceCheckUtils]: 39: Hoare triple {27680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,829 INFO L273 TraceCheckUtils]: 40: Hoare triple {27680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,829 INFO L273 TraceCheckUtils]: 41: Hoare triple {27680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,830 INFO L273 TraceCheckUtils]: 42: Hoare triple {27681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,830 INFO L273 TraceCheckUtils]: 43: Hoare triple {27681#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,831 INFO L273 TraceCheckUtils]: 44: Hoare triple {27681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {27682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,832 INFO L273 TraceCheckUtils]: 46: Hoare triple {27682#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,833 INFO L273 TraceCheckUtils]: 47: Hoare triple {27682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,833 INFO L273 TraceCheckUtils]: 48: Hoare triple {27683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,834 INFO L273 TraceCheckUtils]: 49: Hoare triple {27683#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,834 INFO L273 TraceCheckUtils]: 50: Hoare triple {27683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,835 INFO L273 TraceCheckUtils]: 51: Hoare triple {27684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,835 INFO L273 TraceCheckUtils]: 52: Hoare triple {27684#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,836 INFO L273 TraceCheckUtils]: 53: Hoare triple {27684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:31,836 INFO L273 TraceCheckUtils]: 54: Hoare triple {27685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:31,837 INFO L273 TraceCheckUtils]: 55: Hoare triple {27685#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:31,837 INFO L273 TraceCheckUtils]: 56: Hoare triple {27685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:31,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {27686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:31,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {27686#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:31,839 INFO L273 TraceCheckUtils]: 59: Hoare triple {27686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:31,839 INFO L273 TraceCheckUtils]: 60: Hoare triple {27687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:31,840 INFO L273 TraceCheckUtils]: 61: Hoare triple {27687#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:31,841 INFO L273 TraceCheckUtils]: 62: Hoare triple {27687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:31,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {27688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:31,842 INFO L273 TraceCheckUtils]: 64: Hoare triple {27688#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:31,842 INFO L273 TraceCheckUtils]: 65: Hoare triple {27688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:31,843 INFO L273 TraceCheckUtils]: 66: Hoare triple {27689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:31,843 INFO L273 TraceCheckUtils]: 67: Hoare triple {27689#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:31,844 INFO L273 TraceCheckUtils]: 68: Hoare triple {27689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:31,844 INFO L273 TraceCheckUtils]: 69: Hoare triple {27690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:31,845 INFO L273 TraceCheckUtils]: 70: Hoare triple {27690#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:31,845 INFO L273 TraceCheckUtils]: 71: Hoare triple {27690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:31,846 INFO L273 TraceCheckUtils]: 72: Hoare triple {27691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:31,846 INFO L273 TraceCheckUtils]: 73: Hoare triple {27691#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:31,847 INFO L273 TraceCheckUtils]: 74: Hoare triple {27691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:31,848 INFO L273 TraceCheckUtils]: 75: Hoare triple {27692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:31,848 INFO L273 TraceCheckUtils]: 76: Hoare triple {27692#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:31,849 INFO L273 TraceCheckUtils]: 77: Hoare triple {27692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:31,849 INFO L273 TraceCheckUtils]: 78: Hoare triple {27693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:31,850 INFO L273 TraceCheckUtils]: 79: Hoare triple {27693#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:31,850 INFO L273 TraceCheckUtils]: 80: Hoare triple {27693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:31,851 INFO L273 TraceCheckUtils]: 81: Hoare triple {27694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:31,851 INFO L273 TraceCheckUtils]: 82: Hoare triple {27694#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:31,852 INFO L273 TraceCheckUtils]: 83: Hoare triple {27694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:31,852 INFO L273 TraceCheckUtils]: 84: Hoare triple {27695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:31,853 INFO L273 TraceCheckUtils]: 85: Hoare triple {27695#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:31,854 INFO L273 TraceCheckUtils]: 86: Hoare triple {27695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:31,854 INFO L273 TraceCheckUtils]: 87: Hoare triple {27696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:31,855 INFO L273 TraceCheckUtils]: 88: Hoare triple {27696#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:31,855 INFO L273 TraceCheckUtils]: 89: Hoare triple {27696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:31,856 INFO L273 TraceCheckUtils]: 90: Hoare triple {27697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:31,856 INFO L273 TraceCheckUtils]: 91: Hoare triple {27697#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:31,857 INFO L273 TraceCheckUtils]: 92: Hoare triple {27697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:31,857 INFO L273 TraceCheckUtils]: 93: Hoare triple {27698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:31,858 INFO L273 TraceCheckUtils]: 94: Hoare triple {27698#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:31,859 INFO L273 TraceCheckUtils]: 95: Hoare triple {27698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:31,859 INFO L273 TraceCheckUtils]: 96: Hoare triple {27699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:31,860 INFO L273 TraceCheckUtils]: 97: Hoare triple {27699#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:31,860 INFO L273 TraceCheckUtils]: 98: Hoare triple {27699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:31,861 INFO L273 TraceCheckUtils]: 99: Hoare triple {27700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:31,861 INFO L273 TraceCheckUtils]: 100: Hoare triple {27700#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:31,862 INFO L273 TraceCheckUtils]: 101: Hoare triple {27700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:31,863 INFO L273 TraceCheckUtils]: 102: Hoare triple {27701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:31,863 INFO L273 TraceCheckUtils]: 103: Hoare triple {27701#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:31,864 INFO L273 TraceCheckUtils]: 104: Hoare triple {27701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:31,864 INFO L273 TraceCheckUtils]: 105: Hoare triple {27702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:31,865 INFO L273 TraceCheckUtils]: 106: Hoare triple {27702#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:31,865 INFO L273 TraceCheckUtils]: 107: Hoare triple {27702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:31,866 INFO L273 TraceCheckUtils]: 108: Hoare triple {27703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:31,866 INFO L273 TraceCheckUtils]: 109: Hoare triple {27703#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:31,867 INFO L273 TraceCheckUtils]: 110: Hoare triple {27703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:31,867 INFO L273 TraceCheckUtils]: 111: Hoare triple {27704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:31,868 INFO L273 TraceCheckUtils]: 112: Hoare triple {27704#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:31,869 INFO L273 TraceCheckUtils]: 113: Hoare triple {27704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:31,869 INFO L273 TraceCheckUtils]: 114: Hoare triple {27705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:31,869 INFO L273 TraceCheckUtils]: 115: Hoare triple {27705#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:31,870 INFO L273 TraceCheckUtils]: 116: Hoare triple {27705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:31,871 INFO L273 TraceCheckUtils]: 117: Hoare triple {27706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:31,871 INFO L273 TraceCheckUtils]: 118: Hoare triple {27706#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:31,872 INFO L273 TraceCheckUtils]: 119: Hoare triple {27706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:31,872 INFO L273 TraceCheckUtils]: 120: Hoare triple {27707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:31,873 INFO L273 TraceCheckUtils]: 121: Hoare triple {27707#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:31,873 INFO L273 TraceCheckUtils]: 122: Hoare triple {27707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:31,874 INFO L273 TraceCheckUtils]: 123: Hoare triple {27708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:31,874 INFO L273 TraceCheckUtils]: 124: Hoare triple {27708#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:31,875 INFO L273 TraceCheckUtils]: 125: Hoare triple {27708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:31,875 INFO L273 TraceCheckUtils]: 126: Hoare triple {27709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:31,876 INFO L273 TraceCheckUtils]: 127: Hoare triple {27709#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:31,877 INFO L273 TraceCheckUtils]: 128: Hoare triple {27709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:31,877 INFO L273 TraceCheckUtils]: 129: Hoare triple {27710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:31,877 INFO L273 TraceCheckUtils]: 130: Hoare triple {27710#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:31,878 INFO L273 TraceCheckUtils]: 131: Hoare triple {27710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {27711#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:31,879 INFO L273 TraceCheckUtils]: 132: Hoare triple {27711#(<= main_~i~0 42)} assume !(~i~0 < 100000); {27668#false} is VALID [2018-11-23 12:06:31,879 INFO L273 TraceCheckUtils]: 133: Hoare triple {27668#false} havoc ~x~0;~x~0 := 0; {27668#false} is VALID [2018-11-23 12:06:31,879 INFO L273 TraceCheckUtils]: 134: Hoare triple {27668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {27668#false} is VALID [2018-11-23 12:06:31,879 INFO L256 TraceCheckUtils]: 135: Hoare triple {27668#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {27668#false} is VALID [2018-11-23 12:06:31,879 INFO L273 TraceCheckUtils]: 136: Hoare triple {27668#false} ~cond := #in~cond; {27668#false} is VALID [2018-11-23 12:06:31,880 INFO L273 TraceCheckUtils]: 137: Hoare triple {27668#false} assume 0 == ~cond; {27668#false} is VALID [2018-11-23 12:06:31,880 INFO L273 TraceCheckUtils]: 138: Hoare triple {27668#false} assume !false; {27668#false} is VALID [2018-11-23 12:06:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-11-23 12:06:31,912 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 139 [2018-11-23 12:06:31,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:31,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:06:32,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:32,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:06:32,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:06:32,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:06:32,052 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand 46 states. [2018-11-23 12:06:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:33,108 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2018-11-23 12:06:33,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 12:06:33,108 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 139 [2018-11-23 12:06:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:06:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 206 transitions. [2018-11-23 12:06:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:06:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 206 transitions. [2018-11-23 12:06:33,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 206 transitions. [2018-11-23 12:06:33,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:33,306 INFO L225 Difference]: With dead ends: 160 [2018-11-23 12:06:33,306 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 12:06:33,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:06:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 12:06:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-11-23 12:06:33,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:33,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 147 states. [2018-11-23 12:06:33,396 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 147 states. [2018-11-23 12:06:33,396 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 147 states. [2018-11-23 12:06:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:33,398 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2018-11-23 12:06:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2018-11-23 12:06:33,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:33,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:33,399 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 149 states. [2018-11-23 12:06:33,399 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 149 states. [2018-11-23 12:06:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:33,400 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2018-11-23 12:06:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2018-11-23 12:06:33,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:33,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:33,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:33,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:06:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2018-11-23 12:06:33,403 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 139 [2018-11-23 12:06:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:33,403 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2018-11-23 12:06:33,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:06:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2018-11-23 12:06:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-23 12:06:33,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:33,404 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:33,404 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:33,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:33,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1671197219, now seen corresponding path program 43 times [2018-11-23 12:06:33,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:33,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:33,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:34,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {28839#true} call ULTIMATE.init(); {28839#true} is VALID [2018-11-23 12:06:34,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {28839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28839#true} is VALID [2018-11-23 12:06:34,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {28839#true} assume true; {28839#true} is VALID [2018-11-23 12:06:34,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28839#true} {28839#true} #55#return; {28839#true} is VALID [2018-11-23 12:06:34,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {28839#true} call #t~ret4 := main(); {28839#true} is VALID [2018-11-23 12:06:34,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {28839#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {28841#(= main_~i~0 0)} is VALID [2018-11-23 12:06:34,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {28841#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28841#(= main_~i~0 0)} is VALID [2018-11-23 12:06:34,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {28841#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28841#(= main_~i~0 0)} is VALID [2018-11-23 12:06:34,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {28841#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:34,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {28842#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:34,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {28842#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:34,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {28842#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:34,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {28843#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:34,837 INFO L273 TraceCheckUtils]: 13: Hoare triple {28843#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:34,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {28843#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:34,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {28844#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:34,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {28844#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:34,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {28844#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:34,839 INFO L273 TraceCheckUtils]: 18: Hoare triple {28845#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:34,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {28845#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:34,840 INFO L273 TraceCheckUtils]: 20: Hoare triple {28845#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:34,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {28846#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:34,841 INFO L273 TraceCheckUtils]: 22: Hoare triple {28846#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:34,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {28846#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:34,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {28847#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:34,843 INFO L273 TraceCheckUtils]: 25: Hoare triple {28847#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:34,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {28847#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:34,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {28848#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:34,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {28848#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:34,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {28848#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:34,846 INFO L273 TraceCheckUtils]: 30: Hoare triple {28849#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:34,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {28849#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:34,847 INFO L273 TraceCheckUtils]: 32: Hoare triple {28849#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:34,848 INFO L273 TraceCheckUtils]: 33: Hoare triple {28850#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:34,848 INFO L273 TraceCheckUtils]: 34: Hoare triple {28850#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:34,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {28850#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:34,849 INFO L273 TraceCheckUtils]: 36: Hoare triple {28851#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:34,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {28851#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:34,850 INFO L273 TraceCheckUtils]: 38: Hoare triple {28851#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:34,851 INFO L273 TraceCheckUtils]: 39: Hoare triple {28852#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:34,851 INFO L273 TraceCheckUtils]: 40: Hoare triple {28852#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:34,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {28852#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:34,853 INFO L273 TraceCheckUtils]: 42: Hoare triple {28853#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:34,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {28853#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:34,854 INFO L273 TraceCheckUtils]: 44: Hoare triple {28853#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:34,854 INFO L273 TraceCheckUtils]: 45: Hoare triple {28854#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:34,855 INFO L273 TraceCheckUtils]: 46: Hoare triple {28854#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:34,856 INFO L273 TraceCheckUtils]: 47: Hoare triple {28854#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:34,856 INFO L273 TraceCheckUtils]: 48: Hoare triple {28855#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:34,857 INFO L273 TraceCheckUtils]: 49: Hoare triple {28855#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:34,857 INFO L273 TraceCheckUtils]: 50: Hoare triple {28855#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:34,858 INFO L273 TraceCheckUtils]: 51: Hoare triple {28856#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:34,858 INFO L273 TraceCheckUtils]: 52: Hoare triple {28856#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:34,859 INFO L273 TraceCheckUtils]: 53: Hoare triple {28856#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:34,860 INFO L273 TraceCheckUtils]: 54: Hoare triple {28857#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:34,860 INFO L273 TraceCheckUtils]: 55: Hoare triple {28857#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:34,861 INFO L273 TraceCheckUtils]: 56: Hoare triple {28857#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:34,861 INFO L273 TraceCheckUtils]: 57: Hoare triple {28858#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:34,862 INFO L273 TraceCheckUtils]: 58: Hoare triple {28858#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:34,863 INFO L273 TraceCheckUtils]: 59: Hoare triple {28858#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:34,863 INFO L273 TraceCheckUtils]: 60: Hoare triple {28859#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:34,864 INFO L273 TraceCheckUtils]: 61: Hoare triple {28859#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:34,864 INFO L273 TraceCheckUtils]: 62: Hoare triple {28859#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:34,865 INFO L273 TraceCheckUtils]: 63: Hoare triple {28860#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:34,865 INFO L273 TraceCheckUtils]: 64: Hoare triple {28860#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:34,866 INFO L273 TraceCheckUtils]: 65: Hoare triple {28860#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:34,866 INFO L273 TraceCheckUtils]: 66: Hoare triple {28861#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:34,867 INFO L273 TraceCheckUtils]: 67: Hoare triple {28861#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:34,868 INFO L273 TraceCheckUtils]: 68: Hoare triple {28861#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:34,868 INFO L273 TraceCheckUtils]: 69: Hoare triple {28862#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:34,869 INFO L273 TraceCheckUtils]: 70: Hoare triple {28862#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:34,869 INFO L273 TraceCheckUtils]: 71: Hoare triple {28862#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:34,870 INFO L273 TraceCheckUtils]: 72: Hoare triple {28863#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:34,870 INFO L273 TraceCheckUtils]: 73: Hoare triple {28863#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:34,871 INFO L273 TraceCheckUtils]: 74: Hoare triple {28863#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:34,872 INFO L273 TraceCheckUtils]: 75: Hoare triple {28864#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:34,872 INFO L273 TraceCheckUtils]: 76: Hoare triple {28864#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:34,873 INFO L273 TraceCheckUtils]: 77: Hoare triple {28864#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:34,873 INFO L273 TraceCheckUtils]: 78: Hoare triple {28865#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:34,874 INFO L273 TraceCheckUtils]: 79: Hoare triple {28865#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:34,875 INFO L273 TraceCheckUtils]: 80: Hoare triple {28865#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:34,875 INFO L273 TraceCheckUtils]: 81: Hoare triple {28866#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:34,876 INFO L273 TraceCheckUtils]: 82: Hoare triple {28866#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:34,876 INFO L273 TraceCheckUtils]: 83: Hoare triple {28866#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:34,877 INFO L273 TraceCheckUtils]: 84: Hoare triple {28867#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:34,877 INFO L273 TraceCheckUtils]: 85: Hoare triple {28867#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:34,878 INFO L273 TraceCheckUtils]: 86: Hoare triple {28867#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:34,879 INFO L273 TraceCheckUtils]: 87: Hoare triple {28868#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:34,879 INFO L273 TraceCheckUtils]: 88: Hoare triple {28868#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:34,880 INFO L273 TraceCheckUtils]: 89: Hoare triple {28868#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:34,880 INFO L273 TraceCheckUtils]: 90: Hoare triple {28869#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:34,881 INFO L273 TraceCheckUtils]: 91: Hoare triple {28869#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:34,881 INFO L273 TraceCheckUtils]: 92: Hoare triple {28869#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:34,882 INFO L273 TraceCheckUtils]: 93: Hoare triple {28870#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:34,882 INFO L273 TraceCheckUtils]: 94: Hoare triple {28870#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:34,883 INFO L273 TraceCheckUtils]: 95: Hoare triple {28870#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:34,884 INFO L273 TraceCheckUtils]: 96: Hoare triple {28871#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:34,884 INFO L273 TraceCheckUtils]: 97: Hoare triple {28871#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:34,885 INFO L273 TraceCheckUtils]: 98: Hoare triple {28871#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:34,885 INFO L273 TraceCheckUtils]: 99: Hoare triple {28872#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:34,886 INFO L273 TraceCheckUtils]: 100: Hoare triple {28872#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:34,887 INFO L273 TraceCheckUtils]: 101: Hoare triple {28872#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:34,887 INFO L273 TraceCheckUtils]: 102: Hoare triple {28873#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:34,888 INFO L273 TraceCheckUtils]: 103: Hoare triple {28873#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:34,888 INFO L273 TraceCheckUtils]: 104: Hoare triple {28873#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:34,889 INFO L273 TraceCheckUtils]: 105: Hoare triple {28874#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:34,889 INFO L273 TraceCheckUtils]: 106: Hoare triple {28874#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:34,890 INFO L273 TraceCheckUtils]: 107: Hoare triple {28874#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:34,891 INFO L273 TraceCheckUtils]: 108: Hoare triple {28875#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:34,891 INFO L273 TraceCheckUtils]: 109: Hoare triple {28875#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:34,892 INFO L273 TraceCheckUtils]: 110: Hoare triple {28875#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:34,892 INFO L273 TraceCheckUtils]: 111: Hoare triple {28876#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:34,893 INFO L273 TraceCheckUtils]: 112: Hoare triple {28876#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:34,893 INFO L273 TraceCheckUtils]: 113: Hoare triple {28876#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:34,894 INFO L273 TraceCheckUtils]: 114: Hoare triple {28877#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:34,894 INFO L273 TraceCheckUtils]: 115: Hoare triple {28877#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:34,895 INFO L273 TraceCheckUtils]: 116: Hoare triple {28877#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:34,896 INFO L273 TraceCheckUtils]: 117: Hoare triple {28878#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:34,896 INFO L273 TraceCheckUtils]: 118: Hoare triple {28878#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:34,897 INFO L273 TraceCheckUtils]: 119: Hoare triple {28878#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:34,897 INFO L273 TraceCheckUtils]: 120: Hoare triple {28879#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:34,898 INFO L273 TraceCheckUtils]: 121: Hoare triple {28879#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:34,899 INFO L273 TraceCheckUtils]: 122: Hoare triple {28879#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:34,899 INFO L273 TraceCheckUtils]: 123: Hoare triple {28880#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:34,900 INFO L273 TraceCheckUtils]: 124: Hoare triple {28880#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:34,900 INFO L273 TraceCheckUtils]: 125: Hoare triple {28880#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:34,901 INFO L273 TraceCheckUtils]: 126: Hoare triple {28881#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:34,901 INFO L273 TraceCheckUtils]: 127: Hoare triple {28881#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:34,902 INFO L273 TraceCheckUtils]: 128: Hoare triple {28881#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:34,903 INFO L273 TraceCheckUtils]: 129: Hoare triple {28882#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:34,903 INFO L273 TraceCheckUtils]: 130: Hoare triple {28882#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:34,904 INFO L273 TraceCheckUtils]: 131: Hoare triple {28882#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:34,904 INFO L273 TraceCheckUtils]: 132: Hoare triple {28883#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:34,905 INFO L273 TraceCheckUtils]: 133: Hoare triple {28883#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:34,905 INFO L273 TraceCheckUtils]: 134: Hoare triple {28883#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {28884#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:34,906 INFO L273 TraceCheckUtils]: 135: Hoare triple {28884#(<= main_~i~0 43)} assume !(~i~0 < 100000); {28840#false} is VALID [2018-11-23 12:06:34,906 INFO L273 TraceCheckUtils]: 136: Hoare triple {28840#false} havoc ~x~0;~x~0 := 0; {28840#false} is VALID [2018-11-23 12:06:34,906 INFO L273 TraceCheckUtils]: 137: Hoare triple {28840#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {28840#false} is VALID [2018-11-23 12:06:34,907 INFO L256 TraceCheckUtils]: 138: Hoare triple {28840#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {28840#false} is VALID [2018-11-23 12:06:34,907 INFO L273 TraceCheckUtils]: 139: Hoare triple {28840#false} ~cond := #in~cond; {28840#false} is VALID [2018-11-23 12:06:34,907 INFO L273 TraceCheckUtils]: 140: Hoare triple {28840#false} assume 0 == ~cond; {28840#false} is VALID [2018-11-23 12:06:34,907 INFO L273 TraceCheckUtils]: 141: Hoare triple {28840#false} assume !false; {28840#false} is VALID [2018-11-23 12:06:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:34,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:34,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:34,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:35,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:35,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {28839#true} call ULTIMATE.init(); {28839#true} is VALID [2018-11-23 12:06:35,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {28839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28839#true} is VALID [2018-11-23 12:06:35,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {28839#true} assume true; {28839#true} is VALID [2018-11-23 12:06:35,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28839#true} {28839#true} #55#return; {28839#true} is VALID [2018-11-23 12:06:35,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {28839#true} call #t~ret4 := main(); {28839#true} is VALID [2018-11-23 12:06:35,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {28839#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {28903#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:35,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {28903#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28903#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:35,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {28903#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28903#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:35,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {28903#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:35,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {28842#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:35,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {28842#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:35,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {28842#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:35,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {28843#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:35,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {28843#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:35,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {28843#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:35,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {28844#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:35,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {28844#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:35,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {28844#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:35,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {28845#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:35,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {28845#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:35,515 INFO L273 TraceCheckUtils]: 20: Hoare triple {28845#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:35,515 INFO L273 TraceCheckUtils]: 21: Hoare triple {28846#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:35,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {28846#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:35,516 INFO L273 TraceCheckUtils]: 23: Hoare triple {28846#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:35,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {28847#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:35,517 INFO L273 TraceCheckUtils]: 25: Hoare triple {28847#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:35,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {28847#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:35,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {28848#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:35,519 INFO L273 TraceCheckUtils]: 28: Hoare triple {28848#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:35,520 INFO L273 TraceCheckUtils]: 29: Hoare triple {28848#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:35,520 INFO L273 TraceCheckUtils]: 30: Hoare triple {28849#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:35,521 INFO L273 TraceCheckUtils]: 31: Hoare triple {28849#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:35,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {28849#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:35,522 INFO L273 TraceCheckUtils]: 33: Hoare triple {28850#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:35,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {28850#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:35,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {28850#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:35,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {28851#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:35,524 INFO L273 TraceCheckUtils]: 37: Hoare triple {28851#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:35,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {28851#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:35,525 INFO L273 TraceCheckUtils]: 39: Hoare triple {28852#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:35,526 INFO L273 TraceCheckUtils]: 40: Hoare triple {28852#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:35,526 INFO L273 TraceCheckUtils]: 41: Hoare triple {28852#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:35,527 INFO L273 TraceCheckUtils]: 42: Hoare triple {28853#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:35,527 INFO L273 TraceCheckUtils]: 43: Hoare triple {28853#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:35,528 INFO L273 TraceCheckUtils]: 44: Hoare triple {28853#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:35,529 INFO L273 TraceCheckUtils]: 45: Hoare triple {28854#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:35,529 INFO L273 TraceCheckUtils]: 46: Hoare triple {28854#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:35,530 INFO L273 TraceCheckUtils]: 47: Hoare triple {28854#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:35,530 INFO L273 TraceCheckUtils]: 48: Hoare triple {28855#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:35,531 INFO L273 TraceCheckUtils]: 49: Hoare triple {28855#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:35,532 INFO L273 TraceCheckUtils]: 50: Hoare triple {28855#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:35,532 INFO L273 TraceCheckUtils]: 51: Hoare triple {28856#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:35,533 INFO L273 TraceCheckUtils]: 52: Hoare triple {28856#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:35,533 INFO L273 TraceCheckUtils]: 53: Hoare triple {28856#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:35,534 INFO L273 TraceCheckUtils]: 54: Hoare triple {28857#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:35,534 INFO L273 TraceCheckUtils]: 55: Hoare triple {28857#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:35,535 INFO L273 TraceCheckUtils]: 56: Hoare triple {28857#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:35,536 INFO L273 TraceCheckUtils]: 57: Hoare triple {28858#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:35,536 INFO L273 TraceCheckUtils]: 58: Hoare triple {28858#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:35,537 INFO L273 TraceCheckUtils]: 59: Hoare triple {28858#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:35,537 INFO L273 TraceCheckUtils]: 60: Hoare triple {28859#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:35,538 INFO L273 TraceCheckUtils]: 61: Hoare triple {28859#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:35,538 INFO L273 TraceCheckUtils]: 62: Hoare triple {28859#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:35,539 INFO L273 TraceCheckUtils]: 63: Hoare triple {28860#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:35,539 INFO L273 TraceCheckUtils]: 64: Hoare triple {28860#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:35,540 INFO L273 TraceCheckUtils]: 65: Hoare triple {28860#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:35,541 INFO L273 TraceCheckUtils]: 66: Hoare triple {28861#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:35,541 INFO L273 TraceCheckUtils]: 67: Hoare triple {28861#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:35,542 INFO L273 TraceCheckUtils]: 68: Hoare triple {28861#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:35,542 INFO L273 TraceCheckUtils]: 69: Hoare triple {28862#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:35,543 INFO L273 TraceCheckUtils]: 70: Hoare triple {28862#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:35,544 INFO L273 TraceCheckUtils]: 71: Hoare triple {28862#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:35,544 INFO L273 TraceCheckUtils]: 72: Hoare triple {28863#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:35,545 INFO L273 TraceCheckUtils]: 73: Hoare triple {28863#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:35,545 INFO L273 TraceCheckUtils]: 74: Hoare triple {28863#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:35,546 INFO L273 TraceCheckUtils]: 75: Hoare triple {28864#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:35,546 INFO L273 TraceCheckUtils]: 76: Hoare triple {28864#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:35,547 INFO L273 TraceCheckUtils]: 77: Hoare triple {28864#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:35,548 INFO L273 TraceCheckUtils]: 78: Hoare triple {28865#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:35,548 INFO L273 TraceCheckUtils]: 79: Hoare triple {28865#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:35,549 INFO L273 TraceCheckUtils]: 80: Hoare triple {28865#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:35,549 INFO L273 TraceCheckUtils]: 81: Hoare triple {28866#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:35,550 INFO L273 TraceCheckUtils]: 82: Hoare triple {28866#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:35,550 INFO L273 TraceCheckUtils]: 83: Hoare triple {28866#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:35,551 INFO L273 TraceCheckUtils]: 84: Hoare triple {28867#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:35,551 INFO L273 TraceCheckUtils]: 85: Hoare triple {28867#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:35,552 INFO L273 TraceCheckUtils]: 86: Hoare triple {28867#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:35,553 INFO L273 TraceCheckUtils]: 87: Hoare triple {28868#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:35,553 INFO L273 TraceCheckUtils]: 88: Hoare triple {28868#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:35,554 INFO L273 TraceCheckUtils]: 89: Hoare triple {28868#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:35,554 INFO L273 TraceCheckUtils]: 90: Hoare triple {28869#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:35,555 INFO L273 TraceCheckUtils]: 91: Hoare triple {28869#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:35,556 INFO L273 TraceCheckUtils]: 92: Hoare triple {28869#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:35,556 INFO L273 TraceCheckUtils]: 93: Hoare triple {28870#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:35,557 INFO L273 TraceCheckUtils]: 94: Hoare triple {28870#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:35,557 INFO L273 TraceCheckUtils]: 95: Hoare triple {28870#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:35,558 INFO L273 TraceCheckUtils]: 96: Hoare triple {28871#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:35,558 INFO L273 TraceCheckUtils]: 97: Hoare triple {28871#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:35,559 INFO L273 TraceCheckUtils]: 98: Hoare triple {28871#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:35,560 INFO L273 TraceCheckUtils]: 99: Hoare triple {28872#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:35,560 INFO L273 TraceCheckUtils]: 100: Hoare triple {28872#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:35,561 INFO L273 TraceCheckUtils]: 101: Hoare triple {28872#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:35,561 INFO L273 TraceCheckUtils]: 102: Hoare triple {28873#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:35,562 INFO L273 TraceCheckUtils]: 103: Hoare triple {28873#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:35,562 INFO L273 TraceCheckUtils]: 104: Hoare triple {28873#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:35,563 INFO L273 TraceCheckUtils]: 105: Hoare triple {28874#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:35,563 INFO L273 TraceCheckUtils]: 106: Hoare triple {28874#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:35,564 INFO L273 TraceCheckUtils]: 107: Hoare triple {28874#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:35,565 INFO L273 TraceCheckUtils]: 108: Hoare triple {28875#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:35,565 INFO L273 TraceCheckUtils]: 109: Hoare triple {28875#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:35,566 INFO L273 TraceCheckUtils]: 110: Hoare triple {28875#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:35,566 INFO L273 TraceCheckUtils]: 111: Hoare triple {28876#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:35,567 INFO L273 TraceCheckUtils]: 112: Hoare triple {28876#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:35,568 INFO L273 TraceCheckUtils]: 113: Hoare triple {28876#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:35,568 INFO L273 TraceCheckUtils]: 114: Hoare triple {28877#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:35,569 INFO L273 TraceCheckUtils]: 115: Hoare triple {28877#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:35,569 INFO L273 TraceCheckUtils]: 116: Hoare triple {28877#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:35,570 INFO L273 TraceCheckUtils]: 117: Hoare triple {28878#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:35,570 INFO L273 TraceCheckUtils]: 118: Hoare triple {28878#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:35,571 INFO L273 TraceCheckUtils]: 119: Hoare triple {28878#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:35,572 INFO L273 TraceCheckUtils]: 120: Hoare triple {28879#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:35,572 INFO L273 TraceCheckUtils]: 121: Hoare triple {28879#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:35,573 INFO L273 TraceCheckUtils]: 122: Hoare triple {28879#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:35,573 INFO L273 TraceCheckUtils]: 123: Hoare triple {28880#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:35,574 INFO L273 TraceCheckUtils]: 124: Hoare triple {28880#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:35,574 INFO L273 TraceCheckUtils]: 125: Hoare triple {28880#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:35,575 INFO L273 TraceCheckUtils]: 126: Hoare triple {28881#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:35,575 INFO L273 TraceCheckUtils]: 127: Hoare triple {28881#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:35,576 INFO L273 TraceCheckUtils]: 128: Hoare triple {28881#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:35,577 INFO L273 TraceCheckUtils]: 129: Hoare triple {28882#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:35,577 INFO L273 TraceCheckUtils]: 130: Hoare triple {28882#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:35,578 INFO L273 TraceCheckUtils]: 131: Hoare triple {28882#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:35,578 INFO L273 TraceCheckUtils]: 132: Hoare triple {28883#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:35,579 INFO L273 TraceCheckUtils]: 133: Hoare triple {28883#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:35,580 INFO L273 TraceCheckUtils]: 134: Hoare triple {28883#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {28884#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:35,580 INFO L273 TraceCheckUtils]: 135: Hoare triple {28884#(<= main_~i~0 43)} assume !(~i~0 < 100000); {28840#false} is VALID [2018-11-23 12:06:35,580 INFO L273 TraceCheckUtils]: 136: Hoare triple {28840#false} havoc ~x~0;~x~0 := 0; {28840#false} is VALID [2018-11-23 12:06:35,581 INFO L273 TraceCheckUtils]: 137: Hoare triple {28840#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {28840#false} is VALID [2018-11-23 12:06:35,581 INFO L256 TraceCheckUtils]: 138: Hoare triple {28840#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {28840#false} is VALID [2018-11-23 12:06:35,581 INFO L273 TraceCheckUtils]: 139: Hoare triple {28840#false} ~cond := #in~cond; {28840#false} is VALID [2018-11-23 12:06:35,581 INFO L273 TraceCheckUtils]: 140: Hoare triple {28840#false} assume 0 == ~cond; {28840#false} is VALID [2018-11-23 12:06:35,581 INFO L273 TraceCheckUtils]: 141: Hoare triple {28840#false} assume !false; {28840#false} is VALID [2018-11-23 12:06:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:35,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:35,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-11-23 12:06:35,614 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 142 [2018-11-23 12:06:35,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:35,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 12:06:35,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:35,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 12:06:35,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 12:06:35,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:06:35,755 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand 47 states. [2018-11-23 12:06:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:36,447 INFO L93 Difference]: Finished difference Result 163 states and 210 transitions. [2018-11-23 12:06:36,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:06:36,448 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 142 [2018-11-23 12:06:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:06:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 210 transitions. [2018-11-23 12:06:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:06:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 210 transitions. [2018-11-23 12:06:36,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 210 transitions. [2018-11-23 12:06:36,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:36,701 INFO L225 Difference]: With dead ends: 163 [2018-11-23 12:06:36,701 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 12:06:36,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:06:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 12:06:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-11-23 12:06:36,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:36,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 150 states. [2018-11-23 12:06:36,735 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 150 states. [2018-11-23 12:06:36,736 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 150 states. [2018-11-23 12:06:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:36,739 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2018-11-23 12:06:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2018-11-23 12:06:36,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:36,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:36,739 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 152 states. [2018-11-23 12:06:36,739 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 152 states. [2018-11-23 12:06:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:36,742 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2018-11-23 12:06:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2018-11-23 12:06:36,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:36,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:36,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:36,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 12:06:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2018-11-23 12:06:36,745 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 142 [2018-11-23 12:06:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:36,745 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2018-11-23 12:06:36,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 12:06:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2018-11-23 12:06:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 12:06:36,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:36,746 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:36,747 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:36,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:36,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1579178183, now seen corresponding path program 44 times [2018-11-23 12:06:36,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:36,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:36,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:36,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:36,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:37,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {30035#true} call ULTIMATE.init(); {30035#true} is VALID [2018-11-23 12:06:37,914 INFO L273 TraceCheckUtils]: 1: Hoare triple {30035#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30035#true} is VALID [2018-11-23 12:06:37,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {30035#true} assume true; {30035#true} is VALID [2018-11-23 12:06:37,915 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30035#true} {30035#true} #55#return; {30035#true} is VALID [2018-11-23 12:06:37,915 INFO L256 TraceCheckUtils]: 4: Hoare triple {30035#true} call #t~ret4 := main(); {30035#true} is VALID [2018-11-23 12:06:37,915 INFO L273 TraceCheckUtils]: 5: Hoare triple {30035#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {30037#(= main_~i~0 0)} is VALID [2018-11-23 12:06:37,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {30037#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30037#(= main_~i~0 0)} is VALID [2018-11-23 12:06:37,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {30037#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30037#(= main_~i~0 0)} is VALID [2018-11-23 12:06:37,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {30037#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:37,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {30038#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:37,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {30038#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:37,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {30038#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:37,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {30039#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:37,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {30039#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:37,919 INFO L273 TraceCheckUtils]: 14: Hoare triple {30039#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:37,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {30040#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:37,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {30040#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:37,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {30040#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:37,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {30041#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:37,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {30041#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:37,922 INFO L273 TraceCheckUtils]: 20: Hoare triple {30041#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:37,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {30042#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:37,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {30042#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:37,924 INFO L273 TraceCheckUtils]: 23: Hoare triple {30042#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:37,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {30043#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:37,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {30043#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:37,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {30043#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:37,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {30044#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:37,927 INFO L273 TraceCheckUtils]: 28: Hoare triple {30044#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:37,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {30044#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:37,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {30045#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:37,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {30045#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:37,929 INFO L273 TraceCheckUtils]: 32: Hoare triple {30045#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:37,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {30046#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:37,930 INFO L273 TraceCheckUtils]: 34: Hoare triple {30046#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:37,931 INFO L273 TraceCheckUtils]: 35: Hoare triple {30046#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:37,932 INFO L273 TraceCheckUtils]: 36: Hoare triple {30047#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:37,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {30047#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:37,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {30047#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:37,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {30048#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:37,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {30048#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:37,934 INFO L273 TraceCheckUtils]: 41: Hoare triple {30048#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:37,935 INFO L273 TraceCheckUtils]: 42: Hoare triple {30049#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:37,935 INFO L273 TraceCheckUtils]: 43: Hoare triple {30049#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:37,936 INFO L273 TraceCheckUtils]: 44: Hoare triple {30049#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:37,937 INFO L273 TraceCheckUtils]: 45: Hoare triple {30050#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:37,937 INFO L273 TraceCheckUtils]: 46: Hoare triple {30050#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:37,938 INFO L273 TraceCheckUtils]: 47: Hoare triple {30050#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:37,938 INFO L273 TraceCheckUtils]: 48: Hoare triple {30051#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:37,939 INFO L273 TraceCheckUtils]: 49: Hoare triple {30051#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:37,939 INFO L273 TraceCheckUtils]: 50: Hoare triple {30051#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:37,940 INFO L273 TraceCheckUtils]: 51: Hoare triple {30052#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:37,940 INFO L273 TraceCheckUtils]: 52: Hoare triple {30052#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:37,941 INFO L273 TraceCheckUtils]: 53: Hoare triple {30052#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:37,942 INFO L273 TraceCheckUtils]: 54: Hoare triple {30053#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:37,942 INFO L273 TraceCheckUtils]: 55: Hoare triple {30053#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:37,943 INFO L273 TraceCheckUtils]: 56: Hoare triple {30053#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:37,943 INFO L273 TraceCheckUtils]: 57: Hoare triple {30054#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:37,944 INFO L273 TraceCheckUtils]: 58: Hoare triple {30054#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:37,945 INFO L273 TraceCheckUtils]: 59: Hoare triple {30054#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:37,945 INFO L273 TraceCheckUtils]: 60: Hoare triple {30055#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:37,946 INFO L273 TraceCheckUtils]: 61: Hoare triple {30055#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:37,946 INFO L273 TraceCheckUtils]: 62: Hoare triple {30055#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:37,947 INFO L273 TraceCheckUtils]: 63: Hoare triple {30056#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:37,947 INFO L273 TraceCheckUtils]: 64: Hoare triple {30056#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:37,948 INFO L273 TraceCheckUtils]: 65: Hoare triple {30056#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:37,948 INFO L273 TraceCheckUtils]: 66: Hoare triple {30057#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:37,949 INFO L273 TraceCheckUtils]: 67: Hoare triple {30057#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:37,950 INFO L273 TraceCheckUtils]: 68: Hoare triple {30057#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:37,950 INFO L273 TraceCheckUtils]: 69: Hoare triple {30058#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:37,951 INFO L273 TraceCheckUtils]: 70: Hoare triple {30058#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:37,951 INFO L273 TraceCheckUtils]: 71: Hoare triple {30058#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:37,952 INFO L273 TraceCheckUtils]: 72: Hoare triple {30059#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:37,952 INFO L273 TraceCheckUtils]: 73: Hoare triple {30059#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:37,953 INFO L273 TraceCheckUtils]: 74: Hoare triple {30059#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:37,954 INFO L273 TraceCheckUtils]: 75: Hoare triple {30060#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:37,954 INFO L273 TraceCheckUtils]: 76: Hoare triple {30060#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:37,955 INFO L273 TraceCheckUtils]: 77: Hoare triple {30060#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:37,955 INFO L273 TraceCheckUtils]: 78: Hoare triple {30061#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:37,956 INFO L273 TraceCheckUtils]: 79: Hoare triple {30061#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:37,956 INFO L273 TraceCheckUtils]: 80: Hoare triple {30061#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:37,957 INFO L273 TraceCheckUtils]: 81: Hoare triple {30062#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:37,957 INFO L273 TraceCheckUtils]: 82: Hoare triple {30062#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:37,958 INFO L273 TraceCheckUtils]: 83: Hoare triple {30062#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:37,959 INFO L273 TraceCheckUtils]: 84: Hoare triple {30063#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:37,959 INFO L273 TraceCheckUtils]: 85: Hoare triple {30063#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:37,960 INFO L273 TraceCheckUtils]: 86: Hoare triple {30063#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:37,960 INFO L273 TraceCheckUtils]: 87: Hoare triple {30064#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:37,961 INFO L273 TraceCheckUtils]: 88: Hoare triple {30064#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:37,962 INFO L273 TraceCheckUtils]: 89: Hoare triple {30064#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:37,962 INFO L273 TraceCheckUtils]: 90: Hoare triple {30065#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:37,963 INFO L273 TraceCheckUtils]: 91: Hoare triple {30065#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:37,963 INFO L273 TraceCheckUtils]: 92: Hoare triple {30065#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:37,964 INFO L273 TraceCheckUtils]: 93: Hoare triple {30066#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:37,964 INFO L273 TraceCheckUtils]: 94: Hoare triple {30066#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:37,965 INFO L273 TraceCheckUtils]: 95: Hoare triple {30066#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:37,965 INFO L273 TraceCheckUtils]: 96: Hoare triple {30067#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:37,966 INFO L273 TraceCheckUtils]: 97: Hoare triple {30067#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:37,967 INFO L273 TraceCheckUtils]: 98: Hoare triple {30067#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:37,967 INFO L273 TraceCheckUtils]: 99: Hoare triple {30068#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:37,968 INFO L273 TraceCheckUtils]: 100: Hoare triple {30068#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:37,968 INFO L273 TraceCheckUtils]: 101: Hoare triple {30068#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:37,969 INFO L273 TraceCheckUtils]: 102: Hoare triple {30069#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:37,969 INFO L273 TraceCheckUtils]: 103: Hoare triple {30069#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:37,970 INFO L273 TraceCheckUtils]: 104: Hoare triple {30069#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:37,971 INFO L273 TraceCheckUtils]: 105: Hoare triple {30070#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:37,971 INFO L273 TraceCheckUtils]: 106: Hoare triple {30070#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:37,972 INFO L273 TraceCheckUtils]: 107: Hoare triple {30070#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:37,972 INFO L273 TraceCheckUtils]: 108: Hoare triple {30071#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:37,973 INFO L273 TraceCheckUtils]: 109: Hoare triple {30071#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:37,973 INFO L273 TraceCheckUtils]: 110: Hoare triple {30071#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:37,974 INFO L273 TraceCheckUtils]: 111: Hoare triple {30072#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:37,974 INFO L273 TraceCheckUtils]: 112: Hoare triple {30072#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:37,975 INFO L273 TraceCheckUtils]: 113: Hoare triple {30072#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:37,976 INFO L273 TraceCheckUtils]: 114: Hoare triple {30073#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:37,976 INFO L273 TraceCheckUtils]: 115: Hoare triple {30073#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:37,977 INFO L273 TraceCheckUtils]: 116: Hoare triple {30073#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:37,977 INFO L273 TraceCheckUtils]: 117: Hoare triple {30074#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:37,978 INFO L273 TraceCheckUtils]: 118: Hoare triple {30074#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:37,979 INFO L273 TraceCheckUtils]: 119: Hoare triple {30074#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:37,979 INFO L273 TraceCheckUtils]: 120: Hoare triple {30075#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:37,980 INFO L273 TraceCheckUtils]: 121: Hoare triple {30075#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:37,980 INFO L273 TraceCheckUtils]: 122: Hoare triple {30075#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:37,981 INFO L273 TraceCheckUtils]: 123: Hoare triple {30076#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:37,981 INFO L273 TraceCheckUtils]: 124: Hoare triple {30076#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:37,982 INFO L273 TraceCheckUtils]: 125: Hoare triple {30076#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:37,982 INFO L273 TraceCheckUtils]: 126: Hoare triple {30077#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:37,983 INFO L273 TraceCheckUtils]: 127: Hoare triple {30077#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:37,984 INFO L273 TraceCheckUtils]: 128: Hoare triple {30077#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:37,984 INFO L273 TraceCheckUtils]: 129: Hoare triple {30078#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:37,985 INFO L273 TraceCheckUtils]: 130: Hoare triple {30078#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:37,985 INFO L273 TraceCheckUtils]: 131: Hoare triple {30078#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:37,986 INFO L273 TraceCheckUtils]: 132: Hoare triple {30079#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:37,986 INFO L273 TraceCheckUtils]: 133: Hoare triple {30079#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:37,987 INFO L273 TraceCheckUtils]: 134: Hoare triple {30079#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:37,988 INFO L273 TraceCheckUtils]: 135: Hoare triple {30080#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:37,988 INFO L273 TraceCheckUtils]: 136: Hoare triple {30080#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:37,989 INFO L273 TraceCheckUtils]: 137: Hoare triple {30080#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {30081#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:37,989 INFO L273 TraceCheckUtils]: 138: Hoare triple {30081#(<= main_~i~0 44)} assume !(~i~0 < 100000); {30036#false} is VALID [2018-11-23 12:06:37,990 INFO L273 TraceCheckUtils]: 139: Hoare triple {30036#false} havoc ~x~0;~x~0 := 0; {30036#false} is VALID [2018-11-23 12:06:37,990 INFO L273 TraceCheckUtils]: 140: Hoare triple {30036#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {30036#false} is VALID [2018-11-23 12:06:37,990 INFO L256 TraceCheckUtils]: 141: Hoare triple {30036#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {30036#false} is VALID [2018-11-23 12:06:37,990 INFO L273 TraceCheckUtils]: 142: Hoare triple {30036#false} ~cond := #in~cond; {30036#false} is VALID [2018-11-23 12:06:37,990 INFO L273 TraceCheckUtils]: 143: Hoare triple {30036#false} assume 0 == ~cond; {30036#false} is VALID [2018-11-23 12:06:37,991 INFO L273 TraceCheckUtils]: 144: Hoare triple {30036#false} assume !false; {30036#false} is VALID [2018-11-23 12:06:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:38,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:38,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:38,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:38,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:38,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:38,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:38,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {30035#true} call ULTIMATE.init(); {30035#true} is VALID [2018-11-23 12:06:38,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {30035#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30035#true} is VALID [2018-11-23 12:06:38,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {30035#true} assume true; {30035#true} is VALID [2018-11-23 12:06:38,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30035#true} {30035#true} #55#return; {30035#true} is VALID [2018-11-23 12:06:38,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {30035#true} call #t~ret4 := main(); {30035#true} is VALID [2018-11-23 12:06:38,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {30035#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {30100#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:38,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {30100#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30100#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:38,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {30100#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30100#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:38,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {30100#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {30038#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {30038#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,759 INFO L273 TraceCheckUtils]: 11: Hoare triple {30038#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,759 INFO L273 TraceCheckUtils]: 12: Hoare triple {30039#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {30039#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,761 INFO L273 TraceCheckUtils]: 14: Hoare triple {30039#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {30040#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {30040#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {30040#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {30041#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {30041#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {30041#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,771 INFO L273 TraceCheckUtils]: 21: Hoare triple {30042#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {30042#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {30042#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {30043#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {30043#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {30043#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {30044#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {30044#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {30044#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {30045#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,781 INFO L273 TraceCheckUtils]: 31: Hoare triple {30045#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {30045#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,783 INFO L273 TraceCheckUtils]: 33: Hoare triple {30046#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,783 INFO L273 TraceCheckUtils]: 34: Hoare triple {30046#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,785 INFO L273 TraceCheckUtils]: 35: Hoare triple {30046#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,785 INFO L273 TraceCheckUtils]: 36: Hoare triple {30047#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,787 INFO L273 TraceCheckUtils]: 37: Hoare triple {30047#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,787 INFO L273 TraceCheckUtils]: 38: Hoare triple {30047#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,790 INFO L273 TraceCheckUtils]: 39: Hoare triple {30048#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,790 INFO L273 TraceCheckUtils]: 40: Hoare triple {30048#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,793 INFO L273 TraceCheckUtils]: 41: Hoare triple {30048#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:38,793 INFO L273 TraceCheckUtils]: 42: Hoare triple {30049#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:38,795 INFO L273 TraceCheckUtils]: 43: Hoare triple {30049#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:38,795 INFO L273 TraceCheckUtils]: 44: Hoare triple {30049#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:38,797 INFO L273 TraceCheckUtils]: 45: Hoare triple {30050#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:38,797 INFO L273 TraceCheckUtils]: 46: Hoare triple {30050#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:38,800 INFO L273 TraceCheckUtils]: 47: Hoare triple {30050#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:38,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {30051#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:38,802 INFO L273 TraceCheckUtils]: 49: Hoare triple {30051#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:38,802 INFO L273 TraceCheckUtils]: 50: Hoare triple {30051#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:38,804 INFO L273 TraceCheckUtils]: 51: Hoare triple {30052#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:38,804 INFO L273 TraceCheckUtils]: 52: Hoare triple {30052#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:38,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {30052#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:38,807 INFO L273 TraceCheckUtils]: 54: Hoare triple {30053#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:38,810 INFO L273 TraceCheckUtils]: 55: Hoare triple {30053#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:38,810 INFO L273 TraceCheckUtils]: 56: Hoare triple {30053#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:38,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {30054#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:38,813 INFO L273 TraceCheckUtils]: 58: Hoare triple {30054#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:38,815 INFO L273 TraceCheckUtils]: 59: Hoare triple {30054#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:38,815 INFO L273 TraceCheckUtils]: 60: Hoare triple {30055#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:38,817 INFO L273 TraceCheckUtils]: 61: Hoare triple {30055#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:38,817 INFO L273 TraceCheckUtils]: 62: Hoare triple {30055#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:38,820 INFO L273 TraceCheckUtils]: 63: Hoare triple {30056#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:38,820 INFO L273 TraceCheckUtils]: 64: Hoare triple {30056#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:38,822 INFO L273 TraceCheckUtils]: 65: Hoare triple {30056#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:38,822 INFO L273 TraceCheckUtils]: 66: Hoare triple {30057#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:38,824 INFO L273 TraceCheckUtils]: 67: Hoare triple {30057#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:38,824 INFO L273 TraceCheckUtils]: 68: Hoare triple {30057#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:38,826 INFO L273 TraceCheckUtils]: 69: Hoare triple {30058#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:38,826 INFO L273 TraceCheckUtils]: 70: Hoare triple {30058#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:38,829 INFO L273 TraceCheckUtils]: 71: Hoare triple {30058#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:38,829 INFO L273 TraceCheckUtils]: 72: Hoare triple {30059#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:38,832 INFO L273 TraceCheckUtils]: 73: Hoare triple {30059#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:38,832 INFO L273 TraceCheckUtils]: 74: Hoare triple {30059#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:38,834 INFO L273 TraceCheckUtils]: 75: Hoare triple {30060#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:38,834 INFO L273 TraceCheckUtils]: 76: Hoare triple {30060#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:38,837 INFO L273 TraceCheckUtils]: 77: Hoare triple {30060#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:38,837 INFO L273 TraceCheckUtils]: 78: Hoare triple {30061#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:38,839 INFO L273 TraceCheckUtils]: 79: Hoare triple {30061#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:38,839 INFO L273 TraceCheckUtils]: 80: Hoare triple {30061#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:38,842 INFO L273 TraceCheckUtils]: 81: Hoare triple {30062#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:38,842 INFO L273 TraceCheckUtils]: 82: Hoare triple {30062#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:38,845 INFO L273 TraceCheckUtils]: 83: Hoare triple {30062#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:38,845 INFO L273 TraceCheckUtils]: 84: Hoare triple {30063#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:38,847 INFO L273 TraceCheckUtils]: 85: Hoare triple {30063#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:38,847 INFO L273 TraceCheckUtils]: 86: Hoare triple {30063#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:38,850 INFO L273 TraceCheckUtils]: 87: Hoare triple {30064#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:38,850 INFO L273 TraceCheckUtils]: 88: Hoare triple {30064#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:38,853 INFO L273 TraceCheckUtils]: 89: Hoare triple {30064#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:38,853 INFO L273 TraceCheckUtils]: 90: Hoare triple {30065#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:38,856 INFO L273 TraceCheckUtils]: 91: Hoare triple {30065#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:38,856 INFO L273 TraceCheckUtils]: 92: Hoare triple {30065#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:38,859 INFO L273 TraceCheckUtils]: 93: Hoare triple {30066#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:38,859 INFO L273 TraceCheckUtils]: 94: Hoare triple {30066#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:38,862 INFO L273 TraceCheckUtils]: 95: Hoare triple {30066#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:38,862 INFO L273 TraceCheckUtils]: 96: Hoare triple {30067#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:38,864 INFO L273 TraceCheckUtils]: 97: Hoare triple {30067#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:38,864 INFO L273 TraceCheckUtils]: 98: Hoare triple {30067#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:38,867 INFO L273 TraceCheckUtils]: 99: Hoare triple {30068#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:38,867 INFO L273 TraceCheckUtils]: 100: Hoare triple {30068#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:38,869 INFO L273 TraceCheckUtils]: 101: Hoare triple {30068#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:38,869 INFO L273 TraceCheckUtils]: 102: Hoare triple {30069#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:38,871 INFO L273 TraceCheckUtils]: 103: Hoare triple {30069#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:38,871 INFO L273 TraceCheckUtils]: 104: Hoare triple {30069#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:38,873 INFO L273 TraceCheckUtils]: 105: Hoare triple {30070#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:38,873 INFO L273 TraceCheckUtils]: 106: Hoare triple {30070#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:38,875 INFO L273 TraceCheckUtils]: 107: Hoare triple {30070#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:38,875 INFO L273 TraceCheckUtils]: 108: Hoare triple {30071#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:38,878 INFO L273 TraceCheckUtils]: 109: Hoare triple {30071#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:38,878 INFO L273 TraceCheckUtils]: 110: Hoare triple {30071#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:38,880 INFO L273 TraceCheckUtils]: 111: Hoare triple {30072#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:38,880 INFO L273 TraceCheckUtils]: 112: Hoare triple {30072#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:38,882 INFO L273 TraceCheckUtils]: 113: Hoare triple {30072#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:38,882 INFO L273 TraceCheckUtils]: 114: Hoare triple {30073#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:38,885 INFO L273 TraceCheckUtils]: 115: Hoare triple {30073#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:38,885 INFO L273 TraceCheckUtils]: 116: Hoare triple {30073#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:38,887 INFO L273 TraceCheckUtils]: 117: Hoare triple {30074#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:38,887 INFO L273 TraceCheckUtils]: 118: Hoare triple {30074#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:38,889 INFO L273 TraceCheckUtils]: 119: Hoare triple {30074#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:38,889 INFO L273 TraceCheckUtils]: 120: Hoare triple {30075#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:38,891 INFO L273 TraceCheckUtils]: 121: Hoare triple {30075#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:38,891 INFO L273 TraceCheckUtils]: 122: Hoare triple {30075#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:38,893 INFO L273 TraceCheckUtils]: 123: Hoare triple {30076#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:38,893 INFO L273 TraceCheckUtils]: 124: Hoare triple {30076#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:38,896 INFO L273 TraceCheckUtils]: 125: Hoare triple {30076#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:38,896 INFO L273 TraceCheckUtils]: 126: Hoare triple {30077#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:38,899 INFO L273 TraceCheckUtils]: 127: Hoare triple {30077#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:38,899 INFO L273 TraceCheckUtils]: 128: Hoare triple {30077#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:38,902 INFO L273 TraceCheckUtils]: 129: Hoare triple {30078#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:38,902 INFO L273 TraceCheckUtils]: 130: Hoare triple {30078#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:38,904 INFO L273 TraceCheckUtils]: 131: Hoare triple {30078#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:38,904 INFO L273 TraceCheckUtils]: 132: Hoare triple {30079#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:38,907 INFO L273 TraceCheckUtils]: 133: Hoare triple {30079#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:38,907 INFO L273 TraceCheckUtils]: 134: Hoare triple {30079#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:38,910 INFO L273 TraceCheckUtils]: 135: Hoare triple {30080#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:38,910 INFO L273 TraceCheckUtils]: 136: Hoare triple {30080#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:38,910 INFO L273 TraceCheckUtils]: 137: Hoare triple {30080#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {30081#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:38,911 INFO L273 TraceCheckUtils]: 138: Hoare triple {30081#(<= main_~i~0 44)} assume !(~i~0 < 100000); {30036#false} is VALID [2018-11-23 12:06:38,911 INFO L273 TraceCheckUtils]: 139: Hoare triple {30036#false} havoc ~x~0;~x~0 := 0; {30036#false} is VALID [2018-11-23 12:06:38,911 INFO L273 TraceCheckUtils]: 140: Hoare triple {30036#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {30036#false} is VALID [2018-11-23 12:06:38,911 INFO L256 TraceCheckUtils]: 141: Hoare triple {30036#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {30036#false} is VALID [2018-11-23 12:06:38,911 INFO L273 TraceCheckUtils]: 142: Hoare triple {30036#false} ~cond := #in~cond; {30036#false} is VALID [2018-11-23 12:06:38,911 INFO L273 TraceCheckUtils]: 143: Hoare triple {30036#false} assume 0 == ~cond; {30036#false} is VALID [2018-11-23 12:06:38,911 INFO L273 TraceCheckUtils]: 144: Hoare triple {30036#false} assume !false; {30036#false} is VALID [2018-11-23 12:06:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:38,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:38,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2018-11-23 12:06:38,943 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 145 [2018-11-23 12:06:38,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:38,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:06:39,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:39,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:06:39,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:06:39,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:06:39,085 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand 48 states. [2018-11-23 12:06:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,612 INFO L93 Difference]: Finished difference Result 166 states and 214 transitions. [2018-11-23 12:06:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 12:06:39,613 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 145 [2018-11-23 12:06:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:06:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 214 transitions. [2018-11-23 12:06:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:06:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 214 transitions. [2018-11-23 12:06:39,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 214 transitions. [2018-11-23 12:06:39,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:39,818 INFO L225 Difference]: With dead ends: 166 [2018-11-23 12:06:39,818 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 12:06:39,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:06:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 12:06:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-23 12:06:39,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:39,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 153 states. [2018-11-23 12:06:39,859 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 153 states. [2018-11-23 12:06:39,859 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 153 states. [2018-11-23 12:06:39,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,862 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2018-11-23 12:06:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2018-11-23 12:06:39,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:39,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:39,862 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 155 states. [2018-11-23 12:06:39,862 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 155 states. [2018-11-23 12:06:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,864 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2018-11-23 12:06:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2018-11-23 12:06:39,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:39,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:39,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:39,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 12:06:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 199 transitions. [2018-11-23 12:06:39,867 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 199 transitions. Word has length 145 [2018-11-23 12:06:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:39,867 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 199 transitions. [2018-11-23 12:06:39,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:06:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 199 transitions. [2018-11-23 12:06:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:06:39,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:39,868 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:39,868 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:39,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:39,868 INFO L82 PathProgramCache]: Analyzing trace with hash 819876451, now seen corresponding path program 45 times [2018-11-23 12:06:39,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:39,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:39,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:41,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {31255#true} call ULTIMATE.init(); {31255#true} is VALID [2018-11-23 12:06:41,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {31255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31255#true} is VALID [2018-11-23 12:06:41,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {31255#true} assume true; {31255#true} is VALID [2018-11-23 12:06:41,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31255#true} {31255#true} #55#return; {31255#true} is VALID [2018-11-23 12:06:41,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {31255#true} call #t~ret4 := main(); {31255#true} is VALID [2018-11-23 12:06:41,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {31255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {31257#(= main_~i~0 0)} is VALID [2018-11-23 12:06:41,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {31257#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31257#(= main_~i~0 0)} is VALID [2018-11-23 12:06:41,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {31257#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31257#(= main_~i~0 0)} is VALID [2018-11-23 12:06:41,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {31257#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:41,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {31258#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:41,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {31258#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:41,342 INFO L273 TraceCheckUtils]: 11: Hoare triple {31258#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:41,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {31259#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:41,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {31259#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:41,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {31259#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:41,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {31260#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:41,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {31260#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:41,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {31260#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:41,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {31261#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:41,346 INFO L273 TraceCheckUtils]: 19: Hoare triple {31261#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:41,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {31261#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:41,347 INFO L273 TraceCheckUtils]: 21: Hoare triple {31262#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:41,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {31262#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:41,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {31262#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:41,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {31263#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:41,350 INFO L273 TraceCheckUtils]: 25: Hoare triple {31263#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:41,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {31263#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:41,351 INFO L273 TraceCheckUtils]: 27: Hoare triple {31264#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:41,351 INFO L273 TraceCheckUtils]: 28: Hoare triple {31264#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:41,352 INFO L273 TraceCheckUtils]: 29: Hoare triple {31264#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:41,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {31265#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:41,353 INFO L273 TraceCheckUtils]: 31: Hoare triple {31265#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:41,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {31265#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:41,354 INFO L273 TraceCheckUtils]: 33: Hoare triple {31266#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:41,355 INFO L273 TraceCheckUtils]: 34: Hoare triple {31266#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:41,355 INFO L273 TraceCheckUtils]: 35: Hoare triple {31266#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:41,356 INFO L273 TraceCheckUtils]: 36: Hoare triple {31267#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:41,356 INFO L273 TraceCheckUtils]: 37: Hoare triple {31267#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:41,357 INFO L273 TraceCheckUtils]: 38: Hoare triple {31267#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:41,358 INFO L273 TraceCheckUtils]: 39: Hoare triple {31268#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:41,358 INFO L273 TraceCheckUtils]: 40: Hoare triple {31268#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:41,359 INFO L273 TraceCheckUtils]: 41: Hoare triple {31268#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:41,359 INFO L273 TraceCheckUtils]: 42: Hoare triple {31269#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:41,360 INFO L273 TraceCheckUtils]: 43: Hoare triple {31269#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:41,361 INFO L273 TraceCheckUtils]: 44: Hoare triple {31269#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:41,361 INFO L273 TraceCheckUtils]: 45: Hoare triple {31270#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:41,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {31270#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:41,362 INFO L273 TraceCheckUtils]: 47: Hoare triple {31270#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:41,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {31271#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:41,363 INFO L273 TraceCheckUtils]: 49: Hoare triple {31271#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:41,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {31271#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:41,365 INFO L273 TraceCheckUtils]: 51: Hoare triple {31272#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:41,365 INFO L273 TraceCheckUtils]: 52: Hoare triple {31272#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:41,366 INFO L273 TraceCheckUtils]: 53: Hoare triple {31272#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:41,366 INFO L273 TraceCheckUtils]: 54: Hoare triple {31273#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:41,367 INFO L273 TraceCheckUtils]: 55: Hoare triple {31273#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:41,367 INFO L273 TraceCheckUtils]: 56: Hoare triple {31273#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:41,368 INFO L273 TraceCheckUtils]: 57: Hoare triple {31274#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:41,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {31274#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:41,369 INFO L273 TraceCheckUtils]: 59: Hoare triple {31274#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:41,370 INFO L273 TraceCheckUtils]: 60: Hoare triple {31275#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:41,370 INFO L273 TraceCheckUtils]: 61: Hoare triple {31275#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:41,371 INFO L273 TraceCheckUtils]: 62: Hoare triple {31275#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:41,371 INFO L273 TraceCheckUtils]: 63: Hoare triple {31276#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:41,372 INFO L273 TraceCheckUtils]: 64: Hoare triple {31276#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:41,373 INFO L273 TraceCheckUtils]: 65: Hoare triple {31276#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:41,373 INFO L273 TraceCheckUtils]: 66: Hoare triple {31277#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:41,374 INFO L273 TraceCheckUtils]: 67: Hoare triple {31277#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:41,374 INFO L273 TraceCheckUtils]: 68: Hoare triple {31277#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:41,375 INFO L273 TraceCheckUtils]: 69: Hoare triple {31278#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:41,375 INFO L273 TraceCheckUtils]: 70: Hoare triple {31278#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:41,376 INFO L273 TraceCheckUtils]: 71: Hoare triple {31278#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:41,377 INFO L273 TraceCheckUtils]: 72: Hoare triple {31279#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:41,377 INFO L273 TraceCheckUtils]: 73: Hoare triple {31279#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:41,378 INFO L273 TraceCheckUtils]: 74: Hoare triple {31279#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:41,378 INFO L273 TraceCheckUtils]: 75: Hoare triple {31280#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:41,379 INFO L273 TraceCheckUtils]: 76: Hoare triple {31280#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:41,380 INFO L273 TraceCheckUtils]: 77: Hoare triple {31280#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:41,380 INFO L273 TraceCheckUtils]: 78: Hoare triple {31281#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:41,381 INFO L273 TraceCheckUtils]: 79: Hoare triple {31281#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:41,381 INFO L273 TraceCheckUtils]: 80: Hoare triple {31281#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:41,382 INFO L273 TraceCheckUtils]: 81: Hoare triple {31282#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:41,382 INFO L273 TraceCheckUtils]: 82: Hoare triple {31282#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:41,383 INFO L273 TraceCheckUtils]: 83: Hoare triple {31282#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:41,383 INFO L273 TraceCheckUtils]: 84: Hoare triple {31283#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:41,384 INFO L273 TraceCheckUtils]: 85: Hoare triple {31283#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:41,385 INFO L273 TraceCheckUtils]: 86: Hoare triple {31283#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:41,385 INFO L273 TraceCheckUtils]: 87: Hoare triple {31284#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:41,386 INFO L273 TraceCheckUtils]: 88: Hoare triple {31284#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:41,386 INFO L273 TraceCheckUtils]: 89: Hoare triple {31284#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:41,387 INFO L273 TraceCheckUtils]: 90: Hoare triple {31285#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:41,387 INFO L273 TraceCheckUtils]: 91: Hoare triple {31285#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:41,388 INFO L273 TraceCheckUtils]: 92: Hoare triple {31285#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:41,389 INFO L273 TraceCheckUtils]: 93: Hoare triple {31286#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:41,389 INFO L273 TraceCheckUtils]: 94: Hoare triple {31286#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:41,390 INFO L273 TraceCheckUtils]: 95: Hoare triple {31286#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:41,390 INFO L273 TraceCheckUtils]: 96: Hoare triple {31287#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:41,391 INFO L273 TraceCheckUtils]: 97: Hoare triple {31287#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:41,391 INFO L273 TraceCheckUtils]: 98: Hoare triple {31287#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:41,392 INFO L273 TraceCheckUtils]: 99: Hoare triple {31288#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:41,393 INFO L273 TraceCheckUtils]: 100: Hoare triple {31288#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:41,393 INFO L273 TraceCheckUtils]: 101: Hoare triple {31288#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:41,394 INFO L273 TraceCheckUtils]: 102: Hoare triple {31289#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:41,394 INFO L273 TraceCheckUtils]: 103: Hoare triple {31289#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:41,395 INFO L273 TraceCheckUtils]: 104: Hoare triple {31289#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:41,395 INFO L273 TraceCheckUtils]: 105: Hoare triple {31290#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:41,396 INFO L273 TraceCheckUtils]: 106: Hoare triple {31290#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:41,397 INFO L273 TraceCheckUtils]: 107: Hoare triple {31290#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:41,397 INFO L273 TraceCheckUtils]: 108: Hoare triple {31291#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:41,398 INFO L273 TraceCheckUtils]: 109: Hoare triple {31291#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:41,398 INFO L273 TraceCheckUtils]: 110: Hoare triple {31291#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:41,399 INFO L273 TraceCheckUtils]: 111: Hoare triple {31292#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:41,399 INFO L273 TraceCheckUtils]: 112: Hoare triple {31292#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:41,400 INFO L273 TraceCheckUtils]: 113: Hoare triple {31292#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:41,401 INFO L273 TraceCheckUtils]: 114: Hoare triple {31293#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:41,401 INFO L273 TraceCheckUtils]: 115: Hoare triple {31293#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:41,402 INFO L273 TraceCheckUtils]: 116: Hoare triple {31293#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:41,402 INFO L273 TraceCheckUtils]: 117: Hoare triple {31294#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:41,403 INFO L273 TraceCheckUtils]: 118: Hoare triple {31294#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:41,404 INFO L273 TraceCheckUtils]: 119: Hoare triple {31294#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:41,404 INFO L273 TraceCheckUtils]: 120: Hoare triple {31295#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:41,405 INFO L273 TraceCheckUtils]: 121: Hoare triple {31295#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:41,405 INFO L273 TraceCheckUtils]: 122: Hoare triple {31295#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:41,406 INFO L273 TraceCheckUtils]: 123: Hoare triple {31296#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:41,406 INFO L273 TraceCheckUtils]: 124: Hoare triple {31296#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:41,407 INFO L273 TraceCheckUtils]: 125: Hoare triple {31296#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:41,407 INFO L273 TraceCheckUtils]: 126: Hoare triple {31297#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:41,408 INFO L273 TraceCheckUtils]: 127: Hoare triple {31297#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:41,409 INFO L273 TraceCheckUtils]: 128: Hoare triple {31297#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:41,409 INFO L273 TraceCheckUtils]: 129: Hoare triple {31298#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:41,410 INFO L273 TraceCheckUtils]: 130: Hoare triple {31298#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:41,410 INFO L273 TraceCheckUtils]: 131: Hoare triple {31298#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:41,411 INFO L273 TraceCheckUtils]: 132: Hoare triple {31299#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:41,411 INFO L273 TraceCheckUtils]: 133: Hoare triple {31299#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:41,412 INFO L273 TraceCheckUtils]: 134: Hoare triple {31299#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:41,413 INFO L273 TraceCheckUtils]: 135: Hoare triple {31300#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:41,413 INFO L273 TraceCheckUtils]: 136: Hoare triple {31300#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:41,414 INFO L273 TraceCheckUtils]: 137: Hoare triple {31300#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:41,414 INFO L273 TraceCheckUtils]: 138: Hoare triple {31301#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:41,415 INFO L273 TraceCheckUtils]: 139: Hoare triple {31301#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:41,415 INFO L273 TraceCheckUtils]: 140: Hoare triple {31301#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {31302#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:41,416 INFO L273 TraceCheckUtils]: 141: Hoare triple {31302#(<= main_~i~0 45)} assume !(~i~0 < 100000); {31256#false} is VALID [2018-11-23 12:06:41,416 INFO L273 TraceCheckUtils]: 142: Hoare triple {31256#false} havoc ~x~0;~x~0 := 0; {31256#false} is VALID [2018-11-23 12:06:41,417 INFO L273 TraceCheckUtils]: 143: Hoare triple {31256#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {31256#false} is VALID [2018-11-23 12:06:41,417 INFO L256 TraceCheckUtils]: 144: Hoare triple {31256#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {31256#false} is VALID [2018-11-23 12:06:41,417 INFO L273 TraceCheckUtils]: 145: Hoare triple {31256#false} ~cond := #in~cond; {31256#false} is VALID [2018-11-23 12:06:41,417 INFO L273 TraceCheckUtils]: 146: Hoare triple {31256#false} assume 0 == ~cond; {31256#false} is VALID [2018-11-23 12:06:41,417 INFO L273 TraceCheckUtils]: 147: Hoare triple {31256#false} assume !false; {31256#false} is VALID [2018-11-23 12:06:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:41,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:41,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:41,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:41,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-11-23 12:06:41,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:41,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:41,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {31255#true} call ULTIMATE.init(); {31255#true} is VALID [2018-11-23 12:06:41,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {31255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31255#true} is VALID [2018-11-23 12:06:41,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {31255#true} assume true; {31255#true} is VALID [2018-11-23 12:06:41,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31255#true} {31255#true} #55#return; {31255#true} is VALID [2018-11-23 12:06:41,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {31255#true} call #t~ret4 := main(); {31255#true} is VALID [2018-11-23 12:06:41,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {31255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {31321#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:41,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {31321#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31321#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:41,985 INFO L273 TraceCheckUtils]: 7: Hoare triple {31321#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31321#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:41,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {31321#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:41,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {31258#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:41,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {31258#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:41,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {31258#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:41,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {31259#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:41,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {31259#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:41,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {31259#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:41,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {31260#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:41,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {31260#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:41,991 INFO L273 TraceCheckUtils]: 17: Hoare triple {31260#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:41,992 INFO L273 TraceCheckUtils]: 18: Hoare triple {31261#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:41,992 INFO L273 TraceCheckUtils]: 19: Hoare triple {31261#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:41,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {31261#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:41,994 INFO L273 TraceCheckUtils]: 21: Hoare triple {31262#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:41,994 INFO L273 TraceCheckUtils]: 22: Hoare triple {31262#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:41,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {31262#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:41,995 INFO L273 TraceCheckUtils]: 24: Hoare triple {31263#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:41,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {31263#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:41,997 INFO L273 TraceCheckUtils]: 26: Hoare triple {31263#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:41,997 INFO L273 TraceCheckUtils]: 27: Hoare triple {31264#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:41,998 INFO L273 TraceCheckUtils]: 28: Hoare triple {31264#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:41,998 INFO L273 TraceCheckUtils]: 29: Hoare triple {31264#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:41,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {31265#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:41,999 INFO L273 TraceCheckUtils]: 31: Hoare triple {31265#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:42,000 INFO L273 TraceCheckUtils]: 32: Hoare triple {31265#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:42,000 INFO L273 TraceCheckUtils]: 33: Hoare triple {31266#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:42,001 INFO L273 TraceCheckUtils]: 34: Hoare triple {31266#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:42,002 INFO L273 TraceCheckUtils]: 35: Hoare triple {31266#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:42,002 INFO L273 TraceCheckUtils]: 36: Hoare triple {31267#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:42,003 INFO L273 TraceCheckUtils]: 37: Hoare triple {31267#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:42,003 INFO L273 TraceCheckUtils]: 38: Hoare triple {31267#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:42,004 INFO L273 TraceCheckUtils]: 39: Hoare triple {31268#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:42,004 INFO L273 TraceCheckUtils]: 40: Hoare triple {31268#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:42,005 INFO L273 TraceCheckUtils]: 41: Hoare triple {31268#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:42,006 INFO L273 TraceCheckUtils]: 42: Hoare triple {31269#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:42,006 INFO L273 TraceCheckUtils]: 43: Hoare triple {31269#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:42,007 INFO L273 TraceCheckUtils]: 44: Hoare triple {31269#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:42,007 INFO L273 TraceCheckUtils]: 45: Hoare triple {31270#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:42,008 INFO L273 TraceCheckUtils]: 46: Hoare triple {31270#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:42,008 INFO L273 TraceCheckUtils]: 47: Hoare triple {31270#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:42,009 INFO L273 TraceCheckUtils]: 48: Hoare triple {31271#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:42,009 INFO L273 TraceCheckUtils]: 49: Hoare triple {31271#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:42,010 INFO L273 TraceCheckUtils]: 50: Hoare triple {31271#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:42,011 INFO L273 TraceCheckUtils]: 51: Hoare triple {31272#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:42,011 INFO L273 TraceCheckUtils]: 52: Hoare triple {31272#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:42,012 INFO L273 TraceCheckUtils]: 53: Hoare triple {31272#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:42,012 INFO L273 TraceCheckUtils]: 54: Hoare triple {31273#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:42,013 INFO L273 TraceCheckUtils]: 55: Hoare triple {31273#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:42,014 INFO L273 TraceCheckUtils]: 56: Hoare triple {31273#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:42,014 INFO L273 TraceCheckUtils]: 57: Hoare triple {31274#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:42,015 INFO L273 TraceCheckUtils]: 58: Hoare triple {31274#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:42,015 INFO L273 TraceCheckUtils]: 59: Hoare triple {31274#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:42,016 INFO L273 TraceCheckUtils]: 60: Hoare triple {31275#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:42,016 INFO L273 TraceCheckUtils]: 61: Hoare triple {31275#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:42,017 INFO L273 TraceCheckUtils]: 62: Hoare triple {31275#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:42,018 INFO L273 TraceCheckUtils]: 63: Hoare triple {31276#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:42,018 INFO L273 TraceCheckUtils]: 64: Hoare triple {31276#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:42,019 INFO L273 TraceCheckUtils]: 65: Hoare triple {31276#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:42,019 INFO L273 TraceCheckUtils]: 66: Hoare triple {31277#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:42,020 INFO L273 TraceCheckUtils]: 67: Hoare triple {31277#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:42,021 INFO L273 TraceCheckUtils]: 68: Hoare triple {31277#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:42,021 INFO L273 TraceCheckUtils]: 69: Hoare triple {31278#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:42,021 INFO L273 TraceCheckUtils]: 70: Hoare triple {31278#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:42,022 INFO L273 TraceCheckUtils]: 71: Hoare triple {31278#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:42,023 INFO L273 TraceCheckUtils]: 72: Hoare triple {31279#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:42,023 INFO L273 TraceCheckUtils]: 73: Hoare triple {31279#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:42,024 INFO L273 TraceCheckUtils]: 74: Hoare triple {31279#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:42,024 INFO L273 TraceCheckUtils]: 75: Hoare triple {31280#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:42,025 INFO L273 TraceCheckUtils]: 76: Hoare triple {31280#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:42,026 INFO L273 TraceCheckUtils]: 77: Hoare triple {31280#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:42,026 INFO L273 TraceCheckUtils]: 78: Hoare triple {31281#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:42,027 INFO L273 TraceCheckUtils]: 79: Hoare triple {31281#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:42,027 INFO L273 TraceCheckUtils]: 80: Hoare triple {31281#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:42,028 INFO L273 TraceCheckUtils]: 81: Hoare triple {31282#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:42,028 INFO L273 TraceCheckUtils]: 82: Hoare triple {31282#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:42,029 INFO L273 TraceCheckUtils]: 83: Hoare triple {31282#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:42,030 INFO L273 TraceCheckUtils]: 84: Hoare triple {31283#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:42,030 INFO L273 TraceCheckUtils]: 85: Hoare triple {31283#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:42,031 INFO L273 TraceCheckUtils]: 86: Hoare triple {31283#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:42,031 INFO L273 TraceCheckUtils]: 87: Hoare triple {31284#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:42,032 INFO L273 TraceCheckUtils]: 88: Hoare triple {31284#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:42,033 INFO L273 TraceCheckUtils]: 89: Hoare triple {31284#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:42,033 INFO L273 TraceCheckUtils]: 90: Hoare triple {31285#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:42,034 INFO L273 TraceCheckUtils]: 91: Hoare triple {31285#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:42,034 INFO L273 TraceCheckUtils]: 92: Hoare triple {31285#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:42,035 INFO L273 TraceCheckUtils]: 93: Hoare triple {31286#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:42,035 INFO L273 TraceCheckUtils]: 94: Hoare triple {31286#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:42,036 INFO L273 TraceCheckUtils]: 95: Hoare triple {31286#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:42,036 INFO L273 TraceCheckUtils]: 96: Hoare triple {31287#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:42,037 INFO L273 TraceCheckUtils]: 97: Hoare triple {31287#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:42,038 INFO L273 TraceCheckUtils]: 98: Hoare triple {31287#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:42,038 INFO L273 TraceCheckUtils]: 99: Hoare triple {31288#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:42,039 INFO L273 TraceCheckUtils]: 100: Hoare triple {31288#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:42,039 INFO L273 TraceCheckUtils]: 101: Hoare triple {31288#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:42,040 INFO L273 TraceCheckUtils]: 102: Hoare triple {31289#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:42,040 INFO L273 TraceCheckUtils]: 103: Hoare triple {31289#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:42,041 INFO L273 TraceCheckUtils]: 104: Hoare triple {31289#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:42,042 INFO L273 TraceCheckUtils]: 105: Hoare triple {31290#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:42,042 INFO L273 TraceCheckUtils]: 106: Hoare triple {31290#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:42,043 INFO L273 TraceCheckUtils]: 107: Hoare triple {31290#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:42,043 INFO L273 TraceCheckUtils]: 108: Hoare triple {31291#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:42,044 INFO L273 TraceCheckUtils]: 109: Hoare triple {31291#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:42,044 INFO L273 TraceCheckUtils]: 110: Hoare triple {31291#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:42,045 INFO L273 TraceCheckUtils]: 111: Hoare triple {31292#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:42,045 INFO L273 TraceCheckUtils]: 112: Hoare triple {31292#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:42,046 INFO L273 TraceCheckUtils]: 113: Hoare triple {31292#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:42,047 INFO L273 TraceCheckUtils]: 114: Hoare triple {31293#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:42,047 INFO L273 TraceCheckUtils]: 115: Hoare triple {31293#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:42,048 INFO L273 TraceCheckUtils]: 116: Hoare triple {31293#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:42,048 INFO L273 TraceCheckUtils]: 117: Hoare triple {31294#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:42,049 INFO L273 TraceCheckUtils]: 118: Hoare triple {31294#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:42,050 INFO L273 TraceCheckUtils]: 119: Hoare triple {31294#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:42,050 INFO L273 TraceCheckUtils]: 120: Hoare triple {31295#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:42,051 INFO L273 TraceCheckUtils]: 121: Hoare triple {31295#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:42,051 INFO L273 TraceCheckUtils]: 122: Hoare triple {31295#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:42,052 INFO L273 TraceCheckUtils]: 123: Hoare triple {31296#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:42,052 INFO L273 TraceCheckUtils]: 124: Hoare triple {31296#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:42,053 INFO L273 TraceCheckUtils]: 125: Hoare triple {31296#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:42,054 INFO L273 TraceCheckUtils]: 126: Hoare triple {31297#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:42,054 INFO L273 TraceCheckUtils]: 127: Hoare triple {31297#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:42,055 INFO L273 TraceCheckUtils]: 128: Hoare triple {31297#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:42,055 INFO L273 TraceCheckUtils]: 129: Hoare triple {31298#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:42,056 INFO L273 TraceCheckUtils]: 130: Hoare triple {31298#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:42,056 INFO L273 TraceCheckUtils]: 131: Hoare triple {31298#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:42,057 INFO L273 TraceCheckUtils]: 132: Hoare triple {31299#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:42,057 INFO L273 TraceCheckUtils]: 133: Hoare triple {31299#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:42,058 INFO L273 TraceCheckUtils]: 134: Hoare triple {31299#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:42,059 INFO L273 TraceCheckUtils]: 135: Hoare triple {31300#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:42,059 INFO L273 TraceCheckUtils]: 136: Hoare triple {31300#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:42,060 INFO L273 TraceCheckUtils]: 137: Hoare triple {31300#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:42,060 INFO L273 TraceCheckUtils]: 138: Hoare triple {31301#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:42,061 INFO L273 TraceCheckUtils]: 139: Hoare triple {31301#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:42,062 INFO L273 TraceCheckUtils]: 140: Hoare triple {31301#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {31302#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:42,062 INFO L273 TraceCheckUtils]: 141: Hoare triple {31302#(<= main_~i~0 45)} assume !(~i~0 < 100000); {31256#false} is VALID [2018-11-23 12:06:42,062 INFO L273 TraceCheckUtils]: 142: Hoare triple {31256#false} havoc ~x~0;~x~0 := 0; {31256#false} is VALID [2018-11-23 12:06:42,063 INFO L273 TraceCheckUtils]: 143: Hoare triple {31256#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {31256#false} is VALID [2018-11-23 12:06:42,063 INFO L256 TraceCheckUtils]: 144: Hoare triple {31256#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {31256#false} is VALID [2018-11-23 12:06:42,063 INFO L273 TraceCheckUtils]: 145: Hoare triple {31256#false} ~cond := #in~cond; {31256#false} is VALID [2018-11-23 12:06:42,063 INFO L273 TraceCheckUtils]: 146: Hoare triple {31256#false} assume 0 == ~cond; {31256#false} is VALID [2018-11-23 12:06:42,063 INFO L273 TraceCheckUtils]: 147: Hoare triple {31256#false} assume !false; {31256#false} is VALID [2018-11-23 12:06:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:42,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:42,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-11-23 12:06:42,106 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 148 [2018-11-23 12:06:42,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:42,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:06:42,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:42,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:06:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:06:42,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:06:42,320 INFO L87 Difference]: Start difference. First operand 153 states and 199 transitions. Second operand 49 states. [2018-11-23 12:06:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:42,892 INFO L93 Difference]: Finished difference Result 169 states and 218 transitions. [2018-11-23 12:06:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:06:42,892 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 148 [2018-11-23 12:06:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:06:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2018-11-23 12:06:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:06:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2018-11-23 12:06:42,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 218 transitions. [2018-11-23 12:06:43,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:43,088 INFO L225 Difference]: With dead ends: 169 [2018-11-23 12:06:43,088 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 12:06:43,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:06:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 12:06:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-11-23 12:06:43,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:43,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 156 states. [2018-11-23 12:06:43,127 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 156 states. [2018-11-23 12:06:43,127 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 156 states. [2018-11-23 12:06:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:43,129 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2018-11-23 12:06:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2018-11-23 12:06:43,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:43,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:43,129 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 158 states. [2018-11-23 12:06:43,129 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 158 states. [2018-11-23 12:06:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:43,132 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2018-11-23 12:06:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2018-11-23 12:06:43,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:43,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:43,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:43,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 12:06:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2018-11-23 12:06:43,136 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 148 [2018-11-23 12:06:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:43,136 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2018-11-23 12:06:43,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:06:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 12:06:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 12:06:43,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:43,137 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:43,137 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:43,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:43,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1494294791, now seen corresponding path program 46 times [2018-11-23 12:06:43,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:43,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:43,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:43,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:43,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:44,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {32499#true} call ULTIMATE.init(); {32499#true} is VALID [2018-11-23 12:06:44,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {32499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32499#true} is VALID [2018-11-23 12:06:44,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {32499#true} assume true; {32499#true} is VALID [2018-11-23 12:06:44,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32499#true} {32499#true} #55#return; {32499#true} is VALID [2018-11-23 12:06:44,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {32499#true} call #t~ret4 := main(); {32499#true} is VALID [2018-11-23 12:06:44,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {32499#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {32501#(= main_~i~0 0)} is VALID [2018-11-23 12:06:44,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {32501#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32501#(= main_~i~0 0)} is VALID [2018-11-23 12:06:44,585 INFO L273 TraceCheckUtils]: 7: Hoare triple {32501#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32501#(= main_~i~0 0)} is VALID [2018-11-23 12:06:44,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {32501#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:44,586 INFO L273 TraceCheckUtils]: 9: Hoare triple {32502#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:44,586 INFO L273 TraceCheckUtils]: 10: Hoare triple {32502#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:44,587 INFO L273 TraceCheckUtils]: 11: Hoare triple {32502#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:44,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {32503#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:44,588 INFO L273 TraceCheckUtils]: 13: Hoare triple {32503#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:44,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {32503#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:44,589 INFO L273 TraceCheckUtils]: 15: Hoare triple {32504#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:44,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {32504#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:44,590 INFO L273 TraceCheckUtils]: 17: Hoare triple {32504#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:44,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {32505#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:44,591 INFO L273 TraceCheckUtils]: 19: Hoare triple {32505#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:44,592 INFO L273 TraceCheckUtils]: 20: Hoare triple {32505#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:44,592 INFO L273 TraceCheckUtils]: 21: Hoare triple {32506#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:44,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {32506#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:44,594 INFO L273 TraceCheckUtils]: 23: Hoare triple {32506#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:44,594 INFO L273 TraceCheckUtils]: 24: Hoare triple {32507#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:44,595 INFO L273 TraceCheckUtils]: 25: Hoare triple {32507#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:44,595 INFO L273 TraceCheckUtils]: 26: Hoare triple {32507#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:44,596 INFO L273 TraceCheckUtils]: 27: Hoare triple {32508#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:44,596 INFO L273 TraceCheckUtils]: 28: Hoare triple {32508#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:44,597 INFO L273 TraceCheckUtils]: 29: Hoare triple {32508#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:44,597 INFO L273 TraceCheckUtils]: 30: Hoare triple {32509#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:44,598 INFO L273 TraceCheckUtils]: 31: Hoare triple {32509#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:44,598 INFO L273 TraceCheckUtils]: 32: Hoare triple {32509#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:44,599 INFO L273 TraceCheckUtils]: 33: Hoare triple {32510#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:44,599 INFO L273 TraceCheckUtils]: 34: Hoare triple {32510#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:44,600 INFO L273 TraceCheckUtils]: 35: Hoare triple {32510#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:44,600 INFO L273 TraceCheckUtils]: 36: Hoare triple {32511#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:44,601 INFO L273 TraceCheckUtils]: 37: Hoare triple {32511#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:44,602 INFO L273 TraceCheckUtils]: 38: Hoare triple {32511#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:44,602 INFO L273 TraceCheckUtils]: 39: Hoare triple {32512#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:44,603 INFO L273 TraceCheckUtils]: 40: Hoare triple {32512#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:44,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {32512#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:44,604 INFO L273 TraceCheckUtils]: 42: Hoare triple {32513#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:44,604 INFO L273 TraceCheckUtils]: 43: Hoare triple {32513#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:44,605 INFO L273 TraceCheckUtils]: 44: Hoare triple {32513#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:44,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {32514#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:44,606 INFO L273 TraceCheckUtils]: 46: Hoare triple {32514#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:44,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {32514#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:44,607 INFO L273 TraceCheckUtils]: 48: Hoare triple {32515#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:44,607 INFO L273 TraceCheckUtils]: 49: Hoare triple {32515#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:44,608 INFO L273 TraceCheckUtils]: 50: Hoare triple {32515#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:44,608 INFO L273 TraceCheckUtils]: 51: Hoare triple {32516#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:44,609 INFO L273 TraceCheckUtils]: 52: Hoare triple {32516#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:44,610 INFO L273 TraceCheckUtils]: 53: Hoare triple {32516#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:44,610 INFO L273 TraceCheckUtils]: 54: Hoare triple {32517#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:44,611 INFO L273 TraceCheckUtils]: 55: Hoare triple {32517#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:44,611 INFO L273 TraceCheckUtils]: 56: Hoare triple {32517#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:44,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {32518#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:44,612 INFO L273 TraceCheckUtils]: 58: Hoare triple {32518#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:44,613 INFO L273 TraceCheckUtils]: 59: Hoare triple {32518#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:44,613 INFO L273 TraceCheckUtils]: 60: Hoare triple {32519#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:44,614 INFO L273 TraceCheckUtils]: 61: Hoare triple {32519#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:44,614 INFO L273 TraceCheckUtils]: 62: Hoare triple {32519#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:44,615 INFO L273 TraceCheckUtils]: 63: Hoare triple {32520#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:44,615 INFO L273 TraceCheckUtils]: 64: Hoare triple {32520#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:44,616 INFO L273 TraceCheckUtils]: 65: Hoare triple {32520#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:44,617 INFO L273 TraceCheckUtils]: 66: Hoare triple {32521#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:44,617 INFO L273 TraceCheckUtils]: 67: Hoare triple {32521#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:44,618 INFO L273 TraceCheckUtils]: 68: Hoare triple {32521#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:44,618 INFO L273 TraceCheckUtils]: 69: Hoare triple {32522#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:44,619 INFO L273 TraceCheckUtils]: 70: Hoare triple {32522#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:44,619 INFO L273 TraceCheckUtils]: 71: Hoare triple {32522#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:44,620 INFO L273 TraceCheckUtils]: 72: Hoare triple {32523#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:44,620 INFO L273 TraceCheckUtils]: 73: Hoare triple {32523#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:44,621 INFO L273 TraceCheckUtils]: 74: Hoare triple {32523#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:44,621 INFO L273 TraceCheckUtils]: 75: Hoare triple {32524#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:44,622 INFO L273 TraceCheckUtils]: 76: Hoare triple {32524#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:44,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {32524#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:44,623 INFO L273 TraceCheckUtils]: 78: Hoare triple {32525#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:44,623 INFO L273 TraceCheckUtils]: 79: Hoare triple {32525#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:44,624 INFO L273 TraceCheckUtils]: 80: Hoare triple {32525#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:44,625 INFO L273 TraceCheckUtils]: 81: Hoare triple {32526#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:44,625 INFO L273 TraceCheckUtils]: 82: Hoare triple {32526#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:44,626 INFO L273 TraceCheckUtils]: 83: Hoare triple {32526#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:44,626 INFO L273 TraceCheckUtils]: 84: Hoare triple {32527#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:44,627 INFO L273 TraceCheckUtils]: 85: Hoare triple {32527#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:44,627 INFO L273 TraceCheckUtils]: 86: Hoare triple {32527#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:44,628 INFO L273 TraceCheckUtils]: 87: Hoare triple {32528#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:44,628 INFO L273 TraceCheckUtils]: 88: Hoare triple {32528#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:44,629 INFO L273 TraceCheckUtils]: 89: Hoare triple {32528#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:44,629 INFO L273 TraceCheckUtils]: 90: Hoare triple {32529#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:44,630 INFO L273 TraceCheckUtils]: 91: Hoare triple {32529#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:44,630 INFO L273 TraceCheckUtils]: 92: Hoare triple {32529#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:44,631 INFO L273 TraceCheckUtils]: 93: Hoare triple {32530#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:44,631 INFO L273 TraceCheckUtils]: 94: Hoare triple {32530#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:44,632 INFO L273 TraceCheckUtils]: 95: Hoare triple {32530#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:44,633 INFO L273 TraceCheckUtils]: 96: Hoare triple {32531#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:44,633 INFO L273 TraceCheckUtils]: 97: Hoare triple {32531#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:44,634 INFO L273 TraceCheckUtils]: 98: Hoare triple {32531#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:44,634 INFO L273 TraceCheckUtils]: 99: Hoare triple {32532#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:44,635 INFO L273 TraceCheckUtils]: 100: Hoare triple {32532#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:44,635 INFO L273 TraceCheckUtils]: 101: Hoare triple {32532#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:44,636 INFO L273 TraceCheckUtils]: 102: Hoare triple {32533#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:44,636 INFO L273 TraceCheckUtils]: 103: Hoare triple {32533#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:44,637 INFO L273 TraceCheckUtils]: 104: Hoare triple {32533#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:44,637 INFO L273 TraceCheckUtils]: 105: Hoare triple {32534#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:44,638 INFO L273 TraceCheckUtils]: 106: Hoare triple {32534#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:44,638 INFO L273 TraceCheckUtils]: 107: Hoare triple {32534#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:44,639 INFO L273 TraceCheckUtils]: 108: Hoare triple {32535#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:44,639 INFO L273 TraceCheckUtils]: 109: Hoare triple {32535#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:44,640 INFO L273 TraceCheckUtils]: 110: Hoare triple {32535#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:44,641 INFO L273 TraceCheckUtils]: 111: Hoare triple {32536#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:44,641 INFO L273 TraceCheckUtils]: 112: Hoare triple {32536#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:44,642 INFO L273 TraceCheckUtils]: 113: Hoare triple {32536#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:44,642 INFO L273 TraceCheckUtils]: 114: Hoare triple {32537#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:44,643 INFO L273 TraceCheckUtils]: 115: Hoare triple {32537#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:44,643 INFO L273 TraceCheckUtils]: 116: Hoare triple {32537#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:44,644 INFO L273 TraceCheckUtils]: 117: Hoare triple {32538#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:44,644 INFO L273 TraceCheckUtils]: 118: Hoare triple {32538#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:44,645 INFO L273 TraceCheckUtils]: 119: Hoare triple {32538#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:44,645 INFO L273 TraceCheckUtils]: 120: Hoare triple {32539#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:44,646 INFO L273 TraceCheckUtils]: 121: Hoare triple {32539#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:44,647 INFO L273 TraceCheckUtils]: 122: Hoare triple {32539#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:44,647 INFO L273 TraceCheckUtils]: 123: Hoare triple {32540#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:44,647 INFO L273 TraceCheckUtils]: 124: Hoare triple {32540#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:44,648 INFO L273 TraceCheckUtils]: 125: Hoare triple {32540#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:44,649 INFO L273 TraceCheckUtils]: 126: Hoare triple {32541#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:44,649 INFO L273 TraceCheckUtils]: 127: Hoare triple {32541#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:44,650 INFO L273 TraceCheckUtils]: 128: Hoare triple {32541#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:44,650 INFO L273 TraceCheckUtils]: 129: Hoare triple {32542#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:44,651 INFO L273 TraceCheckUtils]: 130: Hoare triple {32542#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:44,651 INFO L273 TraceCheckUtils]: 131: Hoare triple {32542#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:44,652 INFO L273 TraceCheckUtils]: 132: Hoare triple {32543#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:44,652 INFO L273 TraceCheckUtils]: 133: Hoare triple {32543#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:44,653 INFO L273 TraceCheckUtils]: 134: Hoare triple {32543#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:44,653 INFO L273 TraceCheckUtils]: 135: Hoare triple {32544#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:44,654 INFO L273 TraceCheckUtils]: 136: Hoare triple {32544#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:44,655 INFO L273 TraceCheckUtils]: 137: Hoare triple {32544#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:44,655 INFO L273 TraceCheckUtils]: 138: Hoare triple {32545#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:44,656 INFO L273 TraceCheckUtils]: 139: Hoare triple {32545#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:44,656 INFO L273 TraceCheckUtils]: 140: Hoare triple {32545#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:44,657 INFO L273 TraceCheckUtils]: 141: Hoare triple {32546#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:44,657 INFO L273 TraceCheckUtils]: 142: Hoare triple {32546#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:44,658 INFO L273 TraceCheckUtils]: 143: Hoare triple {32546#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {32547#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:44,659 INFO L273 TraceCheckUtils]: 144: Hoare triple {32547#(<= main_~i~0 46)} assume !(~i~0 < 100000); {32500#false} is VALID [2018-11-23 12:06:44,659 INFO L273 TraceCheckUtils]: 145: Hoare triple {32500#false} havoc ~x~0;~x~0 := 0; {32500#false} is VALID [2018-11-23 12:06:44,659 INFO L273 TraceCheckUtils]: 146: Hoare triple {32500#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {32500#false} is VALID [2018-11-23 12:06:44,659 INFO L256 TraceCheckUtils]: 147: Hoare triple {32500#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {32500#false} is VALID [2018-11-23 12:06:44,659 INFO L273 TraceCheckUtils]: 148: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2018-11-23 12:06:44,659 INFO L273 TraceCheckUtils]: 149: Hoare triple {32500#false} assume 0 == ~cond; {32500#false} is VALID [2018-11-23 12:06:44,660 INFO L273 TraceCheckUtils]: 150: Hoare triple {32500#false} assume !false; {32500#false} is VALID [2018-11-23 12:06:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:44,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:44,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:44,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:44,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:44,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:44,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:45,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {32499#true} call ULTIMATE.init(); {32499#true} is VALID [2018-11-23 12:06:45,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {32499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32499#true} is VALID [2018-11-23 12:06:45,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {32499#true} assume true; {32499#true} is VALID [2018-11-23 12:06:45,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32499#true} {32499#true} #55#return; {32499#true} is VALID [2018-11-23 12:06:45,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {32499#true} call #t~ret4 := main(); {32499#true} is VALID [2018-11-23 12:06:45,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {32499#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {32566#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:45,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {32566#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32566#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:45,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {32566#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32566#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:45,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {32566#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {32502#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {32502#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {32502#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {32503#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {32503#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {32503#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {32504#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {32504#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {32504#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {32505#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {32505#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {32505#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {32506#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {32506#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {32506#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {32507#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {32507#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,125 INFO L273 TraceCheckUtils]: 26: Hoare triple {32507#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {32508#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,126 INFO L273 TraceCheckUtils]: 28: Hoare triple {32508#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,126 INFO L273 TraceCheckUtils]: 29: Hoare triple {32508#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {32509#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,127 INFO L273 TraceCheckUtils]: 31: Hoare triple {32509#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,128 INFO L273 TraceCheckUtils]: 32: Hoare triple {32509#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,128 INFO L273 TraceCheckUtils]: 33: Hoare triple {32510#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,129 INFO L273 TraceCheckUtils]: 34: Hoare triple {32510#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,129 INFO L273 TraceCheckUtils]: 35: Hoare triple {32510#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,130 INFO L273 TraceCheckUtils]: 36: Hoare triple {32511#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,130 INFO L273 TraceCheckUtils]: 37: Hoare triple {32511#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,131 INFO L273 TraceCheckUtils]: 38: Hoare triple {32511#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,132 INFO L273 TraceCheckUtils]: 39: Hoare triple {32512#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,132 INFO L273 TraceCheckUtils]: 40: Hoare triple {32512#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,133 INFO L273 TraceCheckUtils]: 41: Hoare triple {32512#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,133 INFO L273 TraceCheckUtils]: 42: Hoare triple {32513#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {32513#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {32513#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:45,135 INFO L273 TraceCheckUtils]: 45: Hoare triple {32514#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:45,135 INFO L273 TraceCheckUtils]: 46: Hoare triple {32514#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:45,136 INFO L273 TraceCheckUtils]: 47: Hoare triple {32514#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:45,136 INFO L273 TraceCheckUtils]: 48: Hoare triple {32515#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:45,137 INFO L273 TraceCheckUtils]: 49: Hoare triple {32515#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:45,137 INFO L273 TraceCheckUtils]: 50: Hoare triple {32515#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:45,138 INFO L273 TraceCheckUtils]: 51: Hoare triple {32516#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:45,138 INFO L273 TraceCheckUtils]: 52: Hoare triple {32516#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:45,139 INFO L273 TraceCheckUtils]: 53: Hoare triple {32516#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:45,140 INFO L273 TraceCheckUtils]: 54: Hoare triple {32517#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:45,140 INFO L273 TraceCheckUtils]: 55: Hoare triple {32517#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:45,141 INFO L273 TraceCheckUtils]: 56: Hoare triple {32517#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:45,141 INFO L273 TraceCheckUtils]: 57: Hoare triple {32518#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:45,142 INFO L273 TraceCheckUtils]: 58: Hoare triple {32518#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:45,142 INFO L273 TraceCheckUtils]: 59: Hoare triple {32518#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:45,143 INFO L273 TraceCheckUtils]: 60: Hoare triple {32519#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:45,143 INFO L273 TraceCheckUtils]: 61: Hoare triple {32519#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:45,144 INFO L273 TraceCheckUtils]: 62: Hoare triple {32519#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:45,145 INFO L273 TraceCheckUtils]: 63: Hoare triple {32520#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:45,145 INFO L273 TraceCheckUtils]: 64: Hoare triple {32520#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:45,146 INFO L273 TraceCheckUtils]: 65: Hoare triple {32520#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:45,146 INFO L273 TraceCheckUtils]: 66: Hoare triple {32521#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:45,147 INFO L273 TraceCheckUtils]: 67: Hoare triple {32521#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:45,147 INFO L273 TraceCheckUtils]: 68: Hoare triple {32521#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:45,148 INFO L273 TraceCheckUtils]: 69: Hoare triple {32522#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:45,148 INFO L273 TraceCheckUtils]: 70: Hoare triple {32522#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:45,149 INFO L273 TraceCheckUtils]: 71: Hoare triple {32522#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:45,149 INFO L273 TraceCheckUtils]: 72: Hoare triple {32523#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:45,150 INFO L273 TraceCheckUtils]: 73: Hoare triple {32523#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:45,150 INFO L273 TraceCheckUtils]: 74: Hoare triple {32523#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:45,151 INFO L273 TraceCheckUtils]: 75: Hoare triple {32524#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:45,151 INFO L273 TraceCheckUtils]: 76: Hoare triple {32524#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:45,152 INFO L273 TraceCheckUtils]: 77: Hoare triple {32524#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:45,153 INFO L273 TraceCheckUtils]: 78: Hoare triple {32525#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:45,153 INFO L273 TraceCheckUtils]: 79: Hoare triple {32525#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:45,154 INFO L273 TraceCheckUtils]: 80: Hoare triple {32525#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:45,154 INFO L273 TraceCheckUtils]: 81: Hoare triple {32526#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:45,155 INFO L273 TraceCheckUtils]: 82: Hoare triple {32526#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:45,155 INFO L273 TraceCheckUtils]: 83: Hoare triple {32526#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:45,156 INFO L273 TraceCheckUtils]: 84: Hoare triple {32527#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:45,156 INFO L273 TraceCheckUtils]: 85: Hoare triple {32527#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:45,157 INFO L273 TraceCheckUtils]: 86: Hoare triple {32527#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:45,157 INFO L273 TraceCheckUtils]: 87: Hoare triple {32528#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:45,158 INFO L273 TraceCheckUtils]: 88: Hoare triple {32528#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:45,158 INFO L273 TraceCheckUtils]: 89: Hoare triple {32528#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:45,159 INFO L273 TraceCheckUtils]: 90: Hoare triple {32529#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:45,159 INFO L273 TraceCheckUtils]: 91: Hoare triple {32529#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:45,160 INFO L273 TraceCheckUtils]: 92: Hoare triple {32529#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:45,161 INFO L273 TraceCheckUtils]: 93: Hoare triple {32530#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:45,161 INFO L273 TraceCheckUtils]: 94: Hoare triple {32530#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:45,162 INFO L273 TraceCheckUtils]: 95: Hoare triple {32530#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:45,162 INFO L273 TraceCheckUtils]: 96: Hoare triple {32531#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:45,163 INFO L273 TraceCheckUtils]: 97: Hoare triple {32531#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:45,163 INFO L273 TraceCheckUtils]: 98: Hoare triple {32531#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:45,164 INFO L273 TraceCheckUtils]: 99: Hoare triple {32532#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:45,164 INFO L273 TraceCheckUtils]: 100: Hoare triple {32532#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:45,165 INFO L273 TraceCheckUtils]: 101: Hoare triple {32532#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:45,165 INFO L273 TraceCheckUtils]: 102: Hoare triple {32533#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:45,166 INFO L273 TraceCheckUtils]: 103: Hoare triple {32533#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:45,167 INFO L273 TraceCheckUtils]: 104: Hoare triple {32533#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:45,167 INFO L273 TraceCheckUtils]: 105: Hoare triple {32534#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:45,167 INFO L273 TraceCheckUtils]: 106: Hoare triple {32534#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:45,168 INFO L273 TraceCheckUtils]: 107: Hoare triple {32534#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:45,169 INFO L273 TraceCheckUtils]: 108: Hoare triple {32535#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:45,169 INFO L273 TraceCheckUtils]: 109: Hoare triple {32535#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:45,170 INFO L273 TraceCheckUtils]: 110: Hoare triple {32535#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:45,170 INFO L273 TraceCheckUtils]: 111: Hoare triple {32536#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:45,171 INFO L273 TraceCheckUtils]: 112: Hoare triple {32536#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:45,171 INFO L273 TraceCheckUtils]: 113: Hoare triple {32536#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:45,172 INFO L273 TraceCheckUtils]: 114: Hoare triple {32537#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:45,172 INFO L273 TraceCheckUtils]: 115: Hoare triple {32537#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:45,173 INFO L273 TraceCheckUtils]: 116: Hoare triple {32537#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:45,173 INFO L273 TraceCheckUtils]: 117: Hoare triple {32538#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:45,174 INFO L273 TraceCheckUtils]: 118: Hoare triple {32538#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:45,175 INFO L273 TraceCheckUtils]: 119: Hoare triple {32538#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:45,175 INFO L273 TraceCheckUtils]: 120: Hoare triple {32539#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:45,175 INFO L273 TraceCheckUtils]: 121: Hoare triple {32539#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:45,176 INFO L273 TraceCheckUtils]: 122: Hoare triple {32539#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:45,177 INFO L273 TraceCheckUtils]: 123: Hoare triple {32540#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:45,177 INFO L273 TraceCheckUtils]: 124: Hoare triple {32540#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:45,178 INFO L273 TraceCheckUtils]: 125: Hoare triple {32540#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:45,178 INFO L273 TraceCheckUtils]: 126: Hoare triple {32541#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:45,179 INFO L273 TraceCheckUtils]: 127: Hoare triple {32541#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:45,179 INFO L273 TraceCheckUtils]: 128: Hoare triple {32541#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:45,180 INFO L273 TraceCheckUtils]: 129: Hoare triple {32542#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:45,180 INFO L273 TraceCheckUtils]: 130: Hoare triple {32542#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:45,181 INFO L273 TraceCheckUtils]: 131: Hoare triple {32542#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:45,181 INFO L273 TraceCheckUtils]: 132: Hoare triple {32543#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:45,182 INFO L273 TraceCheckUtils]: 133: Hoare triple {32543#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:45,183 INFO L273 TraceCheckUtils]: 134: Hoare triple {32543#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:45,183 INFO L273 TraceCheckUtils]: 135: Hoare triple {32544#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:45,183 INFO L273 TraceCheckUtils]: 136: Hoare triple {32544#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:45,184 INFO L273 TraceCheckUtils]: 137: Hoare triple {32544#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:45,185 INFO L273 TraceCheckUtils]: 138: Hoare triple {32545#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:45,185 INFO L273 TraceCheckUtils]: 139: Hoare triple {32545#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:45,186 INFO L273 TraceCheckUtils]: 140: Hoare triple {32545#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:45,186 INFO L273 TraceCheckUtils]: 141: Hoare triple {32546#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:45,187 INFO L273 TraceCheckUtils]: 142: Hoare triple {32546#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:45,187 INFO L273 TraceCheckUtils]: 143: Hoare triple {32546#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {32547#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:45,188 INFO L273 TraceCheckUtils]: 144: Hoare triple {32547#(<= main_~i~0 46)} assume !(~i~0 < 100000); {32500#false} is VALID [2018-11-23 12:06:45,188 INFO L273 TraceCheckUtils]: 145: Hoare triple {32500#false} havoc ~x~0;~x~0 := 0; {32500#false} is VALID [2018-11-23 12:06:45,188 INFO L273 TraceCheckUtils]: 146: Hoare triple {32500#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {32500#false} is VALID [2018-11-23 12:06:45,189 INFO L256 TraceCheckUtils]: 147: Hoare triple {32500#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {32500#false} is VALID [2018-11-23 12:06:45,189 INFO L273 TraceCheckUtils]: 148: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2018-11-23 12:06:45,189 INFO L273 TraceCheckUtils]: 149: Hoare triple {32500#false} assume 0 == ~cond; {32500#false} is VALID [2018-11-23 12:06:45,189 INFO L273 TraceCheckUtils]: 150: Hoare triple {32500#false} assume !false; {32500#false} is VALID [2018-11-23 12:06:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:45,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:45,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2018-11-23 12:06:45,224 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 151 [2018-11-23 12:06:45,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:45,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:06:45,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:45,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:06:45,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:06:45,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:06:45,365 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand 50 states. [2018-11-23 12:06:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:46,233 INFO L93 Difference]: Finished difference Result 172 states and 222 transitions. [2018-11-23 12:06:46,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:06:46,233 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 151 [2018-11-23 12:06:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:06:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 222 transitions. [2018-11-23 12:06:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:06:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 222 transitions. [2018-11-23 12:06:46,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 222 transitions. [2018-11-23 12:06:46,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:46,442 INFO L225 Difference]: With dead ends: 172 [2018-11-23 12:06:46,443 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 12:06:46,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:06:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 12:06:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-11-23 12:06:46,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:46,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 159 states. [2018-11-23 12:06:46,526 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 159 states. [2018-11-23 12:06:46,527 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 159 states. [2018-11-23 12:06:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:46,529 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2018-11-23 12:06:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 12:06:46,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:46,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:46,529 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 161 states. [2018-11-23 12:06:46,529 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 161 states. [2018-11-23 12:06:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:46,532 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2018-11-23 12:06:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 12:06:46,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:46,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:46,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:46,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 12:06:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 207 transitions. [2018-11-23 12:06:46,535 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 207 transitions. Word has length 151 [2018-11-23 12:06:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:46,536 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 207 transitions. [2018-11-23 12:06:46,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:06:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 207 transitions. [2018-11-23 12:06:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 12:06:46,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:46,537 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:46,537 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:46,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:46,537 INFO L82 PathProgramCache]: Analyzing trace with hash -154729821, now seen corresponding path program 47 times [2018-11-23 12:06:46,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:46,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:46,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:47,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {33767#true} call ULTIMATE.init(); {33767#true} is VALID [2018-11-23 12:06:47,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {33767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33767#true} is VALID [2018-11-23 12:06:47,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {33767#true} assume true; {33767#true} is VALID [2018-11-23 12:06:47,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33767#true} {33767#true} #55#return; {33767#true} is VALID [2018-11-23 12:06:47,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {33767#true} call #t~ret4 := main(); {33767#true} is VALID [2018-11-23 12:06:47,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {33767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {33769#(= main_~i~0 0)} is VALID [2018-11-23 12:06:47,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {33769#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33769#(= main_~i~0 0)} is VALID [2018-11-23 12:06:47,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {33769#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33769#(= main_~i~0 0)} is VALID [2018-11-23 12:06:47,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {33769#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:47,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {33770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:47,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {33770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:47,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {33770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:47,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {33771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:47,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {33771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:47,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {33771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:47,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {33772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:47,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {33772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:47,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {33772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:47,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {33773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:47,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {33773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:47,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {33773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:47,884 INFO L273 TraceCheckUtils]: 21: Hoare triple {33774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:47,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {33774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:47,885 INFO L273 TraceCheckUtils]: 23: Hoare triple {33774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:47,885 INFO L273 TraceCheckUtils]: 24: Hoare triple {33775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:47,886 INFO L273 TraceCheckUtils]: 25: Hoare triple {33775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:47,886 INFO L273 TraceCheckUtils]: 26: Hoare triple {33775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:47,887 INFO L273 TraceCheckUtils]: 27: Hoare triple {33776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:47,887 INFO L273 TraceCheckUtils]: 28: Hoare triple {33776#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:47,888 INFO L273 TraceCheckUtils]: 29: Hoare triple {33776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:47,888 INFO L273 TraceCheckUtils]: 30: Hoare triple {33777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:47,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {33777#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:47,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {33777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:47,890 INFO L273 TraceCheckUtils]: 33: Hoare triple {33778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:47,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {33778#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:47,891 INFO L273 TraceCheckUtils]: 35: Hoare triple {33778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:47,892 INFO L273 TraceCheckUtils]: 36: Hoare triple {33779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:47,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {33779#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:47,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {33779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:47,893 INFO L273 TraceCheckUtils]: 39: Hoare triple {33780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:47,894 INFO L273 TraceCheckUtils]: 40: Hoare triple {33780#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:47,894 INFO L273 TraceCheckUtils]: 41: Hoare triple {33780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:47,895 INFO L273 TraceCheckUtils]: 42: Hoare triple {33781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:47,895 INFO L273 TraceCheckUtils]: 43: Hoare triple {33781#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:47,896 INFO L273 TraceCheckUtils]: 44: Hoare triple {33781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:47,896 INFO L273 TraceCheckUtils]: 45: Hoare triple {33782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:47,897 INFO L273 TraceCheckUtils]: 46: Hoare triple {33782#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:47,897 INFO L273 TraceCheckUtils]: 47: Hoare triple {33782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:47,898 INFO L273 TraceCheckUtils]: 48: Hoare triple {33783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:47,898 INFO L273 TraceCheckUtils]: 49: Hoare triple {33783#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:47,899 INFO L273 TraceCheckUtils]: 50: Hoare triple {33783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:47,900 INFO L273 TraceCheckUtils]: 51: Hoare triple {33784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:47,900 INFO L273 TraceCheckUtils]: 52: Hoare triple {33784#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:47,901 INFO L273 TraceCheckUtils]: 53: Hoare triple {33784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:47,901 INFO L273 TraceCheckUtils]: 54: Hoare triple {33785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:47,902 INFO L273 TraceCheckUtils]: 55: Hoare triple {33785#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:47,902 INFO L273 TraceCheckUtils]: 56: Hoare triple {33785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:47,903 INFO L273 TraceCheckUtils]: 57: Hoare triple {33786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:47,903 INFO L273 TraceCheckUtils]: 58: Hoare triple {33786#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:47,904 INFO L273 TraceCheckUtils]: 59: Hoare triple {33786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:47,904 INFO L273 TraceCheckUtils]: 60: Hoare triple {33787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:47,905 INFO L273 TraceCheckUtils]: 61: Hoare triple {33787#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:47,905 INFO L273 TraceCheckUtils]: 62: Hoare triple {33787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:47,906 INFO L273 TraceCheckUtils]: 63: Hoare triple {33788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:47,906 INFO L273 TraceCheckUtils]: 64: Hoare triple {33788#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:47,907 INFO L273 TraceCheckUtils]: 65: Hoare triple {33788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:47,908 INFO L273 TraceCheckUtils]: 66: Hoare triple {33789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:47,908 INFO L273 TraceCheckUtils]: 67: Hoare triple {33789#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:47,909 INFO L273 TraceCheckUtils]: 68: Hoare triple {33789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:47,909 INFO L273 TraceCheckUtils]: 69: Hoare triple {33790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:47,910 INFO L273 TraceCheckUtils]: 70: Hoare triple {33790#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:47,910 INFO L273 TraceCheckUtils]: 71: Hoare triple {33790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:47,911 INFO L273 TraceCheckUtils]: 72: Hoare triple {33791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:47,911 INFO L273 TraceCheckUtils]: 73: Hoare triple {33791#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:47,912 INFO L273 TraceCheckUtils]: 74: Hoare triple {33791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:47,912 INFO L273 TraceCheckUtils]: 75: Hoare triple {33792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:47,913 INFO L273 TraceCheckUtils]: 76: Hoare triple {33792#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:47,913 INFO L273 TraceCheckUtils]: 77: Hoare triple {33792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:47,914 INFO L273 TraceCheckUtils]: 78: Hoare triple {33793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:47,914 INFO L273 TraceCheckUtils]: 79: Hoare triple {33793#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:47,915 INFO L273 TraceCheckUtils]: 80: Hoare triple {33793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:47,916 INFO L273 TraceCheckUtils]: 81: Hoare triple {33794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:47,916 INFO L273 TraceCheckUtils]: 82: Hoare triple {33794#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:47,917 INFO L273 TraceCheckUtils]: 83: Hoare triple {33794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:47,917 INFO L273 TraceCheckUtils]: 84: Hoare triple {33795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:47,918 INFO L273 TraceCheckUtils]: 85: Hoare triple {33795#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:47,919 INFO L273 TraceCheckUtils]: 86: Hoare triple {33795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:47,919 INFO L273 TraceCheckUtils]: 87: Hoare triple {33796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:47,920 INFO L273 TraceCheckUtils]: 88: Hoare triple {33796#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:47,920 INFO L273 TraceCheckUtils]: 89: Hoare triple {33796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:47,921 INFO L273 TraceCheckUtils]: 90: Hoare triple {33797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:47,921 INFO L273 TraceCheckUtils]: 91: Hoare triple {33797#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:47,922 INFO L273 TraceCheckUtils]: 92: Hoare triple {33797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:47,922 INFO L273 TraceCheckUtils]: 93: Hoare triple {33798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:47,923 INFO L273 TraceCheckUtils]: 94: Hoare triple {33798#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:47,924 INFO L273 TraceCheckUtils]: 95: Hoare triple {33798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:47,924 INFO L273 TraceCheckUtils]: 96: Hoare triple {33799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:47,924 INFO L273 TraceCheckUtils]: 97: Hoare triple {33799#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:47,925 INFO L273 TraceCheckUtils]: 98: Hoare triple {33799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:47,926 INFO L273 TraceCheckUtils]: 99: Hoare triple {33800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:47,926 INFO L273 TraceCheckUtils]: 100: Hoare triple {33800#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:47,927 INFO L273 TraceCheckUtils]: 101: Hoare triple {33800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:47,927 INFO L273 TraceCheckUtils]: 102: Hoare triple {33801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:47,928 INFO L273 TraceCheckUtils]: 103: Hoare triple {33801#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:47,928 INFO L273 TraceCheckUtils]: 104: Hoare triple {33801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:47,929 INFO L273 TraceCheckUtils]: 105: Hoare triple {33802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:47,929 INFO L273 TraceCheckUtils]: 106: Hoare triple {33802#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:47,930 INFO L273 TraceCheckUtils]: 107: Hoare triple {33802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:47,930 INFO L273 TraceCheckUtils]: 108: Hoare triple {33803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:47,931 INFO L273 TraceCheckUtils]: 109: Hoare triple {33803#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:47,932 INFO L273 TraceCheckUtils]: 110: Hoare triple {33803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:47,932 INFO L273 TraceCheckUtils]: 111: Hoare triple {33804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:47,933 INFO L273 TraceCheckUtils]: 112: Hoare triple {33804#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:47,933 INFO L273 TraceCheckUtils]: 113: Hoare triple {33804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:47,934 INFO L273 TraceCheckUtils]: 114: Hoare triple {33805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:47,934 INFO L273 TraceCheckUtils]: 115: Hoare triple {33805#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:47,935 INFO L273 TraceCheckUtils]: 116: Hoare triple {33805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:47,935 INFO L273 TraceCheckUtils]: 117: Hoare triple {33806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:47,936 INFO L273 TraceCheckUtils]: 118: Hoare triple {33806#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:47,936 INFO L273 TraceCheckUtils]: 119: Hoare triple {33806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:47,937 INFO L273 TraceCheckUtils]: 120: Hoare triple {33807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:47,937 INFO L273 TraceCheckUtils]: 121: Hoare triple {33807#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:47,938 INFO L273 TraceCheckUtils]: 122: Hoare triple {33807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:47,938 INFO L273 TraceCheckUtils]: 123: Hoare triple {33808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:47,939 INFO L273 TraceCheckUtils]: 124: Hoare triple {33808#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:47,940 INFO L273 TraceCheckUtils]: 125: Hoare triple {33808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:47,940 INFO L273 TraceCheckUtils]: 126: Hoare triple {33809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:47,941 INFO L273 TraceCheckUtils]: 127: Hoare triple {33809#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:47,941 INFO L273 TraceCheckUtils]: 128: Hoare triple {33809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:47,942 INFO L273 TraceCheckUtils]: 129: Hoare triple {33810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:47,942 INFO L273 TraceCheckUtils]: 130: Hoare triple {33810#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:47,943 INFO L273 TraceCheckUtils]: 131: Hoare triple {33810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:47,943 INFO L273 TraceCheckUtils]: 132: Hoare triple {33811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:47,944 INFO L273 TraceCheckUtils]: 133: Hoare triple {33811#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:47,944 INFO L273 TraceCheckUtils]: 134: Hoare triple {33811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:47,945 INFO L273 TraceCheckUtils]: 135: Hoare triple {33812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:47,945 INFO L273 TraceCheckUtils]: 136: Hoare triple {33812#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:47,946 INFO L273 TraceCheckUtils]: 137: Hoare triple {33812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:47,946 INFO L273 TraceCheckUtils]: 138: Hoare triple {33813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:47,947 INFO L273 TraceCheckUtils]: 139: Hoare triple {33813#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:47,948 INFO L273 TraceCheckUtils]: 140: Hoare triple {33813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:47,948 INFO L273 TraceCheckUtils]: 141: Hoare triple {33814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:47,949 INFO L273 TraceCheckUtils]: 142: Hoare triple {33814#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:47,949 INFO L273 TraceCheckUtils]: 143: Hoare triple {33814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:47,950 INFO L273 TraceCheckUtils]: 144: Hoare triple {33815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:47,950 INFO L273 TraceCheckUtils]: 145: Hoare triple {33815#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:47,951 INFO L273 TraceCheckUtils]: 146: Hoare triple {33815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {33816#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:47,951 INFO L273 TraceCheckUtils]: 147: Hoare triple {33816#(<= main_~i~0 47)} assume !(~i~0 < 100000); {33768#false} is VALID [2018-11-23 12:06:47,952 INFO L273 TraceCheckUtils]: 148: Hoare triple {33768#false} havoc ~x~0;~x~0 := 0; {33768#false} is VALID [2018-11-23 12:06:47,952 INFO L273 TraceCheckUtils]: 149: Hoare triple {33768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {33768#false} is VALID [2018-11-23 12:06:47,952 INFO L256 TraceCheckUtils]: 150: Hoare triple {33768#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {33768#false} is VALID [2018-11-23 12:06:47,952 INFO L273 TraceCheckUtils]: 151: Hoare triple {33768#false} ~cond := #in~cond; {33768#false} is VALID [2018-11-23 12:06:47,952 INFO L273 TraceCheckUtils]: 152: Hoare triple {33768#false} assume 0 == ~cond; {33768#false} is VALID [2018-11-23 12:06:47,952 INFO L273 TraceCheckUtils]: 153: Hoare triple {33768#false} assume !false; {33768#false} is VALID [2018-11-23 12:06:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:47,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:47,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:47,984 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:48,182 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-11-23 12:06:48,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:48,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:48,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {33767#true} call ULTIMATE.init(); {33767#true} is VALID [2018-11-23 12:06:48,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {33767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33767#true} is VALID [2018-11-23 12:06:48,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {33767#true} assume true; {33767#true} is VALID [2018-11-23 12:06:48,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33767#true} {33767#true} #55#return; {33767#true} is VALID [2018-11-23 12:06:48,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {33767#true} call #t~ret4 := main(); {33767#true} is VALID [2018-11-23 12:06:48,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {33767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {33835#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:48,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {33835#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33835#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:48,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {33835#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33835#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:48,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {33835#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {33770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {33770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {33770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {33771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {33771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {33771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,567 INFO L273 TraceCheckUtils]: 15: Hoare triple {33772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {33772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {33772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {33773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,569 INFO L273 TraceCheckUtils]: 19: Hoare triple {33773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,570 INFO L273 TraceCheckUtils]: 20: Hoare triple {33773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,571 INFO L273 TraceCheckUtils]: 21: Hoare triple {33774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {33774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {33774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {33775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,573 INFO L273 TraceCheckUtils]: 25: Hoare triple {33775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,573 INFO L273 TraceCheckUtils]: 26: Hoare triple {33775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,574 INFO L273 TraceCheckUtils]: 27: Hoare triple {33776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,574 INFO L273 TraceCheckUtils]: 28: Hoare triple {33776#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,575 INFO L273 TraceCheckUtils]: 29: Hoare triple {33776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {33777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,576 INFO L273 TraceCheckUtils]: 31: Hoare triple {33777#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,577 INFO L273 TraceCheckUtils]: 32: Hoare triple {33777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,577 INFO L273 TraceCheckUtils]: 33: Hoare triple {33778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,578 INFO L273 TraceCheckUtils]: 34: Hoare triple {33778#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,579 INFO L273 TraceCheckUtils]: 35: Hoare triple {33778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,579 INFO L273 TraceCheckUtils]: 36: Hoare triple {33779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {33779#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,580 INFO L273 TraceCheckUtils]: 38: Hoare triple {33779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,581 INFO L273 TraceCheckUtils]: 39: Hoare triple {33780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,581 INFO L273 TraceCheckUtils]: 40: Hoare triple {33780#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,582 INFO L273 TraceCheckUtils]: 41: Hoare triple {33780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,582 INFO L273 TraceCheckUtils]: 42: Hoare triple {33781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,583 INFO L273 TraceCheckUtils]: 43: Hoare triple {33781#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,584 INFO L273 TraceCheckUtils]: 44: Hoare triple {33781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,584 INFO L273 TraceCheckUtils]: 45: Hoare triple {33782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,585 INFO L273 TraceCheckUtils]: 46: Hoare triple {33782#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,585 INFO L273 TraceCheckUtils]: 47: Hoare triple {33782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,586 INFO L273 TraceCheckUtils]: 48: Hoare triple {33783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,586 INFO L273 TraceCheckUtils]: 49: Hoare triple {33783#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,587 INFO L273 TraceCheckUtils]: 50: Hoare triple {33783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,588 INFO L273 TraceCheckUtils]: 51: Hoare triple {33784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,588 INFO L273 TraceCheckUtils]: 52: Hoare triple {33784#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,589 INFO L273 TraceCheckUtils]: 53: Hoare triple {33784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,589 INFO L273 TraceCheckUtils]: 54: Hoare triple {33785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,590 INFO L273 TraceCheckUtils]: 55: Hoare triple {33785#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,590 INFO L273 TraceCheckUtils]: 56: Hoare triple {33785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,591 INFO L273 TraceCheckUtils]: 57: Hoare triple {33786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,591 INFO L273 TraceCheckUtils]: 58: Hoare triple {33786#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,592 INFO L273 TraceCheckUtils]: 59: Hoare triple {33786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,593 INFO L273 TraceCheckUtils]: 60: Hoare triple {33787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,593 INFO L273 TraceCheckUtils]: 61: Hoare triple {33787#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,594 INFO L273 TraceCheckUtils]: 62: Hoare triple {33787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,594 INFO L273 TraceCheckUtils]: 63: Hoare triple {33788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,595 INFO L273 TraceCheckUtils]: 64: Hoare triple {33788#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,596 INFO L273 TraceCheckUtils]: 65: Hoare triple {33788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,596 INFO L273 TraceCheckUtils]: 66: Hoare triple {33789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,597 INFO L273 TraceCheckUtils]: 67: Hoare triple {33789#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,597 INFO L273 TraceCheckUtils]: 68: Hoare triple {33789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,598 INFO L273 TraceCheckUtils]: 69: Hoare triple {33790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,598 INFO L273 TraceCheckUtils]: 70: Hoare triple {33790#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,599 INFO L273 TraceCheckUtils]: 71: Hoare triple {33790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,599 INFO L273 TraceCheckUtils]: 72: Hoare triple {33791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,600 INFO L273 TraceCheckUtils]: 73: Hoare triple {33791#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,601 INFO L273 TraceCheckUtils]: 74: Hoare triple {33791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,601 INFO L273 TraceCheckUtils]: 75: Hoare triple {33792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,602 INFO L273 TraceCheckUtils]: 76: Hoare triple {33792#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,602 INFO L273 TraceCheckUtils]: 77: Hoare triple {33792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,603 INFO L273 TraceCheckUtils]: 78: Hoare triple {33793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,603 INFO L273 TraceCheckUtils]: 79: Hoare triple {33793#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,604 INFO L273 TraceCheckUtils]: 80: Hoare triple {33793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,605 INFO L273 TraceCheckUtils]: 81: Hoare triple {33794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,605 INFO L273 TraceCheckUtils]: 82: Hoare triple {33794#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,606 INFO L273 TraceCheckUtils]: 83: Hoare triple {33794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,606 INFO L273 TraceCheckUtils]: 84: Hoare triple {33795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,607 INFO L273 TraceCheckUtils]: 85: Hoare triple {33795#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,607 INFO L273 TraceCheckUtils]: 86: Hoare triple {33795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,608 INFO L273 TraceCheckUtils]: 87: Hoare triple {33796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,608 INFO L273 TraceCheckUtils]: 88: Hoare triple {33796#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,609 INFO L273 TraceCheckUtils]: 89: Hoare triple {33796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,610 INFO L273 TraceCheckUtils]: 90: Hoare triple {33797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,610 INFO L273 TraceCheckUtils]: 91: Hoare triple {33797#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,611 INFO L273 TraceCheckUtils]: 92: Hoare triple {33797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,611 INFO L273 TraceCheckUtils]: 93: Hoare triple {33798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,612 INFO L273 TraceCheckUtils]: 94: Hoare triple {33798#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,613 INFO L273 TraceCheckUtils]: 95: Hoare triple {33798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:48,613 INFO L273 TraceCheckUtils]: 96: Hoare triple {33799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:48,614 INFO L273 TraceCheckUtils]: 97: Hoare triple {33799#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:48,614 INFO L273 TraceCheckUtils]: 98: Hoare triple {33799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:48,615 INFO L273 TraceCheckUtils]: 99: Hoare triple {33800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:48,615 INFO L273 TraceCheckUtils]: 100: Hoare triple {33800#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:48,616 INFO L273 TraceCheckUtils]: 101: Hoare triple {33800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:48,617 INFO L273 TraceCheckUtils]: 102: Hoare triple {33801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:48,617 INFO L273 TraceCheckUtils]: 103: Hoare triple {33801#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:48,618 INFO L273 TraceCheckUtils]: 104: Hoare triple {33801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:48,618 INFO L273 TraceCheckUtils]: 105: Hoare triple {33802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:48,619 INFO L273 TraceCheckUtils]: 106: Hoare triple {33802#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:48,619 INFO L273 TraceCheckUtils]: 107: Hoare triple {33802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:48,620 INFO L273 TraceCheckUtils]: 108: Hoare triple {33803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:48,620 INFO L273 TraceCheckUtils]: 109: Hoare triple {33803#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:48,621 INFO L273 TraceCheckUtils]: 110: Hoare triple {33803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:48,622 INFO L273 TraceCheckUtils]: 111: Hoare triple {33804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:48,622 INFO L273 TraceCheckUtils]: 112: Hoare triple {33804#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:48,623 INFO L273 TraceCheckUtils]: 113: Hoare triple {33804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:48,623 INFO L273 TraceCheckUtils]: 114: Hoare triple {33805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:48,624 INFO L273 TraceCheckUtils]: 115: Hoare triple {33805#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:48,625 INFO L273 TraceCheckUtils]: 116: Hoare triple {33805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:48,625 INFO L273 TraceCheckUtils]: 117: Hoare triple {33806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:48,626 INFO L273 TraceCheckUtils]: 118: Hoare triple {33806#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:48,626 INFO L273 TraceCheckUtils]: 119: Hoare triple {33806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:48,627 INFO L273 TraceCheckUtils]: 120: Hoare triple {33807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:48,627 INFO L273 TraceCheckUtils]: 121: Hoare triple {33807#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:48,628 INFO L273 TraceCheckUtils]: 122: Hoare triple {33807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:48,628 INFO L273 TraceCheckUtils]: 123: Hoare triple {33808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:48,629 INFO L273 TraceCheckUtils]: 124: Hoare triple {33808#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:48,630 INFO L273 TraceCheckUtils]: 125: Hoare triple {33808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:48,630 INFO L273 TraceCheckUtils]: 126: Hoare triple {33809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:48,631 INFO L273 TraceCheckUtils]: 127: Hoare triple {33809#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:48,631 INFO L273 TraceCheckUtils]: 128: Hoare triple {33809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:48,632 INFO L273 TraceCheckUtils]: 129: Hoare triple {33810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:48,632 INFO L273 TraceCheckUtils]: 130: Hoare triple {33810#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:48,633 INFO L273 TraceCheckUtils]: 131: Hoare triple {33810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:48,634 INFO L273 TraceCheckUtils]: 132: Hoare triple {33811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:48,634 INFO L273 TraceCheckUtils]: 133: Hoare triple {33811#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:48,635 INFO L273 TraceCheckUtils]: 134: Hoare triple {33811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:48,635 INFO L273 TraceCheckUtils]: 135: Hoare triple {33812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:48,636 INFO L273 TraceCheckUtils]: 136: Hoare triple {33812#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:48,636 INFO L273 TraceCheckUtils]: 137: Hoare triple {33812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:48,637 INFO L273 TraceCheckUtils]: 138: Hoare triple {33813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:48,637 INFO L273 TraceCheckUtils]: 139: Hoare triple {33813#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:48,638 INFO L273 TraceCheckUtils]: 140: Hoare triple {33813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:48,639 INFO L273 TraceCheckUtils]: 141: Hoare triple {33814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:48,639 INFO L273 TraceCheckUtils]: 142: Hoare triple {33814#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:48,640 INFO L273 TraceCheckUtils]: 143: Hoare triple {33814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:48,640 INFO L273 TraceCheckUtils]: 144: Hoare triple {33815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:48,641 INFO L273 TraceCheckUtils]: 145: Hoare triple {33815#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:48,642 INFO L273 TraceCheckUtils]: 146: Hoare triple {33815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {33816#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:48,642 INFO L273 TraceCheckUtils]: 147: Hoare triple {33816#(<= main_~i~0 47)} assume !(~i~0 < 100000); {33768#false} is VALID [2018-11-23 12:06:48,642 INFO L273 TraceCheckUtils]: 148: Hoare triple {33768#false} havoc ~x~0;~x~0 := 0; {33768#false} is VALID [2018-11-23 12:06:48,643 INFO L273 TraceCheckUtils]: 149: Hoare triple {33768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {33768#false} is VALID [2018-11-23 12:06:48,643 INFO L256 TraceCheckUtils]: 150: Hoare triple {33768#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {33768#false} is VALID [2018-11-23 12:06:48,643 INFO L273 TraceCheckUtils]: 151: Hoare triple {33768#false} ~cond := #in~cond; {33768#false} is VALID [2018-11-23 12:06:48,643 INFO L273 TraceCheckUtils]: 152: Hoare triple {33768#false} assume 0 == ~cond; {33768#false} is VALID [2018-11-23 12:06:48,643 INFO L273 TraceCheckUtils]: 153: Hoare triple {33768#false} assume !false; {33768#false} is VALID [2018-11-23 12:06:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:48,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:48,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2018-11-23 12:06:48,679 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 154 [2018-11-23 12:06:48,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:48,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:06:48,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:48,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:06:48,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:06:48,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:06:48,883 INFO L87 Difference]: Start difference. First operand 159 states and 207 transitions. Second operand 51 states. [2018-11-23 12:06:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:49,799 INFO L93 Difference]: Finished difference Result 175 states and 226 transitions. [2018-11-23 12:06:49,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 12:06:49,799 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 154 [2018-11-23 12:06:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:06:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 226 transitions. [2018-11-23 12:06:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:06:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 226 transitions. [2018-11-23 12:06:49,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 226 transitions. [2018-11-23 12:06:50,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:50,018 INFO L225 Difference]: With dead ends: 175 [2018-11-23 12:06:50,018 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 12:06:50,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:06:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 12:06:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-11-23 12:06:50,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:50,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 162 states. [2018-11-23 12:06:50,059 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 162 states. [2018-11-23 12:06:50,060 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 162 states. [2018-11-23 12:06:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:50,062 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2018-11-23 12:06:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2018-11-23 12:06:50,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:50,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:50,063 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 164 states. [2018-11-23 12:06:50,063 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 164 states. [2018-11-23 12:06:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:50,065 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2018-11-23 12:06:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2018-11-23 12:06:50,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:50,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:50,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:50,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 12:06:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2018-11-23 12:06:50,069 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 154 [2018-11-23 12:06:50,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:50,069 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2018-11-23 12:06:50,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:06:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2018-11-23 12:06:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 12:06:50,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:50,070 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:50,070 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:50,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2010822983, now seen corresponding path program 48 times [2018-11-23 12:06:50,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:50,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:50,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:50,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:51,321 INFO L256 TraceCheckUtils]: 0: Hoare triple {35059#true} call ULTIMATE.init(); {35059#true} is VALID [2018-11-23 12:06:51,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {35059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35059#true} is VALID [2018-11-23 12:06:51,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {35059#true} assume true; {35059#true} is VALID [2018-11-23 12:06:51,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35059#true} {35059#true} #55#return; {35059#true} is VALID [2018-11-23 12:06:51,322 INFO L256 TraceCheckUtils]: 4: Hoare triple {35059#true} call #t~ret4 := main(); {35059#true} is VALID [2018-11-23 12:06:51,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {35059#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {35061#(= main_~i~0 0)} is VALID [2018-11-23 12:06:51,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {35061#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35061#(= main_~i~0 0)} is VALID [2018-11-23 12:06:51,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {35061#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35061#(= main_~i~0 0)} is VALID [2018-11-23 12:06:51,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {35061#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:51,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {35062#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:51,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {35062#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:51,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {35062#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:51,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {35063#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:51,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {35063#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:51,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {35063#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:51,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {35064#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:51,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {35064#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:51,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {35064#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:51,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {35065#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:51,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {35065#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:51,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {35065#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:51,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {35066#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:51,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {35066#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:51,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {35066#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:51,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {35067#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:51,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {35067#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:51,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {35067#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:51,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {35068#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:51,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {35068#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:51,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {35068#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:51,334 INFO L273 TraceCheckUtils]: 30: Hoare triple {35069#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:51,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {35069#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:51,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {35069#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:51,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {35070#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:51,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {35070#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:51,337 INFO L273 TraceCheckUtils]: 35: Hoare triple {35070#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:51,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {35071#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:51,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {35071#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:51,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {35071#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:51,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {35072#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:51,340 INFO L273 TraceCheckUtils]: 40: Hoare triple {35072#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:51,341 INFO L273 TraceCheckUtils]: 41: Hoare triple {35072#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:51,341 INFO L273 TraceCheckUtils]: 42: Hoare triple {35073#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:51,342 INFO L273 TraceCheckUtils]: 43: Hoare triple {35073#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:51,342 INFO L273 TraceCheckUtils]: 44: Hoare triple {35073#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:51,343 INFO L273 TraceCheckUtils]: 45: Hoare triple {35074#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:51,343 INFO L273 TraceCheckUtils]: 46: Hoare triple {35074#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:51,344 INFO L273 TraceCheckUtils]: 47: Hoare triple {35074#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:51,345 INFO L273 TraceCheckUtils]: 48: Hoare triple {35075#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:51,345 INFO L273 TraceCheckUtils]: 49: Hoare triple {35075#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:51,346 INFO L273 TraceCheckUtils]: 50: Hoare triple {35075#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:51,346 INFO L273 TraceCheckUtils]: 51: Hoare triple {35076#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:51,347 INFO L273 TraceCheckUtils]: 52: Hoare triple {35076#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:51,347 INFO L273 TraceCheckUtils]: 53: Hoare triple {35076#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:51,348 INFO L273 TraceCheckUtils]: 54: Hoare triple {35077#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:51,348 INFO L273 TraceCheckUtils]: 55: Hoare triple {35077#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:51,349 INFO L273 TraceCheckUtils]: 56: Hoare triple {35077#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:51,350 INFO L273 TraceCheckUtils]: 57: Hoare triple {35078#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:51,350 INFO L273 TraceCheckUtils]: 58: Hoare triple {35078#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:51,351 INFO L273 TraceCheckUtils]: 59: Hoare triple {35078#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:51,351 INFO L273 TraceCheckUtils]: 60: Hoare triple {35079#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:51,352 INFO L273 TraceCheckUtils]: 61: Hoare triple {35079#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:51,353 INFO L273 TraceCheckUtils]: 62: Hoare triple {35079#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:51,353 INFO L273 TraceCheckUtils]: 63: Hoare triple {35080#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:51,354 INFO L273 TraceCheckUtils]: 64: Hoare triple {35080#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:51,354 INFO L273 TraceCheckUtils]: 65: Hoare triple {35080#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:51,355 INFO L273 TraceCheckUtils]: 66: Hoare triple {35081#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:51,355 INFO L273 TraceCheckUtils]: 67: Hoare triple {35081#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:51,356 INFO L273 TraceCheckUtils]: 68: Hoare triple {35081#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:51,356 INFO L273 TraceCheckUtils]: 69: Hoare triple {35082#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:51,357 INFO L273 TraceCheckUtils]: 70: Hoare triple {35082#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:51,358 INFO L273 TraceCheckUtils]: 71: Hoare triple {35082#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:51,358 INFO L273 TraceCheckUtils]: 72: Hoare triple {35083#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:51,359 INFO L273 TraceCheckUtils]: 73: Hoare triple {35083#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:51,359 INFO L273 TraceCheckUtils]: 74: Hoare triple {35083#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:51,360 INFO L273 TraceCheckUtils]: 75: Hoare triple {35084#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:51,360 INFO L273 TraceCheckUtils]: 76: Hoare triple {35084#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:51,361 INFO L273 TraceCheckUtils]: 77: Hoare triple {35084#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:51,362 INFO L273 TraceCheckUtils]: 78: Hoare triple {35085#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:51,362 INFO L273 TraceCheckUtils]: 79: Hoare triple {35085#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:51,363 INFO L273 TraceCheckUtils]: 80: Hoare triple {35085#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:51,363 INFO L273 TraceCheckUtils]: 81: Hoare triple {35086#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:51,364 INFO L273 TraceCheckUtils]: 82: Hoare triple {35086#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:51,365 INFO L273 TraceCheckUtils]: 83: Hoare triple {35086#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:51,365 INFO L273 TraceCheckUtils]: 84: Hoare triple {35087#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:51,366 INFO L273 TraceCheckUtils]: 85: Hoare triple {35087#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:51,366 INFO L273 TraceCheckUtils]: 86: Hoare triple {35087#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:51,367 INFO L273 TraceCheckUtils]: 87: Hoare triple {35088#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:51,367 INFO L273 TraceCheckUtils]: 88: Hoare triple {35088#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:51,368 INFO L273 TraceCheckUtils]: 89: Hoare triple {35088#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:51,368 INFO L273 TraceCheckUtils]: 90: Hoare triple {35089#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:51,369 INFO L273 TraceCheckUtils]: 91: Hoare triple {35089#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:51,370 INFO L273 TraceCheckUtils]: 92: Hoare triple {35089#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:51,370 INFO L273 TraceCheckUtils]: 93: Hoare triple {35090#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:51,371 INFO L273 TraceCheckUtils]: 94: Hoare triple {35090#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:51,371 INFO L273 TraceCheckUtils]: 95: Hoare triple {35090#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:51,372 INFO L273 TraceCheckUtils]: 96: Hoare triple {35091#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:51,372 INFO L273 TraceCheckUtils]: 97: Hoare triple {35091#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:51,373 INFO L273 TraceCheckUtils]: 98: Hoare triple {35091#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:51,374 INFO L273 TraceCheckUtils]: 99: Hoare triple {35092#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:51,374 INFO L273 TraceCheckUtils]: 100: Hoare triple {35092#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:51,375 INFO L273 TraceCheckUtils]: 101: Hoare triple {35092#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:51,375 INFO L273 TraceCheckUtils]: 102: Hoare triple {35093#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:51,376 INFO L273 TraceCheckUtils]: 103: Hoare triple {35093#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:51,376 INFO L273 TraceCheckUtils]: 104: Hoare triple {35093#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:51,377 INFO L273 TraceCheckUtils]: 105: Hoare triple {35094#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:51,377 INFO L273 TraceCheckUtils]: 106: Hoare triple {35094#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:51,378 INFO L273 TraceCheckUtils]: 107: Hoare triple {35094#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:51,379 INFO L273 TraceCheckUtils]: 108: Hoare triple {35095#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:51,379 INFO L273 TraceCheckUtils]: 109: Hoare triple {35095#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:51,380 INFO L273 TraceCheckUtils]: 110: Hoare triple {35095#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:51,380 INFO L273 TraceCheckUtils]: 111: Hoare triple {35096#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:51,381 INFO L273 TraceCheckUtils]: 112: Hoare triple {35096#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:51,382 INFO L273 TraceCheckUtils]: 113: Hoare triple {35096#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:51,382 INFO L273 TraceCheckUtils]: 114: Hoare triple {35097#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:51,383 INFO L273 TraceCheckUtils]: 115: Hoare triple {35097#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:51,383 INFO L273 TraceCheckUtils]: 116: Hoare triple {35097#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:51,384 INFO L273 TraceCheckUtils]: 117: Hoare triple {35098#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:51,384 INFO L273 TraceCheckUtils]: 118: Hoare triple {35098#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:51,385 INFO L273 TraceCheckUtils]: 119: Hoare triple {35098#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:51,386 INFO L273 TraceCheckUtils]: 120: Hoare triple {35099#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:51,386 INFO L273 TraceCheckUtils]: 121: Hoare triple {35099#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:51,387 INFO L273 TraceCheckUtils]: 122: Hoare triple {35099#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:51,387 INFO L273 TraceCheckUtils]: 123: Hoare triple {35100#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:51,388 INFO L273 TraceCheckUtils]: 124: Hoare triple {35100#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:51,388 INFO L273 TraceCheckUtils]: 125: Hoare triple {35100#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:51,389 INFO L273 TraceCheckUtils]: 126: Hoare triple {35101#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:51,389 INFO L273 TraceCheckUtils]: 127: Hoare triple {35101#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:51,390 INFO L273 TraceCheckUtils]: 128: Hoare triple {35101#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:51,391 INFO L273 TraceCheckUtils]: 129: Hoare triple {35102#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:51,391 INFO L273 TraceCheckUtils]: 130: Hoare triple {35102#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:51,392 INFO L273 TraceCheckUtils]: 131: Hoare triple {35102#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:51,392 INFO L273 TraceCheckUtils]: 132: Hoare triple {35103#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:51,393 INFO L273 TraceCheckUtils]: 133: Hoare triple {35103#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:51,394 INFO L273 TraceCheckUtils]: 134: Hoare triple {35103#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:51,394 INFO L273 TraceCheckUtils]: 135: Hoare triple {35104#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:51,395 INFO L273 TraceCheckUtils]: 136: Hoare triple {35104#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:51,395 INFO L273 TraceCheckUtils]: 137: Hoare triple {35104#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:51,396 INFO L273 TraceCheckUtils]: 138: Hoare triple {35105#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:51,396 INFO L273 TraceCheckUtils]: 139: Hoare triple {35105#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:51,397 INFO L273 TraceCheckUtils]: 140: Hoare triple {35105#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:51,397 INFO L273 TraceCheckUtils]: 141: Hoare triple {35106#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:51,398 INFO L273 TraceCheckUtils]: 142: Hoare triple {35106#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:51,399 INFO L273 TraceCheckUtils]: 143: Hoare triple {35106#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:51,399 INFO L273 TraceCheckUtils]: 144: Hoare triple {35107#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:51,400 INFO L273 TraceCheckUtils]: 145: Hoare triple {35107#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:51,400 INFO L273 TraceCheckUtils]: 146: Hoare triple {35107#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:51,401 INFO L273 TraceCheckUtils]: 147: Hoare triple {35108#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:51,401 INFO L273 TraceCheckUtils]: 148: Hoare triple {35108#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:51,402 INFO L273 TraceCheckUtils]: 149: Hoare triple {35108#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {35109#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:51,403 INFO L273 TraceCheckUtils]: 150: Hoare triple {35109#(<= main_~i~0 48)} assume !(~i~0 < 100000); {35060#false} is VALID [2018-11-23 12:06:51,403 INFO L273 TraceCheckUtils]: 151: Hoare triple {35060#false} havoc ~x~0;~x~0 := 0; {35060#false} is VALID [2018-11-23 12:06:51,403 INFO L273 TraceCheckUtils]: 152: Hoare triple {35060#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {35060#false} is VALID [2018-11-23 12:06:51,403 INFO L256 TraceCheckUtils]: 153: Hoare triple {35060#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {35060#false} is VALID [2018-11-23 12:06:51,404 INFO L273 TraceCheckUtils]: 154: Hoare triple {35060#false} ~cond := #in~cond; {35060#false} is VALID [2018-11-23 12:06:51,404 INFO L273 TraceCheckUtils]: 155: Hoare triple {35060#false} assume 0 == ~cond; {35060#false} is VALID [2018-11-23 12:06:51,404 INFO L273 TraceCheckUtils]: 156: Hoare triple {35060#false} assume !false; {35060#false} is VALID [2018-11-23 12:06:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:51,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:51,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:51,430 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:51,981 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-11-23 12:06:51,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:52,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:52,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {35059#true} call ULTIMATE.init(); {35059#true} is VALID [2018-11-23 12:06:52,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {35059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35059#true} is VALID [2018-11-23 12:06:52,956 INFO L273 TraceCheckUtils]: 2: Hoare triple {35059#true} assume true; {35059#true} is VALID [2018-11-23 12:06:52,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35059#true} {35059#true} #55#return; {35059#true} is VALID [2018-11-23 12:06:52,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {35059#true} call #t~ret4 := main(); {35059#true} is VALID [2018-11-23 12:06:52,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {35059#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {35128#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:52,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {35128#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35128#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:52,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {35128#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35128#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:52,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {35128#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:52,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {35062#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:52,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {35062#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:52,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {35062#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:52,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {35063#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:52,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {35063#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:52,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {35063#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:52,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {35064#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:52,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {35064#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:52,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {35064#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:52,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {35065#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:52,963 INFO L273 TraceCheckUtils]: 19: Hoare triple {35065#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:52,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {35065#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:52,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {35066#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:52,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {35066#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:52,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {35066#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:52,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {35067#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:52,967 INFO L273 TraceCheckUtils]: 25: Hoare triple {35067#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:52,968 INFO L273 TraceCheckUtils]: 26: Hoare triple {35067#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:52,968 INFO L273 TraceCheckUtils]: 27: Hoare triple {35068#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:52,969 INFO L273 TraceCheckUtils]: 28: Hoare triple {35068#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:52,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {35068#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:52,970 INFO L273 TraceCheckUtils]: 30: Hoare triple {35069#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:52,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {35069#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:52,971 INFO L273 TraceCheckUtils]: 32: Hoare triple {35069#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:52,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {35070#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:52,972 INFO L273 TraceCheckUtils]: 34: Hoare triple {35070#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:52,973 INFO L273 TraceCheckUtils]: 35: Hoare triple {35070#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:52,973 INFO L273 TraceCheckUtils]: 36: Hoare triple {35071#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:52,974 INFO L273 TraceCheckUtils]: 37: Hoare triple {35071#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:52,974 INFO L273 TraceCheckUtils]: 38: Hoare triple {35071#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:52,975 INFO L273 TraceCheckUtils]: 39: Hoare triple {35072#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:52,975 INFO L273 TraceCheckUtils]: 40: Hoare triple {35072#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:52,976 INFO L273 TraceCheckUtils]: 41: Hoare triple {35072#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:52,977 INFO L273 TraceCheckUtils]: 42: Hoare triple {35073#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:52,977 INFO L273 TraceCheckUtils]: 43: Hoare triple {35073#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:52,978 INFO L273 TraceCheckUtils]: 44: Hoare triple {35073#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:52,978 INFO L273 TraceCheckUtils]: 45: Hoare triple {35074#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:52,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {35074#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:52,979 INFO L273 TraceCheckUtils]: 47: Hoare triple {35074#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:52,980 INFO L273 TraceCheckUtils]: 48: Hoare triple {35075#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:52,980 INFO L273 TraceCheckUtils]: 49: Hoare triple {35075#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:52,981 INFO L273 TraceCheckUtils]: 50: Hoare triple {35075#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:52,982 INFO L273 TraceCheckUtils]: 51: Hoare triple {35076#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:52,982 INFO L273 TraceCheckUtils]: 52: Hoare triple {35076#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:52,983 INFO L273 TraceCheckUtils]: 53: Hoare triple {35076#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:52,983 INFO L273 TraceCheckUtils]: 54: Hoare triple {35077#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:52,984 INFO L273 TraceCheckUtils]: 55: Hoare triple {35077#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:52,985 INFO L273 TraceCheckUtils]: 56: Hoare triple {35077#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:52,985 INFO L273 TraceCheckUtils]: 57: Hoare triple {35078#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:52,986 INFO L273 TraceCheckUtils]: 58: Hoare triple {35078#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:52,986 INFO L273 TraceCheckUtils]: 59: Hoare triple {35078#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:52,987 INFO L273 TraceCheckUtils]: 60: Hoare triple {35079#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:52,987 INFO L273 TraceCheckUtils]: 61: Hoare triple {35079#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:52,988 INFO L273 TraceCheckUtils]: 62: Hoare triple {35079#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:52,989 INFO L273 TraceCheckUtils]: 63: Hoare triple {35080#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:52,989 INFO L273 TraceCheckUtils]: 64: Hoare triple {35080#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:52,990 INFO L273 TraceCheckUtils]: 65: Hoare triple {35080#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:52,990 INFO L273 TraceCheckUtils]: 66: Hoare triple {35081#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:52,991 INFO L273 TraceCheckUtils]: 67: Hoare triple {35081#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:52,992 INFO L273 TraceCheckUtils]: 68: Hoare triple {35081#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:52,992 INFO L273 TraceCheckUtils]: 69: Hoare triple {35082#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:52,993 INFO L273 TraceCheckUtils]: 70: Hoare triple {35082#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:52,993 INFO L273 TraceCheckUtils]: 71: Hoare triple {35082#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:52,994 INFO L273 TraceCheckUtils]: 72: Hoare triple {35083#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:52,994 INFO L273 TraceCheckUtils]: 73: Hoare triple {35083#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:52,995 INFO L273 TraceCheckUtils]: 74: Hoare triple {35083#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:52,995 INFO L273 TraceCheckUtils]: 75: Hoare triple {35084#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:52,996 INFO L273 TraceCheckUtils]: 76: Hoare triple {35084#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:52,997 INFO L273 TraceCheckUtils]: 77: Hoare triple {35084#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:52,997 INFO L273 TraceCheckUtils]: 78: Hoare triple {35085#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:52,998 INFO L273 TraceCheckUtils]: 79: Hoare triple {35085#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:52,998 INFO L273 TraceCheckUtils]: 80: Hoare triple {35085#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:52,999 INFO L273 TraceCheckUtils]: 81: Hoare triple {35086#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:52,999 INFO L273 TraceCheckUtils]: 82: Hoare triple {35086#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:53,000 INFO L273 TraceCheckUtils]: 83: Hoare triple {35086#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:53,001 INFO L273 TraceCheckUtils]: 84: Hoare triple {35087#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:53,001 INFO L273 TraceCheckUtils]: 85: Hoare triple {35087#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:53,002 INFO L273 TraceCheckUtils]: 86: Hoare triple {35087#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:53,002 INFO L273 TraceCheckUtils]: 87: Hoare triple {35088#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:53,003 INFO L273 TraceCheckUtils]: 88: Hoare triple {35088#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:53,004 INFO L273 TraceCheckUtils]: 89: Hoare triple {35088#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:53,004 INFO L273 TraceCheckUtils]: 90: Hoare triple {35089#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:53,005 INFO L273 TraceCheckUtils]: 91: Hoare triple {35089#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:53,005 INFO L273 TraceCheckUtils]: 92: Hoare triple {35089#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:53,006 INFO L273 TraceCheckUtils]: 93: Hoare triple {35090#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:53,006 INFO L273 TraceCheckUtils]: 94: Hoare triple {35090#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:53,007 INFO L273 TraceCheckUtils]: 95: Hoare triple {35090#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:53,008 INFO L273 TraceCheckUtils]: 96: Hoare triple {35091#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:53,008 INFO L273 TraceCheckUtils]: 97: Hoare triple {35091#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:53,009 INFO L273 TraceCheckUtils]: 98: Hoare triple {35091#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:53,009 INFO L273 TraceCheckUtils]: 99: Hoare triple {35092#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:53,010 INFO L273 TraceCheckUtils]: 100: Hoare triple {35092#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:53,010 INFO L273 TraceCheckUtils]: 101: Hoare triple {35092#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:53,011 INFO L273 TraceCheckUtils]: 102: Hoare triple {35093#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:53,011 INFO L273 TraceCheckUtils]: 103: Hoare triple {35093#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:53,012 INFO L273 TraceCheckUtils]: 104: Hoare triple {35093#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:53,013 INFO L273 TraceCheckUtils]: 105: Hoare triple {35094#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:53,013 INFO L273 TraceCheckUtils]: 106: Hoare triple {35094#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:53,014 INFO L273 TraceCheckUtils]: 107: Hoare triple {35094#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:53,014 INFO L273 TraceCheckUtils]: 108: Hoare triple {35095#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:53,015 INFO L273 TraceCheckUtils]: 109: Hoare triple {35095#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:53,016 INFO L273 TraceCheckUtils]: 110: Hoare triple {35095#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:53,016 INFO L273 TraceCheckUtils]: 111: Hoare triple {35096#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:53,017 INFO L273 TraceCheckUtils]: 112: Hoare triple {35096#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:53,017 INFO L273 TraceCheckUtils]: 113: Hoare triple {35096#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:53,018 INFO L273 TraceCheckUtils]: 114: Hoare triple {35097#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:53,018 INFO L273 TraceCheckUtils]: 115: Hoare triple {35097#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:53,019 INFO L273 TraceCheckUtils]: 116: Hoare triple {35097#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:53,020 INFO L273 TraceCheckUtils]: 117: Hoare triple {35098#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:53,020 INFO L273 TraceCheckUtils]: 118: Hoare triple {35098#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:53,021 INFO L273 TraceCheckUtils]: 119: Hoare triple {35098#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:53,021 INFO L273 TraceCheckUtils]: 120: Hoare triple {35099#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:53,022 INFO L273 TraceCheckUtils]: 121: Hoare triple {35099#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:53,022 INFO L273 TraceCheckUtils]: 122: Hoare triple {35099#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:53,023 INFO L273 TraceCheckUtils]: 123: Hoare triple {35100#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:53,024 INFO L273 TraceCheckUtils]: 124: Hoare triple {35100#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:53,024 INFO L273 TraceCheckUtils]: 125: Hoare triple {35100#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:53,025 INFO L273 TraceCheckUtils]: 126: Hoare triple {35101#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:53,025 INFO L273 TraceCheckUtils]: 127: Hoare triple {35101#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:53,026 INFO L273 TraceCheckUtils]: 128: Hoare triple {35101#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:53,026 INFO L273 TraceCheckUtils]: 129: Hoare triple {35102#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:53,027 INFO L273 TraceCheckUtils]: 130: Hoare triple {35102#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:53,028 INFO L273 TraceCheckUtils]: 131: Hoare triple {35102#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:53,028 INFO L273 TraceCheckUtils]: 132: Hoare triple {35103#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:53,029 INFO L273 TraceCheckUtils]: 133: Hoare triple {35103#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:53,029 INFO L273 TraceCheckUtils]: 134: Hoare triple {35103#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:53,030 INFO L273 TraceCheckUtils]: 135: Hoare triple {35104#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:53,030 INFO L273 TraceCheckUtils]: 136: Hoare triple {35104#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:53,031 INFO L273 TraceCheckUtils]: 137: Hoare triple {35104#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:53,032 INFO L273 TraceCheckUtils]: 138: Hoare triple {35105#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:53,032 INFO L273 TraceCheckUtils]: 139: Hoare triple {35105#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:53,033 INFO L273 TraceCheckUtils]: 140: Hoare triple {35105#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:53,033 INFO L273 TraceCheckUtils]: 141: Hoare triple {35106#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:53,034 INFO L273 TraceCheckUtils]: 142: Hoare triple {35106#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:53,035 INFO L273 TraceCheckUtils]: 143: Hoare triple {35106#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:53,035 INFO L273 TraceCheckUtils]: 144: Hoare triple {35107#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:53,036 INFO L273 TraceCheckUtils]: 145: Hoare triple {35107#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:53,036 INFO L273 TraceCheckUtils]: 146: Hoare triple {35107#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:53,037 INFO L273 TraceCheckUtils]: 147: Hoare triple {35108#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:53,037 INFO L273 TraceCheckUtils]: 148: Hoare triple {35108#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:53,038 INFO L273 TraceCheckUtils]: 149: Hoare triple {35108#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {35109#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:53,039 INFO L273 TraceCheckUtils]: 150: Hoare triple {35109#(<= main_~i~0 48)} assume !(~i~0 < 100000); {35060#false} is VALID [2018-11-23 12:06:53,039 INFO L273 TraceCheckUtils]: 151: Hoare triple {35060#false} havoc ~x~0;~x~0 := 0; {35060#false} is VALID [2018-11-23 12:06:53,039 INFO L273 TraceCheckUtils]: 152: Hoare triple {35060#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {35060#false} is VALID [2018-11-23 12:06:53,039 INFO L256 TraceCheckUtils]: 153: Hoare triple {35060#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {35060#false} is VALID [2018-11-23 12:06:53,039 INFO L273 TraceCheckUtils]: 154: Hoare triple {35060#false} ~cond := #in~cond; {35060#false} is VALID [2018-11-23 12:06:53,040 INFO L273 TraceCheckUtils]: 155: Hoare triple {35060#false} assume 0 == ~cond; {35060#false} is VALID [2018-11-23 12:06:53,040 INFO L273 TraceCheckUtils]: 156: Hoare triple {35060#false} assume !false; {35060#false} is VALID [2018-11-23 12:06:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:53,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:53,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2018-11-23 12:06:53,075 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 157 [2018-11-23 12:06:53,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:53,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 12:06:53,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:53,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 12:06:53,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 12:06:53,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:06:53,233 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand 52 states. [2018-11-23 12:06:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:54,332 INFO L93 Difference]: Finished difference Result 178 states and 230 transitions. [2018-11-23 12:06:54,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:06:54,332 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 157 [2018-11-23 12:06:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:06:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 230 transitions. [2018-11-23 12:06:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:06:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 230 transitions. [2018-11-23 12:06:54,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 230 transitions. [2018-11-23 12:06:54,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:54,544 INFO L225 Difference]: With dead ends: 178 [2018-11-23 12:06:54,544 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 12:06:54,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:06:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 12:06:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-23 12:06:54,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:54,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 165 states. [2018-11-23 12:06:54,578 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 165 states. [2018-11-23 12:06:54,578 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 165 states. [2018-11-23 12:06:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:54,581 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2018-11-23 12:06:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2018-11-23 12:06:54,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:54,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:54,582 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 167 states. [2018-11-23 12:06:54,582 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 167 states. [2018-11-23 12:06:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:54,584 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2018-11-23 12:06:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2018-11-23 12:06:54,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:54,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:54,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:54,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 12:06:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 215 transitions. [2018-11-23 12:06:54,586 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 215 transitions. Word has length 157 [2018-11-23 12:06:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:54,586 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 215 transitions. [2018-11-23 12:06:54,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 12:06:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 215 transitions. [2018-11-23 12:06:54,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:06:54,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:54,587 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:54,587 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:54,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:54,588 INFO L82 PathProgramCache]: Analyzing trace with hash 821723875, now seen corresponding path program 49 times [2018-11-23 12:06:54,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:54,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:54,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:54,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:54,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:55,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {36375#true} call ULTIMATE.init(); {36375#true} is VALID [2018-11-23 12:06:55,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {36375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36375#true} is VALID [2018-11-23 12:06:55,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {36375#true} assume true; {36375#true} is VALID [2018-11-23 12:06:55,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36375#true} {36375#true} #55#return; {36375#true} is VALID [2018-11-23 12:06:55,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {36375#true} call #t~ret4 := main(); {36375#true} is VALID [2018-11-23 12:06:55,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {36375#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {36377#(= main_~i~0 0)} is VALID [2018-11-23 12:06:55,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {36377#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36377#(= main_~i~0 0)} is VALID [2018-11-23 12:06:55,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {36377#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36377#(= main_~i~0 0)} is VALID [2018-11-23 12:06:55,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {36377#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:55,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {36378#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:55,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {36378#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:55,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {36378#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:55,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {36379#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:55,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {36379#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:55,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {36379#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:55,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {36380#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:55,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {36380#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:55,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {36380#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:55,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {36381#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:55,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {36381#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:55,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {36381#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:55,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {36382#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:55,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {36382#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:55,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {36382#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:55,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {36383#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:55,806 INFO L273 TraceCheckUtils]: 25: Hoare triple {36383#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:55,807 INFO L273 TraceCheckUtils]: 26: Hoare triple {36383#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:55,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {36384#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:55,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {36384#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:55,808 INFO L273 TraceCheckUtils]: 29: Hoare triple {36384#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:55,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {36385#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:55,809 INFO L273 TraceCheckUtils]: 31: Hoare triple {36385#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:55,810 INFO L273 TraceCheckUtils]: 32: Hoare triple {36385#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:55,810 INFO L273 TraceCheckUtils]: 33: Hoare triple {36386#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:55,811 INFO L273 TraceCheckUtils]: 34: Hoare triple {36386#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:55,812 INFO L273 TraceCheckUtils]: 35: Hoare triple {36386#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:55,812 INFO L273 TraceCheckUtils]: 36: Hoare triple {36387#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:55,813 INFO L273 TraceCheckUtils]: 37: Hoare triple {36387#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:55,813 INFO L273 TraceCheckUtils]: 38: Hoare triple {36387#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:55,814 INFO L273 TraceCheckUtils]: 39: Hoare triple {36388#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:55,814 INFO L273 TraceCheckUtils]: 40: Hoare triple {36388#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:55,815 INFO L273 TraceCheckUtils]: 41: Hoare triple {36388#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:55,815 INFO L273 TraceCheckUtils]: 42: Hoare triple {36389#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:55,816 INFO L273 TraceCheckUtils]: 43: Hoare triple {36389#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:55,816 INFO L273 TraceCheckUtils]: 44: Hoare triple {36389#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:55,817 INFO L273 TraceCheckUtils]: 45: Hoare triple {36390#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:55,817 INFO L273 TraceCheckUtils]: 46: Hoare triple {36390#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:55,818 INFO L273 TraceCheckUtils]: 47: Hoare triple {36390#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:55,818 INFO L273 TraceCheckUtils]: 48: Hoare triple {36391#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:55,819 INFO L273 TraceCheckUtils]: 49: Hoare triple {36391#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:55,820 INFO L273 TraceCheckUtils]: 50: Hoare triple {36391#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:55,820 INFO L273 TraceCheckUtils]: 51: Hoare triple {36392#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:55,821 INFO L273 TraceCheckUtils]: 52: Hoare triple {36392#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:55,821 INFO L273 TraceCheckUtils]: 53: Hoare triple {36392#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:55,822 INFO L273 TraceCheckUtils]: 54: Hoare triple {36393#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:55,822 INFO L273 TraceCheckUtils]: 55: Hoare triple {36393#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:55,823 INFO L273 TraceCheckUtils]: 56: Hoare triple {36393#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:55,823 INFO L273 TraceCheckUtils]: 57: Hoare triple {36394#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:55,824 INFO L273 TraceCheckUtils]: 58: Hoare triple {36394#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:55,824 INFO L273 TraceCheckUtils]: 59: Hoare triple {36394#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:55,825 INFO L273 TraceCheckUtils]: 60: Hoare triple {36395#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:55,825 INFO L273 TraceCheckUtils]: 61: Hoare triple {36395#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:55,826 INFO L273 TraceCheckUtils]: 62: Hoare triple {36395#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:55,827 INFO L273 TraceCheckUtils]: 63: Hoare triple {36396#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:55,827 INFO L273 TraceCheckUtils]: 64: Hoare triple {36396#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:55,828 INFO L273 TraceCheckUtils]: 65: Hoare triple {36396#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:55,828 INFO L273 TraceCheckUtils]: 66: Hoare triple {36397#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:55,829 INFO L273 TraceCheckUtils]: 67: Hoare triple {36397#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:55,829 INFO L273 TraceCheckUtils]: 68: Hoare triple {36397#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:55,830 INFO L273 TraceCheckUtils]: 69: Hoare triple {36398#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:55,830 INFO L273 TraceCheckUtils]: 70: Hoare triple {36398#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:55,831 INFO L273 TraceCheckUtils]: 71: Hoare triple {36398#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:55,831 INFO L273 TraceCheckUtils]: 72: Hoare triple {36399#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:55,832 INFO L273 TraceCheckUtils]: 73: Hoare triple {36399#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:55,832 INFO L273 TraceCheckUtils]: 74: Hoare triple {36399#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:55,833 INFO L273 TraceCheckUtils]: 75: Hoare triple {36400#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:55,833 INFO L273 TraceCheckUtils]: 76: Hoare triple {36400#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:55,834 INFO L273 TraceCheckUtils]: 77: Hoare triple {36400#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:55,835 INFO L273 TraceCheckUtils]: 78: Hoare triple {36401#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:55,835 INFO L273 TraceCheckUtils]: 79: Hoare triple {36401#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:55,836 INFO L273 TraceCheckUtils]: 80: Hoare triple {36401#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:55,836 INFO L273 TraceCheckUtils]: 81: Hoare triple {36402#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:55,837 INFO L273 TraceCheckUtils]: 82: Hoare triple {36402#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:55,837 INFO L273 TraceCheckUtils]: 83: Hoare triple {36402#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:55,838 INFO L273 TraceCheckUtils]: 84: Hoare triple {36403#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:55,838 INFO L273 TraceCheckUtils]: 85: Hoare triple {36403#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:55,839 INFO L273 TraceCheckUtils]: 86: Hoare triple {36403#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:55,839 INFO L273 TraceCheckUtils]: 87: Hoare triple {36404#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:55,840 INFO L273 TraceCheckUtils]: 88: Hoare triple {36404#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:55,840 INFO L273 TraceCheckUtils]: 89: Hoare triple {36404#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:55,841 INFO L273 TraceCheckUtils]: 90: Hoare triple {36405#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:55,841 INFO L273 TraceCheckUtils]: 91: Hoare triple {36405#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:55,842 INFO L273 TraceCheckUtils]: 92: Hoare triple {36405#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:55,843 INFO L273 TraceCheckUtils]: 93: Hoare triple {36406#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:55,843 INFO L273 TraceCheckUtils]: 94: Hoare triple {36406#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:55,844 INFO L273 TraceCheckUtils]: 95: Hoare triple {36406#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:55,844 INFO L273 TraceCheckUtils]: 96: Hoare triple {36407#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:55,845 INFO L273 TraceCheckUtils]: 97: Hoare triple {36407#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:55,845 INFO L273 TraceCheckUtils]: 98: Hoare triple {36407#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:55,846 INFO L273 TraceCheckUtils]: 99: Hoare triple {36408#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:55,846 INFO L273 TraceCheckUtils]: 100: Hoare triple {36408#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:55,847 INFO L273 TraceCheckUtils]: 101: Hoare triple {36408#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:55,847 INFO L273 TraceCheckUtils]: 102: Hoare triple {36409#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:55,848 INFO L273 TraceCheckUtils]: 103: Hoare triple {36409#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:55,848 INFO L273 TraceCheckUtils]: 104: Hoare triple {36409#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:55,849 INFO L273 TraceCheckUtils]: 105: Hoare triple {36410#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:55,849 INFO L273 TraceCheckUtils]: 106: Hoare triple {36410#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:55,850 INFO L273 TraceCheckUtils]: 107: Hoare triple {36410#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:55,851 INFO L273 TraceCheckUtils]: 108: Hoare triple {36411#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:55,851 INFO L273 TraceCheckUtils]: 109: Hoare triple {36411#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:55,852 INFO L273 TraceCheckUtils]: 110: Hoare triple {36411#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:55,852 INFO L273 TraceCheckUtils]: 111: Hoare triple {36412#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:55,853 INFO L273 TraceCheckUtils]: 112: Hoare triple {36412#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:55,853 INFO L273 TraceCheckUtils]: 113: Hoare triple {36412#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:55,854 INFO L273 TraceCheckUtils]: 114: Hoare triple {36413#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:55,854 INFO L273 TraceCheckUtils]: 115: Hoare triple {36413#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:55,855 INFO L273 TraceCheckUtils]: 116: Hoare triple {36413#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:55,855 INFO L273 TraceCheckUtils]: 117: Hoare triple {36414#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:55,856 INFO L273 TraceCheckUtils]: 118: Hoare triple {36414#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:55,856 INFO L273 TraceCheckUtils]: 119: Hoare triple {36414#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:55,857 INFO L273 TraceCheckUtils]: 120: Hoare triple {36415#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:55,857 INFO L273 TraceCheckUtils]: 121: Hoare triple {36415#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:55,858 INFO L273 TraceCheckUtils]: 122: Hoare triple {36415#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:55,858 INFO L273 TraceCheckUtils]: 123: Hoare triple {36416#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:55,859 INFO L273 TraceCheckUtils]: 124: Hoare triple {36416#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:55,860 INFO L273 TraceCheckUtils]: 125: Hoare triple {36416#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:55,860 INFO L273 TraceCheckUtils]: 126: Hoare triple {36417#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:55,861 INFO L273 TraceCheckUtils]: 127: Hoare triple {36417#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:55,861 INFO L273 TraceCheckUtils]: 128: Hoare triple {36417#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:55,862 INFO L273 TraceCheckUtils]: 129: Hoare triple {36418#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:55,862 INFO L273 TraceCheckUtils]: 130: Hoare triple {36418#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:55,863 INFO L273 TraceCheckUtils]: 131: Hoare triple {36418#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:55,863 INFO L273 TraceCheckUtils]: 132: Hoare triple {36419#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:55,864 INFO L273 TraceCheckUtils]: 133: Hoare triple {36419#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:55,864 INFO L273 TraceCheckUtils]: 134: Hoare triple {36419#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:55,865 INFO L273 TraceCheckUtils]: 135: Hoare triple {36420#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:55,865 INFO L273 TraceCheckUtils]: 136: Hoare triple {36420#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:55,866 INFO L273 TraceCheckUtils]: 137: Hoare triple {36420#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:55,866 INFO L273 TraceCheckUtils]: 138: Hoare triple {36421#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:55,867 INFO L273 TraceCheckUtils]: 139: Hoare triple {36421#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:55,868 INFO L273 TraceCheckUtils]: 140: Hoare triple {36421#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:55,868 INFO L273 TraceCheckUtils]: 141: Hoare triple {36422#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:55,869 INFO L273 TraceCheckUtils]: 142: Hoare triple {36422#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:55,869 INFO L273 TraceCheckUtils]: 143: Hoare triple {36422#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:55,870 INFO L273 TraceCheckUtils]: 144: Hoare triple {36423#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:55,870 INFO L273 TraceCheckUtils]: 145: Hoare triple {36423#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:55,871 INFO L273 TraceCheckUtils]: 146: Hoare triple {36423#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:55,871 INFO L273 TraceCheckUtils]: 147: Hoare triple {36424#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:55,872 INFO L273 TraceCheckUtils]: 148: Hoare triple {36424#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:55,873 INFO L273 TraceCheckUtils]: 149: Hoare triple {36424#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:55,873 INFO L273 TraceCheckUtils]: 150: Hoare triple {36425#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:55,874 INFO L273 TraceCheckUtils]: 151: Hoare triple {36425#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:55,874 INFO L273 TraceCheckUtils]: 152: Hoare triple {36425#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {36426#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:55,875 INFO L273 TraceCheckUtils]: 153: Hoare triple {36426#(<= main_~i~0 49)} assume !(~i~0 < 100000); {36376#false} is VALID [2018-11-23 12:06:55,875 INFO L273 TraceCheckUtils]: 154: Hoare triple {36376#false} havoc ~x~0;~x~0 := 0; {36376#false} is VALID [2018-11-23 12:06:55,875 INFO L273 TraceCheckUtils]: 155: Hoare triple {36376#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {36376#false} is VALID [2018-11-23 12:06:55,875 INFO L256 TraceCheckUtils]: 156: Hoare triple {36376#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {36376#false} is VALID [2018-11-23 12:06:55,876 INFO L273 TraceCheckUtils]: 157: Hoare triple {36376#false} ~cond := #in~cond; {36376#false} is VALID [2018-11-23 12:06:55,876 INFO L273 TraceCheckUtils]: 158: Hoare triple {36376#false} assume 0 == ~cond; {36376#false} is VALID [2018-11-23 12:06:55,876 INFO L273 TraceCheckUtils]: 159: Hoare triple {36376#false} assume !false; {36376#false} is VALID [2018-11-23 12:06:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:55,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:55,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:55,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:56,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:56,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {36375#true} call ULTIMATE.init(); {36375#true} is VALID [2018-11-23 12:06:56,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {36375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36375#true} is VALID [2018-11-23 12:06:56,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {36375#true} assume true; {36375#true} is VALID [2018-11-23 12:06:56,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36375#true} {36375#true} #55#return; {36375#true} is VALID [2018-11-23 12:06:56,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {36375#true} call #t~ret4 := main(); {36375#true} is VALID [2018-11-23 12:06:56,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {36375#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {36445#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:56,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {36445#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36445#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:56,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {36445#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36445#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:56,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {36445#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:56,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {36378#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:56,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {36378#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:56,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {36378#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:56,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {36379#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:56,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {36379#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:56,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {36379#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:56,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {36380#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:56,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {36380#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:56,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {36380#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:56,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {36381#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:56,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {36381#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:56,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {36381#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:56,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {36382#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:56,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {36382#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:56,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {36382#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:56,467 INFO L273 TraceCheckUtils]: 24: Hoare triple {36383#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:56,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {36383#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:56,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {36383#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:56,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {36384#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:56,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {36384#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:56,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {36384#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:56,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {36385#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:56,470 INFO L273 TraceCheckUtils]: 31: Hoare triple {36385#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:56,471 INFO L273 TraceCheckUtils]: 32: Hoare triple {36385#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:56,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {36386#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:56,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {36386#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:56,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {36386#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:56,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {36387#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:56,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {36387#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:56,475 INFO L273 TraceCheckUtils]: 38: Hoare triple {36387#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:56,475 INFO L273 TraceCheckUtils]: 39: Hoare triple {36388#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:56,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {36388#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:56,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {36388#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:56,477 INFO L273 TraceCheckUtils]: 42: Hoare triple {36389#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:56,477 INFO L273 TraceCheckUtils]: 43: Hoare triple {36389#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:56,478 INFO L273 TraceCheckUtils]: 44: Hoare triple {36389#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:56,478 INFO L273 TraceCheckUtils]: 45: Hoare triple {36390#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:56,479 INFO L273 TraceCheckUtils]: 46: Hoare triple {36390#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:56,480 INFO L273 TraceCheckUtils]: 47: Hoare triple {36390#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:56,480 INFO L273 TraceCheckUtils]: 48: Hoare triple {36391#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:56,481 INFO L273 TraceCheckUtils]: 49: Hoare triple {36391#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:56,481 INFO L273 TraceCheckUtils]: 50: Hoare triple {36391#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:56,482 INFO L273 TraceCheckUtils]: 51: Hoare triple {36392#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:56,482 INFO L273 TraceCheckUtils]: 52: Hoare triple {36392#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:56,483 INFO L273 TraceCheckUtils]: 53: Hoare triple {36392#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:56,484 INFO L273 TraceCheckUtils]: 54: Hoare triple {36393#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:56,484 INFO L273 TraceCheckUtils]: 55: Hoare triple {36393#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:56,485 INFO L273 TraceCheckUtils]: 56: Hoare triple {36393#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:56,485 INFO L273 TraceCheckUtils]: 57: Hoare triple {36394#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:56,486 INFO L273 TraceCheckUtils]: 58: Hoare triple {36394#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:56,486 INFO L273 TraceCheckUtils]: 59: Hoare triple {36394#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:56,487 INFO L273 TraceCheckUtils]: 60: Hoare triple {36395#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:56,487 INFO L273 TraceCheckUtils]: 61: Hoare triple {36395#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:56,488 INFO L273 TraceCheckUtils]: 62: Hoare triple {36395#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:56,489 INFO L273 TraceCheckUtils]: 63: Hoare triple {36396#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:56,489 INFO L273 TraceCheckUtils]: 64: Hoare triple {36396#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:56,490 INFO L273 TraceCheckUtils]: 65: Hoare triple {36396#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:56,490 INFO L273 TraceCheckUtils]: 66: Hoare triple {36397#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:56,491 INFO L273 TraceCheckUtils]: 67: Hoare triple {36397#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:56,492 INFO L273 TraceCheckUtils]: 68: Hoare triple {36397#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:56,492 INFO L273 TraceCheckUtils]: 69: Hoare triple {36398#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:56,493 INFO L273 TraceCheckUtils]: 70: Hoare triple {36398#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:56,493 INFO L273 TraceCheckUtils]: 71: Hoare triple {36398#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:56,494 INFO L273 TraceCheckUtils]: 72: Hoare triple {36399#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:56,494 INFO L273 TraceCheckUtils]: 73: Hoare triple {36399#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:56,495 INFO L273 TraceCheckUtils]: 74: Hoare triple {36399#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:56,495 INFO L273 TraceCheckUtils]: 75: Hoare triple {36400#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:56,496 INFO L273 TraceCheckUtils]: 76: Hoare triple {36400#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:56,497 INFO L273 TraceCheckUtils]: 77: Hoare triple {36400#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:56,497 INFO L273 TraceCheckUtils]: 78: Hoare triple {36401#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:56,498 INFO L273 TraceCheckUtils]: 79: Hoare triple {36401#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:56,498 INFO L273 TraceCheckUtils]: 80: Hoare triple {36401#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:56,499 INFO L273 TraceCheckUtils]: 81: Hoare triple {36402#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:56,499 INFO L273 TraceCheckUtils]: 82: Hoare triple {36402#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:56,500 INFO L273 TraceCheckUtils]: 83: Hoare triple {36402#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:56,501 INFO L273 TraceCheckUtils]: 84: Hoare triple {36403#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:56,501 INFO L273 TraceCheckUtils]: 85: Hoare triple {36403#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:56,502 INFO L273 TraceCheckUtils]: 86: Hoare triple {36403#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:56,502 INFO L273 TraceCheckUtils]: 87: Hoare triple {36404#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:56,503 INFO L273 TraceCheckUtils]: 88: Hoare triple {36404#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:56,503 INFO L273 TraceCheckUtils]: 89: Hoare triple {36404#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:56,504 INFO L273 TraceCheckUtils]: 90: Hoare triple {36405#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:56,504 INFO L273 TraceCheckUtils]: 91: Hoare triple {36405#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:56,505 INFO L273 TraceCheckUtils]: 92: Hoare triple {36405#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:56,506 INFO L273 TraceCheckUtils]: 93: Hoare triple {36406#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:56,506 INFO L273 TraceCheckUtils]: 94: Hoare triple {36406#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:56,507 INFO L273 TraceCheckUtils]: 95: Hoare triple {36406#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:56,507 INFO L273 TraceCheckUtils]: 96: Hoare triple {36407#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:56,508 INFO L273 TraceCheckUtils]: 97: Hoare triple {36407#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:56,509 INFO L273 TraceCheckUtils]: 98: Hoare triple {36407#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:56,509 INFO L273 TraceCheckUtils]: 99: Hoare triple {36408#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:56,510 INFO L273 TraceCheckUtils]: 100: Hoare triple {36408#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:56,510 INFO L273 TraceCheckUtils]: 101: Hoare triple {36408#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:56,511 INFO L273 TraceCheckUtils]: 102: Hoare triple {36409#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:56,511 INFO L273 TraceCheckUtils]: 103: Hoare triple {36409#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:56,512 INFO L273 TraceCheckUtils]: 104: Hoare triple {36409#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:56,513 INFO L273 TraceCheckUtils]: 105: Hoare triple {36410#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:56,513 INFO L273 TraceCheckUtils]: 106: Hoare triple {36410#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:56,514 INFO L273 TraceCheckUtils]: 107: Hoare triple {36410#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:56,514 INFO L273 TraceCheckUtils]: 108: Hoare triple {36411#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:56,515 INFO L273 TraceCheckUtils]: 109: Hoare triple {36411#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:56,515 INFO L273 TraceCheckUtils]: 110: Hoare triple {36411#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:56,516 INFO L273 TraceCheckUtils]: 111: Hoare triple {36412#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:56,516 INFO L273 TraceCheckUtils]: 112: Hoare triple {36412#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:56,517 INFO L273 TraceCheckUtils]: 113: Hoare triple {36412#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:56,518 INFO L273 TraceCheckUtils]: 114: Hoare triple {36413#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:56,518 INFO L273 TraceCheckUtils]: 115: Hoare triple {36413#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:56,519 INFO L273 TraceCheckUtils]: 116: Hoare triple {36413#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:56,519 INFO L273 TraceCheckUtils]: 117: Hoare triple {36414#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:56,520 INFO L273 TraceCheckUtils]: 118: Hoare triple {36414#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:56,521 INFO L273 TraceCheckUtils]: 119: Hoare triple {36414#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:56,521 INFO L273 TraceCheckUtils]: 120: Hoare triple {36415#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:56,522 INFO L273 TraceCheckUtils]: 121: Hoare triple {36415#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:56,522 INFO L273 TraceCheckUtils]: 122: Hoare triple {36415#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:56,523 INFO L273 TraceCheckUtils]: 123: Hoare triple {36416#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:56,523 INFO L273 TraceCheckUtils]: 124: Hoare triple {36416#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:56,524 INFO L273 TraceCheckUtils]: 125: Hoare triple {36416#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:56,524 INFO L273 TraceCheckUtils]: 126: Hoare triple {36417#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:56,525 INFO L273 TraceCheckUtils]: 127: Hoare triple {36417#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:56,526 INFO L273 TraceCheckUtils]: 128: Hoare triple {36417#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:56,526 INFO L273 TraceCheckUtils]: 129: Hoare triple {36418#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:56,527 INFO L273 TraceCheckUtils]: 130: Hoare triple {36418#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:56,527 INFO L273 TraceCheckUtils]: 131: Hoare triple {36418#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:56,528 INFO L273 TraceCheckUtils]: 132: Hoare triple {36419#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:56,528 INFO L273 TraceCheckUtils]: 133: Hoare triple {36419#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:56,529 INFO L273 TraceCheckUtils]: 134: Hoare triple {36419#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:56,530 INFO L273 TraceCheckUtils]: 135: Hoare triple {36420#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:56,530 INFO L273 TraceCheckUtils]: 136: Hoare triple {36420#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:56,531 INFO L273 TraceCheckUtils]: 137: Hoare triple {36420#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:56,531 INFO L273 TraceCheckUtils]: 138: Hoare triple {36421#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:56,532 INFO L273 TraceCheckUtils]: 139: Hoare triple {36421#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:56,532 INFO L273 TraceCheckUtils]: 140: Hoare triple {36421#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:56,533 INFO L273 TraceCheckUtils]: 141: Hoare triple {36422#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:56,533 INFO L273 TraceCheckUtils]: 142: Hoare triple {36422#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:56,534 INFO L273 TraceCheckUtils]: 143: Hoare triple {36422#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:56,535 INFO L273 TraceCheckUtils]: 144: Hoare triple {36423#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:56,535 INFO L273 TraceCheckUtils]: 145: Hoare triple {36423#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:56,536 INFO L273 TraceCheckUtils]: 146: Hoare triple {36423#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:56,536 INFO L273 TraceCheckUtils]: 147: Hoare triple {36424#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:56,537 INFO L273 TraceCheckUtils]: 148: Hoare triple {36424#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:56,538 INFO L273 TraceCheckUtils]: 149: Hoare triple {36424#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:56,538 INFO L273 TraceCheckUtils]: 150: Hoare triple {36425#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:56,539 INFO L273 TraceCheckUtils]: 151: Hoare triple {36425#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:56,539 INFO L273 TraceCheckUtils]: 152: Hoare triple {36425#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {36426#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:56,540 INFO L273 TraceCheckUtils]: 153: Hoare triple {36426#(<= main_~i~0 49)} assume !(~i~0 < 100000); {36376#false} is VALID [2018-11-23 12:06:56,540 INFO L273 TraceCheckUtils]: 154: Hoare triple {36376#false} havoc ~x~0;~x~0 := 0; {36376#false} is VALID [2018-11-23 12:06:56,540 INFO L273 TraceCheckUtils]: 155: Hoare triple {36376#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {36376#false} is VALID [2018-11-23 12:06:56,540 INFO L256 TraceCheckUtils]: 156: Hoare triple {36376#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {36376#false} is VALID [2018-11-23 12:06:56,541 INFO L273 TraceCheckUtils]: 157: Hoare triple {36376#false} ~cond := #in~cond; {36376#false} is VALID [2018-11-23 12:06:56,541 INFO L273 TraceCheckUtils]: 158: Hoare triple {36376#false} assume 0 == ~cond; {36376#false} is VALID [2018-11-23 12:06:56,541 INFO L273 TraceCheckUtils]: 159: Hoare triple {36376#false} assume !false; {36376#false} is VALID [2018-11-23 12:06:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:56,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:56,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2018-11-23 12:06:56,577 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 160 [2018-11-23 12:06:56,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:56,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-23 12:06:56,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:56,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 12:06:56,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 12:06:56,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:06:56,736 INFO L87 Difference]: Start difference. First operand 165 states and 215 transitions. Second operand 53 states. [2018-11-23 12:06:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:57,808 INFO L93 Difference]: Finished difference Result 181 states and 234 transitions. [2018-11-23 12:06:57,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 12:06:57,809 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 160 [2018-11-23 12:06:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:06:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 234 transitions. [2018-11-23 12:06:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:06:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 234 transitions. [2018-11-23 12:06:57,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 234 transitions. [2018-11-23 12:06:58,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:58,030 INFO L225 Difference]: With dead ends: 181 [2018-11-23 12:06:58,030 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 12:06:58,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:06:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 12:06:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-11-23 12:06:58,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:58,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 168 states. [2018-11-23 12:06:58,068 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 168 states. [2018-11-23 12:06:58,068 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 168 states. [2018-11-23 12:06:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:58,071 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2018-11-23 12:06:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2018-11-23 12:06:58,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:58,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:58,071 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 170 states. [2018-11-23 12:06:58,071 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 170 states. [2018-11-23 12:06:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:58,074 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2018-11-23 12:06:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2018-11-23 12:06:58,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:58,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:58,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:58,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 12:06:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 219 transitions. [2018-11-23 12:06:58,076 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 219 transitions. Word has length 160 [2018-11-23 12:06:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:58,077 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 219 transitions. [2018-11-23 12:06:58,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-23 12:06:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2018-11-23 12:06:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 12:06:58,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:58,077 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:58,078 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:58,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2002706041, now seen corresponding path program 50 times [2018-11-23 12:06:58,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:58,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:58,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:58,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:59,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {37715#true} call ULTIMATE.init(); {37715#true} is VALID [2018-11-23 12:06:59,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {37715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37715#true} is VALID [2018-11-23 12:06:59,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {37715#true} assume true; {37715#true} is VALID [2018-11-23 12:06:59,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37715#true} {37715#true} #55#return; {37715#true} is VALID [2018-11-23 12:06:59,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {37715#true} call #t~ret4 := main(); {37715#true} is VALID [2018-11-23 12:06:59,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {37715#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {37717#(= main_~i~0 0)} is VALID [2018-11-23 12:06:59,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {37717#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37717#(= main_~i~0 0)} is VALID [2018-11-23 12:06:59,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {37717#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37717#(= main_~i~0 0)} is VALID [2018-11-23 12:06:59,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {37717#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:59,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {37718#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:59,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {37718#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:59,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {37718#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:59,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {37719#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:59,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {37719#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:59,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {37719#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:59,698 INFO L273 TraceCheckUtils]: 15: Hoare triple {37720#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:59,699 INFO L273 TraceCheckUtils]: 16: Hoare triple {37720#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:59,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {37720#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:59,700 INFO L273 TraceCheckUtils]: 18: Hoare triple {37721#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:59,701 INFO L273 TraceCheckUtils]: 19: Hoare triple {37721#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:59,701 INFO L273 TraceCheckUtils]: 20: Hoare triple {37721#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:59,702 INFO L273 TraceCheckUtils]: 21: Hoare triple {37722#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:59,702 INFO L273 TraceCheckUtils]: 22: Hoare triple {37722#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:59,703 INFO L273 TraceCheckUtils]: 23: Hoare triple {37722#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:59,703 INFO L273 TraceCheckUtils]: 24: Hoare triple {37723#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:59,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {37723#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:59,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {37723#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:59,705 INFO L273 TraceCheckUtils]: 27: Hoare triple {37724#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:59,705 INFO L273 TraceCheckUtils]: 28: Hoare triple {37724#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:59,706 INFO L273 TraceCheckUtils]: 29: Hoare triple {37724#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:59,707 INFO L273 TraceCheckUtils]: 30: Hoare triple {37725#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:59,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {37725#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:59,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {37725#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:59,708 INFO L273 TraceCheckUtils]: 33: Hoare triple {37726#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:59,709 INFO L273 TraceCheckUtils]: 34: Hoare triple {37726#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:59,709 INFO L273 TraceCheckUtils]: 35: Hoare triple {37726#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:59,710 INFO L273 TraceCheckUtils]: 36: Hoare triple {37727#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:59,710 INFO L273 TraceCheckUtils]: 37: Hoare triple {37727#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:59,711 INFO L273 TraceCheckUtils]: 38: Hoare triple {37727#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:59,711 INFO L273 TraceCheckUtils]: 39: Hoare triple {37728#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:59,712 INFO L273 TraceCheckUtils]: 40: Hoare triple {37728#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:59,712 INFO L273 TraceCheckUtils]: 41: Hoare triple {37728#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:59,713 INFO L273 TraceCheckUtils]: 42: Hoare triple {37729#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:59,713 INFO L273 TraceCheckUtils]: 43: Hoare triple {37729#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:59,714 INFO L273 TraceCheckUtils]: 44: Hoare triple {37729#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:59,715 INFO L273 TraceCheckUtils]: 45: Hoare triple {37730#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:59,715 INFO L273 TraceCheckUtils]: 46: Hoare triple {37730#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:59,716 INFO L273 TraceCheckUtils]: 47: Hoare triple {37730#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:59,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {37731#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:59,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {37731#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:59,717 INFO L273 TraceCheckUtils]: 50: Hoare triple {37731#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:59,718 INFO L273 TraceCheckUtils]: 51: Hoare triple {37732#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:59,718 INFO L273 TraceCheckUtils]: 52: Hoare triple {37732#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:59,719 INFO L273 TraceCheckUtils]: 53: Hoare triple {37732#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:59,719 INFO L273 TraceCheckUtils]: 54: Hoare triple {37733#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:59,720 INFO L273 TraceCheckUtils]: 55: Hoare triple {37733#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:59,720 INFO L273 TraceCheckUtils]: 56: Hoare triple {37733#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:59,721 INFO L273 TraceCheckUtils]: 57: Hoare triple {37734#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:59,721 INFO L273 TraceCheckUtils]: 58: Hoare triple {37734#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:59,722 INFO L273 TraceCheckUtils]: 59: Hoare triple {37734#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:59,722 INFO L273 TraceCheckUtils]: 60: Hoare triple {37735#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:59,723 INFO L273 TraceCheckUtils]: 61: Hoare triple {37735#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:59,724 INFO L273 TraceCheckUtils]: 62: Hoare triple {37735#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:59,724 INFO L273 TraceCheckUtils]: 63: Hoare triple {37736#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:59,725 INFO L273 TraceCheckUtils]: 64: Hoare triple {37736#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:59,725 INFO L273 TraceCheckUtils]: 65: Hoare triple {37736#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:59,726 INFO L273 TraceCheckUtils]: 66: Hoare triple {37737#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:59,726 INFO L273 TraceCheckUtils]: 67: Hoare triple {37737#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:59,727 INFO L273 TraceCheckUtils]: 68: Hoare triple {37737#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:59,727 INFO L273 TraceCheckUtils]: 69: Hoare triple {37738#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:59,728 INFO L273 TraceCheckUtils]: 70: Hoare triple {37738#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:59,728 INFO L273 TraceCheckUtils]: 71: Hoare triple {37738#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:59,729 INFO L273 TraceCheckUtils]: 72: Hoare triple {37739#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:59,729 INFO L273 TraceCheckUtils]: 73: Hoare triple {37739#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:59,730 INFO L273 TraceCheckUtils]: 74: Hoare triple {37739#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:59,730 INFO L273 TraceCheckUtils]: 75: Hoare triple {37740#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:59,731 INFO L273 TraceCheckUtils]: 76: Hoare triple {37740#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:59,732 INFO L273 TraceCheckUtils]: 77: Hoare triple {37740#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:59,732 INFO L273 TraceCheckUtils]: 78: Hoare triple {37741#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:59,733 INFO L273 TraceCheckUtils]: 79: Hoare triple {37741#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:59,733 INFO L273 TraceCheckUtils]: 80: Hoare triple {37741#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:59,734 INFO L273 TraceCheckUtils]: 81: Hoare triple {37742#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:59,734 INFO L273 TraceCheckUtils]: 82: Hoare triple {37742#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:59,735 INFO L273 TraceCheckUtils]: 83: Hoare triple {37742#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:59,735 INFO L273 TraceCheckUtils]: 84: Hoare triple {37743#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:59,736 INFO L273 TraceCheckUtils]: 85: Hoare triple {37743#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:59,736 INFO L273 TraceCheckUtils]: 86: Hoare triple {37743#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:59,737 INFO L273 TraceCheckUtils]: 87: Hoare triple {37744#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:59,737 INFO L273 TraceCheckUtils]: 88: Hoare triple {37744#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:59,738 INFO L273 TraceCheckUtils]: 89: Hoare triple {37744#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:59,738 INFO L273 TraceCheckUtils]: 90: Hoare triple {37745#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:59,739 INFO L273 TraceCheckUtils]: 91: Hoare triple {37745#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:59,740 INFO L273 TraceCheckUtils]: 92: Hoare triple {37745#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:59,740 INFO L273 TraceCheckUtils]: 93: Hoare triple {37746#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:59,741 INFO L273 TraceCheckUtils]: 94: Hoare triple {37746#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:59,741 INFO L273 TraceCheckUtils]: 95: Hoare triple {37746#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:59,742 INFO L273 TraceCheckUtils]: 96: Hoare triple {37747#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:59,742 INFO L273 TraceCheckUtils]: 97: Hoare triple {37747#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:59,743 INFO L273 TraceCheckUtils]: 98: Hoare triple {37747#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:59,743 INFO L273 TraceCheckUtils]: 99: Hoare triple {37748#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:59,744 INFO L273 TraceCheckUtils]: 100: Hoare triple {37748#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:59,744 INFO L273 TraceCheckUtils]: 101: Hoare triple {37748#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:59,745 INFO L273 TraceCheckUtils]: 102: Hoare triple {37749#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:59,745 INFO L273 TraceCheckUtils]: 103: Hoare triple {37749#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:59,746 INFO L273 TraceCheckUtils]: 104: Hoare triple {37749#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:59,746 INFO L273 TraceCheckUtils]: 105: Hoare triple {37750#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:59,747 INFO L273 TraceCheckUtils]: 106: Hoare triple {37750#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:59,748 INFO L273 TraceCheckUtils]: 107: Hoare triple {37750#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:59,748 INFO L273 TraceCheckUtils]: 108: Hoare triple {37751#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:59,749 INFO L273 TraceCheckUtils]: 109: Hoare triple {37751#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:59,749 INFO L273 TraceCheckUtils]: 110: Hoare triple {37751#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:59,750 INFO L273 TraceCheckUtils]: 111: Hoare triple {37752#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:59,750 INFO L273 TraceCheckUtils]: 112: Hoare triple {37752#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:59,751 INFO L273 TraceCheckUtils]: 113: Hoare triple {37752#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:59,751 INFO L273 TraceCheckUtils]: 114: Hoare triple {37753#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:59,752 INFO L273 TraceCheckUtils]: 115: Hoare triple {37753#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:59,752 INFO L273 TraceCheckUtils]: 116: Hoare triple {37753#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:59,753 INFO L273 TraceCheckUtils]: 117: Hoare triple {37754#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:59,753 INFO L273 TraceCheckUtils]: 118: Hoare triple {37754#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:59,754 INFO L273 TraceCheckUtils]: 119: Hoare triple {37754#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:59,754 INFO L273 TraceCheckUtils]: 120: Hoare triple {37755#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:59,755 INFO L273 TraceCheckUtils]: 121: Hoare triple {37755#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:59,756 INFO L273 TraceCheckUtils]: 122: Hoare triple {37755#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:59,756 INFO L273 TraceCheckUtils]: 123: Hoare triple {37756#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:59,756 INFO L273 TraceCheckUtils]: 124: Hoare triple {37756#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:59,757 INFO L273 TraceCheckUtils]: 125: Hoare triple {37756#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:59,758 INFO L273 TraceCheckUtils]: 126: Hoare triple {37757#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:59,758 INFO L273 TraceCheckUtils]: 127: Hoare triple {37757#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:59,759 INFO L273 TraceCheckUtils]: 128: Hoare triple {37757#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:59,759 INFO L273 TraceCheckUtils]: 129: Hoare triple {37758#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:59,760 INFO L273 TraceCheckUtils]: 130: Hoare triple {37758#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:59,760 INFO L273 TraceCheckUtils]: 131: Hoare triple {37758#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:59,761 INFO L273 TraceCheckUtils]: 132: Hoare triple {37759#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:59,761 INFO L273 TraceCheckUtils]: 133: Hoare triple {37759#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:59,762 INFO L273 TraceCheckUtils]: 134: Hoare triple {37759#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:59,763 INFO L273 TraceCheckUtils]: 135: Hoare triple {37760#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:59,763 INFO L273 TraceCheckUtils]: 136: Hoare triple {37760#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:59,764 INFO L273 TraceCheckUtils]: 137: Hoare triple {37760#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:59,764 INFO L273 TraceCheckUtils]: 138: Hoare triple {37761#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:59,765 INFO L273 TraceCheckUtils]: 139: Hoare triple {37761#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:59,765 INFO L273 TraceCheckUtils]: 140: Hoare triple {37761#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:59,766 INFO L273 TraceCheckUtils]: 141: Hoare triple {37762#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:59,766 INFO L273 TraceCheckUtils]: 142: Hoare triple {37762#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:59,767 INFO L273 TraceCheckUtils]: 143: Hoare triple {37762#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:59,768 INFO L273 TraceCheckUtils]: 144: Hoare triple {37763#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:59,768 INFO L273 TraceCheckUtils]: 145: Hoare triple {37763#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:59,769 INFO L273 TraceCheckUtils]: 146: Hoare triple {37763#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:59,769 INFO L273 TraceCheckUtils]: 147: Hoare triple {37764#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:59,770 INFO L273 TraceCheckUtils]: 148: Hoare triple {37764#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:59,771 INFO L273 TraceCheckUtils]: 149: Hoare triple {37764#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:59,771 INFO L273 TraceCheckUtils]: 150: Hoare triple {37765#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:59,772 INFO L273 TraceCheckUtils]: 151: Hoare triple {37765#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:59,772 INFO L273 TraceCheckUtils]: 152: Hoare triple {37765#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:59,773 INFO L273 TraceCheckUtils]: 153: Hoare triple {37766#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:59,773 INFO L273 TraceCheckUtils]: 154: Hoare triple {37766#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:59,774 INFO L273 TraceCheckUtils]: 155: Hoare triple {37766#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {37767#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:59,775 INFO L273 TraceCheckUtils]: 156: Hoare triple {37767#(<= main_~i~0 50)} assume !(~i~0 < 100000); {37716#false} is VALID [2018-11-23 12:06:59,775 INFO L273 TraceCheckUtils]: 157: Hoare triple {37716#false} havoc ~x~0;~x~0 := 0; {37716#false} is VALID [2018-11-23 12:06:59,775 INFO L273 TraceCheckUtils]: 158: Hoare triple {37716#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {37716#false} is VALID [2018-11-23 12:06:59,775 INFO L256 TraceCheckUtils]: 159: Hoare triple {37716#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {37716#false} is VALID [2018-11-23 12:06:59,775 INFO L273 TraceCheckUtils]: 160: Hoare triple {37716#false} ~cond := #in~cond; {37716#false} is VALID [2018-11-23 12:06:59,776 INFO L273 TraceCheckUtils]: 161: Hoare triple {37716#false} assume 0 == ~cond; {37716#false} is VALID [2018-11-23 12:06:59,776 INFO L273 TraceCheckUtils]: 162: Hoare triple {37716#false} assume !false; {37716#false} is VALID [2018-11-23 12:06:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:59,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:59,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:59,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:59,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:59,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:59,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:00,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {37715#true} call ULTIMATE.init(); {37715#true} is VALID [2018-11-23 12:07:00,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {37715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37715#true} is VALID [2018-11-23 12:07:00,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {37715#true} assume true; {37715#true} is VALID [2018-11-23 12:07:00,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37715#true} {37715#true} #55#return; {37715#true} is VALID [2018-11-23 12:07:00,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {37715#true} call #t~ret4 := main(); {37715#true} is VALID [2018-11-23 12:07:00,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {37715#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {37786#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:00,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {37786#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37786#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:00,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {37786#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37786#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:00,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {37786#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:00,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {37718#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:00,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {37718#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:00,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {37718#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:00,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {37719#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:00,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {37719#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:00,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {37719#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:00,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {37720#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:00,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {37720#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:00,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {37720#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:00,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {37721#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:00,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {37721#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:00,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {37721#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:00,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {37722#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:00,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {37722#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:00,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {37722#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:00,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {37723#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:00,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {37723#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:00,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {37723#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:00,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {37724#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:00,363 INFO L273 TraceCheckUtils]: 28: Hoare triple {37724#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:00,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {37724#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:00,365 INFO L273 TraceCheckUtils]: 30: Hoare triple {37725#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:00,365 INFO L273 TraceCheckUtils]: 31: Hoare triple {37725#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:00,366 INFO L273 TraceCheckUtils]: 32: Hoare triple {37725#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:00,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {37726#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:00,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {37726#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:00,367 INFO L273 TraceCheckUtils]: 35: Hoare triple {37726#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:00,368 INFO L273 TraceCheckUtils]: 36: Hoare triple {37727#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:00,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {37727#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:00,369 INFO L273 TraceCheckUtils]: 38: Hoare triple {37727#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:00,369 INFO L273 TraceCheckUtils]: 39: Hoare triple {37728#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:00,370 INFO L273 TraceCheckUtils]: 40: Hoare triple {37728#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:00,370 INFO L273 TraceCheckUtils]: 41: Hoare triple {37728#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:00,371 INFO L273 TraceCheckUtils]: 42: Hoare triple {37729#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:00,371 INFO L273 TraceCheckUtils]: 43: Hoare triple {37729#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:00,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {37729#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:00,373 INFO L273 TraceCheckUtils]: 45: Hoare triple {37730#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:00,373 INFO L273 TraceCheckUtils]: 46: Hoare triple {37730#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:00,374 INFO L273 TraceCheckUtils]: 47: Hoare triple {37730#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:00,374 INFO L273 TraceCheckUtils]: 48: Hoare triple {37731#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:00,375 INFO L273 TraceCheckUtils]: 49: Hoare triple {37731#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:00,375 INFO L273 TraceCheckUtils]: 50: Hoare triple {37731#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:00,376 INFO L273 TraceCheckUtils]: 51: Hoare triple {37732#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:00,376 INFO L273 TraceCheckUtils]: 52: Hoare triple {37732#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:00,377 INFO L273 TraceCheckUtils]: 53: Hoare triple {37732#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:00,377 INFO L273 TraceCheckUtils]: 54: Hoare triple {37733#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:00,378 INFO L273 TraceCheckUtils]: 55: Hoare triple {37733#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:00,378 INFO L273 TraceCheckUtils]: 56: Hoare triple {37733#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:00,379 INFO L273 TraceCheckUtils]: 57: Hoare triple {37734#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:00,379 INFO L273 TraceCheckUtils]: 58: Hoare triple {37734#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:00,380 INFO L273 TraceCheckUtils]: 59: Hoare triple {37734#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:00,380 INFO L273 TraceCheckUtils]: 60: Hoare triple {37735#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:00,381 INFO L273 TraceCheckUtils]: 61: Hoare triple {37735#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:00,382 INFO L273 TraceCheckUtils]: 62: Hoare triple {37735#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:00,382 INFO L273 TraceCheckUtils]: 63: Hoare triple {37736#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:00,383 INFO L273 TraceCheckUtils]: 64: Hoare triple {37736#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:00,383 INFO L273 TraceCheckUtils]: 65: Hoare triple {37736#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:00,384 INFO L273 TraceCheckUtils]: 66: Hoare triple {37737#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:00,384 INFO L273 TraceCheckUtils]: 67: Hoare triple {37737#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:00,385 INFO L273 TraceCheckUtils]: 68: Hoare triple {37737#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:00,385 INFO L273 TraceCheckUtils]: 69: Hoare triple {37738#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:00,386 INFO L273 TraceCheckUtils]: 70: Hoare triple {37738#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:00,386 INFO L273 TraceCheckUtils]: 71: Hoare triple {37738#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:00,387 INFO L273 TraceCheckUtils]: 72: Hoare triple {37739#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:00,387 INFO L273 TraceCheckUtils]: 73: Hoare triple {37739#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:00,388 INFO L273 TraceCheckUtils]: 74: Hoare triple {37739#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:00,388 INFO L273 TraceCheckUtils]: 75: Hoare triple {37740#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:00,389 INFO L273 TraceCheckUtils]: 76: Hoare triple {37740#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:00,390 INFO L273 TraceCheckUtils]: 77: Hoare triple {37740#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:00,390 INFO L273 TraceCheckUtils]: 78: Hoare triple {37741#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:00,391 INFO L273 TraceCheckUtils]: 79: Hoare triple {37741#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:00,391 INFO L273 TraceCheckUtils]: 80: Hoare triple {37741#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:00,392 INFO L273 TraceCheckUtils]: 81: Hoare triple {37742#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:00,392 INFO L273 TraceCheckUtils]: 82: Hoare triple {37742#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:00,393 INFO L273 TraceCheckUtils]: 83: Hoare triple {37742#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:00,393 INFO L273 TraceCheckUtils]: 84: Hoare triple {37743#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:00,394 INFO L273 TraceCheckUtils]: 85: Hoare triple {37743#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:00,394 INFO L273 TraceCheckUtils]: 86: Hoare triple {37743#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:00,395 INFO L273 TraceCheckUtils]: 87: Hoare triple {37744#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:00,395 INFO L273 TraceCheckUtils]: 88: Hoare triple {37744#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:00,396 INFO L273 TraceCheckUtils]: 89: Hoare triple {37744#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:00,397 INFO L273 TraceCheckUtils]: 90: Hoare triple {37745#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:00,397 INFO L273 TraceCheckUtils]: 91: Hoare triple {37745#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:00,398 INFO L273 TraceCheckUtils]: 92: Hoare triple {37745#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:00,398 INFO L273 TraceCheckUtils]: 93: Hoare triple {37746#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:00,399 INFO L273 TraceCheckUtils]: 94: Hoare triple {37746#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:00,399 INFO L273 TraceCheckUtils]: 95: Hoare triple {37746#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:00,400 INFO L273 TraceCheckUtils]: 96: Hoare triple {37747#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:00,400 INFO L273 TraceCheckUtils]: 97: Hoare triple {37747#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:00,401 INFO L273 TraceCheckUtils]: 98: Hoare triple {37747#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:00,401 INFO L273 TraceCheckUtils]: 99: Hoare triple {37748#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:00,402 INFO L273 TraceCheckUtils]: 100: Hoare triple {37748#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:00,403 INFO L273 TraceCheckUtils]: 101: Hoare triple {37748#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:00,403 INFO L273 TraceCheckUtils]: 102: Hoare triple {37749#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:00,404 INFO L273 TraceCheckUtils]: 103: Hoare triple {37749#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:00,404 INFO L273 TraceCheckUtils]: 104: Hoare triple {37749#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:00,405 INFO L273 TraceCheckUtils]: 105: Hoare triple {37750#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:00,405 INFO L273 TraceCheckUtils]: 106: Hoare triple {37750#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:00,406 INFO L273 TraceCheckUtils]: 107: Hoare triple {37750#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:00,406 INFO L273 TraceCheckUtils]: 108: Hoare triple {37751#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:00,407 INFO L273 TraceCheckUtils]: 109: Hoare triple {37751#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:00,407 INFO L273 TraceCheckUtils]: 110: Hoare triple {37751#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:00,408 INFO L273 TraceCheckUtils]: 111: Hoare triple {37752#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:00,408 INFO L273 TraceCheckUtils]: 112: Hoare triple {37752#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:00,409 INFO L273 TraceCheckUtils]: 113: Hoare triple {37752#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:00,410 INFO L273 TraceCheckUtils]: 114: Hoare triple {37753#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:00,410 INFO L273 TraceCheckUtils]: 115: Hoare triple {37753#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:00,411 INFO L273 TraceCheckUtils]: 116: Hoare triple {37753#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:00,411 INFO L273 TraceCheckUtils]: 117: Hoare triple {37754#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:00,412 INFO L273 TraceCheckUtils]: 118: Hoare triple {37754#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:00,412 INFO L273 TraceCheckUtils]: 119: Hoare triple {37754#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:00,413 INFO L273 TraceCheckUtils]: 120: Hoare triple {37755#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:00,413 INFO L273 TraceCheckUtils]: 121: Hoare triple {37755#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:00,414 INFO L273 TraceCheckUtils]: 122: Hoare triple {37755#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:00,414 INFO L273 TraceCheckUtils]: 123: Hoare triple {37756#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:00,415 INFO L273 TraceCheckUtils]: 124: Hoare triple {37756#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:00,415 INFO L273 TraceCheckUtils]: 125: Hoare triple {37756#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:00,416 INFO L273 TraceCheckUtils]: 126: Hoare triple {37757#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:00,416 INFO L273 TraceCheckUtils]: 127: Hoare triple {37757#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:00,417 INFO L273 TraceCheckUtils]: 128: Hoare triple {37757#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:00,418 INFO L273 TraceCheckUtils]: 129: Hoare triple {37758#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:00,418 INFO L273 TraceCheckUtils]: 130: Hoare triple {37758#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:00,419 INFO L273 TraceCheckUtils]: 131: Hoare triple {37758#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:00,419 INFO L273 TraceCheckUtils]: 132: Hoare triple {37759#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:00,420 INFO L273 TraceCheckUtils]: 133: Hoare triple {37759#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:00,420 INFO L273 TraceCheckUtils]: 134: Hoare triple {37759#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:00,421 INFO L273 TraceCheckUtils]: 135: Hoare triple {37760#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:00,421 INFO L273 TraceCheckUtils]: 136: Hoare triple {37760#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:00,422 INFO L273 TraceCheckUtils]: 137: Hoare triple {37760#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:00,422 INFO L273 TraceCheckUtils]: 138: Hoare triple {37761#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:00,423 INFO L273 TraceCheckUtils]: 139: Hoare triple {37761#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:00,423 INFO L273 TraceCheckUtils]: 140: Hoare triple {37761#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:00,424 INFO L273 TraceCheckUtils]: 141: Hoare triple {37762#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:00,424 INFO L273 TraceCheckUtils]: 142: Hoare triple {37762#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:00,425 INFO L273 TraceCheckUtils]: 143: Hoare triple {37762#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:00,426 INFO L273 TraceCheckUtils]: 144: Hoare triple {37763#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:00,426 INFO L273 TraceCheckUtils]: 145: Hoare triple {37763#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:00,427 INFO L273 TraceCheckUtils]: 146: Hoare triple {37763#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:00,427 INFO L273 TraceCheckUtils]: 147: Hoare triple {37764#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:00,428 INFO L273 TraceCheckUtils]: 148: Hoare triple {37764#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:00,428 INFO L273 TraceCheckUtils]: 149: Hoare triple {37764#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:00,429 INFO L273 TraceCheckUtils]: 150: Hoare triple {37765#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:00,429 INFO L273 TraceCheckUtils]: 151: Hoare triple {37765#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:00,430 INFO L273 TraceCheckUtils]: 152: Hoare triple {37765#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:00,430 INFO L273 TraceCheckUtils]: 153: Hoare triple {37766#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:00,431 INFO L273 TraceCheckUtils]: 154: Hoare triple {37766#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:00,431 INFO L273 TraceCheckUtils]: 155: Hoare triple {37766#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {37767#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:00,432 INFO L273 TraceCheckUtils]: 156: Hoare triple {37767#(<= main_~i~0 50)} assume !(~i~0 < 100000); {37716#false} is VALID [2018-11-23 12:07:00,432 INFO L273 TraceCheckUtils]: 157: Hoare triple {37716#false} havoc ~x~0;~x~0 := 0; {37716#false} is VALID [2018-11-23 12:07:00,432 INFO L273 TraceCheckUtils]: 158: Hoare triple {37716#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {37716#false} is VALID [2018-11-23 12:07:00,433 INFO L256 TraceCheckUtils]: 159: Hoare triple {37716#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {37716#false} is VALID [2018-11-23 12:07:00,433 INFO L273 TraceCheckUtils]: 160: Hoare triple {37716#false} ~cond := #in~cond; {37716#false} is VALID [2018-11-23 12:07:00,433 INFO L273 TraceCheckUtils]: 161: Hoare triple {37716#false} assume 0 == ~cond; {37716#false} is VALID [2018-11-23 12:07:00,433 INFO L273 TraceCheckUtils]: 162: Hoare triple {37716#false} assume !false; {37716#false} is VALID [2018-11-23 12:07:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:00,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:00,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2018-11-23 12:07:00,468 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 163 [2018-11-23 12:07:00,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:00,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 12:07:00,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:00,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 12:07:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 12:07:00,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:07:00,627 INFO L87 Difference]: Start difference. First operand 168 states and 219 transitions. Second operand 54 states. [2018-11-23 12:07:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:01,287 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2018-11-23 12:07:01,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 12:07:01,287 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 163 [2018-11-23 12:07:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:07:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 238 transitions. [2018-11-23 12:07:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:07:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 238 transitions. [2018-11-23 12:07:01,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 238 transitions. [2018-11-23 12:07:01,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:01,519 INFO L225 Difference]: With dead ends: 184 [2018-11-23 12:07:01,519 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 12:07:01,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:07:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 12:07:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-11-23 12:07:01,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:01,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 171 states. [2018-11-23 12:07:01,573 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 171 states. [2018-11-23 12:07:01,573 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 171 states. [2018-11-23 12:07:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:01,576 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2018-11-23 12:07:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2018-11-23 12:07:01,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:01,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:01,577 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 173 states. [2018-11-23 12:07:01,577 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 173 states. [2018-11-23 12:07:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:01,579 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2018-11-23 12:07:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2018-11-23 12:07:01,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:01,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:01,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:01,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 12:07:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-11-23 12:07:01,582 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 163 [2018-11-23 12:07:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:01,582 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-11-23 12:07:01,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 12:07:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-11-23 12:07:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-23 12:07:01,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:01,583 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:01,583 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:01,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:01,583 INFO L82 PathProgramCache]: Analyzing trace with hash 270324515, now seen corresponding path program 51 times [2018-11-23 12:07:01,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:01,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:01,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:01,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:01,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:02,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {39079#true} call ULTIMATE.init(); {39079#true} is VALID [2018-11-23 12:07:02,822 INFO L273 TraceCheckUtils]: 1: Hoare triple {39079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39079#true} is VALID [2018-11-23 12:07:02,822 INFO L273 TraceCheckUtils]: 2: Hoare triple {39079#true} assume true; {39079#true} is VALID [2018-11-23 12:07:02,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39079#true} {39079#true} #55#return; {39079#true} is VALID [2018-11-23 12:07:02,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {39079#true} call #t~ret4 := main(); {39079#true} is VALID [2018-11-23 12:07:02,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {39079#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {39081#(= main_~i~0 0)} is VALID [2018-11-23 12:07:02,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {39081#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39081#(= main_~i~0 0)} is VALID [2018-11-23 12:07:02,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {39081#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39081#(= main_~i~0 0)} is VALID [2018-11-23 12:07:02,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {39081#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:02,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {39082#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:02,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {39082#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:02,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {39082#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:02,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {39083#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:02,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {39083#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:02,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {39083#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:02,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {39084#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:02,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {39084#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:02,828 INFO L273 TraceCheckUtils]: 17: Hoare triple {39084#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:02,829 INFO L273 TraceCheckUtils]: 18: Hoare triple {39085#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:02,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {39085#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:02,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {39085#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:02,831 INFO L273 TraceCheckUtils]: 21: Hoare triple {39086#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:02,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {39086#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:02,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {39086#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:02,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {39087#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:02,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {39087#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:02,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {39087#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:02,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {39088#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:02,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {39088#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:02,835 INFO L273 TraceCheckUtils]: 29: Hoare triple {39088#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:02,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {39089#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:02,836 INFO L273 TraceCheckUtils]: 31: Hoare triple {39089#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:02,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {39089#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:02,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {39090#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:02,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {39090#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:02,839 INFO L273 TraceCheckUtils]: 35: Hoare triple {39090#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:02,839 INFO L273 TraceCheckUtils]: 36: Hoare triple {39091#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:02,840 INFO L273 TraceCheckUtils]: 37: Hoare triple {39091#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:02,840 INFO L273 TraceCheckUtils]: 38: Hoare triple {39091#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:02,841 INFO L273 TraceCheckUtils]: 39: Hoare triple {39092#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:02,841 INFO L273 TraceCheckUtils]: 40: Hoare triple {39092#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:02,842 INFO L273 TraceCheckUtils]: 41: Hoare triple {39092#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:02,842 INFO L273 TraceCheckUtils]: 42: Hoare triple {39093#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:02,843 INFO L273 TraceCheckUtils]: 43: Hoare triple {39093#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:02,844 INFO L273 TraceCheckUtils]: 44: Hoare triple {39093#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:02,844 INFO L273 TraceCheckUtils]: 45: Hoare triple {39094#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:02,845 INFO L273 TraceCheckUtils]: 46: Hoare triple {39094#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:02,845 INFO L273 TraceCheckUtils]: 47: Hoare triple {39094#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:02,846 INFO L273 TraceCheckUtils]: 48: Hoare triple {39095#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:02,846 INFO L273 TraceCheckUtils]: 49: Hoare triple {39095#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:02,847 INFO L273 TraceCheckUtils]: 50: Hoare triple {39095#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:02,848 INFO L273 TraceCheckUtils]: 51: Hoare triple {39096#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:02,848 INFO L273 TraceCheckUtils]: 52: Hoare triple {39096#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:02,849 INFO L273 TraceCheckUtils]: 53: Hoare triple {39096#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:02,849 INFO L273 TraceCheckUtils]: 54: Hoare triple {39097#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:02,850 INFO L273 TraceCheckUtils]: 55: Hoare triple {39097#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:02,850 INFO L273 TraceCheckUtils]: 56: Hoare triple {39097#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:02,851 INFO L273 TraceCheckUtils]: 57: Hoare triple {39098#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:02,851 INFO L273 TraceCheckUtils]: 58: Hoare triple {39098#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:02,852 INFO L273 TraceCheckUtils]: 59: Hoare triple {39098#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:02,853 INFO L273 TraceCheckUtils]: 60: Hoare triple {39099#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:02,853 INFO L273 TraceCheckUtils]: 61: Hoare triple {39099#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:02,854 INFO L273 TraceCheckUtils]: 62: Hoare triple {39099#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:02,854 INFO L273 TraceCheckUtils]: 63: Hoare triple {39100#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:02,855 INFO L273 TraceCheckUtils]: 64: Hoare triple {39100#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:02,856 INFO L273 TraceCheckUtils]: 65: Hoare triple {39100#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:02,856 INFO L273 TraceCheckUtils]: 66: Hoare triple {39101#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:02,857 INFO L273 TraceCheckUtils]: 67: Hoare triple {39101#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:02,857 INFO L273 TraceCheckUtils]: 68: Hoare triple {39101#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:02,858 INFO L273 TraceCheckUtils]: 69: Hoare triple {39102#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:02,858 INFO L273 TraceCheckUtils]: 70: Hoare triple {39102#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:02,859 INFO L273 TraceCheckUtils]: 71: Hoare triple {39102#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:02,859 INFO L273 TraceCheckUtils]: 72: Hoare triple {39103#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:02,860 INFO L273 TraceCheckUtils]: 73: Hoare triple {39103#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:02,861 INFO L273 TraceCheckUtils]: 74: Hoare triple {39103#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:02,861 INFO L273 TraceCheckUtils]: 75: Hoare triple {39104#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:02,862 INFO L273 TraceCheckUtils]: 76: Hoare triple {39104#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:02,862 INFO L273 TraceCheckUtils]: 77: Hoare triple {39104#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:02,863 INFO L273 TraceCheckUtils]: 78: Hoare triple {39105#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:02,863 INFO L273 TraceCheckUtils]: 79: Hoare triple {39105#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:02,864 INFO L273 TraceCheckUtils]: 80: Hoare triple {39105#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:02,865 INFO L273 TraceCheckUtils]: 81: Hoare triple {39106#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:02,865 INFO L273 TraceCheckUtils]: 82: Hoare triple {39106#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:02,866 INFO L273 TraceCheckUtils]: 83: Hoare triple {39106#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:02,866 INFO L273 TraceCheckUtils]: 84: Hoare triple {39107#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:02,867 INFO L273 TraceCheckUtils]: 85: Hoare triple {39107#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:02,867 INFO L273 TraceCheckUtils]: 86: Hoare triple {39107#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:02,868 INFO L273 TraceCheckUtils]: 87: Hoare triple {39108#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:02,868 INFO L273 TraceCheckUtils]: 88: Hoare triple {39108#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:02,869 INFO L273 TraceCheckUtils]: 89: Hoare triple {39108#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:02,870 INFO L273 TraceCheckUtils]: 90: Hoare triple {39109#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:02,870 INFO L273 TraceCheckUtils]: 91: Hoare triple {39109#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:02,871 INFO L273 TraceCheckUtils]: 92: Hoare triple {39109#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:02,871 INFO L273 TraceCheckUtils]: 93: Hoare triple {39110#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:02,872 INFO L273 TraceCheckUtils]: 94: Hoare triple {39110#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:02,872 INFO L273 TraceCheckUtils]: 95: Hoare triple {39110#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:02,873 INFO L273 TraceCheckUtils]: 96: Hoare triple {39111#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:02,874 INFO L273 TraceCheckUtils]: 97: Hoare triple {39111#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:02,874 INFO L273 TraceCheckUtils]: 98: Hoare triple {39111#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:02,875 INFO L273 TraceCheckUtils]: 99: Hoare triple {39112#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:02,875 INFO L273 TraceCheckUtils]: 100: Hoare triple {39112#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:02,876 INFO L273 TraceCheckUtils]: 101: Hoare triple {39112#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:02,876 INFO L273 TraceCheckUtils]: 102: Hoare triple {39113#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:02,877 INFO L273 TraceCheckUtils]: 103: Hoare triple {39113#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:02,878 INFO L273 TraceCheckUtils]: 104: Hoare triple {39113#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:02,878 INFO L273 TraceCheckUtils]: 105: Hoare triple {39114#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:02,879 INFO L273 TraceCheckUtils]: 106: Hoare triple {39114#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:02,879 INFO L273 TraceCheckUtils]: 107: Hoare triple {39114#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:02,880 INFO L273 TraceCheckUtils]: 108: Hoare triple {39115#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:02,880 INFO L273 TraceCheckUtils]: 109: Hoare triple {39115#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:02,881 INFO L273 TraceCheckUtils]: 110: Hoare triple {39115#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:02,881 INFO L273 TraceCheckUtils]: 111: Hoare triple {39116#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:02,882 INFO L273 TraceCheckUtils]: 112: Hoare triple {39116#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:02,883 INFO L273 TraceCheckUtils]: 113: Hoare triple {39116#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:02,883 INFO L273 TraceCheckUtils]: 114: Hoare triple {39117#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:02,884 INFO L273 TraceCheckUtils]: 115: Hoare triple {39117#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:02,884 INFO L273 TraceCheckUtils]: 116: Hoare triple {39117#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:02,885 INFO L273 TraceCheckUtils]: 117: Hoare triple {39118#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:02,885 INFO L273 TraceCheckUtils]: 118: Hoare triple {39118#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:02,886 INFO L273 TraceCheckUtils]: 119: Hoare triple {39118#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:02,887 INFO L273 TraceCheckUtils]: 120: Hoare triple {39119#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:02,887 INFO L273 TraceCheckUtils]: 121: Hoare triple {39119#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:02,888 INFO L273 TraceCheckUtils]: 122: Hoare triple {39119#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:02,888 INFO L273 TraceCheckUtils]: 123: Hoare triple {39120#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:02,889 INFO L273 TraceCheckUtils]: 124: Hoare triple {39120#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:02,889 INFO L273 TraceCheckUtils]: 125: Hoare triple {39120#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:02,890 INFO L273 TraceCheckUtils]: 126: Hoare triple {39121#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:02,890 INFO L273 TraceCheckUtils]: 127: Hoare triple {39121#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:02,891 INFO L273 TraceCheckUtils]: 128: Hoare triple {39121#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:02,892 INFO L273 TraceCheckUtils]: 129: Hoare triple {39122#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:02,892 INFO L273 TraceCheckUtils]: 130: Hoare triple {39122#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:02,893 INFO L273 TraceCheckUtils]: 131: Hoare triple {39122#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:02,893 INFO L273 TraceCheckUtils]: 132: Hoare triple {39123#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:02,894 INFO L273 TraceCheckUtils]: 133: Hoare triple {39123#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:02,895 INFO L273 TraceCheckUtils]: 134: Hoare triple {39123#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:02,895 INFO L273 TraceCheckUtils]: 135: Hoare triple {39124#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:02,896 INFO L273 TraceCheckUtils]: 136: Hoare triple {39124#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:02,896 INFO L273 TraceCheckUtils]: 137: Hoare triple {39124#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:02,897 INFO L273 TraceCheckUtils]: 138: Hoare triple {39125#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:02,897 INFO L273 TraceCheckUtils]: 139: Hoare triple {39125#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:02,898 INFO L273 TraceCheckUtils]: 140: Hoare triple {39125#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:02,898 INFO L273 TraceCheckUtils]: 141: Hoare triple {39126#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:02,899 INFO L273 TraceCheckUtils]: 142: Hoare triple {39126#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:02,900 INFO L273 TraceCheckUtils]: 143: Hoare triple {39126#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:02,900 INFO L273 TraceCheckUtils]: 144: Hoare triple {39127#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:02,901 INFO L273 TraceCheckUtils]: 145: Hoare triple {39127#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:02,901 INFO L273 TraceCheckUtils]: 146: Hoare triple {39127#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:02,902 INFO L273 TraceCheckUtils]: 147: Hoare triple {39128#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:02,902 INFO L273 TraceCheckUtils]: 148: Hoare triple {39128#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:02,903 INFO L273 TraceCheckUtils]: 149: Hoare triple {39128#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:02,904 INFO L273 TraceCheckUtils]: 150: Hoare triple {39129#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:02,904 INFO L273 TraceCheckUtils]: 151: Hoare triple {39129#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:02,905 INFO L273 TraceCheckUtils]: 152: Hoare triple {39129#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:02,905 INFO L273 TraceCheckUtils]: 153: Hoare triple {39130#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:02,906 INFO L273 TraceCheckUtils]: 154: Hoare triple {39130#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:02,907 INFO L273 TraceCheckUtils]: 155: Hoare triple {39130#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:02,907 INFO L273 TraceCheckUtils]: 156: Hoare triple {39131#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:02,908 INFO L273 TraceCheckUtils]: 157: Hoare triple {39131#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:02,908 INFO L273 TraceCheckUtils]: 158: Hoare triple {39131#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {39132#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:02,909 INFO L273 TraceCheckUtils]: 159: Hoare triple {39132#(<= main_~i~0 51)} assume !(~i~0 < 100000); {39080#false} is VALID [2018-11-23 12:07:02,909 INFO L273 TraceCheckUtils]: 160: Hoare triple {39080#false} havoc ~x~0;~x~0 := 0; {39080#false} is VALID [2018-11-23 12:07:02,909 INFO L273 TraceCheckUtils]: 161: Hoare triple {39080#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {39080#false} is VALID [2018-11-23 12:07:02,909 INFO L256 TraceCheckUtils]: 162: Hoare triple {39080#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {39080#false} is VALID [2018-11-23 12:07:02,910 INFO L273 TraceCheckUtils]: 163: Hoare triple {39080#false} ~cond := #in~cond; {39080#false} is VALID [2018-11-23 12:07:02,910 INFO L273 TraceCheckUtils]: 164: Hoare triple {39080#false} assume 0 == ~cond; {39080#false} is VALID [2018-11-23 12:07:02,910 INFO L273 TraceCheckUtils]: 165: Hoare triple {39080#false} assume !false; {39080#false} is VALID [2018-11-23 12:07:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:02,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:02,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:02,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:07:03,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-11-23 12:07:03,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:03,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:04,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {39079#true} call ULTIMATE.init(); {39079#true} is VALID [2018-11-23 12:07:04,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {39079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39079#true} is VALID [2018-11-23 12:07:04,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {39079#true} assume true; {39079#true} is VALID [2018-11-23 12:07:04,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39079#true} {39079#true} #55#return; {39079#true} is VALID [2018-11-23 12:07:04,845 INFO L256 TraceCheckUtils]: 4: Hoare triple {39079#true} call #t~ret4 := main(); {39079#true} is VALID [2018-11-23 12:07:04,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {39079#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {39151#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:04,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {39151#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39151#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:04,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {39151#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39151#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:04,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {39151#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:04,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {39082#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:04,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {39082#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:04,848 INFO L273 TraceCheckUtils]: 11: Hoare triple {39082#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:04,849 INFO L273 TraceCheckUtils]: 12: Hoare triple {39083#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:04,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {39083#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:04,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {39083#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:04,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {39084#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:04,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {39084#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:04,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {39084#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:04,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {39085#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:04,853 INFO L273 TraceCheckUtils]: 19: Hoare triple {39085#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:04,853 INFO L273 TraceCheckUtils]: 20: Hoare triple {39085#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:04,854 INFO L273 TraceCheckUtils]: 21: Hoare triple {39086#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:04,854 INFO L273 TraceCheckUtils]: 22: Hoare triple {39086#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:04,855 INFO L273 TraceCheckUtils]: 23: Hoare triple {39086#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:04,855 INFO L273 TraceCheckUtils]: 24: Hoare triple {39087#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:04,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {39087#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:04,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {39087#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:04,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {39088#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:04,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {39088#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:04,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {39088#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:04,859 INFO L273 TraceCheckUtils]: 30: Hoare triple {39089#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:04,859 INFO L273 TraceCheckUtils]: 31: Hoare triple {39089#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:04,860 INFO L273 TraceCheckUtils]: 32: Hoare triple {39089#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:04,861 INFO L273 TraceCheckUtils]: 33: Hoare triple {39090#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:04,861 INFO L273 TraceCheckUtils]: 34: Hoare triple {39090#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:04,862 INFO L273 TraceCheckUtils]: 35: Hoare triple {39090#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:04,862 INFO L273 TraceCheckUtils]: 36: Hoare triple {39091#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:04,863 INFO L273 TraceCheckUtils]: 37: Hoare triple {39091#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:04,863 INFO L273 TraceCheckUtils]: 38: Hoare triple {39091#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:04,864 INFO L273 TraceCheckUtils]: 39: Hoare triple {39092#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:04,864 INFO L273 TraceCheckUtils]: 40: Hoare triple {39092#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:04,865 INFO L273 TraceCheckUtils]: 41: Hoare triple {39092#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:04,866 INFO L273 TraceCheckUtils]: 42: Hoare triple {39093#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:04,866 INFO L273 TraceCheckUtils]: 43: Hoare triple {39093#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:04,867 INFO L273 TraceCheckUtils]: 44: Hoare triple {39093#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:04,867 INFO L273 TraceCheckUtils]: 45: Hoare triple {39094#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:04,868 INFO L273 TraceCheckUtils]: 46: Hoare triple {39094#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:04,869 INFO L273 TraceCheckUtils]: 47: Hoare triple {39094#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:04,869 INFO L273 TraceCheckUtils]: 48: Hoare triple {39095#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:04,870 INFO L273 TraceCheckUtils]: 49: Hoare triple {39095#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:04,870 INFO L273 TraceCheckUtils]: 50: Hoare triple {39095#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:04,871 INFO L273 TraceCheckUtils]: 51: Hoare triple {39096#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:04,871 INFO L273 TraceCheckUtils]: 52: Hoare triple {39096#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:04,872 INFO L273 TraceCheckUtils]: 53: Hoare triple {39096#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:04,872 INFO L273 TraceCheckUtils]: 54: Hoare triple {39097#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:04,873 INFO L273 TraceCheckUtils]: 55: Hoare triple {39097#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:04,874 INFO L273 TraceCheckUtils]: 56: Hoare triple {39097#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:04,874 INFO L273 TraceCheckUtils]: 57: Hoare triple {39098#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:04,875 INFO L273 TraceCheckUtils]: 58: Hoare triple {39098#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:04,875 INFO L273 TraceCheckUtils]: 59: Hoare triple {39098#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:04,876 INFO L273 TraceCheckUtils]: 60: Hoare triple {39099#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:04,876 INFO L273 TraceCheckUtils]: 61: Hoare triple {39099#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:04,877 INFO L273 TraceCheckUtils]: 62: Hoare triple {39099#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:04,878 INFO L273 TraceCheckUtils]: 63: Hoare triple {39100#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:04,878 INFO L273 TraceCheckUtils]: 64: Hoare triple {39100#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:04,879 INFO L273 TraceCheckUtils]: 65: Hoare triple {39100#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:04,879 INFO L273 TraceCheckUtils]: 66: Hoare triple {39101#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:04,880 INFO L273 TraceCheckUtils]: 67: Hoare triple {39101#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:04,880 INFO L273 TraceCheckUtils]: 68: Hoare triple {39101#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:04,881 INFO L273 TraceCheckUtils]: 69: Hoare triple {39102#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:04,881 INFO L273 TraceCheckUtils]: 70: Hoare triple {39102#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:04,882 INFO L273 TraceCheckUtils]: 71: Hoare triple {39102#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:04,883 INFO L273 TraceCheckUtils]: 72: Hoare triple {39103#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:04,885 INFO L273 TraceCheckUtils]: 73: Hoare triple {39103#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:04,886 INFO L273 TraceCheckUtils]: 74: Hoare triple {39103#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:04,886 INFO L273 TraceCheckUtils]: 75: Hoare triple {39104#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:04,887 INFO L273 TraceCheckUtils]: 76: Hoare triple {39104#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:04,887 INFO L273 TraceCheckUtils]: 77: Hoare triple {39104#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:04,887 INFO L273 TraceCheckUtils]: 78: Hoare triple {39105#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:04,888 INFO L273 TraceCheckUtils]: 79: Hoare triple {39105#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:04,888 INFO L273 TraceCheckUtils]: 80: Hoare triple {39105#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:04,889 INFO L273 TraceCheckUtils]: 81: Hoare triple {39106#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:04,889 INFO L273 TraceCheckUtils]: 82: Hoare triple {39106#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:04,890 INFO L273 TraceCheckUtils]: 83: Hoare triple {39106#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:04,891 INFO L273 TraceCheckUtils]: 84: Hoare triple {39107#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:04,891 INFO L273 TraceCheckUtils]: 85: Hoare triple {39107#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:04,892 INFO L273 TraceCheckUtils]: 86: Hoare triple {39107#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:04,892 INFO L273 TraceCheckUtils]: 87: Hoare triple {39108#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:04,893 INFO L273 TraceCheckUtils]: 88: Hoare triple {39108#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:04,894 INFO L273 TraceCheckUtils]: 89: Hoare triple {39108#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:04,894 INFO L273 TraceCheckUtils]: 90: Hoare triple {39109#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:04,895 INFO L273 TraceCheckUtils]: 91: Hoare triple {39109#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:04,895 INFO L273 TraceCheckUtils]: 92: Hoare triple {39109#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:04,896 INFO L273 TraceCheckUtils]: 93: Hoare triple {39110#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:04,896 INFO L273 TraceCheckUtils]: 94: Hoare triple {39110#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:04,897 INFO L273 TraceCheckUtils]: 95: Hoare triple {39110#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:04,898 INFO L273 TraceCheckUtils]: 96: Hoare triple {39111#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:04,898 INFO L273 TraceCheckUtils]: 97: Hoare triple {39111#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:04,899 INFO L273 TraceCheckUtils]: 98: Hoare triple {39111#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:04,899 INFO L273 TraceCheckUtils]: 99: Hoare triple {39112#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:04,900 INFO L273 TraceCheckUtils]: 100: Hoare triple {39112#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:04,900 INFO L273 TraceCheckUtils]: 101: Hoare triple {39112#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:04,901 INFO L273 TraceCheckUtils]: 102: Hoare triple {39113#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:04,901 INFO L273 TraceCheckUtils]: 103: Hoare triple {39113#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:04,902 INFO L273 TraceCheckUtils]: 104: Hoare triple {39113#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:04,903 INFO L273 TraceCheckUtils]: 105: Hoare triple {39114#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:04,903 INFO L273 TraceCheckUtils]: 106: Hoare triple {39114#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:04,904 INFO L273 TraceCheckUtils]: 107: Hoare triple {39114#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:04,904 INFO L273 TraceCheckUtils]: 108: Hoare triple {39115#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:04,905 INFO L273 TraceCheckUtils]: 109: Hoare triple {39115#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:04,906 INFO L273 TraceCheckUtils]: 110: Hoare triple {39115#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:04,906 INFO L273 TraceCheckUtils]: 111: Hoare triple {39116#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:04,907 INFO L273 TraceCheckUtils]: 112: Hoare triple {39116#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:04,907 INFO L273 TraceCheckUtils]: 113: Hoare triple {39116#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:04,908 INFO L273 TraceCheckUtils]: 114: Hoare triple {39117#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:04,908 INFO L273 TraceCheckUtils]: 115: Hoare triple {39117#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:04,909 INFO L273 TraceCheckUtils]: 116: Hoare triple {39117#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:04,910 INFO L273 TraceCheckUtils]: 117: Hoare triple {39118#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:04,910 INFO L273 TraceCheckUtils]: 118: Hoare triple {39118#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:04,911 INFO L273 TraceCheckUtils]: 119: Hoare triple {39118#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:04,911 INFO L273 TraceCheckUtils]: 120: Hoare triple {39119#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:04,912 INFO L273 TraceCheckUtils]: 121: Hoare triple {39119#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:04,912 INFO L273 TraceCheckUtils]: 122: Hoare triple {39119#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:04,913 INFO L273 TraceCheckUtils]: 123: Hoare triple {39120#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:04,913 INFO L273 TraceCheckUtils]: 124: Hoare triple {39120#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:04,914 INFO L273 TraceCheckUtils]: 125: Hoare triple {39120#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:04,915 INFO L273 TraceCheckUtils]: 126: Hoare triple {39121#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:04,915 INFO L273 TraceCheckUtils]: 127: Hoare triple {39121#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:04,916 INFO L273 TraceCheckUtils]: 128: Hoare triple {39121#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:04,916 INFO L273 TraceCheckUtils]: 129: Hoare triple {39122#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:04,917 INFO L273 TraceCheckUtils]: 130: Hoare triple {39122#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:04,917 INFO L273 TraceCheckUtils]: 131: Hoare triple {39122#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:04,918 INFO L273 TraceCheckUtils]: 132: Hoare triple {39123#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:04,918 INFO L273 TraceCheckUtils]: 133: Hoare triple {39123#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:04,919 INFO L273 TraceCheckUtils]: 134: Hoare triple {39123#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:04,920 INFO L273 TraceCheckUtils]: 135: Hoare triple {39124#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:04,920 INFO L273 TraceCheckUtils]: 136: Hoare triple {39124#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:04,921 INFO L273 TraceCheckUtils]: 137: Hoare triple {39124#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:04,921 INFO L273 TraceCheckUtils]: 138: Hoare triple {39125#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:04,922 INFO L273 TraceCheckUtils]: 139: Hoare triple {39125#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:04,923 INFO L273 TraceCheckUtils]: 140: Hoare triple {39125#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:04,923 INFO L273 TraceCheckUtils]: 141: Hoare triple {39126#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:04,924 INFO L273 TraceCheckUtils]: 142: Hoare triple {39126#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:04,924 INFO L273 TraceCheckUtils]: 143: Hoare triple {39126#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:04,925 INFO L273 TraceCheckUtils]: 144: Hoare triple {39127#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:04,925 INFO L273 TraceCheckUtils]: 145: Hoare triple {39127#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:04,926 INFO L273 TraceCheckUtils]: 146: Hoare triple {39127#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:04,926 INFO L273 TraceCheckUtils]: 147: Hoare triple {39128#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:04,927 INFO L273 TraceCheckUtils]: 148: Hoare triple {39128#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:04,928 INFO L273 TraceCheckUtils]: 149: Hoare triple {39128#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:04,928 INFO L273 TraceCheckUtils]: 150: Hoare triple {39129#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:04,929 INFO L273 TraceCheckUtils]: 151: Hoare triple {39129#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:04,929 INFO L273 TraceCheckUtils]: 152: Hoare triple {39129#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:04,930 INFO L273 TraceCheckUtils]: 153: Hoare triple {39130#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:04,930 INFO L273 TraceCheckUtils]: 154: Hoare triple {39130#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:04,931 INFO L273 TraceCheckUtils]: 155: Hoare triple {39130#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:04,932 INFO L273 TraceCheckUtils]: 156: Hoare triple {39131#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:04,932 INFO L273 TraceCheckUtils]: 157: Hoare triple {39131#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:04,933 INFO L273 TraceCheckUtils]: 158: Hoare triple {39131#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {39132#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:04,933 INFO L273 TraceCheckUtils]: 159: Hoare triple {39132#(<= main_~i~0 51)} assume !(~i~0 < 100000); {39080#false} is VALID [2018-11-23 12:07:04,934 INFO L273 TraceCheckUtils]: 160: Hoare triple {39080#false} havoc ~x~0;~x~0 := 0; {39080#false} is VALID [2018-11-23 12:07:04,934 INFO L273 TraceCheckUtils]: 161: Hoare triple {39080#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {39080#false} is VALID [2018-11-23 12:07:04,934 INFO L256 TraceCheckUtils]: 162: Hoare triple {39080#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {39080#false} is VALID [2018-11-23 12:07:04,934 INFO L273 TraceCheckUtils]: 163: Hoare triple {39080#false} ~cond := #in~cond; {39080#false} is VALID [2018-11-23 12:07:04,934 INFO L273 TraceCheckUtils]: 164: Hoare triple {39080#false} assume 0 == ~cond; {39080#false} is VALID [2018-11-23 12:07:04,935 INFO L273 TraceCheckUtils]: 165: Hoare triple {39080#false} assume !false; {39080#false} is VALID [2018-11-23 12:07:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:04,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:04,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2018-11-23 12:07:04,972 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 166 [2018-11-23 12:07:04,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:04,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:07:05,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:05,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:07:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:07:05,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:07:05,147 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 55 states. [2018-11-23 12:07:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:06,195 INFO L93 Difference]: Finished difference Result 187 states and 242 transitions. [2018-11-23 12:07:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 12:07:06,196 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 166 [2018-11-23 12:07:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:07:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 242 transitions. [2018-11-23 12:07:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:07:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 242 transitions. [2018-11-23 12:07:06,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 242 transitions. [2018-11-23 12:07:06,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:06,422 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:07:06,422 INFO L226 Difference]: Without dead ends: 176 [2018-11-23 12:07:06,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:07:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-23 12:07:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-11-23 12:07:06,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:06,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand 174 states. [2018-11-23 12:07:06,480 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 174 states. [2018-11-23 12:07:06,480 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 174 states. [2018-11-23 12:07:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:06,483 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2018-11-23 12:07:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2018-11-23 12:07:06,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:06,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:06,483 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 176 states. [2018-11-23 12:07:06,483 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 176 states. [2018-11-23 12:07:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:06,485 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2018-11-23 12:07:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2018-11-23 12:07:06,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:06,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:06,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:06,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 12:07:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 227 transitions. [2018-11-23 12:07:06,488 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 227 transitions. Word has length 166 [2018-11-23 12:07:06,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:06,488 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 227 transitions. [2018-11-23 12:07:06,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:07:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2018-11-23 12:07:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-23 12:07:06,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:06,489 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:06,489 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:06,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:06,490 INFO L82 PathProgramCache]: Analyzing trace with hash -780687815, now seen corresponding path program 52 times [2018-11-23 12:07:06,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:06,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:06,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:06,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:06,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:07,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {40467#true} call ULTIMATE.init(); {40467#true} is VALID [2018-11-23 12:07:07,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {40467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40467#true} is VALID [2018-11-23 12:07:07,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {40467#true} assume true; {40467#true} is VALID [2018-11-23 12:07:07,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40467#true} {40467#true} #55#return; {40467#true} is VALID [2018-11-23 12:07:07,797 INFO L256 TraceCheckUtils]: 4: Hoare triple {40467#true} call #t~ret4 := main(); {40467#true} is VALID [2018-11-23 12:07:07,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {40467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {40469#(= main_~i~0 0)} is VALID [2018-11-23 12:07:07,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {40469#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40469#(= main_~i~0 0)} is VALID [2018-11-23 12:07:07,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {40469#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40469#(= main_~i~0 0)} is VALID [2018-11-23 12:07:07,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {40469#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:07,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {40470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:07,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {40470#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:07,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {40470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:07,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {40471#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:07,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {40471#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:07,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {40471#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:07,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {40472#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:07,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {40472#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:07,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {40472#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:07,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {40473#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:07,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {40473#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:07,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {40473#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:07,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {40474#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:07,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {40474#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:07,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {40474#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:07,808 INFO L273 TraceCheckUtils]: 24: Hoare triple {40475#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:07,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {40475#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:07,809 INFO L273 TraceCheckUtils]: 26: Hoare triple {40475#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:07,810 INFO L273 TraceCheckUtils]: 27: Hoare triple {40476#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:07,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {40476#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:07,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {40476#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:07,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {40477#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:07,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {40477#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:07,813 INFO L273 TraceCheckUtils]: 32: Hoare triple {40477#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:07,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {40478#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:07,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {40478#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:07,815 INFO L273 TraceCheckUtils]: 35: Hoare triple {40478#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:07,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {40479#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:07,816 INFO L273 TraceCheckUtils]: 37: Hoare triple {40479#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:07,816 INFO L273 TraceCheckUtils]: 38: Hoare triple {40479#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:07,817 INFO L273 TraceCheckUtils]: 39: Hoare triple {40480#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:07,817 INFO L273 TraceCheckUtils]: 40: Hoare triple {40480#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:07,818 INFO L273 TraceCheckUtils]: 41: Hoare triple {40480#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:07,818 INFO L273 TraceCheckUtils]: 42: Hoare triple {40481#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:07,819 INFO L273 TraceCheckUtils]: 43: Hoare triple {40481#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:07,820 INFO L273 TraceCheckUtils]: 44: Hoare triple {40481#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:07,820 INFO L273 TraceCheckUtils]: 45: Hoare triple {40482#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:07,821 INFO L273 TraceCheckUtils]: 46: Hoare triple {40482#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:07,821 INFO L273 TraceCheckUtils]: 47: Hoare triple {40482#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:07,822 INFO L273 TraceCheckUtils]: 48: Hoare triple {40483#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:07,822 INFO L273 TraceCheckUtils]: 49: Hoare triple {40483#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:07,823 INFO L273 TraceCheckUtils]: 50: Hoare triple {40483#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:07,823 INFO L273 TraceCheckUtils]: 51: Hoare triple {40484#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:07,824 INFO L273 TraceCheckUtils]: 52: Hoare triple {40484#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:07,825 INFO L273 TraceCheckUtils]: 53: Hoare triple {40484#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:07,825 INFO L273 TraceCheckUtils]: 54: Hoare triple {40485#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:07,826 INFO L273 TraceCheckUtils]: 55: Hoare triple {40485#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:07,826 INFO L273 TraceCheckUtils]: 56: Hoare triple {40485#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:07,827 INFO L273 TraceCheckUtils]: 57: Hoare triple {40486#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:07,827 INFO L273 TraceCheckUtils]: 58: Hoare triple {40486#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:07,828 INFO L273 TraceCheckUtils]: 59: Hoare triple {40486#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:07,829 INFO L273 TraceCheckUtils]: 60: Hoare triple {40487#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:07,829 INFO L273 TraceCheckUtils]: 61: Hoare triple {40487#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:07,830 INFO L273 TraceCheckUtils]: 62: Hoare triple {40487#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:07,830 INFO L273 TraceCheckUtils]: 63: Hoare triple {40488#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:07,831 INFO L273 TraceCheckUtils]: 64: Hoare triple {40488#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:07,831 INFO L273 TraceCheckUtils]: 65: Hoare triple {40488#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:07,832 INFO L273 TraceCheckUtils]: 66: Hoare triple {40489#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:07,832 INFO L273 TraceCheckUtils]: 67: Hoare triple {40489#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:07,833 INFO L273 TraceCheckUtils]: 68: Hoare triple {40489#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:07,834 INFO L273 TraceCheckUtils]: 69: Hoare triple {40490#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:07,834 INFO L273 TraceCheckUtils]: 70: Hoare triple {40490#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:07,835 INFO L273 TraceCheckUtils]: 71: Hoare triple {40490#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:07,835 INFO L273 TraceCheckUtils]: 72: Hoare triple {40491#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:07,836 INFO L273 TraceCheckUtils]: 73: Hoare triple {40491#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:07,836 INFO L273 TraceCheckUtils]: 74: Hoare triple {40491#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:07,837 INFO L273 TraceCheckUtils]: 75: Hoare triple {40492#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:07,838 INFO L273 TraceCheckUtils]: 76: Hoare triple {40492#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:07,838 INFO L273 TraceCheckUtils]: 77: Hoare triple {40492#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:07,839 INFO L273 TraceCheckUtils]: 78: Hoare triple {40493#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:07,839 INFO L273 TraceCheckUtils]: 79: Hoare triple {40493#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:07,840 INFO L273 TraceCheckUtils]: 80: Hoare triple {40493#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:07,840 INFO L273 TraceCheckUtils]: 81: Hoare triple {40494#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:07,841 INFO L273 TraceCheckUtils]: 82: Hoare triple {40494#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:07,842 INFO L273 TraceCheckUtils]: 83: Hoare triple {40494#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:07,842 INFO L273 TraceCheckUtils]: 84: Hoare triple {40495#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:07,843 INFO L273 TraceCheckUtils]: 85: Hoare triple {40495#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:07,843 INFO L273 TraceCheckUtils]: 86: Hoare triple {40495#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:07,844 INFO L273 TraceCheckUtils]: 87: Hoare triple {40496#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:07,844 INFO L273 TraceCheckUtils]: 88: Hoare triple {40496#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:07,845 INFO L273 TraceCheckUtils]: 89: Hoare triple {40496#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:07,845 INFO L273 TraceCheckUtils]: 90: Hoare triple {40497#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:07,846 INFO L273 TraceCheckUtils]: 91: Hoare triple {40497#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:07,847 INFO L273 TraceCheckUtils]: 92: Hoare triple {40497#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:07,847 INFO L273 TraceCheckUtils]: 93: Hoare triple {40498#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:07,848 INFO L273 TraceCheckUtils]: 94: Hoare triple {40498#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:07,848 INFO L273 TraceCheckUtils]: 95: Hoare triple {40498#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:07,849 INFO L273 TraceCheckUtils]: 96: Hoare triple {40499#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:07,849 INFO L273 TraceCheckUtils]: 97: Hoare triple {40499#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:07,850 INFO L273 TraceCheckUtils]: 98: Hoare triple {40499#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:07,851 INFO L273 TraceCheckUtils]: 99: Hoare triple {40500#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:07,851 INFO L273 TraceCheckUtils]: 100: Hoare triple {40500#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:07,852 INFO L273 TraceCheckUtils]: 101: Hoare triple {40500#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:07,852 INFO L273 TraceCheckUtils]: 102: Hoare triple {40501#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:07,853 INFO L273 TraceCheckUtils]: 103: Hoare triple {40501#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:07,853 INFO L273 TraceCheckUtils]: 104: Hoare triple {40501#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:07,854 INFO L273 TraceCheckUtils]: 105: Hoare triple {40502#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:07,854 INFO L273 TraceCheckUtils]: 106: Hoare triple {40502#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:07,855 INFO L273 TraceCheckUtils]: 107: Hoare triple {40502#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:07,856 INFO L273 TraceCheckUtils]: 108: Hoare triple {40503#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:07,856 INFO L273 TraceCheckUtils]: 109: Hoare triple {40503#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:07,857 INFO L273 TraceCheckUtils]: 110: Hoare triple {40503#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:07,857 INFO L273 TraceCheckUtils]: 111: Hoare triple {40504#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:07,858 INFO L273 TraceCheckUtils]: 112: Hoare triple {40504#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:07,859 INFO L273 TraceCheckUtils]: 113: Hoare triple {40504#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:07,859 INFO L273 TraceCheckUtils]: 114: Hoare triple {40505#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:07,860 INFO L273 TraceCheckUtils]: 115: Hoare triple {40505#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:07,860 INFO L273 TraceCheckUtils]: 116: Hoare triple {40505#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:07,861 INFO L273 TraceCheckUtils]: 117: Hoare triple {40506#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:07,861 INFO L273 TraceCheckUtils]: 118: Hoare triple {40506#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:07,862 INFO L273 TraceCheckUtils]: 119: Hoare triple {40506#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:07,863 INFO L273 TraceCheckUtils]: 120: Hoare triple {40507#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:07,863 INFO L273 TraceCheckUtils]: 121: Hoare triple {40507#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:07,864 INFO L273 TraceCheckUtils]: 122: Hoare triple {40507#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:07,864 INFO L273 TraceCheckUtils]: 123: Hoare triple {40508#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:07,865 INFO L273 TraceCheckUtils]: 124: Hoare triple {40508#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:07,865 INFO L273 TraceCheckUtils]: 125: Hoare triple {40508#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:07,866 INFO L273 TraceCheckUtils]: 126: Hoare triple {40509#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:07,866 INFO L273 TraceCheckUtils]: 127: Hoare triple {40509#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:07,867 INFO L273 TraceCheckUtils]: 128: Hoare triple {40509#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:07,868 INFO L273 TraceCheckUtils]: 129: Hoare triple {40510#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:07,868 INFO L273 TraceCheckUtils]: 130: Hoare triple {40510#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:07,869 INFO L273 TraceCheckUtils]: 131: Hoare triple {40510#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:07,869 INFO L273 TraceCheckUtils]: 132: Hoare triple {40511#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:07,870 INFO L273 TraceCheckUtils]: 133: Hoare triple {40511#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:07,870 INFO L273 TraceCheckUtils]: 134: Hoare triple {40511#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:07,871 INFO L273 TraceCheckUtils]: 135: Hoare triple {40512#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:07,871 INFO L273 TraceCheckUtils]: 136: Hoare triple {40512#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:07,872 INFO L273 TraceCheckUtils]: 137: Hoare triple {40512#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:07,873 INFO L273 TraceCheckUtils]: 138: Hoare triple {40513#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:07,873 INFO L273 TraceCheckUtils]: 139: Hoare triple {40513#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:07,874 INFO L273 TraceCheckUtils]: 140: Hoare triple {40513#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:07,874 INFO L273 TraceCheckUtils]: 141: Hoare triple {40514#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:07,875 INFO L273 TraceCheckUtils]: 142: Hoare triple {40514#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:07,876 INFO L273 TraceCheckUtils]: 143: Hoare triple {40514#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:07,876 INFO L273 TraceCheckUtils]: 144: Hoare triple {40515#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:07,877 INFO L273 TraceCheckUtils]: 145: Hoare triple {40515#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:07,877 INFO L273 TraceCheckUtils]: 146: Hoare triple {40515#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:07,878 INFO L273 TraceCheckUtils]: 147: Hoare triple {40516#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:07,878 INFO L273 TraceCheckUtils]: 148: Hoare triple {40516#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:07,879 INFO L273 TraceCheckUtils]: 149: Hoare triple {40516#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:07,879 INFO L273 TraceCheckUtils]: 150: Hoare triple {40517#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:07,880 INFO L273 TraceCheckUtils]: 151: Hoare triple {40517#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:07,881 INFO L273 TraceCheckUtils]: 152: Hoare triple {40517#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:07,881 INFO L273 TraceCheckUtils]: 153: Hoare triple {40518#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:07,882 INFO L273 TraceCheckUtils]: 154: Hoare triple {40518#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:07,882 INFO L273 TraceCheckUtils]: 155: Hoare triple {40518#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:07,883 INFO L273 TraceCheckUtils]: 156: Hoare triple {40519#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:07,883 INFO L273 TraceCheckUtils]: 157: Hoare triple {40519#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:07,884 INFO L273 TraceCheckUtils]: 158: Hoare triple {40519#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:07,885 INFO L273 TraceCheckUtils]: 159: Hoare triple {40520#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:07,885 INFO L273 TraceCheckUtils]: 160: Hoare triple {40520#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:07,886 INFO L273 TraceCheckUtils]: 161: Hoare triple {40520#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {40521#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:07,886 INFO L273 TraceCheckUtils]: 162: Hoare triple {40521#(<= main_~i~0 52)} assume !(~i~0 < 100000); {40468#false} is VALID [2018-11-23 12:07:07,887 INFO L273 TraceCheckUtils]: 163: Hoare triple {40468#false} havoc ~x~0;~x~0 := 0; {40468#false} is VALID [2018-11-23 12:07:07,887 INFO L273 TraceCheckUtils]: 164: Hoare triple {40468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {40468#false} is VALID [2018-11-23 12:07:07,887 INFO L256 TraceCheckUtils]: 165: Hoare triple {40468#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {40468#false} is VALID [2018-11-23 12:07:07,887 INFO L273 TraceCheckUtils]: 166: Hoare triple {40468#false} ~cond := #in~cond; {40468#false} is VALID [2018-11-23 12:07:07,887 INFO L273 TraceCheckUtils]: 167: Hoare triple {40468#false} assume 0 == ~cond; {40468#false} is VALID [2018-11-23 12:07:07,887 INFO L273 TraceCheckUtils]: 168: Hoare triple {40468#false} assume !false; {40468#false} is VALID [2018-11-23 12:07:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:07,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:07,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:07,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:07:07,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:07:07,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:08,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:08,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {40467#true} call ULTIMATE.init(); {40467#true} is VALID [2018-11-23 12:07:08,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {40467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40467#true} is VALID [2018-11-23 12:07:08,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {40467#true} assume true; {40467#true} is VALID [2018-11-23 12:07:08,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40467#true} {40467#true} #55#return; {40467#true} is VALID [2018-11-23 12:07:08,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {40467#true} call #t~ret4 := main(); {40467#true} is VALID [2018-11-23 12:07:08,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {40467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {40540#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:08,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {40540#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40540#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:08,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {40540#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40540#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:08,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {40540#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:08,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {40470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:08,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {40470#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:08,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {40470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:08,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {40471#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:08,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {40471#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:08,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {40471#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:08,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {40472#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:08,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {40472#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:08,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {40472#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:08,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {40473#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:08,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {40473#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:08,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {40473#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:08,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {40474#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:08,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {40474#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:08,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {40474#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:08,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {40475#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:08,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {40475#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:08,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {40475#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:08,402 INFO L273 TraceCheckUtils]: 27: Hoare triple {40476#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:08,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {40476#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:08,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {40476#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:08,404 INFO L273 TraceCheckUtils]: 30: Hoare triple {40477#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:08,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {40477#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:08,405 INFO L273 TraceCheckUtils]: 32: Hoare triple {40477#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:08,405 INFO L273 TraceCheckUtils]: 33: Hoare triple {40478#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:08,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {40478#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:08,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {40478#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:08,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {40479#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:08,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {40479#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:08,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {40479#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:08,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {40480#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:08,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {40480#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:08,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {40480#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:08,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {40481#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:08,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {40481#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:08,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {40481#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:08,412 INFO L273 TraceCheckUtils]: 45: Hoare triple {40482#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:08,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {40482#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:08,413 INFO L273 TraceCheckUtils]: 47: Hoare triple {40482#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:08,414 INFO L273 TraceCheckUtils]: 48: Hoare triple {40483#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:08,414 INFO L273 TraceCheckUtils]: 49: Hoare triple {40483#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:08,415 INFO L273 TraceCheckUtils]: 50: Hoare triple {40483#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:08,415 INFO L273 TraceCheckUtils]: 51: Hoare triple {40484#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:08,416 INFO L273 TraceCheckUtils]: 52: Hoare triple {40484#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:08,417 INFO L273 TraceCheckUtils]: 53: Hoare triple {40484#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:08,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {40485#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:08,418 INFO L273 TraceCheckUtils]: 55: Hoare triple {40485#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:08,418 INFO L273 TraceCheckUtils]: 56: Hoare triple {40485#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:08,419 INFO L273 TraceCheckUtils]: 57: Hoare triple {40486#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:08,419 INFO L273 TraceCheckUtils]: 58: Hoare triple {40486#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:08,420 INFO L273 TraceCheckUtils]: 59: Hoare triple {40486#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:08,420 INFO L273 TraceCheckUtils]: 60: Hoare triple {40487#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:08,421 INFO L273 TraceCheckUtils]: 61: Hoare triple {40487#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:08,422 INFO L273 TraceCheckUtils]: 62: Hoare triple {40487#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:08,422 INFO L273 TraceCheckUtils]: 63: Hoare triple {40488#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:08,423 INFO L273 TraceCheckUtils]: 64: Hoare triple {40488#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:08,423 INFO L273 TraceCheckUtils]: 65: Hoare triple {40488#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:08,424 INFO L273 TraceCheckUtils]: 66: Hoare triple {40489#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:08,424 INFO L273 TraceCheckUtils]: 67: Hoare triple {40489#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:08,425 INFO L273 TraceCheckUtils]: 68: Hoare triple {40489#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:08,426 INFO L273 TraceCheckUtils]: 69: Hoare triple {40490#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:08,426 INFO L273 TraceCheckUtils]: 70: Hoare triple {40490#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:08,427 INFO L273 TraceCheckUtils]: 71: Hoare triple {40490#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:08,427 INFO L273 TraceCheckUtils]: 72: Hoare triple {40491#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:08,428 INFO L273 TraceCheckUtils]: 73: Hoare triple {40491#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:08,428 INFO L273 TraceCheckUtils]: 74: Hoare triple {40491#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:08,429 INFO L273 TraceCheckUtils]: 75: Hoare triple {40492#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:08,429 INFO L273 TraceCheckUtils]: 76: Hoare triple {40492#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:08,430 INFO L273 TraceCheckUtils]: 77: Hoare triple {40492#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:08,431 INFO L273 TraceCheckUtils]: 78: Hoare triple {40493#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:08,431 INFO L273 TraceCheckUtils]: 79: Hoare triple {40493#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:08,432 INFO L273 TraceCheckUtils]: 80: Hoare triple {40493#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:08,432 INFO L273 TraceCheckUtils]: 81: Hoare triple {40494#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:08,433 INFO L273 TraceCheckUtils]: 82: Hoare triple {40494#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:08,434 INFO L273 TraceCheckUtils]: 83: Hoare triple {40494#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:08,434 INFO L273 TraceCheckUtils]: 84: Hoare triple {40495#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:08,435 INFO L273 TraceCheckUtils]: 85: Hoare triple {40495#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:08,435 INFO L273 TraceCheckUtils]: 86: Hoare triple {40495#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:08,436 INFO L273 TraceCheckUtils]: 87: Hoare triple {40496#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:08,436 INFO L273 TraceCheckUtils]: 88: Hoare triple {40496#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:08,437 INFO L273 TraceCheckUtils]: 89: Hoare triple {40496#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:08,437 INFO L273 TraceCheckUtils]: 90: Hoare triple {40497#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:08,438 INFO L273 TraceCheckUtils]: 91: Hoare triple {40497#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:08,439 INFO L273 TraceCheckUtils]: 92: Hoare triple {40497#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:08,439 INFO L273 TraceCheckUtils]: 93: Hoare triple {40498#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:08,440 INFO L273 TraceCheckUtils]: 94: Hoare triple {40498#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:08,440 INFO L273 TraceCheckUtils]: 95: Hoare triple {40498#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:08,441 INFO L273 TraceCheckUtils]: 96: Hoare triple {40499#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:08,441 INFO L273 TraceCheckUtils]: 97: Hoare triple {40499#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:08,442 INFO L273 TraceCheckUtils]: 98: Hoare triple {40499#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:08,443 INFO L273 TraceCheckUtils]: 99: Hoare triple {40500#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:08,443 INFO L273 TraceCheckUtils]: 100: Hoare triple {40500#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:08,444 INFO L273 TraceCheckUtils]: 101: Hoare triple {40500#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:08,444 INFO L273 TraceCheckUtils]: 102: Hoare triple {40501#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:08,445 INFO L273 TraceCheckUtils]: 103: Hoare triple {40501#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:08,445 INFO L273 TraceCheckUtils]: 104: Hoare triple {40501#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:08,446 INFO L273 TraceCheckUtils]: 105: Hoare triple {40502#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:08,446 INFO L273 TraceCheckUtils]: 106: Hoare triple {40502#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:08,447 INFO L273 TraceCheckUtils]: 107: Hoare triple {40502#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:08,448 INFO L273 TraceCheckUtils]: 108: Hoare triple {40503#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:08,448 INFO L273 TraceCheckUtils]: 109: Hoare triple {40503#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:08,449 INFO L273 TraceCheckUtils]: 110: Hoare triple {40503#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:08,449 INFO L273 TraceCheckUtils]: 111: Hoare triple {40504#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:08,450 INFO L273 TraceCheckUtils]: 112: Hoare triple {40504#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:08,451 INFO L273 TraceCheckUtils]: 113: Hoare triple {40504#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:08,451 INFO L273 TraceCheckUtils]: 114: Hoare triple {40505#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:08,452 INFO L273 TraceCheckUtils]: 115: Hoare triple {40505#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:08,452 INFO L273 TraceCheckUtils]: 116: Hoare triple {40505#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:08,453 INFO L273 TraceCheckUtils]: 117: Hoare triple {40506#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:08,453 INFO L273 TraceCheckUtils]: 118: Hoare triple {40506#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:08,454 INFO L273 TraceCheckUtils]: 119: Hoare triple {40506#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:08,454 INFO L273 TraceCheckUtils]: 120: Hoare triple {40507#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:08,455 INFO L273 TraceCheckUtils]: 121: Hoare triple {40507#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:08,456 INFO L273 TraceCheckUtils]: 122: Hoare triple {40507#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:08,456 INFO L273 TraceCheckUtils]: 123: Hoare triple {40508#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:08,457 INFO L273 TraceCheckUtils]: 124: Hoare triple {40508#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:08,457 INFO L273 TraceCheckUtils]: 125: Hoare triple {40508#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:08,458 INFO L273 TraceCheckUtils]: 126: Hoare triple {40509#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:08,458 INFO L273 TraceCheckUtils]: 127: Hoare triple {40509#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:08,459 INFO L273 TraceCheckUtils]: 128: Hoare triple {40509#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:08,460 INFO L273 TraceCheckUtils]: 129: Hoare triple {40510#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:08,460 INFO L273 TraceCheckUtils]: 130: Hoare triple {40510#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:08,461 INFO L273 TraceCheckUtils]: 131: Hoare triple {40510#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:08,461 INFO L273 TraceCheckUtils]: 132: Hoare triple {40511#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:08,462 INFO L273 TraceCheckUtils]: 133: Hoare triple {40511#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:08,463 INFO L273 TraceCheckUtils]: 134: Hoare triple {40511#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:08,463 INFO L273 TraceCheckUtils]: 135: Hoare triple {40512#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:08,464 INFO L273 TraceCheckUtils]: 136: Hoare triple {40512#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:08,464 INFO L273 TraceCheckUtils]: 137: Hoare triple {40512#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:08,465 INFO L273 TraceCheckUtils]: 138: Hoare triple {40513#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:08,465 INFO L273 TraceCheckUtils]: 139: Hoare triple {40513#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:08,466 INFO L273 TraceCheckUtils]: 140: Hoare triple {40513#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:08,466 INFO L273 TraceCheckUtils]: 141: Hoare triple {40514#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:08,467 INFO L273 TraceCheckUtils]: 142: Hoare triple {40514#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:08,468 INFO L273 TraceCheckUtils]: 143: Hoare triple {40514#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:08,468 INFO L273 TraceCheckUtils]: 144: Hoare triple {40515#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:08,469 INFO L273 TraceCheckUtils]: 145: Hoare triple {40515#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:08,469 INFO L273 TraceCheckUtils]: 146: Hoare triple {40515#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:08,470 INFO L273 TraceCheckUtils]: 147: Hoare triple {40516#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:08,470 INFO L273 TraceCheckUtils]: 148: Hoare triple {40516#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:08,471 INFO L273 TraceCheckUtils]: 149: Hoare triple {40516#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:08,472 INFO L273 TraceCheckUtils]: 150: Hoare triple {40517#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:08,472 INFO L273 TraceCheckUtils]: 151: Hoare triple {40517#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:08,473 INFO L273 TraceCheckUtils]: 152: Hoare triple {40517#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:08,473 INFO L273 TraceCheckUtils]: 153: Hoare triple {40518#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:08,474 INFO L273 TraceCheckUtils]: 154: Hoare triple {40518#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:08,474 INFO L273 TraceCheckUtils]: 155: Hoare triple {40518#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:08,475 INFO L273 TraceCheckUtils]: 156: Hoare triple {40519#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:08,475 INFO L273 TraceCheckUtils]: 157: Hoare triple {40519#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:08,476 INFO L273 TraceCheckUtils]: 158: Hoare triple {40519#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:08,477 INFO L273 TraceCheckUtils]: 159: Hoare triple {40520#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:08,477 INFO L273 TraceCheckUtils]: 160: Hoare triple {40520#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:08,478 INFO L273 TraceCheckUtils]: 161: Hoare triple {40520#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {40521#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:08,478 INFO L273 TraceCheckUtils]: 162: Hoare triple {40521#(<= main_~i~0 52)} assume !(~i~0 < 100000); {40468#false} is VALID [2018-11-23 12:07:08,479 INFO L273 TraceCheckUtils]: 163: Hoare triple {40468#false} havoc ~x~0;~x~0 := 0; {40468#false} is VALID [2018-11-23 12:07:08,479 INFO L273 TraceCheckUtils]: 164: Hoare triple {40468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {40468#false} is VALID [2018-11-23 12:07:08,479 INFO L256 TraceCheckUtils]: 165: Hoare triple {40468#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {40468#false} is VALID [2018-11-23 12:07:08,479 INFO L273 TraceCheckUtils]: 166: Hoare triple {40468#false} ~cond := #in~cond; {40468#false} is VALID [2018-11-23 12:07:08,479 INFO L273 TraceCheckUtils]: 167: Hoare triple {40468#false} assume 0 == ~cond; {40468#false} is VALID [2018-11-23 12:07:08,480 INFO L273 TraceCheckUtils]: 168: Hoare triple {40468#false} assume !false; {40468#false} is VALID [2018-11-23 12:07:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:08,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:08,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2018-11-23 12:07:08,518 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 169 [2018-11-23 12:07:08,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:08,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 12:07:08,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:08,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 12:07:08,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 12:07:08,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 12:07:08,691 INFO L87 Difference]: Start difference. First operand 174 states and 227 transitions. Second operand 56 states. [2018-11-23 12:07:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:10,021 INFO L93 Difference]: Finished difference Result 190 states and 246 transitions. [2018-11-23 12:07:10,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:07:10,022 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 169 [2018-11-23 12:07:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:07:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 246 transitions. [2018-11-23 12:07:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:07:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 246 transitions. [2018-11-23 12:07:10,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 246 transitions. [2018-11-23 12:07:10,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:10,289 INFO L225 Difference]: With dead ends: 190 [2018-11-23 12:07:10,289 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 12:07:10,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 12:07:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 12:07:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-23 12:07:10,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:10,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 177 states. [2018-11-23 12:07:10,348 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 177 states. [2018-11-23 12:07:10,348 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 177 states. [2018-11-23 12:07:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:10,351 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2018-11-23 12:07:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2018-11-23 12:07:10,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:10,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:10,352 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 179 states. [2018-11-23 12:07:10,352 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 179 states. [2018-11-23 12:07:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:10,354 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2018-11-23 12:07:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2018-11-23 12:07:10,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:10,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:10,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:10,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-23 12:07:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 231 transitions. [2018-11-23 12:07:10,357 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 231 transitions. Word has length 169 [2018-11-23 12:07:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:10,357 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 231 transitions. [2018-11-23 12:07:10,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 12:07:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 231 transitions. [2018-11-23 12:07:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:07:10,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:10,358 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:10,358 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:10,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1177423005, now seen corresponding path program 53 times [2018-11-23 12:07:10,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:10,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:10,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:11,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {41879#true} call ULTIMATE.init(); {41879#true} is VALID [2018-11-23 12:07:11,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {41879#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41879#true} is VALID [2018-11-23 12:07:11,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {41879#true} assume true; {41879#true} is VALID [2018-11-23 12:07:11,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41879#true} {41879#true} #55#return; {41879#true} is VALID [2018-11-23 12:07:11,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {41879#true} call #t~ret4 := main(); {41879#true} is VALID [2018-11-23 12:07:11,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {41879#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {41881#(= main_~i~0 0)} is VALID [2018-11-23 12:07:11,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {41881#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41881#(= main_~i~0 0)} is VALID [2018-11-23 12:07:11,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {41881#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41881#(= main_~i~0 0)} is VALID [2018-11-23 12:07:11,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {41881#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:11,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {41882#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:11,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {41882#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:11,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {41882#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:11,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {41883#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:11,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {41883#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:11,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {41883#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:11,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {41884#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:11,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {41884#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:11,772 INFO L273 TraceCheckUtils]: 17: Hoare triple {41884#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:11,772 INFO L273 TraceCheckUtils]: 18: Hoare triple {41885#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:11,773 INFO L273 TraceCheckUtils]: 19: Hoare triple {41885#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:11,774 INFO L273 TraceCheckUtils]: 20: Hoare triple {41885#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:11,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {41886#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:11,775 INFO L273 TraceCheckUtils]: 22: Hoare triple {41886#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:11,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {41886#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:11,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {41887#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:11,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {41887#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:11,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {41887#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:11,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {41888#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:11,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {41888#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:11,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {41888#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:11,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {41889#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:11,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {41889#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:11,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {41889#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:11,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {41890#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:11,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {41890#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:11,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {41890#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:11,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {41891#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:11,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {41891#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:11,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {41891#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:11,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {41892#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:11,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {41892#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:11,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {41892#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:11,786 INFO L273 TraceCheckUtils]: 42: Hoare triple {41893#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:11,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {41893#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:11,787 INFO L273 TraceCheckUtils]: 44: Hoare triple {41893#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:11,788 INFO L273 TraceCheckUtils]: 45: Hoare triple {41894#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:11,788 INFO L273 TraceCheckUtils]: 46: Hoare triple {41894#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:11,789 INFO L273 TraceCheckUtils]: 47: Hoare triple {41894#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:11,789 INFO L273 TraceCheckUtils]: 48: Hoare triple {41895#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:11,790 INFO L273 TraceCheckUtils]: 49: Hoare triple {41895#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:11,791 INFO L273 TraceCheckUtils]: 50: Hoare triple {41895#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:11,791 INFO L273 TraceCheckUtils]: 51: Hoare triple {41896#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:11,792 INFO L273 TraceCheckUtils]: 52: Hoare triple {41896#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:11,792 INFO L273 TraceCheckUtils]: 53: Hoare triple {41896#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:11,793 INFO L273 TraceCheckUtils]: 54: Hoare triple {41897#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:11,793 INFO L273 TraceCheckUtils]: 55: Hoare triple {41897#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:11,794 INFO L273 TraceCheckUtils]: 56: Hoare triple {41897#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:11,795 INFO L273 TraceCheckUtils]: 57: Hoare triple {41898#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:11,795 INFO L273 TraceCheckUtils]: 58: Hoare triple {41898#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:11,796 INFO L273 TraceCheckUtils]: 59: Hoare triple {41898#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:11,796 INFO L273 TraceCheckUtils]: 60: Hoare triple {41899#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:11,797 INFO L273 TraceCheckUtils]: 61: Hoare triple {41899#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:11,798 INFO L273 TraceCheckUtils]: 62: Hoare triple {41899#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:11,798 INFO L273 TraceCheckUtils]: 63: Hoare triple {41900#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:11,798 INFO L273 TraceCheckUtils]: 64: Hoare triple {41900#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:11,799 INFO L273 TraceCheckUtils]: 65: Hoare triple {41900#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:11,800 INFO L273 TraceCheckUtils]: 66: Hoare triple {41901#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:11,800 INFO L273 TraceCheckUtils]: 67: Hoare triple {41901#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:11,801 INFO L273 TraceCheckUtils]: 68: Hoare triple {41901#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:11,801 INFO L273 TraceCheckUtils]: 69: Hoare triple {41902#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:11,802 INFO L273 TraceCheckUtils]: 70: Hoare triple {41902#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:11,803 INFO L273 TraceCheckUtils]: 71: Hoare triple {41902#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:11,803 INFO L273 TraceCheckUtils]: 72: Hoare triple {41903#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:11,804 INFO L273 TraceCheckUtils]: 73: Hoare triple {41903#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:11,804 INFO L273 TraceCheckUtils]: 74: Hoare triple {41903#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:11,805 INFO L273 TraceCheckUtils]: 75: Hoare triple {41904#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:11,805 INFO L273 TraceCheckUtils]: 76: Hoare triple {41904#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:11,806 INFO L273 TraceCheckUtils]: 77: Hoare triple {41904#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:11,807 INFO L273 TraceCheckUtils]: 78: Hoare triple {41905#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:11,807 INFO L273 TraceCheckUtils]: 79: Hoare triple {41905#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:11,808 INFO L273 TraceCheckUtils]: 80: Hoare triple {41905#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:11,808 INFO L273 TraceCheckUtils]: 81: Hoare triple {41906#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:11,809 INFO L273 TraceCheckUtils]: 82: Hoare triple {41906#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:11,809 INFO L273 TraceCheckUtils]: 83: Hoare triple {41906#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:11,810 INFO L273 TraceCheckUtils]: 84: Hoare triple {41907#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:11,810 INFO L273 TraceCheckUtils]: 85: Hoare triple {41907#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:11,811 INFO L273 TraceCheckUtils]: 86: Hoare triple {41907#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:11,812 INFO L273 TraceCheckUtils]: 87: Hoare triple {41908#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:11,812 INFO L273 TraceCheckUtils]: 88: Hoare triple {41908#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:11,813 INFO L273 TraceCheckUtils]: 89: Hoare triple {41908#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:11,813 INFO L273 TraceCheckUtils]: 90: Hoare triple {41909#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:11,814 INFO L273 TraceCheckUtils]: 91: Hoare triple {41909#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:11,815 INFO L273 TraceCheckUtils]: 92: Hoare triple {41909#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:11,815 INFO L273 TraceCheckUtils]: 93: Hoare triple {41910#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:11,816 INFO L273 TraceCheckUtils]: 94: Hoare triple {41910#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:11,816 INFO L273 TraceCheckUtils]: 95: Hoare triple {41910#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:11,817 INFO L273 TraceCheckUtils]: 96: Hoare triple {41911#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:11,817 INFO L273 TraceCheckUtils]: 97: Hoare triple {41911#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:11,818 INFO L273 TraceCheckUtils]: 98: Hoare triple {41911#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:11,819 INFO L273 TraceCheckUtils]: 99: Hoare triple {41912#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:11,819 INFO L273 TraceCheckUtils]: 100: Hoare triple {41912#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:11,820 INFO L273 TraceCheckUtils]: 101: Hoare triple {41912#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:11,820 INFO L273 TraceCheckUtils]: 102: Hoare triple {41913#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:11,821 INFO L273 TraceCheckUtils]: 103: Hoare triple {41913#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:11,821 INFO L273 TraceCheckUtils]: 104: Hoare triple {41913#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:11,822 INFO L273 TraceCheckUtils]: 105: Hoare triple {41914#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:11,822 INFO L273 TraceCheckUtils]: 106: Hoare triple {41914#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:11,823 INFO L273 TraceCheckUtils]: 107: Hoare triple {41914#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:11,824 INFO L273 TraceCheckUtils]: 108: Hoare triple {41915#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:11,824 INFO L273 TraceCheckUtils]: 109: Hoare triple {41915#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:11,825 INFO L273 TraceCheckUtils]: 110: Hoare triple {41915#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:11,825 INFO L273 TraceCheckUtils]: 111: Hoare triple {41916#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:11,826 INFO L273 TraceCheckUtils]: 112: Hoare triple {41916#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:11,827 INFO L273 TraceCheckUtils]: 113: Hoare triple {41916#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:11,827 INFO L273 TraceCheckUtils]: 114: Hoare triple {41917#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:11,828 INFO L273 TraceCheckUtils]: 115: Hoare triple {41917#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:11,828 INFO L273 TraceCheckUtils]: 116: Hoare triple {41917#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:11,829 INFO L273 TraceCheckUtils]: 117: Hoare triple {41918#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:11,829 INFO L273 TraceCheckUtils]: 118: Hoare triple {41918#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:11,830 INFO L273 TraceCheckUtils]: 119: Hoare triple {41918#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:11,831 INFO L273 TraceCheckUtils]: 120: Hoare triple {41919#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:11,831 INFO L273 TraceCheckUtils]: 121: Hoare triple {41919#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:11,832 INFO L273 TraceCheckUtils]: 122: Hoare triple {41919#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:11,832 INFO L273 TraceCheckUtils]: 123: Hoare triple {41920#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:11,833 INFO L273 TraceCheckUtils]: 124: Hoare triple {41920#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:11,833 INFO L273 TraceCheckUtils]: 125: Hoare triple {41920#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:11,834 INFO L273 TraceCheckUtils]: 126: Hoare triple {41921#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:11,834 INFO L273 TraceCheckUtils]: 127: Hoare triple {41921#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:11,835 INFO L273 TraceCheckUtils]: 128: Hoare triple {41921#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:11,836 INFO L273 TraceCheckUtils]: 129: Hoare triple {41922#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:11,836 INFO L273 TraceCheckUtils]: 130: Hoare triple {41922#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:11,837 INFO L273 TraceCheckUtils]: 131: Hoare triple {41922#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:11,837 INFO L273 TraceCheckUtils]: 132: Hoare triple {41923#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:11,838 INFO L273 TraceCheckUtils]: 133: Hoare triple {41923#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:11,839 INFO L273 TraceCheckUtils]: 134: Hoare triple {41923#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:11,839 INFO L273 TraceCheckUtils]: 135: Hoare triple {41924#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:11,840 INFO L273 TraceCheckUtils]: 136: Hoare triple {41924#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:11,840 INFO L273 TraceCheckUtils]: 137: Hoare triple {41924#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:11,841 INFO L273 TraceCheckUtils]: 138: Hoare triple {41925#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:11,841 INFO L273 TraceCheckUtils]: 139: Hoare triple {41925#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:11,842 INFO L273 TraceCheckUtils]: 140: Hoare triple {41925#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:11,843 INFO L273 TraceCheckUtils]: 141: Hoare triple {41926#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:11,843 INFO L273 TraceCheckUtils]: 142: Hoare triple {41926#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:11,844 INFO L273 TraceCheckUtils]: 143: Hoare triple {41926#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:11,844 INFO L273 TraceCheckUtils]: 144: Hoare triple {41927#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:11,845 INFO L273 TraceCheckUtils]: 145: Hoare triple {41927#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:11,845 INFO L273 TraceCheckUtils]: 146: Hoare triple {41927#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:11,846 INFO L273 TraceCheckUtils]: 147: Hoare triple {41928#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:11,846 INFO L273 TraceCheckUtils]: 148: Hoare triple {41928#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:11,847 INFO L273 TraceCheckUtils]: 149: Hoare triple {41928#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:11,848 INFO L273 TraceCheckUtils]: 150: Hoare triple {41929#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:11,848 INFO L273 TraceCheckUtils]: 151: Hoare triple {41929#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:11,849 INFO L273 TraceCheckUtils]: 152: Hoare triple {41929#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:11,849 INFO L273 TraceCheckUtils]: 153: Hoare triple {41930#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:11,850 INFO L273 TraceCheckUtils]: 154: Hoare triple {41930#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:11,851 INFO L273 TraceCheckUtils]: 155: Hoare triple {41930#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:11,851 INFO L273 TraceCheckUtils]: 156: Hoare triple {41931#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:11,852 INFO L273 TraceCheckUtils]: 157: Hoare triple {41931#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:11,852 INFO L273 TraceCheckUtils]: 158: Hoare triple {41931#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:11,853 INFO L273 TraceCheckUtils]: 159: Hoare triple {41932#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:11,853 INFO L273 TraceCheckUtils]: 160: Hoare triple {41932#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:11,854 INFO L273 TraceCheckUtils]: 161: Hoare triple {41932#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:11,855 INFO L273 TraceCheckUtils]: 162: Hoare triple {41933#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:11,855 INFO L273 TraceCheckUtils]: 163: Hoare triple {41933#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:11,856 INFO L273 TraceCheckUtils]: 164: Hoare triple {41933#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {41934#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:11,856 INFO L273 TraceCheckUtils]: 165: Hoare triple {41934#(<= main_~i~0 53)} assume !(~i~0 < 100000); {41880#false} is VALID [2018-11-23 12:07:11,857 INFO L273 TraceCheckUtils]: 166: Hoare triple {41880#false} havoc ~x~0;~x~0 := 0; {41880#false} is VALID [2018-11-23 12:07:11,857 INFO L273 TraceCheckUtils]: 167: Hoare triple {41880#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {41880#false} is VALID [2018-11-23 12:07:11,857 INFO L256 TraceCheckUtils]: 168: Hoare triple {41880#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {41880#false} is VALID [2018-11-23 12:07:11,857 INFO L273 TraceCheckUtils]: 169: Hoare triple {41880#false} ~cond := #in~cond; {41880#false} is VALID [2018-11-23 12:07:11,857 INFO L273 TraceCheckUtils]: 170: Hoare triple {41880#false} assume 0 == ~cond; {41880#false} is VALID [2018-11-23 12:07:11,857 INFO L273 TraceCheckUtils]: 171: Hoare triple {41880#false} assume !false; {41880#false} is VALID [2018-11-23 12:07:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:11,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:11,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:11,884 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:07:12,014 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-11-23 12:07:12,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:12,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:12,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {41879#true} call ULTIMATE.init(); {41879#true} is VALID [2018-11-23 12:07:12,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {41879#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41879#true} is VALID [2018-11-23 12:07:12,438 INFO L273 TraceCheckUtils]: 2: Hoare triple {41879#true} assume true; {41879#true} is VALID [2018-11-23 12:07:12,438 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41879#true} {41879#true} #55#return; {41879#true} is VALID [2018-11-23 12:07:12,439 INFO L256 TraceCheckUtils]: 4: Hoare triple {41879#true} call #t~ret4 := main(); {41879#true} is VALID [2018-11-23 12:07:12,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {41879#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {41953#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:12,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {41953#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41953#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:12,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {41953#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41953#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:12,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {41953#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:12,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {41882#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:12,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {41882#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:12,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {41882#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:12,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {41883#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:12,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {41883#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:12,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {41883#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:12,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {41884#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:12,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {41884#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:12,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {41884#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:12,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {41885#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:12,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {41885#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:12,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {41885#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:12,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {41886#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:12,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {41886#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:12,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {41886#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:12,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {41887#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:12,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {41887#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:12,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {41887#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:12,450 INFO L273 TraceCheckUtils]: 27: Hoare triple {41888#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:12,451 INFO L273 TraceCheckUtils]: 28: Hoare triple {41888#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:12,452 INFO L273 TraceCheckUtils]: 29: Hoare triple {41888#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:12,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {41889#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:12,453 INFO L273 TraceCheckUtils]: 31: Hoare triple {41889#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:12,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {41889#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:12,454 INFO L273 TraceCheckUtils]: 33: Hoare triple {41890#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:12,454 INFO L273 TraceCheckUtils]: 34: Hoare triple {41890#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:12,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {41890#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:12,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {41891#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:12,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {41891#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:12,457 INFO L273 TraceCheckUtils]: 38: Hoare triple {41891#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:12,457 INFO L273 TraceCheckUtils]: 39: Hoare triple {41892#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:12,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {41892#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:12,458 INFO L273 TraceCheckUtils]: 41: Hoare triple {41892#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:12,459 INFO L273 TraceCheckUtils]: 42: Hoare triple {41893#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:12,459 INFO L273 TraceCheckUtils]: 43: Hoare triple {41893#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:12,460 INFO L273 TraceCheckUtils]: 44: Hoare triple {41893#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:12,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {41894#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:12,461 INFO L273 TraceCheckUtils]: 46: Hoare triple {41894#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:12,462 INFO L273 TraceCheckUtils]: 47: Hoare triple {41894#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:12,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {41895#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:12,463 INFO L273 TraceCheckUtils]: 49: Hoare triple {41895#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:12,464 INFO L273 TraceCheckUtils]: 50: Hoare triple {41895#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:12,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {41896#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:12,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {41896#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:12,465 INFO L273 TraceCheckUtils]: 53: Hoare triple {41896#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:12,466 INFO L273 TraceCheckUtils]: 54: Hoare triple {41897#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:12,466 INFO L273 TraceCheckUtils]: 55: Hoare triple {41897#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:12,467 INFO L273 TraceCheckUtils]: 56: Hoare triple {41897#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:12,468 INFO L273 TraceCheckUtils]: 57: Hoare triple {41898#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:12,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {41898#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:12,469 INFO L273 TraceCheckUtils]: 59: Hoare triple {41898#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:12,469 INFO L273 TraceCheckUtils]: 60: Hoare triple {41899#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:12,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {41899#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:12,470 INFO L273 TraceCheckUtils]: 62: Hoare triple {41899#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:12,471 INFO L273 TraceCheckUtils]: 63: Hoare triple {41900#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:12,471 INFO L273 TraceCheckUtils]: 64: Hoare triple {41900#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:12,472 INFO L273 TraceCheckUtils]: 65: Hoare triple {41900#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:12,473 INFO L273 TraceCheckUtils]: 66: Hoare triple {41901#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:12,473 INFO L273 TraceCheckUtils]: 67: Hoare triple {41901#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:12,474 INFO L273 TraceCheckUtils]: 68: Hoare triple {41901#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:12,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {41902#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:12,475 INFO L273 TraceCheckUtils]: 70: Hoare triple {41902#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:12,476 INFO L273 TraceCheckUtils]: 71: Hoare triple {41902#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:12,476 INFO L273 TraceCheckUtils]: 72: Hoare triple {41903#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:12,477 INFO L273 TraceCheckUtils]: 73: Hoare triple {41903#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:12,477 INFO L273 TraceCheckUtils]: 74: Hoare triple {41903#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:12,478 INFO L273 TraceCheckUtils]: 75: Hoare triple {41904#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:12,478 INFO L273 TraceCheckUtils]: 76: Hoare triple {41904#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:12,479 INFO L273 TraceCheckUtils]: 77: Hoare triple {41904#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:12,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {41905#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:12,480 INFO L273 TraceCheckUtils]: 79: Hoare triple {41905#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:12,481 INFO L273 TraceCheckUtils]: 80: Hoare triple {41905#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:12,481 INFO L273 TraceCheckUtils]: 81: Hoare triple {41906#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:12,482 INFO L273 TraceCheckUtils]: 82: Hoare triple {41906#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:12,482 INFO L273 TraceCheckUtils]: 83: Hoare triple {41906#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:12,483 INFO L273 TraceCheckUtils]: 84: Hoare triple {41907#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:12,483 INFO L273 TraceCheckUtils]: 85: Hoare triple {41907#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:12,484 INFO L273 TraceCheckUtils]: 86: Hoare triple {41907#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:12,485 INFO L273 TraceCheckUtils]: 87: Hoare triple {41908#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:12,485 INFO L273 TraceCheckUtils]: 88: Hoare triple {41908#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:12,486 INFO L273 TraceCheckUtils]: 89: Hoare triple {41908#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:12,486 INFO L273 TraceCheckUtils]: 90: Hoare triple {41909#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:12,487 INFO L273 TraceCheckUtils]: 91: Hoare triple {41909#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:12,488 INFO L273 TraceCheckUtils]: 92: Hoare triple {41909#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:12,488 INFO L273 TraceCheckUtils]: 93: Hoare triple {41910#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:12,489 INFO L273 TraceCheckUtils]: 94: Hoare triple {41910#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:12,489 INFO L273 TraceCheckUtils]: 95: Hoare triple {41910#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:12,490 INFO L273 TraceCheckUtils]: 96: Hoare triple {41911#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:12,490 INFO L273 TraceCheckUtils]: 97: Hoare triple {41911#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:12,491 INFO L273 TraceCheckUtils]: 98: Hoare triple {41911#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:12,491 INFO L273 TraceCheckUtils]: 99: Hoare triple {41912#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:12,492 INFO L273 TraceCheckUtils]: 100: Hoare triple {41912#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:12,493 INFO L273 TraceCheckUtils]: 101: Hoare triple {41912#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:12,493 INFO L273 TraceCheckUtils]: 102: Hoare triple {41913#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:12,494 INFO L273 TraceCheckUtils]: 103: Hoare triple {41913#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:12,494 INFO L273 TraceCheckUtils]: 104: Hoare triple {41913#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:12,495 INFO L273 TraceCheckUtils]: 105: Hoare triple {41914#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:12,495 INFO L273 TraceCheckUtils]: 106: Hoare triple {41914#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:12,496 INFO L273 TraceCheckUtils]: 107: Hoare triple {41914#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:12,497 INFO L273 TraceCheckUtils]: 108: Hoare triple {41915#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:12,497 INFO L273 TraceCheckUtils]: 109: Hoare triple {41915#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:12,498 INFO L273 TraceCheckUtils]: 110: Hoare triple {41915#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:12,498 INFO L273 TraceCheckUtils]: 111: Hoare triple {41916#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:12,499 INFO L273 TraceCheckUtils]: 112: Hoare triple {41916#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:12,499 INFO L273 TraceCheckUtils]: 113: Hoare triple {41916#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:12,500 INFO L273 TraceCheckUtils]: 114: Hoare triple {41917#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:12,500 INFO L273 TraceCheckUtils]: 115: Hoare triple {41917#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:12,501 INFO L273 TraceCheckUtils]: 116: Hoare triple {41917#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:12,502 INFO L273 TraceCheckUtils]: 117: Hoare triple {41918#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:12,502 INFO L273 TraceCheckUtils]: 118: Hoare triple {41918#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:12,503 INFO L273 TraceCheckUtils]: 119: Hoare triple {41918#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:12,503 INFO L273 TraceCheckUtils]: 120: Hoare triple {41919#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:12,504 INFO L273 TraceCheckUtils]: 121: Hoare triple {41919#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:12,505 INFO L273 TraceCheckUtils]: 122: Hoare triple {41919#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:12,505 INFO L273 TraceCheckUtils]: 123: Hoare triple {41920#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:12,506 INFO L273 TraceCheckUtils]: 124: Hoare triple {41920#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:12,506 INFO L273 TraceCheckUtils]: 125: Hoare triple {41920#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:12,507 INFO L273 TraceCheckUtils]: 126: Hoare triple {41921#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:12,507 INFO L273 TraceCheckUtils]: 127: Hoare triple {41921#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:12,508 INFO L273 TraceCheckUtils]: 128: Hoare triple {41921#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:12,509 INFO L273 TraceCheckUtils]: 129: Hoare triple {41922#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:12,509 INFO L273 TraceCheckUtils]: 130: Hoare triple {41922#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:12,510 INFO L273 TraceCheckUtils]: 131: Hoare triple {41922#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:12,510 INFO L273 TraceCheckUtils]: 132: Hoare triple {41923#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:12,511 INFO L273 TraceCheckUtils]: 133: Hoare triple {41923#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:12,511 INFO L273 TraceCheckUtils]: 134: Hoare triple {41923#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:12,512 INFO L273 TraceCheckUtils]: 135: Hoare triple {41924#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:12,512 INFO L273 TraceCheckUtils]: 136: Hoare triple {41924#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:12,513 INFO L273 TraceCheckUtils]: 137: Hoare triple {41924#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:12,514 INFO L273 TraceCheckUtils]: 138: Hoare triple {41925#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:12,514 INFO L273 TraceCheckUtils]: 139: Hoare triple {41925#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:12,515 INFO L273 TraceCheckUtils]: 140: Hoare triple {41925#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:12,515 INFO L273 TraceCheckUtils]: 141: Hoare triple {41926#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:12,516 INFO L273 TraceCheckUtils]: 142: Hoare triple {41926#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:12,517 INFO L273 TraceCheckUtils]: 143: Hoare triple {41926#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:12,517 INFO L273 TraceCheckUtils]: 144: Hoare triple {41927#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:12,518 INFO L273 TraceCheckUtils]: 145: Hoare triple {41927#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:12,518 INFO L273 TraceCheckUtils]: 146: Hoare triple {41927#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:12,519 INFO L273 TraceCheckUtils]: 147: Hoare triple {41928#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:12,519 INFO L273 TraceCheckUtils]: 148: Hoare triple {41928#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:12,520 INFO L273 TraceCheckUtils]: 149: Hoare triple {41928#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:12,521 INFO L273 TraceCheckUtils]: 150: Hoare triple {41929#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:12,521 INFO L273 TraceCheckUtils]: 151: Hoare triple {41929#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:12,522 INFO L273 TraceCheckUtils]: 152: Hoare triple {41929#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:12,522 INFO L273 TraceCheckUtils]: 153: Hoare triple {41930#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:12,523 INFO L273 TraceCheckUtils]: 154: Hoare triple {41930#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:12,523 INFO L273 TraceCheckUtils]: 155: Hoare triple {41930#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:12,524 INFO L273 TraceCheckUtils]: 156: Hoare triple {41931#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:12,524 INFO L273 TraceCheckUtils]: 157: Hoare triple {41931#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:12,525 INFO L273 TraceCheckUtils]: 158: Hoare triple {41931#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:12,526 INFO L273 TraceCheckUtils]: 159: Hoare triple {41932#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:12,526 INFO L273 TraceCheckUtils]: 160: Hoare triple {41932#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:12,527 INFO L273 TraceCheckUtils]: 161: Hoare triple {41932#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:12,527 INFO L273 TraceCheckUtils]: 162: Hoare triple {41933#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:12,528 INFO L273 TraceCheckUtils]: 163: Hoare triple {41933#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:12,529 INFO L273 TraceCheckUtils]: 164: Hoare triple {41933#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {41934#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:12,529 INFO L273 TraceCheckUtils]: 165: Hoare triple {41934#(<= main_~i~0 53)} assume !(~i~0 < 100000); {41880#false} is VALID [2018-11-23 12:07:12,529 INFO L273 TraceCheckUtils]: 166: Hoare triple {41880#false} havoc ~x~0;~x~0 := 0; {41880#false} is VALID [2018-11-23 12:07:12,530 INFO L273 TraceCheckUtils]: 167: Hoare triple {41880#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {41880#false} is VALID [2018-11-23 12:07:12,530 INFO L256 TraceCheckUtils]: 168: Hoare triple {41880#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {41880#false} is VALID [2018-11-23 12:07:12,530 INFO L273 TraceCheckUtils]: 169: Hoare triple {41880#false} ~cond := #in~cond; {41880#false} is VALID [2018-11-23 12:07:12,530 INFO L273 TraceCheckUtils]: 170: Hoare triple {41880#false} assume 0 == ~cond; {41880#false} is VALID [2018-11-23 12:07:12,530 INFO L273 TraceCheckUtils]: 171: Hoare triple {41880#false} assume !false; {41880#false} is VALID [2018-11-23 12:07:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:12,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:12,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2018-11-23 12:07:12,569 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 172 [2018-11-23 12:07:12,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:12,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-23 12:07:12,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:12,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 12:07:12,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 12:07:12,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:07:12,744 INFO L87 Difference]: Start difference. First operand 177 states and 231 transitions. Second operand 57 states. [2018-11-23 12:07:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:13,946 INFO L93 Difference]: Finished difference Result 193 states and 250 transitions. [2018-11-23 12:07:13,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-23 12:07:13,946 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 172 [2018-11-23 12:07:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:07:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 250 transitions. [2018-11-23 12:07:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:07:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 250 transitions. [2018-11-23 12:07:13,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 250 transitions. [2018-11-23 12:07:14,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:14,188 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:07:14,188 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 12:07:14,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:07:14,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 12:07:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-11-23 12:07:14,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:14,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 180 states. [2018-11-23 12:07:14,726 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 180 states. [2018-11-23 12:07:14,726 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 180 states. [2018-11-23 12:07:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:14,728 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2018-11-23 12:07:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-11-23 12:07:14,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:14,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:14,729 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 182 states. [2018-11-23 12:07:14,729 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 182 states. [2018-11-23 12:07:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:14,731 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2018-11-23 12:07:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-11-23 12:07:14,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:14,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:14,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:14,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 12:07:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2018-11-23 12:07:14,734 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 172 [2018-11-23 12:07:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:14,735 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2018-11-23 12:07:14,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 12:07:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2018-11-23 12:07:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 12:07:14,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:14,736 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:14,736 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:14,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:14,736 INFO L82 PathProgramCache]: Analyzing trace with hash -565469703, now seen corresponding path program 54 times [2018-11-23 12:07:14,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:14,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:14,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:14,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:14,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:16,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {43315#true} call ULTIMATE.init(); {43315#true} is VALID [2018-11-23 12:07:16,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {43315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43315#true} is VALID [2018-11-23 12:07:16,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {43315#true} assume true; {43315#true} is VALID [2018-11-23 12:07:16,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43315#true} {43315#true} #55#return; {43315#true} is VALID [2018-11-23 12:07:16,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {43315#true} call #t~ret4 := main(); {43315#true} is VALID [2018-11-23 12:07:16,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {43315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {43317#(= main_~i~0 0)} is VALID [2018-11-23 12:07:16,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {43317#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43317#(= main_~i~0 0)} is VALID [2018-11-23 12:07:16,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {43317#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43317#(= main_~i~0 0)} is VALID [2018-11-23 12:07:16,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {43317#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:16,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {43318#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:16,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {43318#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:16,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {43318#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:16,141 INFO L273 TraceCheckUtils]: 12: Hoare triple {43319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:16,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {43319#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:16,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {43319#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:16,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {43320#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:16,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {43320#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:16,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {43320#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:16,143 INFO L273 TraceCheckUtils]: 18: Hoare triple {43321#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:16,144 INFO L273 TraceCheckUtils]: 19: Hoare triple {43321#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:16,145 INFO L273 TraceCheckUtils]: 20: Hoare triple {43321#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:16,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {43322#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:16,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {43322#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:16,146 INFO L273 TraceCheckUtils]: 23: Hoare triple {43322#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:16,147 INFO L273 TraceCheckUtils]: 24: Hoare triple {43323#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:16,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {43323#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:16,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {43323#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:16,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {43324#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:16,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {43324#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:16,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {43324#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:16,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {43325#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:16,150 INFO L273 TraceCheckUtils]: 31: Hoare triple {43325#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:16,151 INFO L273 TraceCheckUtils]: 32: Hoare triple {43325#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:16,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {43326#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:16,152 INFO L273 TraceCheckUtils]: 34: Hoare triple {43326#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:16,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {43326#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:16,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {43327#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:16,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {43327#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:16,154 INFO L273 TraceCheckUtils]: 38: Hoare triple {43327#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:16,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {43328#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:16,155 INFO L273 TraceCheckUtils]: 40: Hoare triple {43328#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:16,156 INFO L273 TraceCheckUtils]: 41: Hoare triple {43328#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:16,156 INFO L273 TraceCheckUtils]: 42: Hoare triple {43329#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:16,157 INFO L273 TraceCheckUtils]: 43: Hoare triple {43329#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:16,157 INFO L273 TraceCheckUtils]: 44: Hoare triple {43329#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:16,158 INFO L273 TraceCheckUtils]: 45: Hoare triple {43330#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:16,158 INFO L273 TraceCheckUtils]: 46: Hoare triple {43330#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:16,159 INFO L273 TraceCheckUtils]: 47: Hoare triple {43330#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:16,159 INFO L273 TraceCheckUtils]: 48: Hoare triple {43331#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:16,160 INFO L273 TraceCheckUtils]: 49: Hoare triple {43331#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:16,160 INFO L273 TraceCheckUtils]: 50: Hoare triple {43331#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:16,161 INFO L273 TraceCheckUtils]: 51: Hoare triple {43332#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:16,161 INFO L273 TraceCheckUtils]: 52: Hoare triple {43332#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:16,162 INFO L273 TraceCheckUtils]: 53: Hoare triple {43332#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:16,163 INFO L273 TraceCheckUtils]: 54: Hoare triple {43333#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:16,163 INFO L273 TraceCheckUtils]: 55: Hoare triple {43333#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:16,164 INFO L273 TraceCheckUtils]: 56: Hoare triple {43333#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:16,164 INFO L273 TraceCheckUtils]: 57: Hoare triple {43334#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:16,165 INFO L273 TraceCheckUtils]: 58: Hoare triple {43334#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:16,165 INFO L273 TraceCheckUtils]: 59: Hoare triple {43334#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:16,166 INFO L273 TraceCheckUtils]: 60: Hoare triple {43335#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:16,166 INFO L273 TraceCheckUtils]: 61: Hoare triple {43335#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:16,167 INFO L273 TraceCheckUtils]: 62: Hoare triple {43335#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:16,167 INFO L273 TraceCheckUtils]: 63: Hoare triple {43336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:16,168 INFO L273 TraceCheckUtils]: 64: Hoare triple {43336#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:16,168 INFO L273 TraceCheckUtils]: 65: Hoare triple {43336#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:16,169 INFO L273 TraceCheckUtils]: 66: Hoare triple {43337#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:16,169 INFO L273 TraceCheckUtils]: 67: Hoare triple {43337#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:16,170 INFO L273 TraceCheckUtils]: 68: Hoare triple {43337#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:16,171 INFO L273 TraceCheckUtils]: 69: Hoare triple {43338#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:16,171 INFO L273 TraceCheckUtils]: 70: Hoare triple {43338#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:16,172 INFO L273 TraceCheckUtils]: 71: Hoare triple {43338#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:16,172 INFO L273 TraceCheckUtils]: 72: Hoare triple {43339#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:16,173 INFO L273 TraceCheckUtils]: 73: Hoare triple {43339#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:16,173 INFO L273 TraceCheckUtils]: 74: Hoare triple {43339#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:16,174 INFO L273 TraceCheckUtils]: 75: Hoare triple {43340#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:16,174 INFO L273 TraceCheckUtils]: 76: Hoare triple {43340#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:16,175 INFO L273 TraceCheckUtils]: 77: Hoare triple {43340#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:16,175 INFO L273 TraceCheckUtils]: 78: Hoare triple {43341#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:16,176 INFO L273 TraceCheckUtils]: 79: Hoare triple {43341#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:16,176 INFO L273 TraceCheckUtils]: 80: Hoare triple {43341#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:16,177 INFO L273 TraceCheckUtils]: 81: Hoare triple {43342#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:16,177 INFO L273 TraceCheckUtils]: 82: Hoare triple {43342#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:16,178 INFO L273 TraceCheckUtils]: 83: Hoare triple {43342#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:16,178 INFO L273 TraceCheckUtils]: 84: Hoare triple {43343#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:16,179 INFO L273 TraceCheckUtils]: 85: Hoare triple {43343#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:16,180 INFO L273 TraceCheckUtils]: 86: Hoare triple {43343#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:16,180 INFO L273 TraceCheckUtils]: 87: Hoare triple {43344#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:16,181 INFO L273 TraceCheckUtils]: 88: Hoare triple {43344#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:16,181 INFO L273 TraceCheckUtils]: 89: Hoare triple {43344#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:16,182 INFO L273 TraceCheckUtils]: 90: Hoare triple {43345#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:16,182 INFO L273 TraceCheckUtils]: 91: Hoare triple {43345#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:16,183 INFO L273 TraceCheckUtils]: 92: Hoare triple {43345#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:16,183 INFO L273 TraceCheckUtils]: 93: Hoare triple {43346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:16,184 INFO L273 TraceCheckUtils]: 94: Hoare triple {43346#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:16,185 INFO L273 TraceCheckUtils]: 95: Hoare triple {43346#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:16,185 INFO L273 TraceCheckUtils]: 96: Hoare triple {43347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:16,185 INFO L273 TraceCheckUtils]: 97: Hoare triple {43347#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:16,186 INFO L273 TraceCheckUtils]: 98: Hoare triple {43347#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:16,187 INFO L273 TraceCheckUtils]: 99: Hoare triple {43348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:16,187 INFO L273 TraceCheckUtils]: 100: Hoare triple {43348#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:16,188 INFO L273 TraceCheckUtils]: 101: Hoare triple {43348#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:16,188 INFO L273 TraceCheckUtils]: 102: Hoare triple {43349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:16,189 INFO L273 TraceCheckUtils]: 103: Hoare triple {43349#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:16,189 INFO L273 TraceCheckUtils]: 104: Hoare triple {43349#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:16,190 INFO L273 TraceCheckUtils]: 105: Hoare triple {43350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:16,190 INFO L273 TraceCheckUtils]: 106: Hoare triple {43350#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:16,191 INFO L273 TraceCheckUtils]: 107: Hoare triple {43350#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:16,191 INFO L273 TraceCheckUtils]: 108: Hoare triple {43351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:16,192 INFO L273 TraceCheckUtils]: 109: Hoare triple {43351#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:16,192 INFO L273 TraceCheckUtils]: 110: Hoare triple {43351#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:16,193 INFO L273 TraceCheckUtils]: 111: Hoare triple {43352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:16,193 INFO L273 TraceCheckUtils]: 112: Hoare triple {43352#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:16,194 INFO L273 TraceCheckUtils]: 113: Hoare triple {43352#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:16,195 INFO L273 TraceCheckUtils]: 114: Hoare triple {43353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:16,195 INFO L273 TraceCheckUtils]: 115: Hoare triple {43353#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:16,196 INFO L273 TraceCheckUtils]: 116: Hoare triple {43353#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:16,196 INFO L273 TraceCheckUtils]: 117: Hoare triple {43354#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:16,197 INFO L273 TraceCheckUtils]: 118: Hoare triple {43354#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:16,197 INFO L273 TraceCheckUtils]: 119: Hoare triple {43354#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:16,198 INFO L273 TraceCheckUtils]: 120: Hoare triple {43355#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:16,198 INFO L273 TraceCheckUtils]: 121: Hoare triple {43355#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:16,199 INFO L273 TraceCheckUtils]: 122: Hoare triple {43355#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:16,199 INFO L273 TraceCheckUtils]: 123: Hoare triple {43356#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:16,200 INFO L273 TraceCheckUtils]: 124: Hoare triple {43356#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:16,201 INFO L273 TraceCheckUtils]: 125: Hoare triple {43356#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,201 INFO L273 TraceCheckUtils]: 126: Hoare triple {43357#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,202 INFO L273 TraceCheckUtils]: 127: Hoare triple {43357#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,202 INFO L273 TraceCheckUtils]: 128: Hoare triple {43357#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,203 INFO L273 TraceCheckUtils]: 129: Hoare triple {43358#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,203 INFO L273 TraceCheckUtils]: 130: Hoare triple {43358#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,204 INFO L273 TraceCheckUtils]: 131: Hoare triple {43358#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,204 INFO L273 TraceCheckUtils]: 132: Hoare triple {43359#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,205 INFO L273 TraceCheckUtils]: 133: Hoare triple {43359#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,205 INFO L273 TraceCheckUtils]: 134: Hoare triple {43359#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,206 INFO L273 TraceCheckUtils]: 135: Hoare triple {43360#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,206 INFO L273 TraceCheckUtils]: 136: Hoare triple {43360#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,207 INFO L273 TraceCheckUtils]: 137: Hoare triple {43360#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,207 INFO L273 TraceCheckUtils]: 138: Hoare triple {43361#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,208 INFO L273 TraceCheckUtils]: 139: Hoare triple {43361#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,209 INFO L273 TraceCheckUtils]: 140: Hoare triple {43361#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,209 INFO L273 TraceCheckUtils]: 141: Hoare triple {43362#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,210 INFO L273 TraceCheckUtils]: 142: Hoare triple {43362#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,210 INFO L273 TraceCheckUtils]: 143: Hoare triple {43362#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,211 INFO L273 TraceCheckUtils]: 144: Hoare triple {43363#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,211 INFO L273 TraceCheckUtils]: 145: Hoare triple {43363#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,212 INFO L273 TraceCheckUtils]: 146: Hoare triple {43363#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,212 INFO L273 TraceCheckUtils]: 147: Hoare triple {43364#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,213 INFO L273 TraceCheckUtils]: 148: Hoare triple {43364#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,213 INFO L273 TraceCheckUtils]: 149: Hoare triple {43364#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,214 INFO L273 TraceCheckUtils]: 150: Hoare triple {43365#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,214 INFO L273 TraceCheckUtils]: 151: Hoare triple {43365#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,215 INFO L273 TraceCheckUtils]: 152: Hoare triple {43365#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,215 INFO L273 TraceCheckUtils]: 153: Hoare triple {43366#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,216 INFO L273 TraceCheckUtils]: 154: Hoare triple {43366#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,217 INFO L273 TraceCheckUtils]: 155: Hoare triple {43366#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,217 INFO L273 TraceCheckUtils]: 156: Hoare triple {43367#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,217 INFO L273 TraceCheckUtils]: 157: Hoare triple {43367#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,218 INFO L273 TraceCheckUtils]: 158: Hoare triple {43367#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,219 INFO L273 TraceCheckUtils]: 159: Hoare triple {43368#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,219 INFO L273 TraceCheckUtils]: 160: Hoare triple {43368#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,220 INFO L273 TraceCheckUtils]: 161: Hoare triple {43368#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,220 INFO L273 TraceCheckUtils]: 162: Hoare triple {43369#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,221 INFO L273 TraceCheckUtils]: 163: Hoare triple {43369#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,221 INFO L273 TraceCheckUtils]: 164: Hoare triple {43369#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,222 INFO L273 TraceCheckUtils]: 165: Hoare triple {43370#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,222 INFO L273 TraceCheckUtils]: 166: Hoare triple {43370#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,223 INFO L273 TraceCheckUtils]: 167: Hoare triple {43370#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {43371#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:16,224 INFO L273 TraceCheckUtils]: 168: Hoare triple {43371#(<= main_~i~0 54)} assume !(~i~0 < 100000); {43316#false} is VALID [2018-11-23 12:07:16,224 INFO L273 TraceCheckUtils]: 169: Hoare triple {43316#false} havoc ~x~0;~x~0 := 0; {43316#false} is VALID [2018-11-23 12:07:16,224 INFO L273 TraceCheckUtils]: 170: Hoare triple {43316#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {43316#false} is VALID [2018-11-23 12:07:16,224 INFO L256 TraceCheckUtils]: 171: Hoare triple {43316#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {43316#false} is VALID [2018-11-23 12:07:16,224 INFO L273 TraceCheckUtils]: 172: Hoare triple {43316#false} ~cond := #in~cond; {43316#false} is VALID [2018-11-23 12:07:16,224 INFO L273 TraceCheckUtils]: 173: Hoare triple {43316#false} assume 0 == ~cond; {43316#false} is VALID [2018-11-23 12:07:16,225 INFO L273 TraceCheckUtils]: 174: Hoare triple {43316#false} assume !false; {43316#false} is VALID [2018-11-23 12:07:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:16,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:16,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:16,254 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:07:16,399 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-11-23 12:07:16,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:16,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:16,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {43315#true} call ULTIMATE.init(); {43315#true} is VALID [2018-11-23 12:07:16,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {43315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43315#true} is VALID [2018-11-23 12:07:16,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {43315#true} assume true; {43315#true} is VALID [2018-11-23 12:07:16,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43315#true} {43315#true} #55#return; {43315#true} is VALID [2018-11-23 12:07:16,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {43315#true} call #t~ret4 := main(); {43315#true} is VALID [2018-11-23 12:07:16,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {43315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {43390#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:16,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {43390#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43390#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:16,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {43390#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43390#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:16,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {43390#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:16,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {43318#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:16,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {43318#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:16,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {43318#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:16,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {43319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:16,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {43319#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:16,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {43319#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:16,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {43320#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:16,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {43320#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:16,875 INFO L273 TraceCheckUtils]: 17: Hoare triple {43320#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:16,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {43321#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:16,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {43321#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:16,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {43321#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:16,878 INFO L273 TraceCheckUtils]: 21: Hoare triple {43322#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:16,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {43322#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:16,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {43322#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:16,879 INFO L273 TraceCheckUtils]: 24: Hoare triple {43323#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:16,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {43323#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:16,880 INFO L273 TraceCheckUtils]: 26: Hoare triple {43323#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:16,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {43324#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:16,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {43324#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:16,882 INFO L273 TraceCheckUtils]: 29: Hoare triple {43324#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:16,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {43325#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:16,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {43325#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:16,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {43325#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:16,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {43326#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:16,885 INFO L273 TraceCheckUtils]: 34: Hoare triple {43326#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:16,886 INFO L273 TraceCheckUtils]: 35: Hoare triple {43326#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:16,886 INFO L273 TraceCheckUtils]: 36: Hoare triple {43327#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:16,887 INFO L273 TraceCheckUtils]: 37: Hoare triple {43327#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:16,887 INFO L273 TraceCheckUtils]: 38: Hoare triple {43327#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:16,888 INFO L273 TraceCheckUtils]: 39: Hoare triple {43328#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:16,888 INFO L273 TraceCheckUtils]: 40: Hoare triple {43328#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:16,889 INFO L273 TraceCheckUtils]: 41: Hoare triple {43328#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:16,890 INFO L273 TraceCheckUtils]: 42: Hoare triple {43329#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:16,890 INFO L273 TraceCheckUtils]: 43: Hoare triple {43329#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:16,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {43329#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:16,891 INFO L273 TraceCheckUtils]: 45: Hoare triple {43330#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:16,892 INFO L273 TraceCheckUtils]: 46: Hoare triple {43330#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:16,892 INFO L273 TraceCheckUtils]: 47: Hoare triple {43330#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:16,893 INFO L273 TraceCheckUtils]: 48: Hoare triple {43331#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:16,893 INFO L273 TraceCheckUtils]: 49: Hoare triple {43331#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:16,894 INFO L273 TraceCheckUtils]: 50: Hoare triple {43331#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:16,895 INFO L273 TraceCheckUtils]: 51: Hoare triple {43332#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:16,895 INFO L273 TraceCheckUtils]: 52: Hoare triple {43332#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:16,896 INFO L273 TraceCheckUtils]: 53: Hoare triple {43332#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:16,896 INFO L273 TraceCheckUtils]: 54: Hoare triple {43333#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:16,897 INFO L273 TraceCheckUtils]: 55: Hoare triple {43333#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:16,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {43333#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:16,898 INFO L273 TraceCheckUtils]: 57: Hoare triple {43334#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:16,899 INFO L273 TraceCheckUtils]: 58: Hoare triple {43334#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:16,899 INFO L273 TraceCheckUtils]: 59: Hoare triple {43334#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:16,900 INFO L273 TraceCheckUtils]: 60: Hoare triple {43335#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:16,900 INFO L273 TraceCheckUtils]: 61: Hoare triple {43335#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:16,901 INFO L273 TraceCheckUtils]: 62: Hoare triple {43335#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:16,901 INFO L273 TraceCheckUtils]: 63: Hoare triple {43336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:16,902 INFO L273 TraceCheckUtils]: 64: Hoare triple {43336#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:16,903 INFO L273 TraceCheckUtils]: 65: Hoare triple {43336#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:16,903 INFO L273 TraceCheckUtils]: 66: Hoare triple {43337#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:16,904 INFO L273 TraceCheckUtils]: 67: Hoare triple {43337#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:16,904 INFO L273 TraceCheckUtils]: 68: Hoare triple {43337#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:16,905 INFO L273 TraceCheckUtils]: 69: Hoare triple {43338#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:16,905 INFO L273 TraceCheckUtils]: 70: Hoare triple {43338#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:16,906 INFO L273 TraceCheckUtils]: 71: Hoare triple {43338#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:16,907 INFO L273 TraceCheckUtils]: 72: Hoare triple {43339#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:16,907 INFO L273 TraceCheckUtils]: 73: Hoare triple {43339#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:16,908 INFO L273 TraceCheckUtils]: 74: Hoare triple {43339#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:16,908 INFO L273 TraceCheckUtils]: 75: Hoare triple {43340#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:16,909 INFO L273 TraceCheckUtils]: 76: Hoare triple {43340#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:16,909 INFO L273 TraceCheckUtils]: 77: Hoare triple {43340#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:16,910 INFO L273 TraceCheckUtils]: 78: Hoare triple {43341#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:16,910 INFO L273 TraceCheckUtils]: 79: Hoare triple {43341#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:16,911 INFO L273 TraceCheckUtils]: 80: Hoare triple {43341#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:16,912 INFO L273 TraceCheckUtils]: 81: Hoare triple {43342#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:16,912 INFO L273 TraceCheckUtils]: 82: Hoare triple {43342#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:16,913 INFO L273 TraceCheckUtils]: 83: Hoare triple {43342#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:16,913 INFO L273 TraceCheckUtils]: 84: Hoare triple {43343#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:16,914 INFO L273 TraceCheckUtils]: 85: Hoare triple {43343#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:16,915 INFO L273 TraceCheckUtils]: 86: Hoare triple {43343#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:16,915 INFO L273 TraceCheckUtils]: 87: Hoare triple {43344#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:16,916 INFO L273 TraceCheckUtils]: 88: Hoare triple {43344#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:16,916 INFO L273 TraceCheckUtils]: 89: Hoare triple {43344#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:16,917 INFO L273 TraceCheckUtils]: 90: Hoare triple {43345#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:16,917 INFO L273 TraceCheckUtils]: 91: Hoare triple {43345#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:16,918 INFO L273 TraceCheckUtils]: 92: Hoare triple {43345#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:16,918 INFO L273 TraceCheckUtils]: 93: Hoare triple {43346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:16,919 INFO L273 TraceCheckUtils]: 94: Hoare triple {43346#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:16,920 INFO L273 TraceCheckUtils]: 95: Hoare triple {43346#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:16,920 INFO L273 TraceCheckUtils]: 96: Hoare triple {43347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:16,921 INFO L273 TraceCheckUtils]: 97: Hoare triple {43347#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:16,921 INFO L273 TraceCheckUtils]: 98: Hoare triple {43347#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:16,922 INFO L273 TraceCheckUtils]: 99: Hoare triple {43348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:16,922 INFO L273 TraceCheckUtils]: 100: Hoare triple {43348#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:16,923 INFO L273 TraceCheckUtils]: 101: Hoare triple {43348#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:16,924 INFO L273 TraceCheckUtils]: 102: Hoare triple {43349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:16,924 INFO L273 TraceCheckUtils]: 103: Hoare triple {43349#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:16,925 INFO L273 TraceCheckUtils]: 104: Hoare triple {43349#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:16,925 INFO L273 TraceCheckUtils]: 105: Hoare triple {43350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:16,926 INFO L273 TraceCheckUtils]: 106: Hoare triple {43350#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:16,927 INFO L273 TraceCheckUtils]: 107: Hoare triple {43350#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:16,927 INFO L273 TraceCheckUtils]: 108: Hoare triple {43351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:16,927 INFO L273 TraceCheckUtils]: 109: Hoare triple {43351#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:16,928 INFO L273 TraceCheckUtils]: 110: Hoare triple {43351#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:16,929 INFO L273 TraceCheckUtils]: 111: Hoare triple {43352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:16,929 INFO L273 TraceCheckUtils]: 112: Hoare triple {43352#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:16,930 INFO L273 TraceCheckUtils]: 113: Hoare triple {43352#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:16,930 INFO L273 TraceCheckUtils]: 114: Hoare triple {43353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:16,931 INFO L273 TraceCheckUtils]: 115: Hoare triple {43353#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:16,932 INFO L273 TraceCheckUtils]: 116: Hoare triple {43353#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:16,932 INFO L273 TraceCheckUtils]: 117: Hoare triple {43354#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:16,933 INFO L273 TraceCheckUtils]: 118: Hoare triple {43354#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:16,933 INFO L273 TraceCheckUtils]: 119: Hoare triple {43354#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:16,934 INFO L273 TraceCheckUtils]: 120: Hoare triple {43355#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:16,934 INFO L273 TraceCheckUtils]: 121: Hoare triple {43355#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:16,935 INFO L273 TraceCheckUtils]: 122: Hoare triple {43355#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:16,936 INFO L273 TraceCheckUtils]: 123: Hoare triple {43356#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:16,936 INFO L273 TraceCheckUtils]: 124: Hoare triple {43356#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:16,937 INFO L273 TraceCheckUtils]: 125: Hoare triple {43356#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,937 INFO L273 TraceCheckUtils]: 126: Hoare triple {43357#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,938 INFO L273 TraceCheckUtils]: 127: Hoare triple {43357#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,938 INFO L273 TraceCheckUtils]: 128: Hoare triple {43357#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,939 INFO L273 TraceCheckUtils]: 129: Hoare triple {43358#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,939 INFO L273 TraceCheckUtils]: 130: Hoare triple {43358#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,940 INFO L273 TraceCheckUtils]: 131: Hoare triple {43358#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,941 INFO L273 TraceCheckUtils]: 132: Hoare triple {43359#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,941 INFO L273 TraceCheckUtils]: 133: Hoare triple {43359#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,942 INFO L273 TraceCheckUtils]: 134: Hoare triple {43359#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,942 INFO L273 TraceCheckUtils]: 135: Hoare triple {43360#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,943 INFO L273 TraceCheckUtils]: 136: Hoare triple {43360#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,944 INFO L273 TraceCheckUtils]: 137: Hoare triple {43360#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,944 INFO L273 TraceCheckUtils]: 138: Hoare triple {43361#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,945 INFO L273 TraceCheckUtils]: 139: Hoare triple {43361#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,945 INFO L273 TraceCheckUtils]: 140: Hoare triple {43361#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,946 INFO L273 TraceCheckUtils]: 141: Hoare triple {43362#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,946 INFO L273 TraceCheckUtils]: 142: Hoare triple {43362#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,947 INFO L273 TraceCheckUtils]: 143: Hoare triple {43362#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,948 INFO L273 TraceCheckUtils]: 144: Hoare triple {43363#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,948 INFO L273 TraceCheckUtils]: 145: Hoare triple {43363#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,949 INFO L273 TraceCheckUtils]: 146: Hoare triple {43363#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,949 INFO L273 TraceCheckUtils]: 147: Hoare triple {43364#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,950 INFO L273 TraceCheckUtils]: 148: Hoare triple {43364#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,950 INFO L273 TraceCheckUtils]: 149: Hoare triple {43364#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,951 INFO L273 TraceCheckUtils]: 150: Hoare triple {43365#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,951 INFO L273 TraceCheckUtils]: 151: Hoare triple {43365#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,952 INFO L273 TraceCheckUtils]: 152: Hoare triple {43365#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,953 INFO L273 TraceCheckUtils]: 153: Hoare triple {43366#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,953 INFO L273 TraceCheckUtils]: 154: Hoare triple {43366#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,954 INFO L273 TraceCheckUtils]: 155: Hoare triple {43366#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,954 INFO L273 TraceCheckUtils]: 156: Hoare triple {43367#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,955 INFO L273 TraceCheckUtils]: 157: Hoare triple {43367#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,956 INFO L273 TraceCheckUtils]: 158: Hoare triple {43367#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,956 INFO L273 TraceCheckUtils]: 159: Hoare triple {43368#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,957 INFO L273 TraceCheckUtils]: 160: Hoare triple {43368#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,957 INFO L273 TraceCheckUtils]: 161: Hoare triple {43368#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,958 INFO L273 TraceCheckUtils]: 162: Hoare triple {43369#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,958 INFO L273 TraceCheckUtils]: 163: Hoare triple {43369#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,959 INFO L273 TraceCheckUtils]: 164: Hoare triple {43369#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,959 INFO L273 TraceCheckUtils]: 165: Hoare triple {43370#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,960 INFO L273 TraceCheckUtils]: 166: Hoare triple {43370#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,961 INFO L273 TraceCheckUtils]: 167: Hoare triple {43370#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {43371#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:16,961 INFO L273 TraceCheckUtils]: 168: Hoare triple {43371#(<= main_~i~0 54)} assume !(~i~0 < 100000); {43316#false} is VALID [2018-11-23 12:07:16,962 INFO L273 TraceCheckUtils]: 169: Hoare triple {43316#false} havoc ~x~0;~x~0 := 0; {43316#false} is VALID [2018-11-23 12:07:16,962 INFO L273 TraceCheckUtils]: 170: Hoare triple {43316#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {43316#false} is VALID [2018-11-23 12:07:16,962 INFO L256 TraceCheckUtils]: 171: Hoare triple {43316#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {43316#false} is VALID [2018-11-23 12:07:16,962 INFO L273 TraceCheckUtils]: 172: Hoare triple {43316#false} ~cond := #in~cond; {43316#false} is VALID [2018-11-23 12:07:16,962 INFO L273 TraceCheckUtils]: 173: Hoare triple {43316#false} assume 0 == ~cond; {43316#false} is VALID [2018-11-23 12:07:16,962 INFO L273 TraceCheckUtils]: 174: Hoare triple {43316#false} assume !false; {43316#false} is VALID [2018-11-23 12:07:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:17,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:17,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2018-11-23 12:07:17,002 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 175 [2018-11-23 12:07:17,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:17,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2018-11-23 12:07:17,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:17,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 12:07:17,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 12:07:17,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 12:07:17,172 INFO L87 Difference]: Start difference. First operand 180 states and 235 transitions. Second operand 58 states. [2018-11-23 12:07:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:18,344 INFO L93 Difference]: Finished difference Result 196 states and 254 transitions. [2018-11-23 12:07:18,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-23 12:07:18,344 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 175 [2018-11-23 12:07:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:07:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 254 transitions. [2018-11-23 12:07:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:07:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 254 transitions. [2018-11-23 12:07:18,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 254 transitions. [2018-11-23 12:07:18,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:18,576 INFO L225 Difference]: With dead ends: 196 [2018-11-23 12:07:18,576 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 12:07:18,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 12:07:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 12:07:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-11-23 12:07:18,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:18,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 183 states. [2018-11-23 12:07:18,621 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 183 states. [2018-11-23 12:07:18,622 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 183 states. [2018-11-23 12:07:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:18,625 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-11-23 12:07:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2018-11-23 12:07:18,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:18,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:18,625 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 185 states. [2018-11-23 12:07:18,626 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 185 states. [2018-11-23 12:07:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:18,628 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-11-23 12:07:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2018-11-23 12:07:18,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:18,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:18,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:18,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-23 12:07:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2018-11-23 12:07:18,632 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 175 [2018-11-23 12:07:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:18,633 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2018-11-23 12:07:18,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 12:07:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2018-11-23 12:07:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 12:07:18,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:18,634 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:18,634 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:18,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2000821341, now seen corresponding path program 55 times [2018-11-23 12:07:18,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:18,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:18,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:18,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:18,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:20,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {44775#true} call ULTIMATE.init(); {44775#true} is VALID [2018-11-23 12:07:20,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {44775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44775#true} is VALID [2018-11-23 12:07:20,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {44775#true} assume true; {44775#true} is VALID [2018-11-23 12:07:20,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44775#true} {44775#true} #55#return; {44775#true} is VALID [2018-11-23 12:07:20,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {44775#true} call #t~ret4 := main(); {44775#true} is VALID [2018-11-23 12:07:20,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {44775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {44777#(= main_~i~0 0)} is VALID [2018-11-23 12:07:20,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {44777#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44777#(= main_~i~0 0)} is VALID [2018-11-23 12:07:20,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {44777#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44777#(= main_~i~0 0)} is VALID [2018-11-23 12:07:20,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {44777#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:20,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {44778#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:20,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {44778#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:20,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {44778#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:20,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {44779#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:20,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {44779#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:20,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {44779#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:20,367 INFO L273 TraceCheckUtils]: 15: Hoare triple {44780#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:20,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {44780#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:20,368 INFO L273 TraceCheckUtils]: 17: Hoare triple {44780#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:20,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {44781#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:20,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {44781#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:20,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {44781#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:20,370 INFO L273 TraceCheckUtils]: 21: Hoare triple {44782#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:20,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {44782#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:20,372 INFO L273 TraceCheckUtils]: 23: Hoare triple {44782#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:20,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {44783#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:20,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {44783#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:20,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {44783#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:20,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {44784#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:20,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {44784#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:20,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {44784#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:20,376 INFO L273 TraceCheckUtils]: 30: Hoare triple {44785#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:20,376 INFO L273 TraceCheckUtils]: 31: Hoare triple {44785#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:20,377 INFO L273 TraceCheckUtils]: 32: Hoare triple {44785#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:20,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {44786#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:20,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {44786#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:20,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {44786#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:20,379 INFO L273 TraceCheckUtils]: 36: Hoare triple {44787#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:20,379 INFO L273 TraceCheckUtils]: 37: Hoare triple {44787#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:20,380 INFO L273 TraceCheckUtils]: 38: Hoare triple {44787#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:20,380 INFO L273 TraceCheckUtils]: 39: Hoare triple {44788#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:20,381 INFO L273 TraceCheckUtils]: 40: Hoare triple {44788#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:20,382 INFO L273 TraceCheckUtils]: 41: Hoare triple {44788#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:20,382 INFO L273 TraceCheckUtils]: 42: Hoare triple {44789#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:20,383 INFO L273 TraceCheckUtils]: 43: Hoare triple {44789#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:20,383 INFO L273 TraceCheckUtils]: 44: Hoare triple {44789#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:20,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {44790#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:20,384 INFO L273 TraceCheckUtils]: 46: Hoare triple {44790#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:20,385 INFO L273 TraceCheckUtils]: 47: Hoare triple {44790#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:20,385 INFO L273 TraceCheckUtils]: 48: Hoare triple {44791#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:20,386 INFO L273 TraceCheckUtils]: 49: Hoare triple {44791#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:20,387 INFO L273 TraceCheckUtils]: 50: Hoare triple {44791#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:20,387 INFO L273 TraceCheckUtils]: 51: Hoare triple {44792#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:20,388 INFO L273 TraceCheckUtils]: 52: Hoare triple {44792#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:20,388 INFO L273 TraceCheckUtils]: 53: Hoare triple {44792#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:20,389 INFO L273 TraceCheckUtils]: 54: Hoare triple {44793#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:20,389 INFO L273 TraceCheckUtils]: 55: Hoare triple {44793#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:20,390 INFO L273 TraceCheckUtils]: 56: Hoare triple {44793#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:20,390 INFO L273 TraceCheckUtils]: 57: Hoare triple {44794#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:20,391 INFO L273 TraceCheckUtils]: 58: Hoare triple {44794#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:20,392 INFO L273 TraceCheckUtils]: 59: Hoare triple {44794#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:20,392 INFO L273 TraceCheckUtils]: 60: Hoare triple {44795#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:20,392 INFO L273 TraceCheckUtils]: 61: Hoare triple {44795#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:20,393 INFO L273 TraceCheckUtils]: 62: Hoare triple {44795#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:20,394 INFO L273 TraceCheckUtils]: 63: Hoare triple {44796#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:20,394 INFO L273 TraceCheckUtils]: 64: Hoare triple {44796#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:20,395 INFO L273 TraceCheckUtils]: 65: Hoare triple {44796#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:20,395 INFO L273 TraceCheckUtils]: 66: Hoare triple {44797#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:20,396 INFO L273 TraceCheckUtils]: 67: Hoare triple {44797#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:20,396 INFO L273 TraceCheckUtils]: 68: Hoare triple {44797#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:20,397 INFO L273 TraceCheckUtils]: 69: Hoare triple {44798#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:20,397 INFO L273 TraceCheckUtils]: 70: Hoare triple {44798#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:20,398 INFO L273 TraceCheckUtils]: 71: Hoare triple {44798#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:20,399 INFO L273 TraceCheckUtils]: 72: Hoare triple {44799#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:20,399 INFO L273 TraceCheckUtils]: 73: Hoare triple {44799#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:20,400 INFO L273 TraceCheckUtils]: 74: Hoare triple {44799#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:20,400 INFO L273 TraceCheckUtils]: 75: Hoare triple {44800#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:20,401 INFO L273 TraceCheckUtils]: 76: Hoare triple {44800#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:20,401 INFO L273 TraceCheckUtils]: 77: Hoare triple {44800#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:20,402 INFO L273 TraceCheckUtils]: 78: Hoare triple {44801#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:20,402 INFO L273 TraceCheckUtils]: 79: Hoare triple {44801#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:20,403 INFO L273 TraceCheckUtils]: 80: Hoare triple {44801#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:20,404 INFO L273 TraceCheckUtils]: 81: Hoare triple {44802#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:20,404 INFO L273 TraceCheckUtils]: 82: Hoare triple {44802#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:20,405 INFO L273 TraceCheckUtils]: 83: Hoare triple {44802#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:20,405 INFO L273 TraceCheckUtils]: 84: Hoare triple {44803#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:20,406 INFO L273 TraceCheckUtils]: 85: Hoare triple {44803#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:20,407 INFO L273 TraceCheckUtils]: 86: Hoare triple {44803#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:20,407 INFO L273 TraceCheckUtils]: 87: Hoare triple {44804#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:20,407 INFO L273 TraceCheckUtils]: 88: Hoare triple {44804#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:20,408 INFO L273 TraceCheckUtils]: 89: Hoare triple {44804#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:20,409 INFO L273 TraceCheckUtils]: 90: Hoare triple {44805#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:20,409 INFO L273 TraceCheckUtils]: 91: Hoare triple {44805#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:20,410 INFO L273 TraceCheckUtils]: 92: Hoare triple {44805#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:20,410 INFO L273 TraceCheckUtils]: 93: Hoare triple {44806#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:20,411 INFO L273 TraceCheckUtils]: 94: Hoare triple {44806#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:20,411 INFO L273 TraceCheckUtils]: 95: Hoare triple {44806#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:20,412 INFO L273 TraceCheckUtils]: 96: Hoare triple {44807#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:20,412 INFO L273 TraceCheckUtils]: 97: Hoare triple {44807#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:20,413 INFO L273 TraceCheckUtils]: 98: Hoare triple {44807#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:20,414 INFO L273 TraceCheckUtils]: 99: Hoare triple {44808#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:20,414 INFO L273 TraceCheckUtils]: 100: Hoare triple {44808#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:20,415 INFO L273 TraceCheckUtils]: 101: Hoare triple {44808#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:20,415 INFO L273 TraceCheckUtils]: 102: Hoare triple {44809#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:20,416 INFO L273 TraceCheckUtils]: 103: Hoare triple {44809#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:20,416 INFO L273 TraceCheckUtils]: 104: Hoare triple {44809#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:20,417 INFO L273 TraceCheckUtils]: 105: Hoare triple {44810#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:20,417 INFO L273 TraceCheckUtils]: 106: Hoare triple {44810#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:20,418 INFO L273 TraceCheckUtils]: 107: Hoare triple {44810#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:20,419 INFO L273 TraceCheckUtils]: 108: Hoare triple {44811#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:20,419 INFO L273 TraceCheckUtils]: 109: Hoare triple {44811#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:20,420 INFO L273 TraceCheckUtils]: 110: Hoare triple {44811#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:20,420 INFO L273 TraceCheckUtils]: 111: Hoare triple {44812#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:20,421 INFO L273 TraceCheckUtils]: 112: Hoare triple {44812#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:20,421 INFO L273 TraceCheckUtils]: 113: Hoare triple {44812#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:20,422 INFO L273 TraceCheckUtils]: 114: Hoare triple {44813#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:20,422 INFO L273 TraceCheckUtils]: 115: Hoare triple {44813#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:20,423 INFO L273 TraceCheckUtils]: 116: Hoare triple {44813#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:20,424 INFO L273 TraceCheckUtils]: 117: Hoare triple {44814#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:20,424 INFO L273 TraceCheckUtils]: 118: Hoare triple {44814#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:20,425 INFO L273 TraceCheckUtils]: 119: Hoare triple {44814#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:20,425 INFO L273 TraceCheckUtils]: 120: Hoare triple {44815#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:20,426 INFO L273 TraceCheckUtils]: 121: Hoare triple {44815#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:20,427 INFO L273 TraceCheckUtils]: 122: Hoare triple {44815#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:20,427 INFO L273 TraceCheckUtils]: 123: Hoare triple {44816#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:20,428 INFO L273 TraceCheckUtils]: 124: Hoare triple {44816#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:20,428 INFO L273 TraceCheckUtils]: 125: Hoare triple {44816#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:20,429 INFO L273 TraceCheckUtils]: 126: Hoare triple {44817#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:20,429 INFO L273 TraceCheckUtils]: 127: Hoare triple {44817#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:20,430 INFO L273 TraceCheckUtils]: 128: Hoare triple {44817#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:20,430 INFO L273 TraceCheckUtils]: 129: Hoare triple {44818#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:20,431 INFO L273 TraceCheckUtils]: 130: Hoare triple {44818#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:20,431 INFO L273 TraceCheckUtils]: 131: Hoare triple {44818#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:20,432 INFO L273 TraceCheckUtils]: 132: Hoare triple {44819#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:20,432 INFO L273 TraceCheckUtils]: 133: Hoare triple {44819#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:20,433 INFO L273 TraceCheckUtils]: 134: Hoare triple {44819#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:20,434 INFO L273 TraceCheckUtils]: 135: Hoare triple {44820#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:20,434 INFO L273 TraceCheckUtils]: 136: Hoare triple {44820#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:20,435 INFO L273 TraceCheckUtils]: 137: Hoare triple {44820#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:20,435 INFO L273 TraceCheckUtils]: 138: Hoare triple {44821#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:20,436 INFO L273 TraceCheckUtils]: 139: Hoare triple {44821#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:20,436 INFO L273 TraceCheckUtils]: 140: Hoare triple {44821#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:20,437 INFO L273 TraceCheckUtils]: 141: Hoare triple {44822#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:20,437 INFO L273 TraceCheckUtils]: 142: Hoare triple {44822#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:20,438 INFO L273 TraceCheckUtils]: 143: Hoare triple {44822#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:20,438 INFO L273 TraceCheckUtils]: 144: Hoare triple {44823#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:20,439 INFO L273 TraceCheckUtils]: 145: Hoare triple {44823#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:20,440 INFO L273 TraceCheckUtils]: 146: Hoare triple {44823#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:20,440 INFO L273 TraceCheckUtils]: 147: Hoare triple {44824#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:20,441 INFO L273 TraceCheckUtils]: 148: Hoare triple {44824#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:20,441 INFO L273 TraceCheckUtils]: 149: Hoare triple {44824#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:20,442 INFO L273 TraceCheckUtils]: 150: Hoare triple {44825#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:20,442 INFO L273 TraceCheckUtils]: 151: Hoare triple {44825#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:20,443 INFO L273 TraceCheckUtils]: 152: Hoare triple {44825#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:20,444 INFO L273 TraceCheckUtils]: 153: Hoare triple {44826#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:20,444 INFO L273 TraceCheckUtils]: 154: Hoare triple {44826#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:20,445 INFO L273 TraceCheckUtils]: 155: Hoare triple {44826#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:20,445 INFO L273 TraceCheckUtils]: 156: Hoare triple {44827#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:20,446 INFO L273 TraceCheckUtils]: 157: Hoare triple {44827#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:20,446 INFO L273 TraceCheckUtils]: 158: Hoare triple {44827#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:20,447 INFO L273 TraceCheckUtils]: 159: Hoare triple {44828#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:20,447 INFO L273 TraceCheckUtils]: 160: Hoare triple {44828#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:20,448 INFO L273 TraceCheckUtils]: 161: Hoare triple {44828#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:20,448 INFO L273 TraceCheckUtils]: 162: Hoare triple {44829#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:20,449 INFO L273 TraceCheckUtils]: 163: Hoare triple {44829#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:20,450 INFO L273 TraceCheckUtils]: 164: Hoare triple {44829#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:20,450 INFO L273 TraceCheckUtils]: 165: Hoare triple {44830#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:20,451 INFO L273 TraceCheckUtils]: 166: Hoare triple {44830#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:20,451 INFO L273 TraceCheckUtils]: 167: Hoare triple {44830#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:20,452 INFO L273 TraceCheckUtils]: 168: Hoare triple {44831#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:20,452 INFO L273 TraceCheckUtils]: 169: Hoare triple {44831#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:20,453 INFO L273 TraceCheckUtils]: 170: Hoare triple {44831#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {44832#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:20,454 INFO L273 TraceCheckUtils]: 171: Hoare triple {44832#(<= main_~i~0 55)} assume !(~i~0 < 100000); {44776#false} is VALID [2018-11-23 12:07:20,454 INFO L273 TraceCheckUtils]: 172: Hoare triple {44776#false} havoc ~x~0;~x~0 := 0; {44776#false} is VALID [2018-11-23 12:07:20,454 INFO L273 TraceCheckUtils]: 173: Hoare triple {44776#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {44776#false} is VALID [2018-11-23 12:07:20,454 INFO L256 TraceCheckUtils]: 174: Hoare triple {44776#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {44776#false} is VALID [2018-11-23 12:07:20,454 INFO L273 TraceCheckUtils]: 175: Hoare triple {44776#false} ~cond := #in~cond; {44776#false} is VALID [2018-11-23 12:07:20,455 INFO L273 TraceCheckUtils]: 176: Hoare triple {44776#false} assume 0 == ~cond; {44776#false} is VALID [2018-11-23 12:07:20,455 INFO L273 TraceCheckUtils]: 177: Hoare triple {44776#false} assume !false; {44776#false} is VALID [2018-11-23 12:07:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:20,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:20,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:20,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:20,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:21,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {44775#true} call ULTIMATE.init(); {44775#true} is VALID [2018-11-23 12:07:21,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {44775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44775#true} is VALID [2018-11-23 12:07:21,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {44775#true} assume true; {44775#true} is VALID [2018-11-23 12:07:21,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44775#true} {44775#true} #55#return; {44775#true} is VALID [2018-11-23 12:07:21,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {44775#true} call #t~ret4 := main(); {44775#true} is VALID [2018-11-23 12:07:21,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {44775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {44851#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:21,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {44851#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44851#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:21,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {44851#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44851#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:21,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {44851#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:21,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {44778#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:21,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {44778#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:21,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {44778#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:21,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {44779#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:21,894 INFO L273 TraceCheckUtils]: 13: Hoare triple {44779#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:21,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {44779#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:21,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {44780#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:21,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {44780#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:21,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {44780#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:21,897 INFO L273 TraceCheckUtils]: 18: Hoare triple {44781#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:21,897 INFO L273 TraceCheckUtils]: 19: Hoare triple {44781#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:21,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {44781#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:21,898 INFO L273 TraceCheckUtils]: 21: Hoare triple {44782#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:21,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {44782#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:21,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {44782#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:21,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {44783#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:21,900 INFO L273 TraceCheckUtils]: 25: Hoare triple {44783#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:21,901 INFO L273 TraceCheckUtils]: 26: Hoare triple {44783#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:21,902 INFO L273 TraceCheckUtils]: 27: Hoare triple {44784#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:21,902 INFO L273 TraceCheckUtils]: 28: Hoare triple {44784#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:21,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {44784#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:21,903 INFO L273 TraceCheckUtils]: 30: Hoare triple {44785#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:21,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {44785#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:21,904 INFO L273 TraceCheckUtils]: 32: Hoare triple {44785#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:21,905 INFO L273 TraceCheckUtils]: 33: Hoare triple {44786#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:21,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {44786#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:21,906 INFO L273 TraceCheckUtils]: 35: Hoare triple {44786#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:21,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {44787#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:21,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {44787#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:21,908 INFO L273 TraceCheckUtils]: 38: Hoare triple {44787#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:21,908 INFO L273 TraceCheckUtils]: 39: Hoare triple {44788#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:21,908 INFO L273 TraceCheckUtils]: 40: Hoare triple {44788#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:21,909 INFO L273 TraceCheckUtils]: 41: Hoare triple {44788#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:21,910 INFO L273 TraceCheckUtils]: 42: Hoare triple {44789#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:21,910 INFO L273 TraceCheckUtils]: 43: Hoare triple {44789#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:21,911 INFO L273 TraceCheckUtils]: 44: Hoare triple {44789#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:21,911 INFO L273 TraceCheckUtils]: 45: Hoare triple {44790#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:21,912 INFO L273 TraceCheckUtils]: 46: Hoare triple {44790#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:21,912 INFO L273 TraceCheckUtils]: 47: Hoare triple {44790#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:21,913 INFO L273 TraceCheckUtils]: 48: Hoare triple {44791#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:21,913 INFO L273 TraceCheckUtils]: 49: Hoare triple {44791#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:21,914 INFO L273 TraceCheckUtils]: 50: Hoare triple {44791#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:21,914 INFO L273 TraceCheckUtils]: 51: Hoare triple {44792#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:21,915 INFO L273 TraceCheckUtils]: 52: Hoare triple {44792#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:21,915 INFO L273 TraceCheckUtils]: 53: Hoare triple {44792#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:21,916 INFO L273 TraceCheckUtils]: 54: Hoare triple {44793#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:21,916 INFO L273 TraceCheckUtils]: 55: Hoare triple {44793#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:21,917 INFO L273 TraceCheckUtils]: 56: Hoare triple {44793#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:21,918 INFO L273 TraceCheckUtils]: 57: Hoare triple {44794#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:21,918 INFO L273 TraceCheckUtils]: 58: Hoare triple {44794#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:21,919 INFO L273 TraceCheckUtils]: 59: Hoare triple {44794#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:21,919 INFO L273 TraceCheckUtils]: 60: Hoare triple {44795#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:21,920 INFO L273 TraceCheckUtils]: 61: Hoare triple {44795#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:21,920 INFO L273 TraceCheckUtils]: 62: Hoare triple {44795#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:21,921 INFO L273 TraceCheckUtils]: 63: Hoare triple {44796#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:21,921 INFO L273 TraceCheckUtils]: 64: Hoare triple {44796#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:21,922 INFO L273 TraceCheckUtils]: 65: Hoare triple {44796#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:21,922 INFO L273 TraceCheckUtils]: 66: Hoare triple {44797#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:21,923 INFO L273 TraceCheckUtils]: 67: Hoare triple {44797#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:21,923 INFO L273 TraceCheckUtils]: 68: Hoare triple {44797#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:21,924 INFO L273 TraceCheckUtils]: 69: Hoare triple {44798#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:21,924 INFO L273 TraceCheckUtils]: 70: Hoare triple {44798#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:21,925 INFO L273 TraceCheckUtils]: 71: Hoare triple {44798#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:21,926 INFO L273 TraceCheckUtils]: 72: Hoare triple {44799#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:21,926 INFO L273 TraceCheckUtils]: 73: Hoare triple {44799#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:21,927 INFO L273 TraceCheckUtils]: 74: Hoare triple {44799#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:21,927 INFO L273 TraceCheckUtils]: 75: Hoare triple {44800#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:21,928 INFO L273 TraceCheckUtils]: 76: Hoare triple {44800#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:21,928 INFO L273 TraceCheckUtils]: 77: Hoare triple {44800#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:21,929 INFO L273 TraceCheckUtils]: 78: Hoare triple {44801#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:21,929 INFO L273 TraceCheckUtils]: 79: Hoare triple {44801#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:21,930 INFO L273 TraceCheckUtils]: 80: Hoare triple {44801#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:21,930 INFO L273 TraceCheckUtils]: 81: Hoare triple {44802#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:21,931 INFO L273 TraceCheckUtils]: 82: Hoare triple {44802#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:21,931 INFO L273 TraceCheckUtils]: 83: Hoare triple {44802#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:21,932 INFO L273 TraceCheckUtils]: 84: Hoare triple {44803#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:21,932 INFO L273 TraceCheckUtils]: 85: Hoare triple {44803#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:21,933 INFO L273 TraceCheckUtils]: 86: Hoare triple {44803#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:21,933 INFO L273 TraceCheckUtils]: 87: Hoare triple {44804#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:21,934 INFO L273 TraceCheckUtils]: 88: Hoare triple {44804#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:21,935 INFO L273 TraceCheckUtils]: 89: Hoare triple {44804#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:21,935 INFO L273 TraceCheckUtils]: 90: Hoare triple {44805#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:21,936 INFO L273 TraceCheckUtils]: 91: Hoare triple {44805#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:21,936 INFO L273 TraceCheckUtils]: 92: Hoare triple {44805#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:21,937 INFO L273 TraceCheckUtils]: 93: Hoare triple {44806#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:21,937 INFO L273 TraceCheckUtils]: 94: Hoare triple {44806#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:21,938 INFO L273 TraceCheckUtils]: 95: Hoare triple {44806#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:21,938 INFO L273 TraceCheckUtils]: 96: Hoare triple {44807#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:21,939 INFO L273 TraceCheckUtils]: 97: Hoare triple {44807#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:21,939 INFO L273 TraceCheckUtils]: 98: Hoare triple {44807#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:21,940 INFO L273 TraceCheckUtils]: 99: Hoare triple {44808#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:21,940 INFO L273 TraceCheckUtils]: 100: Hoare triple {44808#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:21,941 INFO L273 TraceCheckUtils]: 101: Hoare triple {44808#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:21,941 INFO L273 TraceCheckUtils]: 102: Hoare triple {44809#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:21,942 INFO L273 TraceCheckUtils]: 103: Hoare triple {44809#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:21,943 INFO L273 TraceCheckUtils]: 104: Hoare triple {44809#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:21,943 INFO L273 TraceCheckUtils]: 105: Hoare triple {44810#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:21,944 INFO L273 TraceCheckUtils]: 106: Hoare triple {44810#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:21,944 INFO L273 TraceCheckUtils]: 107: Hoare triple {44810#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:21,945 INFO L273 TraceCheckUtils]: 108: Hoare triple {44811#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:21,945 INFO L273 TraceCheckUtils]: 109: Hoare triple {44811#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:21,946 INFO L273 TraceCheckUtils]: 110: Hoare triple {44811#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:21,946 INFO L273 TraceCheckUtils]: 111: Hoare triple {44812#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:21,947 INFO L273 TraceCheckUtils]: 112: Hoare triple {44812#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:21,947 INFO L273 TraceCheckUtils]: 113: Hoare triple {44812#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:21,948 INFO L273 TraceCheckUtils]: 114: Hoare triple {44813#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:21,948 INFO L273 TraceCheckUtils]: 115: Hoare triple {44813#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:21,949 INFO L273 TraceCheckUtils]: 116: Hoare triple {44813#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:21,949 INFO L273 TraceCheckUtils]: 117: Hoare triple {44814#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:21,950 INFO L273 TraceCheckUtils]: 118: Hoare triple {44814#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:21,951 INFO L273 TraceCheckUtils]: 119: Hoare triple {44814#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:21,951 INFO L273 TraceCheckUtils]: 120: Hoare triple {44815#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:21,951 INFO L273 TraceCheckUtils]: 121: Hoare triple {44815#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:21,952 INFO L273 TraceCheckUtils]: 122: Hoare triple {44815#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:21,953 INFO L273 TraceCheckUtils]: 123: Hoare triple {44816#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:21,953 INFO L273 TraceCheckUtils]: 124: Hoare triple {44816#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:21,954 INFO L273 TraceCheckUtils]: 125: Hoare triple {44816#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:21,954 INFO L273 TraceCheckUtils]: 126: Hoare triple {44817#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:21,955 INFO L273 TraceCheckUtils]: 127: Hoare triple {44817#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:21,955 INFO L273 TraceCheckUtils]: 128: Hoare triple {44817#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:21,956 INFO L273 TraceCheckUtils]: 129: Hoare triple {44818#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:21,956 INFO L273 TraceCheckUtils]: 130: Hoare triple {44818#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:21,957 INFO L273 TraceCheckUtils]: 131: Hoare triple {44818#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:21,957 INFO L273 TraceCheckUtils]: 132: Hoare triple {44819#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:21,958 INFO L273 TraceCheckUtils]: 133: Hoare triple {44819#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:21,958 INFO L273 TraceCheckUtils]: 134: Hoare triple {44819#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:21,959 INFO L273 TraceCheckUtils]: 135: Hoare triple {44820#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:21,959 INFO L273 TraceCheckUtils]: 136: Hoare triple {44820#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:21,960 INFO L273 TraceCheckUtils]: 137: Hoare triple {44820#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:21,961 INFO L273 TraceCheckUtils]: 138: Hoare triple {44821#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:21,961 INFO L273 TraceCheckUtils]: 139: Hoare triple {44821#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:21,962 INFO L273 TraceCheckUtils]: 140: Hoare triple {44821#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:21,962 INFO L273 TraceCheckUtils]: 141: Hoare triple {44822#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:21,963 INFO L273 TraceCheckUtils]: 142: Hoare triple {44822#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:21,963 INFO L273 TraceCheckUtils]: 143: Hoare triple {44822#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:21,964 INFO L273 TraceCheckUtils]: 144: Hoare triple {44823#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:21,964 INFO L273 TraceCheckUtils]: 145: Hoare triple {44823#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:21,965 INFO L273 TraceCheckUtils]: 146: Hoare triple {44823#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:21,965 INFO L273 TraceCheckUtils]: 147: Hoare triple {44824#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:21,966 INFO L273 TraceCheckUtils]: 148: Hoare triple {44824#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:21,966 INFO L273 TraceCheckUtils]: 149: Hoare triple {44824#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:21,967 INFO L273 TraceCheckUtils]: 150: Hoare triple {44825#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:21,967 INFO L273 TraceCheckUtils]: 151: Hoare triple {44825#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:21,968 INFO L273 TraceCheckUtils]: 152: Hoare triple {44825#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:21,968 INFO L273 TraceCheckUtils]: 153: Hoare triple {44826#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:21,969 INFO L273 TraceCheckUtils]: 154: Hoare triple {44826#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:21,970 INFO L273 TraceCheckUtils]: 155: Hoare triple {44826#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:21,970 INFO L273 TraceCheckUtils]: 156: Hoare triple {44827#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:21,971 INFO L273 TraceCheckUtils]: 157: Hoare triple {44827#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:21,971 INFO L273 TraceCheckUtils]: 158: Hoare triple {44827#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:21,972 INFO L273 TraceCheckUtils]: 159: Hoare triple {44828#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:21,972 INFO L273 TraceCheckUtils]: 160: Hoare triple {44828#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:21,973 INFO L273 TraceCheckUtils]: 161: Hoare triple {44828#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:21,973 INFO L273 TraceCheckUtils]: 162: Hoare triple {44829#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:21,974 INFO L273 TraceCheckUtils]: 163: Hoare triple {44829#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:21,974 INFO L273 TraceCheckUtils]: 164: Hoare triple {44829#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:21,975 INFO L273 TraceCheckUtils]: 165: Hoare triple {44830#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:21,975 INFO L273 TraceCheckUtils]: 166: Hoare triple {44830#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:21,976 INFO L273 TraceCheckUtils]: 167: Hoare triple {44830#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:21,976 INFO L273 TraceCheckUtils]: 168: Hoare triple {44831#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:21,977 INFO L273 TraceCheckUtils]: 169: Hoare triple {44831#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:21,978 INFO L273 TraceCheckUtils]: 170: Hoare triple {44831#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {44832#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:21,978 INFO L273 TraceCheckUtils]: 171: Hoare triple {44832#(<= main_~i~0 55)} assume !(~i~0 < 100000); {44776#false} is VALID [2018-11-23 12:07:21,978 INFO L273 TraceCheckUtils]: 172: Hoare triple {44776#false} havoc ~x~0;~x~0 := 0; {44776#false} is VALID [2018-11-23 12:07:21,979 INFO L273 TraceCheckUtils]: 173: Hoare triple {44776#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {44776#false} is VALID [2018-11-23 12:07:21,979 INFO L256 TraceCheckUtils]: 174: Hoare triple {44776#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {44776#false} is VALID [2018-11-23 12:07:21,979 INFO L273 TraceCheckUtils]: 175: Hoare triple {44776#false} ~cond := #in~cond; {44776#false} is VALID [2018-11-23 12:07:21,979 INFO L273 TraceCheckUtils]: 176: Hoare triple {44776#false} assume 0 == ~cond; {44776#false} is VALID [2018-11-23 12:07:21,979 INFO L273 TraceCheckUtils]: 177: Hoare triple {44776#false} assume !false; {44776#false} is VALID [2018-11-23 12:07:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:22,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:22,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2018-11-23 12:07:22,019 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 178 [2018-11-23 12:07:22,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:22,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2018-11-23 12:07:22,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:22,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-23 12:07:22,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-23 12:07:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 12:07:22,187 INFO L87 Difference]: Start difference. First operand 183 states and 239 transitions. Second operand 59 states. [2018-11-23 12:07:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:23,122 INFO L93 Difference]: Finished difference Result 199 states and 258 transitions. [2018-11-23 12:07:23,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-23 12:07:23,122 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 178 [2018-11-23 12:07:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:07:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 258 transitions. [2018-11-23 12:07:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:07:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 258 transitions. [2018-11-23 12:07:23,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 258 transitions. [2018-11-23 12:07:23,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:23,366 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:07:23,366 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 12:07:23,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 12:07:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 12:07:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-11-23 12:07:23,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:23,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states. [2018-11-23 12:07:23,431 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states. [2018-11-23 12:07:23,431 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 186 states. [2018-11-23 12:07:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:23,434 INFO L93 Difference]: Finished difference Result 188 states and 246 transitions. [2018-11-23 12:07:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2018-11-23 12:07:23,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:23,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:23,435 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states. [2018-11-23 12:07:23,435 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 188 states. [2018-11-23 12:07:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:23,437 INFO L93 Difference]: Finished difference Result 188 states and 246 transitions. [2018-11-23 12:07:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2018-11-23 12:07:23,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:23,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:23,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:23,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-23 12:07:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-11-23 12:07:23,440 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 178 [2018-11-23 12:07:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:23,440 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-11-23 12:07:23,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-23 12:07:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-11-23 12:07:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-23 12:07:23,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:23,441 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:23,442 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:23,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070023, now seen corresponding path program 56 times [2018-11-23 12:07:23,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:23,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:23,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:23,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:23,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:25,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {46259#true} call ULTIMATE.init(); {46259#true} is VALID [2018-11-23 12:07:25,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {46259#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46259#true} is VALID [2018-11-23 12:07:25,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {46259#true} assume true; {46259#true} is VALID [2018-11-23 12:07:25,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46259#true} {46259#true} #55#return; {46259#true} is VALID [2018-11-23 12:07:25,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {46259#true} call #t~ret4 := main(); {46259#true} is VALID [2018-11-23 12:07:25,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {46259#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {46261#(= main_~i~0 0)} is VALID [2018-11-23 12:07:25,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {46261#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46261#(= main_~i~0 0)} is VALID [2018-11-23 12:07:25,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {46261#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46261#(= main_~i~0 0)} is VALID [2018-11-23 12:07:25,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {46261#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:25,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {46262#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:25,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {46262#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:25,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {46262#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:25,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {46263#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:25,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {46263#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:25,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {46263#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:25,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {46264#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:25,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {46264#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:25,297 INFO L273 TraceCheckUtils]: 17: Hoare triple {46264#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:25,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {46265#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:25,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {46265#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:25,298 INFO L273 TraceCheckUtils]: 20: Hoare triple {46265#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:25,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {46266#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:25,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {46266#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:25,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {46266#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:25,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {46267#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:25,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {46267#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:25,302 INFO L273 TraceCheckUtils]: 26: Hoare triple {46267#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:25,302 INFO L273 TraceCheckUtils]: 27: Hoare triple {46268#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:25,303 INFO L273 TraceCheckUtils]: 28: Hoare triple {46268#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:25,304 INFO L273 TraceCheckUtils]: 29: Hoare triple {46268#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:25,304 INFO L273 TraceCheckUtils]: 30: Hoare triple {46269#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:25,305 INFO L273 TraceCheckUtils]: 31: Hoare triple {46269#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:25,305 INFO L273 TraceCheckUtils]: 32: Hoare triple {46269#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:25,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {46270#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:25,306 INFO L273 TraceCheckUtils]: 34: Hoare triple {46270#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:25,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {46270#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:25,308 INFO L273 TraceCheckUtils]: 36: Hoare triple {46271#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:25,308 INFO L273 TraceCheckUtils]: 37: Hoare triple {46271#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:25,309 INFO L273 TraceCheckUtils]: 38: Hoare triple {46271#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:25,309 INFO L273 TraceCheckUtils]: 39: Hoare triple {46272#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:25,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {46272#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:25,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {46272#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:25,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {46273#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:25,311 INFO L273 TraceCheckUtils]: 43: Hoare triple {46273#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:25,312 INFO L273 TraceCheckUtils]: 44: Hoare triple {46273#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:25,313 INFO L273 TraceCheckUtils]: 45: Hoare triple {46274#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:25,313 INFO L273 TraceCheckUtils]: 46: Hoare triple {46274#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:25,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {46274#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:25,314 INFO L273 TraceCheckUtils]: 48: Hoare triple {46275#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:25,315 INFO L273 TraceCheckUtils]: 49: Hoare triple {46275#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:25,316 INFO L273 TraceCheckUtils]: 50: Hoare triple {46275#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:25,316 INFO L273 TraceCheckUtils]: 51: Hoare triple {46276#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:25,317 INFO L273 TraceCheckUtils]: 52: Hoare triple {46276#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:25,317 INFO L273 TraceCheckUtils]: 53: Hoare triple {46276#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:25,318 INFO L273 TraceCheckUtils]: 54: Hoare triple {46277#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:25,318 INFO L273 TraceCheckUtils]: 55: Hoare triple {46277#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:25,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {46277#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:25,320 INFO L273 TraceCheckUtils]: 57: Hoare triple {46278#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:25,320 INFO L273 TraceCheckUtils]: 58: Hoare triple {46278#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:25,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {46278#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:25,321 INFO L273 TraceCheckUtils]: 60: Hoare triple {46279#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:25,322 INFO L273 TraceCheckUtils]: 61: Hoare triple {46279#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:25,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {46279#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:25,323 INFO L273 TraceCheckUtils]: 63: Hoare triple {46280#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:25,323 INFO L273 TraceCheckUtils]: 64: Hoare triple {46280#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:25,324 INFO L273 TraceCheckUtils]: 65: Hoare triple {46280#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:25,325 INFO L273 TraceCheckUtils]: 66: Hoare triple {46281#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:25,325 INFO L273 TraceCheckUtils]: 67: Hoare triple {46281#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:25,326 INFO L273 TraceCheckUtils]: 68: Hoare triple {46281#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:25,326 INFO L273 TraceCheckUtils]: 69: Hoare triple {46282#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:25,327 INFO L273 TraceCheckUtils]: 70: Hoare triple {46282#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:25,328 INFO L273 TraceCheckUtils]: 71: Hoare triple {46282#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:25,328 INFO L273 TraceCheckUtils]: 72: Hoare triple {46283#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:25,329 INFO L273 TraceCheckUtils]: 73: Hoare triple {46283#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:25,329 INFO L273 TraceCheckUtils]: 74: Hoare triple {46283#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:25,330 INFO L273 TraceCheckUtils]: 75: Hoare triple {46284#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:25,330 INFO L273 TraceCheckUtils]: 76: Hoare triple {46284#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:25,331 INFO L273 TraceCheckUtils]: 77: Hoare triple {46284#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:25,332 INFO L273 TraceCheckUtils]: 78: Hoare triple {46285#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:25,332 INFO L273 TraceCheckUtils]: 79: Hoare triple {46285#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:25,333 INFO L273 TraceCheckUtils]: 80: Hoare triple {46285#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:25,333 INFO L273 TraceCheckUtils]: 81: Hoare triple {46286#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:25,334 INFO L273 TraceCheckUtils]: 82: Hoare triple {46286#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:25,334 INFO L273 TraceCheckUtils]: 83: Hoare triple {46286#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:25,335 INFO L273 TraceCheckUtils]: 84: Hoare triple {46287#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:25,336 INFO L273 TraceCheckUtils]: 85: Hoare triple {46287#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:25,336 INFO L273 TraceCheckUtils]: 86: Hoare triple {46287#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:25,337 INFO L273 TraceCheckUtils]: 87: Hoare triple {46288#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:25,337 INFO L273 TraceCheckUtils]: 88: Hoare triple {46288#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:25,338 INFO L273 TraceCheckUtils]: 89: Hoare triple {46288#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:25,338 INFO L273 TraceCheckUtils]: 90: Hoare triple {46289#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:25,339 INFO L273 TraceCheckUtils]: 91: Hoare triple {46289#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:25,340 INFO L273 TraceCheckUtils]: 92: Hoare triple {46289#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:25,340 INFO L273 TraceCheckUtils]: 93: Hoare triple {46290#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:25,341 INFO L273 TraceCheckUtils]: 94: Hoare triple {46290#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:25,341 INFO L273 TraceCheckUtils]: 95: Hoare triple {46290#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:25,342 INFO L273 TraceCheckUtils]: 96: Hoare triple {46291#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:25,342 INFO L273 TraceCheckUtils]: 97: Hoare triple {46291#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:25,343 INFO L273 TraceCheckUtils]: 98: Hoare triple {46291#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:25,344 INFO L273 TraceCheckUtils]: 99: Hoare triple {46292#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:25,344 INFO L273 TraceCheckUtils]: 100: Hoare triple {46292#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:25,345 INFO L273 TraceCheckUtils]: 101: Hoare triple {46292#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:25,345 INFO L273 TraceCheckUtils]: 102: Hoare triple {46293#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:25,346 INFO L273 TraceCheckUtils]: 103: Hoare triple {46293#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:25,346 INFO L273 TraceCheckUtils]: 104: Hoare triple {46293#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:25,347 INFO L273 TraceCheckUtils]: 105: Hoare triple {46294#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:25,347 INFO L273 TraceCheckUtils]: 106: Hoare triple {46294#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:25,348 INFO L273 TraceCheckUtils]: 107: Hoare triple {46294#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:25,349 INFO L273 TraceCheckUtils]: 108: Hoare triple {46295#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:25,349 INFO L273 TraceCheckUtils]: 109: Hoare triple {46295#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:25,350 INFO L273 TraceCheckUtils]: 110: Hoare triple {46295#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:25,350 INFO L273 TraceCheckUtils]: 111: Hoare triple {46296#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:25,351 INFO L273 TraceCheckUtils]: 112: Hoare triple {46296#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:25,352 INFO L273 TraceCheckUtils]: 113: Hoare triple {46296#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:25,352 INFO L273 TraceCheckUtils]: 114: Hoare triple {46297#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:25,353 INFO L273 TraceCheckUtils]: 115: Hoare triple {46297#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:25,353 INFO L273 TraceCheckUtils]: 116: Hoare triple {46297#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:25,354 INFO L273 TraceCheckUtils]: 117: Hoare triple {46298#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:25,354 INFO L273 TraceCheckUtils]: 118: Hoare triple {46298#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:25,355 INFO L273 TraceCheckUtils]: 119: Hoare triple {46298#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:25,356 INFO L273 TraceCheckUtils]: 120: Hoare triple {46299#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:25,356 INFO L273 TraceCheckUtils]: 121: Hoare triple {46299#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:25,357 INFO L273 TraceCheckUtils]: 122: Hoare triple {46299#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:25,357 INFO L273 TraceCheckUtils]: 123: Hoare triple {46300#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:25,358 INFO L273 TraceCheckUtils]: 124: Hoare triple {46300#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:25,359 INFO L273 TraceCheckUtils]: 125: Hoare triple {46300#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:25,359 INFO L273 TraceCheckUtils]: 126: Hoare triple {46301#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:25,359 INFO L273 TraceCheckUtils]: 127: Hoare triple {46301#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:25,360 INFO L273 TraceCheckUtils]: 128: Hoare triple {46301#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:25,361 INFO L273 TraceCheckUtils]: 129: Hoare triple {46302#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:25,361 INFO L273 TraceCheckUtils]: 130: Hoare triple {46302#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:25,362 INFO L273 TraceCheckUtils]: 131: Hoare triple {46302#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:25,362 INFO L273 TraceCheckUtils]: 132: Hoare triple {46303#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:25,363 INFO L273 TraceCheckUtils]: 133: Hoare triple {46303#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:25,364 INFO L273 TraceCheckUtils]: 134: Hoare triple {46303#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:25,364 INFO L273 TraceCheckUtils]: 135: Hoare triple {46304#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:25,365 INFO L273 TraceCheckUtils]: 136: Hoare triple {46304#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:25,365 INFO L273 TraceCheckUtils]: 137: Hoare triple {46304#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:25,366 INFO L273 TraceCheckUtils]: 138: Hoare triple {46305#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:25,366 INFO L273 TraceCheckUtils]: 139: Hoare triple {46305#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:25,367 INFO L273 TraceCheckUtils]: 140: Hoare triple {46305#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:25,368 INFO L273 TraceCheckUtils]: 141: Hoare triple {46306#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:25,368 INFO L273 TraceCheckUtils]: 142: Hoare triple {46306#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:25,369 INFO L273 TraceCheckUtils]: 143: Hoare triple {46306#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:25,369 INFO L273 TraceCheckUtils]: 144: Hoare triple {46307#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:25,370 INFO L273 TraceCheckUtils]: 145: Hoare triple {46307#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:25,371 INFO L273 TraceCheckUtils]: 146: Hoare triple {46307#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:25,371 INFO L273 TraceCheckUtils]: 147: Hoare triple {46308#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:25,372 INFO L273 TraceCheckUtils]: 148: Hoare triple {46308#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:25,372 INFO L273 TraceCheckUtils]: 149: Hoare triple {46308#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:25,373 INFO L273 TraceCheckUtils]: 150: Hoare triple {46309#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:25,373 INFO L273 TraceCheckUtils]: 151: Hoare triple {46309#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:25,374 INFO L273 TraceCheckUtils]: 152: Hoare triple {46309#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:25,374 INFO L273 TraceCheckUtils]: 153: Hoare triple {46310#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:25,375 INFO L273 TraceCheckUtils]: 154: Hoare triple {46310#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:25,376 INFO L273 TraceCheckUtils]: 155: Hoare triple {46310#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:25,376 INFO L273 TraceCheckUtils]: 156: Hoare triple {46311#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:25,377 INFO L273 TraceCheckUtils]: 157: Hoare triple {46311#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:25,377 INFO L273 TraceCheckUtils]: 158: Hoare triple {46311#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:25,378 INFO L273 TraceCheckUtils]: 159: Hoare triple {46312#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:25,378 INFO L273 TraceCheckUtils]: 160: Hoare triple {46312#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:25,379 INFO L273 TraceCheckUtils]: 161: Hoare triple {46312#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:25,380 INFO L273 TraceCheckUtils]: 162: Hoare triple {46313#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:25,380 INFO L273 TraceCheckUtils]: 163: Hoare triple {46313#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:25,381 INFO L273 TraceCheckUtils]: 164: Hoare triple {46313#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:25,381 INFO L273 TraceCheckUtils]: 165: Hoare triple {46314#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:25,382 INFO L273 TraceCheckUtils]: 166: Hoare triple {46314#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:25,383 INFO L273 TraceCheckUtils]: 167: Hoare triple {46314#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:25,383 INFO L273 TraceCheckUtils]: 168: Hoare triple {46315#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:25,384 INFO L273 TraceCheckUtils]: 169: Hoare triple {46315#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:25,384 INFO L273 TraceCheckUtils]: 170: Hoare triple {46315#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:25,385 INFO L273 TraceCheckUtils]: 171: Hoare triple {46316#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:25,385 INFO L273 TraceCheckUtils]: 172: Hoare triple {46316#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:25,386 INFO L273 TraceCheckUtils]: 173: Hoare triple {46316#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {46317#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:25,387 INFO L273 TraceCheckUtils]: 174: Hoare triple {46317#(<= main_~i~0 56)} assume !(~i~0 < 100000); {46260#false} is VALID [2018-11-23 12:07:25,387 INFO L273 TraceCheckUtils]: 175: Hoare triple {46260#false} havoc ~x~0;~x~0 := 0; {46260#false} is VALID [2018-11-23 12:07:25,387 INFO L273 TraceCheckUtils]: 176: Hoare triple {46260#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {46260#false} is VALID [2018-11-23 12:07:25,387 INFO L256 TraceCheckUtils]: 177: Hoare triple {46260#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {46260#false} is VALID [2018-11-23 12:07:25,387 INFO L273 TraceCheckUtils]: 178: Hoare triple {46260#false} ~cond := #in~cond; {46260#false} is VALID [2018-11-23 12:07:25,388 INFO L273 TraceCheckUtils]: 179: Hoare triple {46260#false} assume 0 == ~cond; {46260#false} is VALID [2018-11-23 12:07:25,388 INFO L273 TraceCheckUtils]: 180: Hoare triple {46260#false} assume !false; {46260#false} is VALID [2018-11-23 12:07:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:25,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:25,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:25,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:07:25,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:07:25,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:25,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:26,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {46259#true} call ULTIMATE.init(); {46259#true} is VALID [2018-11-23 12:07:26,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {46259#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46259#true} is VALID [2018-11-23 12:07:26,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {46259#true} assume true; {46259#true} is VALID [2018-11-23 12:07:26,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46259#true} {46259#true} #55#return; {46259#true} is VALID [2018-11-23 12:07:26,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {46259#true} call #t~ret4 := main(); {46259#true} is VALID [2018-11-23 12:07:26,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {46259#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {46336#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:26,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {46336#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46336#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:26,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {46336#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46336#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:26,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {46336#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:26,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {46262#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:26,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {46262#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:26,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {46262#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:26,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {46263#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:26,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {46263#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:26,090 INFO L273 TraceCheckUtils]: 14: Hoare triple {46263#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:26,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {46264#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:26,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {46264#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:26,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {46264#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:26,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {46265#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:26,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {46265#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:26,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {46265#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:26,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {46266#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:26,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {46266#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:26,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {46266#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:26,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {46267#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:26,096 INFO L273 TraceCheckUtils]: 25: Hoare triple {46267#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:26,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {46267#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:26,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {46268#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:26,098 INFO L273 TraceCheckUtils]: 28: Hoare triple {46268#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:26,098 INFO L273 TraceCheckUtils]: 29: Hoare triple {46268#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:26,099 INFO L273 TraceCheckUtils]: 30: Hoare triple {46269#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:26,099 INFO L273 TraceCheckUtils]: 31: Hoare triple {46269#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:26,100 INFO L273 TraceCheckUtils]: 32: Hoare triple {46269#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:26,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {46270#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:26,101 INFO L273 TraceCheckUtils]: 34: Hoare triple {46270#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:26,102 INFO L273 TraceCheckUtils]: 35: Hoare triple {46270#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:26,102 INFO L273 TraceCheckUtils]: 36: Hoare triple {46271#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:26,103 INFO L273 TraceCheckUtils]: 37: Hoare triple {46271#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:26,104 INFO L273 TraceCheckUtils]: 38: Hoare triple {46271#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:26,104 INFO L273 TraceCheckUtils]: 39: Hoare triple {46272#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:26,105 INFO L273 TraceCheckUtils]: 40: Hoare triple {46272#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:26,105 INFO L273 TraceCheckUtils]: 41: Hoare triple {46272#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:26,106 INFO L273 TraceCheckUtils]: 42: Hoare triple {46273#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:26,106 INFO L273 TraceCheckUtils]: 43: Hoare triple {46273#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:26,107 INFO L273 TraceCheckUtils]: 44: Hoare triple {46273#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:26,108 INFO L273 TraceCheckUtils]: 45: Hoare triple {46274#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:26,108 INFO L273 TraceCheckUtils]: 46: Hoare triple {46274#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:26,109 INFO L273 TraceCheckUtils]: 47: Hoare triple {46274#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:26,109 INFO L273 TraceCheckUtils]: 48: Hoare triple {46275#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:26,110 INFO L273 TraceCheckUtils]: 49: Hoare triple {46275#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:26,111 INFO L273 TraceCheckUtils]: 50: Hoare triple {46275#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:26,111 INFO L273 TraceCheckUtils]: 51: Hoare triple {46276#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:26,112 INFO L273 TraceCheckUtils]: 52: Hoare triple {46276#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:26,112 INFO L273 TraceCheckUtils]: 53: Hoare triple {46276#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:26,113 INFO L273 TraceCheckUtils]: 54: Hoare triple {46277#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:26,113 INFO L273 TraceCheckUtils]: 55: Hoare triple {46277#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:26,114 INFO L273 TraceCheckUtils]: 56: Hoare triple {46277#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:26,115 INFO L273 TraceCheckUtils]: 57: Hoare triple {46278#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:26,115 INFO L273 TraceCheckUtils]: 58: Hoare triple {46278#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:26,116 INFO L273 TraceCheckUtils]: 59: Hoare triple {46278#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:26,116 INFO L273 TraceCheckUtils]: 60: Hoare triple {46279#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:26,117 INFO L273 TraceCheckUtils]: 61: Hoare triple {46279#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:26,117 INFO L273 TraceCheckUtils]: 62: Hoare triple {46279#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:26,118 INFO L273 TraceCheckUtils]: 63: Hoare triple {46280#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:26,118 INFO L273 TraceCheckUtils]: 64: Hoare triple {46280#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:26,119 INFO L273 TraceCheckUtils]: 65: Hoare triple {46280#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:26,120 INFO L273 TraceCheckUtils]: 66: Hoare triple {46281#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:26,120 INFO L273 TraceCheckUtils]: 67: Hoare triple {46281#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:26,121 INFO L273 TraceCheckUtils]: 68: Hoare triple {46281#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:26,121 INFO L273 TraceCheckUtils]: 69: Hoare triple {46282#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:26,122 INFO L273 TraceCheckUtils]: 70: Hoare triple {46282#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:26,123 INFO L273 TraceCheckUtils]: 71: Hoare triple {46282#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:26,123 INFO L273 TraceCheckUtils]: 72: Hoare triple {46283#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:26,124 INFO L273 TraceCheckUtils]: 73: Hoare triple {46283#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:26,124 INFO L273 TraceCheckUtils]: 74: Hoare triple {46283#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:26,125 INFO L273 TraceCheckUtils]: 75: Hoare triple {46284#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:26,125 INFO L273 TraceCheckUtils]: 76: Hoare triple {46284#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:26,126 INFO L273 TraceCheckUtils]: 77: Hoare triple {46284#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:26,127 INFO L273 TraceCheckUtils]: 78: Hoare triple {46285#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:26,127 INFO L273 TraceCheckUtils]: 79: Hoare triple {46285#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:26,128 INFO L273 TraceCheckUtils]: 80: Hoare triple {46285#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:26,128 INFO L273 TraceCheckUtils]: 81: Hoare triple {46286#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:26,129 INFO L273 TraceCheckUtils]: 82: Hoare triple {46286#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:26,130 INFO L273 TraceCheckUtils]: 83: Hoare triple {46286#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:26,130 INFO L273 TraceCheckUtils]: 84: Hoare triple {46287#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:26,131 INFO L273 TraceCheckUtils]: 85: Hoare triple {46287#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:26,131 INFO L273 TraceCheckUtils]: 86: Hoare triple {46287#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:26,132 INFO L273 TraceCheckUtils]: 87: Hoare triple {46288#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:26,132 INFO L273 TraceCheckUtils]: 88: Hoare triple {46288#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:26,133 INFO L273 TraceCheckUtils]: 89: Hoare triple {46288#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:26,133 INFO L273 TraceCheckUtils]: 90: Hoare triple {46289#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:26,134 INFO L273 TraceCheckUtils]: 91: Hoare triple {46289#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:26,135 INFO L273 TraceCheckUtils]: 92: Hoare triple {46289#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:26,135 INFO L273 TraceCheckUtils]: 93: Hoare triple {46290#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:26,136 INFO L273 TraceCheckUtils]: 94: Hoare triple {46290#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:26,136 INFO L273 TraceCheckUtils]: 95: Hoare triple {46290#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:26,137 INFO L273 TraceCheckUtils]: 96: Hoare triple {46291#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:26,137 INFO L273 TraceCheckUtils]: 97: Hoare triple {46291#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:26,138 INFO L273 TraceCheckUtils]: 98: Hoare triple {46291#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:26,139 INFO L273 TraceCheckUtils]: 99: Hoare triple {46292#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:26,139 INFO L273 TraceCheckUtils]: 100: Hoare triple {46292#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:26,140 INFO L273 TraceCheckUtils]: 101: Hoare triple {46292#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:26,140 INFO L273 TraceCheckUtils]: 102: Hoare triple {46293#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:26,141 INFO L273 TraceCheckUtils]: 103: Hoare triple {46293#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:26,142 INFO L273 TraceCheckUtils]: 104: Hoare triple {46293#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:26,142 INFO L273 TraceCheckUtils]: 105: Hoare triple {46294#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:26,143 INFO L273 TraceCheckUtils]: 106: Hoare triple {46294#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:26,143 INFO L273 TraceCheckUtils]: 107: Hoare triple {46294#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:26,144 INFO L273 TraceCheckUtils]: 108: Hoare triple {46295#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:26,144 INFO L273 TraceCheckUtils]: 109: Hoare triple {46295#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:26,145 INFO L273 TraceCheckUtils]: 110: Hoare triple {46295#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:26,146 INFO L273 TraceCheckUtils]: 111: Hoare triple {46296#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:26,146 INFO L273 TraceCheckUtils]: 112: Hoare triple {46296#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:26,147 INFO L273 TraceCheckUtils]: 113: Hoare triple {46296#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:26,147 INFO L273 TraceCheckUtils]: 114: Hoare triple {46297#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:26,148 INFO L273 TraceCheckUtils]: 115: Hoare triple {46297#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:26,148 INFO L273 TraceCheckUtils]: 116: Hoare triple {46297#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:26,149 INFO L273 TraceCheckUtils]: 117: Hoare triple {46298#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:26,149 INFO L273 TraceCheckUtils]: 118: Hoare triple {46298#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:26,150 INFO L273 TraceCheckUtils]: 119: Hoare triple {46298#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:26,151 INFO L273 TraceCheckUtils]: 120: Hoare triple {46299#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:26,151 INFO L273 TraceCheckUtils]: 121: Hoare triple {46299#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:26,152 INFO L273 TraceCheckUtils]: 122: Hoare triple {46299#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:26,152 INFO L273 TraceCheckUtils]: 123: Hoare triple {46300#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:26,153 INFO L273 TraceCheckUtils]: 124: Hoare triple {46300#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:26,154 INFO L273 TraceCheckUtils]: 125: Hoare triple {46300#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:26,154 INFO L273 TraceCheckUtils]: 126: Hoare triple {46301#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:26,155 INFO L273 TraceCheckUtils]: 127: Hoare triple {46301#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:26,155 INFO L273 TraceCheckUtils]: 128: Hoare triple {46301#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:26,156 INFO L273 TraceCheckUtils]: 129: Hoare triple {46302#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:26,156 INFO L273 TraceCheckUtils]: 130: Hoare triple {46302#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:26,157 INFO L273 TraceCheckUtils]: 131: Hoare triple {46302#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:26,158 INFO L273 TraceCheckUtils]: 132: Hoare triple {46303#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:26,158 INFO L273 TraceCheckUtils]: 133: Hoare triple {46303#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:26,159 INFO L273 TraceCheckUtils]: 134: Hoare triple {46303#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:26,159 INFO L273 TraceCheckUtils]: 135: Hoare triple {46304#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:26,160 INFO L273 TraceCheckUtils]: 136: Hoare triple {46304#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:26,160 INFO L273 TraceCheckUtils]: 137: Hoare triple {46304#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:26,161 INFO L273 TraceCheckUtils]: 138: Hoare triple {46305#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:26,161 INFO L273 TraceCheckUtils]: 139: Hoare triple {46305#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:26,162 INFO L273 TraceCheckUtils]: 140: Hoare triple {46305#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:26,163 INFO L273 TraceCheckUtils]: 141: Hoare triple {46306#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:26,163 INFO L273 TraceCheckUtils]: 142: Hoare triple {46306#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:26,164 INFO L273 TraceCheckUtils]: 143: Hoare triple {46306#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:26,164 INFO L273 TraceCheckUtils]: 144: Hoare triple {46307#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:26,165 INFO L273 TraceCheckUtils]: 145: Hoare triple {46307#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:26,166 INFO L273 TraceCheckUtils]: 146: Hoare triple {46307#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:26,166 INFO L273 TraceCheckUtils]: 147: Hoare triple {46308#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:26,167 INFO L273 TraceCheckUtils]: 148: Hoare triple {46308#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:26,167 INFO L273 TraceCheckUtils]: 149: Hoare triple {46308#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:26,168 INFO L273 TraceCheckUtils]: 150: Hoare triple {46309#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:26,168 INFO L273 TraceCheckUtils]: 151: Hoare triple {46309#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:26,169 INFO L273 TraceCheckUtils]: 152: Hoare triple {46309#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:26,170 INFO L273 TraceCheckUtils]: 153: Hoare triple {46310#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:26,170 INFO L273 TraceCheckUtils]: 154: Hoare triple {46310#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:26,171 INFO L273 TraceCheckUtils]: 155: Hoare triple {46310#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:26,171 INFO L273 TraceCheckUtils]: 156: Hoare triple {46311#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:26,172 INFO L273 TraceCheckUtils]: 157: Hoare triple {46311#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:26,173 INFO L273 TraceCheckUtils]: 158: Hoare triple {46311#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:26,173 INFO L273 TraceCheckUtils]: 159: Hoare triple {46312#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:26,174 INFO L273 TraceCheckUtils]: 160: Hoare triple {46312#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:26,174 INFO L273 TraceCheckUtils]: 161: Hoare triple {46312#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:26,175 INFO L273 TraceCheckUtils]: 162: Hoare triple {46313#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:26,175 INFO L273 TraceCheckUtils]: 163: Hoare triple {46313#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:26,176 INFO L273 TraceCheckUtils]: 164: Hoare triple {46313#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:26,176 INFO L273 TraceCheckUtils]: 165: Hoare triple {46314#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:26,177 INFO L273 TraceCheckUtils]: 166: Hoare triple {46314#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:26,178 INFO L273 TraceCheckUtils]: 167: Hoare triple {46314#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:26,178 INFO L273 TraceCheckUtils]: 168: Hoare triple {46315#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:26,179 INFO L273 TraceCheckUtils]: 169: Hoare triple {46315#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:26,179 INFO L273 TraceCheckUtils]: 170: Hoare triple {46315#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:26,180 INFO L273 TraceCheckUtils]: 171: Hoare triple {46316#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:26,180 INFO L273 TraceCheckUtils]: 172: Hoare triple {46316#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:26,181 INFO L273 TraceCheckUtils]: 173: Hoare triple {46316#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {46317#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:26,182 INFO L273 TraceCheckUtils]: 174: Hoare triple {46317#(<= main_~i~0 56)} assume !(~i~0 < 100000); {46260#false} is VALID [2018-11-23 12:07:26,182 INFO L273 TraceCheckUtils]: 175: Hoare triple {46260#false} havoc ~x~0;~x~0 := 0; {46260#false} is VALID [2018-11-23 12:07:26,182 INFO L273 TraceCheckUtils]: 176: Hoare triple {46260#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {46260#false} is VALID [2018-11-23 12:07:26,182 INFO L256 TraceCheckUtils]: 177: Hoare triple {46260#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {46260#false} is VALID [2018-11-23 12:07:26,183 INFO L273 TraceCheckUtils]: 178: Hoare triple {46260#false} ~cond := #in~cond; {46260#false} is VALID [2018-11-23 12:07:26,183 INFO L273 TraceCheckUtils]: 179: Hoare triple {46260#false} assume 0 == ~cond; {46260#false} is VALID [2018-11-23 12:07:26,183 INFO L273 TraceCheckUtils]: 180: Hoare triple {46260#false} assume !false; {46260#false} is VALID [2018-11-23 12:07:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:26,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:26,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2018-11-23 12:07:26,222 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 181 [2018-11-23 12:07:26,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:26,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2018-11-23 12:07:26,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:26,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-23 12:07:26,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-23 12:07:26,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 12:07:26,404 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 60 states. [2018-11-23 12:07:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:27,667 INFO L93 Difference]: Finished difference Result 202 states and 262 transitions. [2018-11-23 12:07:27,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-23 12:07:27,668 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 181 [2018-11-23 12:07:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:07:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 262 transitions. [2018-11-23 12:07:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:07:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 262 transitions. [2018-11-23 12:07:27,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 262 transitions. [2018-11-23 12:07:27,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:27,922 INFO L225 Difference]: With dead ends: 202 [2018-11-23 12:07:27,923 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 12:07:27,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 12:07:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 12:07:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-11-23 12:07:27,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:27,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 189 states. [2018-11-23 12:07:27,974 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 189 states. [2018-11-23 12:07:27,974 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 189 states. [2018-11-23 12:07:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:27,976 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2018-11-23 12:07:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2018-11-23 12:07:27,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:27,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:27,977 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 191 states. [2018-11-23 12:07:27,977 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 191 states. [2018-11-23 12:07:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:27,979 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2018-11-23 12:07:27,979 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2018-11-23 12:07:27,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:27,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:27,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:27,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-23 12:07:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2018-11-23 12:07:27,982 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 181 [2018-11-23 12:07:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:27,983 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2018-11-23 12:07:27,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-23 12:07:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2018-11-23 12:07:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:07:27,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:27,984 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:27,984 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:27,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1283761123, now seen corresponding path program 57 times [2018-11-23 12:07:27,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:27,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:27,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:29,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {47767#true} call ULTIMATE.init(); {47767#true} is VALID [2018-11-23 12:07:29,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {47767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47767#true} is VALID [2018-11-23 12:07:29,593 INFO L273 TraceCheckUtils]: 2: Hoare triple {47767#true} assume true; {47767#true} is VALID [2018-11-23 12:07:29,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47767#true} {47767#true} #55#return; {47767#true} is VALID [2018-11-23 12:07:29,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {47767#true} call #t~ret4 := main(); {47767#true} is VALID [2018-11-23 12:07:29,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {47767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {47769#(= main_~i~0 0)} is VALID [2018-11-23 12:07:29,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {47769#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47769#(= main_~i~0 0)} is VALID [2018-11-23 12:07:29,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {47769#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47769#(= main_~i~0 0)} is VALID [2018-11-23 12:07:29,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {47769#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:29,595 INFO L273 TraceCheckUtils]: 9: Hoare triple {47770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:29,596 INFO L273 TraceCheckUtils]: 10: Hoare triple {47770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:29,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {47770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:29,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {47771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:29,597 INFO L273 TraceCheckUtils]: 13: Hoare triple {47771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:29,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {47771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:29,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {47772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:29,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {47772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:29,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {47772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:29,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {47773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:29,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {47773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:29,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {47773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:29,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {47774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:29,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {47774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:29,602 INFO L273 TraceCheckUtils]: 23: Hoare triple {47774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:29,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {47775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:29,603 INFO L273 TraceCheckUtils]: 25: Hoare triple {47775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:29,604 INFO L273 TraceCheckUtils]: 26: Hoare triple {47775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:29,604 INFO L273 TraceCheckUtils]: 27: Hoare triple {47776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:29,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {47776#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:29,605 INFO L273 TraceCheckUtils]: 29: Hoare triple {47776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:29,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {47777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:29,606 INFO L273 TraceCheckUtils]: 31: Hoare triple {47777#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:29,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {47777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:29,608 INFO L273 TraceCheckUtils]: 33: Hoare triple {47778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:29,608 INFO L273 TraceCheckUtils]: 34: Hoare triple {47778#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:29,609 INFO L273 TraceCheckUtils]: 35: Hoare triple {47778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:29,609 INFO L273 TraceCheckUtils]: 36: Hoare triple {47779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:29,610 INFO L273 TraceCheckUtils]: 37: Hoare triple {47779#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:29,611 INFO L273 TraceCheckUtils]: 38: Hoare triple {47779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:29,611 INFO L273 TraceCheckUtils]: 39: Hoare triple {47780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:29,612 INFO L273 TraceCheckUtils]: 40: Hoare triple {47780#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:29,612 INFO L273 TraceCheckUtils]: 41: Hoare triple {47780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:29,613 INFO L273 TraceCheckUtils]: 42: Hoare triple {47781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:29,613 INFO L273 TraceCheckUtils]: 43: Hoare triple {47781#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:29,614 INFO L273 TraceCheckUtils]: 44: Hoare triple {47781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:29,614 INFO L273 TraceCheckUtils]: 45: Hoare triple {47782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:29,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {47782#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:29,616 INFO L273 TraceCheckUtils]: 47: Hoare triple {47782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:29,616 INFO L273 TraceCheckUtils]: 48: Hoare triple {47783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:29,617 INFO L273 TraceCheckUtils]: 49: Hoare triple {47783#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:29,617 INFO L273 TraceCheckUtils]: 50: Hoare triple {47783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:29,618 INFO L273 TraceCheckUtils]: 51: Hoare triple {47784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:29,618 INFO L273 TraceCheckUtils]: 52: Hoare triple {47784#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:29,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {47784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:29,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {47785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:29,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {47785#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:29,621 INFO L273 TraceCheckUtils]: 56: Hoare triple {47785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:29,621 INFO L273 TraceCheckUtils]: 57: Hoare triple {47786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:29,622 INFO L273 TraceCheckUtils]: 58: Hoare triple {47786#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:29,622 INFO L273 TraceCheckUtils]: 59: Hoare triple {47786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:29,623 INFO L273 TraceCheckUtils]: 60: Hoare triple {47787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:29,623 INFO L273 TraceCheckUtils]: 61: Hoare triple {47787#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:29,624 INFO L273 TraceCheckUtils]: 62: Hoare triple {47787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:29,625 INFO L273 TraceCheckUtils]: 63: Hoare triple {47788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:29,625 INFO L273 TraceCheckUtils]: 64: Hoare triple {47788#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:29,626 INFO L273 TraceCheckUtils]: 65: Hoare triple {47788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:29,626 INFO L273 TraceCheckUtils]: 66: Hoare triple {47789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:29,627 INFO L273 TraceCheckUtils]: 67: Hoare triple {47789#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:29,627 INFO L273 TraceCheckUtils]: 68: Hoare triple {47789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:29,628 INFO L273 TraceCheckUtils]: 69: Hoare triple {47790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:29,628 INFO L273 TraceCheckUtils]: 70: Hoare triple {47790#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:29,629 INFO L273 TraceCheckUtils]: 71: Hoare triple {47790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:29,630 INFO L273 TraceCheckUtils]: 72: Hoare triple {47791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:29,630 INFO L273 TraceCheckUtils]: 73: Hoare triple {47791#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:29,631 INFO L273 TraceCheckUtils]: 74: Hoare triple {47791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:29,631 INFO L273 TraceCheckUtils]: 75: Hoare triple {47792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:29,632 INFO L273 TraceCheckUtils]: 76: Hoare triple {47792#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:29,633 INFO L273 TraceCheckUtils]: 77: Hoare triple {47792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:29,634 INFO L273 TraceCheckUtils]: 78: Hoare triple {47793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:29,639 INFO L273 TraceCheckUtils]: 79: Hoare triple {47793#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:29,641 INFO L273 TraceCheckUtils]: 80: Hoare triple {47793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:29,644 INFO L273 TraceCheckUtils]: 81: Hoare triple {47794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:29,644 INFO L273 TraceCheckUtils]: 82: Hoare triple {47794#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:29,647 INFO L273 TraceCheckUtils]: 83: Hoare triple {47794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:29,647 INFO L273 TraceCheckUtils]: 84: Hoare triple {47795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:29,649 INFO L273 TraceCheckUtils]: 85: Hoare triple {47795#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:29,649 INFO L273 TraceCheckUtils]: 86: Hoare triple {47795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:29,652 INFO L273 TraceCheckUtils]: 87: Hoare triple {47796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:29,652 INFO L273 TraceCheckUtils]: 88: Hoare triple {47796#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:29,654 INFO L273 TraceCheckUtils]: 89: Hoare triple {47796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:29,654 INFO L273 TraceCheckUtils]: 90: Hoare triple {47797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:29,657 INFO L273 TraceCheckUtils]: 91: Hoare triple {47797#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:29,657 INFO L273 TraceCheckUtils]: 92: Hoare triple {47797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:29,659 INFO L273 TraceCheckUtils]: 93: Hoare triple {47798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:29,659 INFO L273 TraceCheckUtils]: 94: Hoare triple {47798#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:29,661 INFO L273 TraceCheckUtils]: 95: Hoare triple {47798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:29,661 INFO L273 TraceCheckUtils]: 96: Hoare triple {47799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:29,663 INFO L273 TraceCheckUtils]: 97: Hoare triple {47799#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:29,663 INFO L273 TraceCheckUtils]: 98: Hoare triple {47799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:29,666 INFO L273 TraceCheckUtils]: 99: Hoare triple {47800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:29,666 INFO L273 TraceCheckUtils]: 100: Hoare triple {47800#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:29,668 INFO L273 TraceCheckUtils]: 101: Hoare triple {47800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:29,668 INFO L273 TraceCheckUtils]: 102: Hoare triple {47801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:29,671 INFO L273 TraceCheckUtils]: 103: Hoare triple {47801#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:29,671 INFO L273 TraceCheckUtils]: 104: Hoare triple {47801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:29,673 INFO L273 TraceCheckUtils]: 105: Hoare triple {47802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:29,673 INFO L273 TraceCheckUtils]: 106: Hoare triple {47802#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:29,675 INFO L273 TraceCheckUtils]: 107: Hoare triple {47802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:29,675 INFO L273 TraceCheckUtils]: 108: Hoare triple {47803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:29,677 INFO L273 TraceCheckUtils]: 109: Hoare triple {47803#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:29,677 INFO L273 TraceCheckUtils]: 110: Hoare triple {47803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:29,680 INFO L273 TraceCheckUtils]: 111: Hoare triple {47804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:29,680 INFO L273 TraceCheckUtils]: 112: Hoare triple {47804#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:29,682 INFO L273 TraceCheckUtils]: 113: Hoare triple {47804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:29,682 INFO L273 TraceCheckUtils]: 114: Hoare triple {47805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:29,684 INFO L273 TraceCheckUtils]: 115: Hoare triple {47805#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:29,684 INFO L273 TraceCheckUtils]: 116: Hoare triple {47805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:29,686 INFO L273 TraceCheckUtils]: 117: Hoare triple {47806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:29,686 INFO L273 TraceCheckUtils]: 118: Hoare triple {47806#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:29,688 INFO L273 TraceCheckUtils]: 119: Hoare triple {47806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:29,688 INFO L273 TraceCheckUtils]: 120: Hoare triple {47807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:29,690 INFO L273 TraceCheckUtils]: 121: Hoare triple {47807#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:29,690 INFO L273 TraceCheckUtils]: 122: Hoare triple {47807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:29,693 INFO L273 TraceCheckUtils]: 123: Hoare triple {47808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:29,693 INFO L273 TraceCheckUtils]: 124: Hoare triple {47808#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:29,696 INFO L273 TraceCheckUtils]: 125: Hoare triple {47808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:29,696 INFO L273 TraceCheckUtils]: 126: Hoare triple {47809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:29,696 INFO L273 TraceCheckUtils]: 127: Hoare triple {47809#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:29,697 INFO L273 TraceCheckUtils]: 128: Hoare triple {47809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:29,697 INFO L273 TraceCheckUtils]: 129: Hoare triple {47810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:29,697 INFO L273 TraceCheckUtils]: 130: Hoare triple {47810#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:29,698 INFO L273 TraceCheckUtils]: 131: Hoare triple {47810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:29,698 INFO L273 TraceCheckUtils]: 132: Hoare triple {47811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:29,700 INFO L273 TraceCheckUtils]: 133: Hoare triple {47811#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:29,700 INFO L273 TraceCheckUtils]: 134: Hoare triple {47811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:29,702 INFO L273 TraceCheckUtils]: 135: Hoare triple {47812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:29,702 INFO L273 TraceCheckUtils]: 136: Hoare triple {47812#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:29,704 INFO L273 TraceCheckUtils]: 137: Hoare triple {47812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:29,704 INFO L273 TraceCheckUtils]: 138: Hoare triple {47813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:29,707 INFO L273 TraceCheckUtils]: 139: Hoare triple {47813#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:29,707 INFO L273 TraceCheckUtils]: 140: Hoare triple {47813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:29,709 INFO L273 TraceCheckUtils]: 141: Hoare triple {47814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:29,709 INFO L273 TraceCheckUtils]: 142: Hoare triple {47814#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:29,711 INFO L273 TraceCheckUtils]: 143: Hoare triple {47814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:29,711 INFO L273 TraceCheckUtils]: 144: Hoare triple {47815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:29,714 INFO L273 TraceCheckUtils]: 145: Hoare triple {47815#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:29,714 INFO L273 TraceCheckUtils]: 146: Hoare triple {47815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:29,716 INFO L273 TraceCheckUtils]: 147: Hoare triple {47816#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:29,716 INFO L273 TraceCheckUtils]: 148: Hoare triple {47816#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:29,719 INFO L273 TraceCheckUtils]: 149: Hoare triple {47816#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:29,719 INFO L273 TraceCheckUtils]: 150: Hoare triple {47817#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:29,719 INFO L273 TraceCheckUtils]: 151: Hoare triple {47817#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:29,720 INFO L273 TraceCheckUtils]: 152: Hoare triple {47817#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:29,721 INFO L273 TraceCheckUtils]: 153: Hoare triple {47818#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:29,721 INFO L273 TraceCheckUtils]: 154: Hoare triple {47818#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:29,721 INFO L273 TraceCheckUtils]: 155: Hoare triple {47818#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:29,722 INFO L273 TraceCheckUtils]: 156: Hoare triple {47819#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:29,723 INFO L273 TraceCheckUtils]: 157: Hoare triple {47819#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:29,723 INFO L273 TraceCheckUtils]: 158: Hoare triple {47819#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:29,725 INFO L273 TraceCheckUtils]: 159: Hoare triple {47820#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:29,725 INFO L273 TraceCheckUtils]: 160: Hoare triple {47820#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:29,727 INFO L273 TraceCheckUtils]: 161: Hoare triple {47820#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:29,727 INFO L273 TraceCheckUtils]: 162: Hoare triple {47821#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:29,730 INFO L273 TraceCheckUtils]: 163: Hoare triple {47821#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:29,730 INFO L273 TraceCheckUtils]: 164: Hoare triple {47821#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:29,730 INFO L273 TraceCheckUtils]: 165: Hoare triple {47822#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:29,731 INFO L273 TraceCheckUtils]: 166: Hoare triple {47822#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:29,732 INFO L273 TraceCheckUtils]: 167: Hoare triple {47822#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:29,732 INFO L273 TraceCheckUtils]: 168: Hoare triple {47823#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:29,734 INFO L273 TraceCheckUtils]: 169: Hoare triple {47823#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:29,734 INFO L273 TraceCheckUtils]: 170: Hoare triple {47823#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:29,735 INFO L273 TraceCheckUtils]: 171: Hoare triple {47824#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:29,735 INFO L273 TraceCheckUtils]: 172: Hoare triple {47824#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:29,736 INFO L273 TraceCheckUtils]: 173: Hoare triple {47824#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:29,736 INFO L273 TraceCheckUtils]: 174: Hoare triple {47825#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:29,736 INFO L273 TraceCheckUtils]: 175: Hoare triple {47825#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:29,737 INFO L273 TraceCheckUtils]: 176: Hoare triple {47825#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {47826#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:29,740 INFO L273 TraceCheckUtils]: 177: Hoare triple {47826#(<= main_~i~0 57)} assume !(~i~0 < 100000); {47768#false} is VALID [2018-11-23 12:07:29,740 INFO L273 TraceCheckUtils]: 178: Hoare triple {47768#false} havoc ~x~0;~x~0 := 0; {47768#false} is VALID [2018-11-23 12:07:29,740 INFO L273 TraceCheckUtils]: 179: Hoare triple {47768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {47768#false} is VALID [2018-11-23 12:07:29,740 INFO L256 TraceCheckUtils]: 180: Hoare triple {47768#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {47768#false} is VALID [2018-11-23 12:07:29,740 INFO L273 TraceCheckUtils]: 181: Hoare triple {47768#false} ~cond := #in~cond; {47768#false} is VALID [2018-11-23 12:07:29,741 INFO L273 TraceCheckUtils]: 182: Hoare triple {47768#false} assume 0 == ~cond; {47768#false} is VALID [2018-11-23 12:07:29,741 INFO L273 TraceCheckUtils]: 183: Hoare triple {47768#false} assume !false; {47768#false} is VALID [2018-11-23 12:07:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:29,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:29,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:29,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:07:29,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-11-23 12:07:29,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:29,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:30,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {47767#true} call ULTIMATE.init(); {47767#true} is VALID [2018-11-23 12:07:30,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {47767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47767#true} is VALID [2018-11-23 12:07:30,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {47767#true} assume true; {47767#true} is VALID [2018-11-23 12:07:30,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47767#true} {47767#true} #55#return; {47767#true} is VALID [2018-11-23 12:07:30,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {47767#true} call #t~ret4 := main(); {47767#true} is VALID [2018-11-23 12:07:30,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {47767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {47845#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:30,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {47845#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47845#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:30,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {47845#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47845#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:30,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {47845#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:30,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {47770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:30,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {47770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:30,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {47770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:30,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {47771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:30,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {47771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:30,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {47771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:30,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {47772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:30,439 INFO L273 TraceCheckUtils]: 16: Hoare triple {47772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:30,440 INFO L273 TraceCheckUtils]: 17: Hoare triple {47772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:30,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {47773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:30,441 INFO L273 TraceCheckUtils]: 19: Hoare triple {47773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:30,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {47773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:30,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {47774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:30,442 INFO L273 TraceCheckUtils]: 22: Hoare triple {47774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:30,443 INFO L273 TraceCheckUtils]: 23: Hoare triple {47774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:30,443 INFO L273 TraceCheckUtils]: 24: Hoare triple {47775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:30,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {47775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:30,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {47775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:30,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {47776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:30,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {47776#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:30,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {47776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:30,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {47777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:30,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {47777#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:30,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {47777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:30,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {47778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:30,449 INFO L273 TraceCheckUtils]: 34: Hoare triple {47778#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:30,449 INFO L273 TraceCheckUtils]: 35: Hoare triple {47778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:30,450 INFO L273 TraceCheckUtils]: 36: Hoare triple {47779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:30,450 INFO L273 TraceCheckUtils]: 37: Hoare triple {47779#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:30,451 INFO L273 TraceCheckUtils]: 38: Hoare triple {47779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:30,451 INFO L273 TraceCheckUtils]: 39: Hoare triple {47780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:30,452 INFO L273 TraceCheckUtils]: 40: Hoare triple {47780#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:30,452 INFO L273 TraceCheckUtils]: 41: Hoare triple {47780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:30,453 INFO L273 TraceCheckUtils]: 42: Hoare triple {47781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:30,453 INFO L273 TraceCheckUtils]: 43: Hoare triple {47781#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:30,454 INFO L273 TraceCheckUtils]: 44: Hoare triple {47781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:30,454 INFO L273 TraceCheckUtils]: 45: Hoare triple {47782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:30,455 INFO L273 TraceCheckUtils]: 46: Hoare triple {47782#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:30,456 INFO L273 TraceCheckUtils]: 47: Hoare triple {47782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:30,456 INFO L273 TraceCheckUtils]: 48: Hoare triple {47783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:30,457 INFO L273 TraceCheckUtils]: 49: Hoare triple {47783#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:30,457 INFO L273 TraceCheckUtils]: 50: Hoare triple {47783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:30,458 INFO L273 TraceCheckUtils]: 51: Hoare triple {47784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:30,458 INFO L273 TraceCheckUtils]: 52: Hoare triple {47784#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:30,459 INFO L273 TraceCheckUtils]: 53: Hoare triple {47784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:30,459 INFO L273 TraceCheckUtils]: 54: Hoare triple {47785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:30,460 INFO L273 TraceCheckUtils]: 55: Hoare triple {47785#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:30,460 INFO L273 TraceCheckUtils]: 56: Hoare triple {47785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:30,461 INFO L273 TraceCheckUtils]: 57: Hoare triple {47786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:30,461 INFO L273 TraceCheckUtils]: 58: Hoare triple {47786#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:30,462 INFO L273 TraceCheckUtils]: 59: Hoare triple {47786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:30,462 INFO L273 TraceCheckUtils]: 60: Hoare triple {47787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:30,463 INFO L273 TraceCheckUtils]: 61: Hoare triple {47787#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:30,464 INFO L273 TraceCheckUtils]: 62: Hoare triple {47787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:30,464 INFO L273 TraceCheckUtils]: 63: Hoare triple {47788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:30,464 INFO L273 TraceCheckUtils]: 64: Hoare triple {47788#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:30,465 INFO L273 TraceCheckUtils]: 65: Hoare triple {47788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:30,466 INFO L273 TraceCheckUtils]: 66: Hoare triple {47789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:30,466 INFO L273 TraceCheckUtils]: 67: Hoare triple {47789#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:30,467 INFO L273 TraceCheckUtils]: 68: Hoare triple {47789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:30,467 INFO L273 TraceCheckUtils]: 69: Hoare triple {47790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:30,468 INFO L273 TraceCheckUtils]: 70: Hoare triple {47790#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:30,468 INFO L273 TraceCheckUtils]: 71: Hoare triple {47790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:30,469 INFO L273 TraceCheckUtils]: 72: Hoare triple {47791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:30,469 INFO L273 TraceCheckUtils]: 73: Hoare triple {47791#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:30,470 INFO L273 TraceCheckUtils]: 74: Hoare triple {47791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:30,470 INFO L273 TraceCheckUtils]: 75: Hoare triple {47792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:30,471 INFO L273 TraceCheckUtils]: 76: Hoare triple {47792#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:30,471 INFO L273 TraceCheckUtils]: 77: Hoare triple {47792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:30,472 INFO L273 TraceCheckUtils]: 78: Hoare triple {47793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:30,472 INFO L273 TraceCheckUtils]: 79: Hoare triple {47793#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:30,473 INFO L273 TraceCheckUtils]: 80: Hoare triple {47793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:30,474 INFO L273 TraceCheckUtils]: 81: Hoare triple {47794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:30,474 INFO L273 TraceCheckUtils]: 82: Hoare triple {47794#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:30,475 INFO L273 TraceCheckUtils]: 83: Hoare triple {47794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:30,475 INFO L273 TraceCheckUtils]: 84: Hoare triple {47795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:30,476 INFO L273 TraceCheckUtils]: 85: Hoare triple {47795#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:30,476 INFO L273 TraceCheckUtils]: 86: Hoare triple {47795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:30,477 INFO L273 TraceCheckUtils]: 87: Hoare triple {47796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:30,477 INFO L273 TraceCheckUtils]: 88: Hoare triple {47796#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:30,478 INFO L273 TraceCheckUtils]: 89: Hoare triple {47796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:30,478 INFO L273 TraceCheckUtils]: 90: Hoare triple {47797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:30,479 INFO L273 TraceCheckUtils]: 91: Hoare triple {47797#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:30,479 INFO L273 TraceCheckUtils]: 92: Hoare triple {47797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:30,480 INFO L273 TraceCheckUtils]: 93: Hoare triple {47798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:30,480 INFO L273 TraceCheckUtils]: 94: Hoare triple {47798#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:30,481 INFO L273 TraceCheckUtils]: 95: Hoare triple {47798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:30,482 INFO L273 TraceCheckUtils]: 96: Hoare triple {47799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:30,482 INFO L273 TraceCheckUtils]: 97: Hoare triple {47799#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:30,483 INFO L273 TraceCheckUtils]: 98: Hoare triple {47799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:30,483 INFO L273 TraceCheckUtils]: 99: Hoare triple {47800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:30,484 INFO L273 TraceCheckUtils]: 100: Hoare triple {47800#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:30,484 INFO L273 TraceCheckUtils]: 101: Hoare triple {47800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:30,485 INFO L273 TraceCheckUtils]: 102: Hoare triple {47801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:30,485 INFO L273 TraceCheckUtils]: 103: Hoare triple {47801#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:30,486 INFO L273 TraceCheckUtils]: 104: Hoare triple {47801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:30,486 INFO L273 TraceCheckUtils]: 105: Hoare triple {47802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:30,487 INFO L273 TraceCheckUtils]: 106: Hoare triple {47802#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:30,487 INFO L273 TraceCheckUtils]: 107: Hoare triple {47802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:30,488 INFO L273 TraceCheckUtils]: 108: Hoare triple {47803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:30,488 INFO L273 TraceCheckUtils]: 109: Hoare triple {47803#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:30,489 INFO L273 TraceCheckUtils]: 110: Hoare triple {47803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:30,489 INFO L273 TraceCheckUtils]: 111: Hoare triple {47804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:30,490 INFO L273 TraceCheckUtils]: 112: Hoare triple {47804#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:30,491 INFO L273 TraceCheckUtils]: 113: Hoare triple {47804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:30,491 INFO L273 TraceCheckUtils]: 114: Hoare triple {47805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:30,492 INFO L273 TraceCheckUtils]: 115: Hoare triple {47805#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:30,492 INFO L273 TraceCheckUtils]: 116: Hoare triple {47805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:30,493 INFO L273 TraceCheckUtils]: 117: Hoare triple {47806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:30,493 INFO L273 TraceCheckUtils]: 118: Hoare triple {47806#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:30,494 INFO L273 TraceCheckUtils]: 119: Hoare triple {47806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:30,494 INFO L273 TraceCheckUtils]: 120: Hoare triple {47807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:30,495 INFO L273 TraceCheckUtils]: 121: Hoare triple {47807#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:30,495 INFO L273 TraceCheckUtils]: 122: Hoare triple {47807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:30,496 INFO L273 TraceCheckUtils]: 123: Hoare triple {47808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:30,496 INFO L273 TraceCheckUtils]: 124: Hoare triple {47808#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:30,497 INFO L273 TraceCheckUtils]: 125: Hoare triple {47808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:30,497 INFO L273 TraceCheckUtils]: 126: Hoare triple {47809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:30,498 INFO L273 TraceCheckUtils]: 127: Hoare triple {47809#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:30,499 INFO L273 TraceCheckUtils]: 128: Hoare triple {47809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:30,499 INFO L273 TraceCheckUtils]: 129: Hoare triple {47810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:30,499 INFO L273 TraceCheckUtils]: 130: Hoare triple {47810#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:30,500 INFO L273 TraceCheckUtils]: 131: Hoare triple {47810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:30,501 INFO L273 TraceCheckUtils]: 132: Hoare triple {47811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:30,501 INFO L273 TraceCheckUtils]: 133: Hoare triple {47811#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:30,502 INFO L273 TraceCheckUtils]: 134: Hoare triple {47811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:30,502 INFO L273 TraceCheckUtils]: 135: Hoare triple {47812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:30,503 INFO L273 TraceCheckUtils]: 136: Hoare triple {47812#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:30,503 INFO L273 TraceCheckUtils]: 137: Hoare triple {47812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:30,504 INFO L273 TraceCheckUtils]: 138: Hoare triple {47813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:30,504 INFO L273 TraceCheckUtils]: 139: Hoare triple {47813#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:30,505 INFO L273 TraceCheckUtils]: 140: Hoare triple {47813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:30,505 INFO L273 TraceCheckUtils]: 141: Hoare triple {47814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:30,506 INFO L273 TraceCheckUtils]: 142: Hoare triple {47814#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:30,506 INFO L273 TraceCheckUtils]: 143: Hoare triple {47814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:30,507 INFO L273 TraceCheckUtils]: 144: Hoare triple {47815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:30,507 INFO L273 TraceCheckUtils]: 145: Hoare triple {47815#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:30,508 INFO L273 TraceCheckUtils]: 146: Hoare triple {47815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:30,509 INFO L273 TraceCheckUtils]: 147: Hoare triple {47816#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:30,509 INFO L273 TraceCheckUtils]: 148: Hoare triple {47816#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:30,510 INFO L273 TraceCheckUtils]: 149: Hoare triple {47816#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:30,510 INFO L273 TraceCheckUtils]: 150: Hoare triple {47817#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:30,511 INFO L273 TraceCheckUtils]: 151: Hoare triple {47817#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:30,511 INFO L273 TraceCheckUtils]: 152: Hoare triple {47817#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:30,512 INFO L273 TraceCheckUtils]: 153: Hoare triple {47818#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:30,512 INFO L273 TraceCheckUtils]: 154: Hoare triple {47818#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:30,513 INFO L273 TraceCheckUtils]: 155: Hoare triple {47818#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:30,513 INFO L273 TraceCheckUtils]: 156: Hoare triple {47819#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:30,514 INFO L273 TraceCheckUtils]: 157: Hoare triple {47819#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:30,514 INFO L273 TraceCheckUtils]: 158: Hoare triple {47819#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:30,515 INFO L273 TraceCheckUtils]: 159: Hoare triple {47820#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:30,515 INFO L273 TraceCheckUtils]: 160: Hoare triple {47820#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:30,516 INFO L273 TraceCheckUtils]: 161: Hoare triple {47820#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:30,516 INFO L273 TraceCheckUtils]: 162: Hoare triple {47821#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:30,517 INFO L273 TraceCheckUtils]: 163: Hoare triple {47821#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:30,518 INFO L273 TraceCheckUtils]: 164: Hoare triple {47821#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:30,518 INFO L273 TraceCheckUtils]: 165: Hoare triple {47822#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:30,519 INFO L273 TraceCheckUtils]: 166: Hoare triple {47822#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:30,519 INFO L273 TraceCheckUtils]: 167: Hoare triple {47822#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:30,520 INFO L273 TraceCheckUtils]: 168: Hoare triple {47823#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:30,520 INFO L273 TraceCheckUtils]: 169: Hoare triple {47823#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:30,521 INFO L273 TraceCheckUtils]: 170: Hoare triple {47823#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:30,521 INFO L273 TraceCheckUtils]: 171: Hoare triple {47824#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:30,522 INFO L273 TraceCheckUtils]: 172: Hoare triple {47824#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:30,523 INFO L273 TraceCheckUtils]: 173: Hoare triple {47824#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:30,523 INFO L273 TraceCheckUtils]: 174: Hoare triple {47825#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:30,524 INFO L273 TraceCheckUtils]: 175: Hoare triple {47825#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:30,524 INFO L273 TraceCheckUtils]: 176: Hoare triple {47825#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {47826#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:30,525 INFO L273 TraceCheckUtils]: 177: Hoare triple {47826#(<= main_~i~0 57)} assume !(~i~0 < 100000); {47768#false} is VALID [2018-11-23 12:07:30,525 INFO L273 TraceCheckUtils]: 178: Hoare triple {47768#false} havoc ~x~0;~x~0 := 0; {47768#false} is VALID [2018-11-23 12:07:30,525 INFO L273 TraceCheckUtils]: 179: Hoare triple {47768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {47768#false} is VALID [2018-11-23 12:07:30,525 INFO L256 TraceCheckUtils]: 180: Hoare triple {47768#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {47768#false} is VALID [2018-11-23 12:07:30,526 INFO L273 TraceCheckUtils]: 181: Hoare triple {47768#false} ~cond := #in~cond; {47768#false} is VALID [2018-11-23 12:07:30,526 INFO L273 TraceCheckUtils]: 182: Hoare triple {47768#false} assume 0 == ~cond; {47768#false} is VALID [2018-11-23 12:07:30,526 INFO L273 TraceCheckUtils]: 183: Hoare triple {47768#false} assume !false; {47768#false} is VALID [2018-11-23 12:07:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:30,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:30,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2018-11-23 12:07:30,566 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 184 [2018-11-23 12:07:30,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:30,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states. [2018-11-23 12:07:30,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:30,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-23 12:07:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-23 12:07:30,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 12:07:30,741 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand 61 states. [2018-11-23 12:07:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:31,995 INFO L93 Difference]: Finished difference Result 205 states and 266 transitions. [2018-11-23 12:07:31,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-23 12:07:31,995 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 184 [2018-11-23 12:07:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:07:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 266 transitions. [2018-11-23 12:07:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:07:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 266 transitions. [2018-11-23 12:07:32,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 266 transitions. [2018-11-23 12:07:32,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:32,280 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:07:32,281 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 12:07:32,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 12:07:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 12:07:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-11-23 12:07:32,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:32,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 192 states. [2018-11-23 12:07:32,329 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 192 states. [2018-11-23 12:07:32,330 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 192 states. [2018-11-23 12:07:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,333 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2018-11-23 12:07:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2018-11-23 12:07:32,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:32,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:32,333 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 194 states. [2018-11-23 12:07:32,333 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 194 states. [2018-11-23 12:07:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,336 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2018-11-23 12:07:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2018-11-23 12:07:32,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:32,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:32,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:32,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-23 12:07:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 251 transitions. [2018-11-23 12:07:32,339 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 251 transitions. Word has length 184 [2018-11-23 12:07:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:32,339 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 251 transitions. [2018-11-23 12:07:32,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-23 12:07:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 251 transitions. [2018-11-23 12:07:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-23 12:07:32,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:32,340 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:32,340 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:32,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:32,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1184177529, now seen corresponding path program 58 times [2018-11-23 12:07:32,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:32,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:32,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:32,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:32,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:33,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {49299#true} call ULTIMATE.init(); {49299#true} is VALID [2018-11-23 12:07:33,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {49299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49299#true} is VALID [2018-11-23 12:07:33,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {49299#true} assume true; {49299#true} is VALID [2018-11-23 12:07:33,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49299#true} {49299#true} #55#return; {49299#true} is VALID [2018-11-23 12:07:33,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {49299#true} call #t~ret4 := main(); {49299#true} is VALID [2018-11-23 12:07:33,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {49299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {49301#(= main_~i~0 0)} is VALID [2018-11-23 12:07:33,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {49301#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49301#(= main_~i~0 0)} is VALID [2018-11-23 12:07:33,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {49301#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49301#(= main_~i~0 0)} is VALID [2018-11-23 12:07:33,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {49301#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:33,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {49302#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:33,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {49302#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:33,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {49302#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:33,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {49303#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:33,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {49303#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:33,908 INFO L273 TraceCheckUtils]: 14: Hoare triple {49303#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:33,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {49304#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:33,909 INFO L273 TraceCheckUtils]: 16: Hoare triple {49304#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:33,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {49304#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:33,910 INFO L273 TraceCheckUtils]: 18: Hoare triple {49305#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:33,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {49305#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:33,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {49305#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:33,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {49306#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:33,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {49306#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:33,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {49306#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:33,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {49307#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:33,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {49307#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:33,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {49307#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:33,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {49308#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:33,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {49308#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:33,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {49308#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:33,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {49309#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:33,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {49309#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:33,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {49309#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:33,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {49310#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:33,919 INFO L273 TraceCheckUtils]: 34: Hoare triple {49310#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:33,920 INFO L273 TraceCheckUtils]: 35: Hoare triple {49310#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:33,920 INFO L273 TraceCheckUtils]: 36: Hoare triple {49311#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:33,921 INFO L273 TraceCheckUtils]: 37: Hoare triple {49311#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:33,921 INFO L273 TraceCheckUtils]: 38: Hoare triple {49311#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:33,922 INFO L273 TraceCheckUtils]: 39: Hoare triple {49312#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:33,922 INFO L273 TraceCheckUtils]: 40: Hoare triple {49312#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:33,923 INFO L273 TraceCheckUtils]: 41: Hoare triple {49312#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:33,924 INFO L273 TraceCheckUtils]: 42: Hoare triple {49313#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:33,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {49313#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:33,925 INFO L273 TraceCheckUtils]: 44: Hoare triple {49313#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:33,925 INFO L273 TraceCheckUtils]: 45: Hoare triple {49314#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:33,926 INFO L273 TraceCheckUtils]: 46: Hoare triple {49314#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:33,926 INFO L273 TraceCheckUtils]: 47: Hoare triple {49314#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:33,927 INFO L273 TraceCheckUtils]: 48: Hoare triple {49315#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:33,927 INFO L273 TraceCheckUtils]: 49: Hoare triple {49315#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:33,928 INFO L273 TraceCheckUtils]: 50: Hoare triple {49315#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:33,929 INFO L273 TraceCheckUtils]: 51: Hoare triple {49316#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:33,929 INFO L273 TraceCheckUtils]: 52: Hoare triple {49316#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:33,930 INFO L273 TraceCheckUtils]: 53: Hoare triple {49316#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:33,930 INFO L273 TraceCheckUtils]: 54: Hoare triple {49317#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:33,931 INFO L273 TraceCheckUtils]: 55: Hoare triple {49317#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:33,932 INFO L273 TraceCheckUtils]: 56: Hoare triple {49317#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:33,932 INFO L273 TraceCheckUtils]: 57: Hoare triple {49318#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:33,933 INFO L273 TraceCheckUtils]: 58: Hoare triple {49318#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:33,933 INFO L273 TraceCheckUtils]: 59: Hoare triple {49318#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:33,934 INFO L273 TraceCheckUtils]: 60: Hoare triple {49319#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:33,934 INFO L273 TraceCheckUtils]: 61: Hoare triple {49319#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:33,935 INFO L273 TraceCheckUtils]: 62: Hoare triple {49319#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:33,935 INFO L273 TraceCheckUtils]: 63: Hoare triple {49320#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:33,936 INFO L273 TraceCheckUtils]: 64: Hoare triple {49320#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:33,937 INFO L273 TraceCheckUtils]: 65: Hoare triple {49320#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:33,937 INFO L273 TraceCheckUtils]: 66: Hoare triple {49321#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:33,938 INFO L273 TraceCheckUtils]: 67: Hoare triple {49321#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:33,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {49321#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:33,939 INFO L273 TraceCheckUtils]: 69: Hoare triple {49322#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:33,939 INFO L273 TraceCheckUtils]: 70: Hoare triple {49322#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:33,940 INFO L273 TraceCheckUtils]: 71: Hoare triple {49322#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:33,941 INFO L273 TraceCheckUtils]: 72: Hoare triple {49323#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:33,941 INFO L273 TraceCheckUtils]: 73: Hoare triple {49323#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:33,942 INFO L273 TraceCheckUtils]: 74: Hoare triple {49323#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:33,942 INFO L273 TraceCheckUtils]: 75: Hoare triple {49324#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:33,943 INFO L273 TraceCheckUtils]: 76: Hoare triple {49324#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:33,943 INFO L273 TraceCheckUtils]: 77: Hoare triple {49324#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:33,944 INFO L273 TraceCheckUtils]: 78: Hoare triple {49325#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:33,944 INFO L273 TraceCheckUtils]: 79: Hoare triple {49325#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:33,945 INFO L273 TraceCheckUtils]: 80: Hoare triple {49325#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:33,946 INFO L273 TraceCheckUtils]: 81: Hoare triple {49326#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:33,946 INFO L273 TraceCheckUtils]: 82: Hoare triple {49326#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:33,947 INFO L273 TraceCheckUtils]: 83: Hoare triple {49326#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:33,947 INFO L273 TraceCheckUtils]: 84: Hoare triple {49327#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:33,948 INFO L273 TraceCheckUtils]: 85: Hoare triple {49327#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:33,948 INFO L273 TraceCheckUtils]: 86: Hoare triple {49327#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:33,949 INFO L273 TraceCheckUtils]: 87: Hoare triple {49328#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:33,949 INFO L273 TraceCheckUtils]: 88: Hoare triple {49328#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:33,950 INFO L273 TraceCheckUtils]: 89: Hoare triple {49328#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:33,951 INFO L273 TraceCheckUtils]: 90: Hoare triple {49329#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:33,951 INFO L273 TraceCheckUtils]: 91: Hoare triple {49329#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:33,952 INFO L273 TraceCheckUtils]: 92: Hoare triple {49329#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:33,952 INFO L273 TraceCheckUtils]: 93: Hoare triple {49330#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:33,953 INFO L273 TraceCheckUtils]: 94: Hoare triple {49330#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:33,954 INFO L273 TraceCheckUtils]: 95: Hoare triple {49330#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:33,954 INFO L273 TraceCheckUtils]: 96: Hoare triple {49331#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:33,955 INFO L273 TraceCheckUtils]: 97: Hoare triple {49331#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:33,955 INFO L273 TraceCheckUtils]: 98: Hoare triple {49331#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:33,956 INFO L273 TraceCheckUtils]: 99: Hoare triple {49332#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:33,956 INFO L273 TraceCheckUtils]: 100: Hoare triple {49332#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:33,957 INFO L273 TraceCheckUtils]: 101: Hoare triple {49332#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:33,957 INFO L273 TraceCheckUtils]: 102: Hoare triple {49333#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:33,958 INFO L273 TraceCheckUtils]: 103: Hoare triple {49333#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:33,959 INFO L273 TraceCheckUtils]: 104: Hoare triple {49333#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:33,959 INFO L273 TraceCheckUtils]: 105: Hoare triple {49334#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:33,960 INFO L273 TraceCheckUtils]: 106: Hoare triple {49334#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:33,960 INFO L273 TraceCheckUtils]: 107: Hoare triple {49334#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:33,961 INFO L273 TraceCheckUtils]: 108: Hoare triple {49335#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:33,961 INFO L273 TraceCheckUtils]: 109: Hoare triple {49335#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:33,962 INFO L273 TraceCheckUtils]: 110: Hoare triple {49335#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:33,963 INFO L273 TraceCheckUtils]: 111: Hoare triple {49336#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:33,963 INFO L273 TraceCheckUtils]: 112: Hoare triple {49336#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:33,964 INFO L273 TraceCheckUtils]: 113: Hoare triple {49336#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:33,964 INFO L273 TraceCheckUtils]: 114: Hoare triple {49337#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:33,965 INFO L273 TraceCheckUtils]: 115: Hoare triple {49337#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:33,965 INFO L273 TraceCheckUtils]: 116: Hoare triple {49337#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:33,966 INFO L273 TraceCheckUtils]: 117: Hoare triple {49338#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:33,966 INFO L273 TraceCheckUtils]: 118: Hoare triple {49338#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:33,967 INFO L273 TraceCheckUtils]: 119: Hoare triple {49338#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:33,968 INFO L273 TraceCheckUtils]: 120: Hoare triple {49339#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:33,968 INFO L273 TraceCheckUtils]: 121: Hoare triple {49339#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:33,969 INFO L273 TraceCheckUtils]: 122: Hoare triple {49339#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:33,969 INFO L273 TraceCheckUtils]: 123: Hoare triple {49340#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:33,970 INFO L273 TraceCheckUtils]: 124: Hoare triple {49340#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:33,971 INFO L273 TraceCheckUtils]: 125: Hoare triple {49340#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:33,971 INFO L273 TraceCheckUtils]: 126: Hoare triple {49341#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:33,972 INFO L273 TraceCheckUtils]: 127: Hoare triple {49341#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:33,972 INFO L273 TraceCheckUtils]: 128: Hoare triple {49341#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:33,973 INFO L273 TraceCheckUtils]: 129: Hoare triple {49342#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:33,973 INFO L273 TraceCheckUtils]: 130: Hoare triple {49342#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:33,974 INFO L273 TraceCheckUtils]: 131: Hoare triple {49342#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:33,975 INFO L273 TraceCheckUtils]: 132: Hoare triple {49343#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:33,975 INFO L273 TraceCheckUtils]: 133: Hoare triple {49343#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:33,976 INFO L273 TraceCheckUtils]: 134: Hoare triple {49343#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:33,976 INFO L273 TraceCheckUtils]: 135: Hoare triple {49344#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:33,977 INFO L273 TraceCheckUtils]: 136: Hoare triple {49344#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:33,977 INFO L273 TraceCheckUtils]: 137: Hoare triple {49344#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:33,978 INFO L273 TraceCheckUtils]: 138: Hoare triple {49345#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:33,978 INFO L273 TraceCheckUtils]: 139: Hoare triple {49345#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:33,979 INFO L273 TraceCheckUtils]: 140: Hoare triple {49345#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:33,980 INFO L273 TraceCheckUtils]: 141: Hoare triple {49346#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:33,980 INFO L273 TraceCheckUtils]: 142: Hoare triple {49346#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:33,981 INFO L273 TraceCheckUtils]: 143: Hoare triple {49346#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:33,981 INFO L273 TraceCheckUtils]: 144: Hoare triple {49347#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:33,982 INFO L273 TraceCheckUtils]: 145: Hoare triple {49347#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:33,983 INFO L273 TraceCheckUtils]: 146: Hoare triple {49347#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:33,983 INFO L273 TraceCheckUtils]: 147: Hoare triple {49348#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:33,984 INFO L273 TraceCheckUtils]: 148: Hoare triple {49348#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:33,984 INFO L273 TraceCheckUtils]: 149: Hoare triple {49348#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:33,985 INFO L273 TraceCheckUtils]: 150: Hoare triple {49349#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:33,985 INFO L273 TraceCheckUtils]: 151: Hoare triple {49349#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:33,986 INFO L273 TraceCheckUtils]: 152: Hoare triple {49349#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:33,986 INFO L273 TraceCheckUtils]: 153: Hoare triple {49350#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:33,987 INFO L273 TraceCheckUtils]: 154: Hoare triple {49350#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:33,988 INFO L273 TraceCheckUtils]: 155: Hoare triple {49350#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:33,988 INFO L273 TraceCheckUtils]: 156: Hoare triple {49351#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:33,989 INFO L273 TraceCheckUtils]: 157: Hoare triple {49351#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:33,989 INFO L273 TraceCheckUtils]: 158: Hoare triple {49351#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:33,990 INFO L273 TraceCheckUtils]: 159: Hoare triple {49352#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:33,990 INFO L273 TraceCheckUtils]: 160: Hoare triple {49352#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:33,991 INFO L273 TraceCheckUtils]: 161: Hoare triple {49352#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:33,992 INFO L273 TraceCheckUtils]: 162: Hoare triple {49353#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:33,992 INFO L273 TraceCheckUtils]: 163: Hoare triple {49353#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:33,993 INFO L273 TraceCheckUtils]: 164: Hoare triple {49353#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:33,993 INFO L273 TraceCheckUtils]: 165: Hoare triple {49354#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:33,994 INFO L273 TraceCheckUtils]: 166: Hoare triple {49354#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:33,994 INFO L273 TraceCheckUtils]: 167: Hoare triple {49354#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:33,995 INFO L273 TraceCheckUtils]: 168: Hoare triple {49355#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:33,995 INFO L273 TraceCheckUtils]: 169: Hoare triple {49355#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:33,996 INFO L273 TraceCheckUtils]: 170: Hoare triple {49355#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:33,997 INFO L273 TraceCheckUtils]: 171: Hoare triple {49356#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:33,997 INFO L273 TraceCheckUtils]: 172: Hoare triple {49356#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:33,998 INFO L273 TraceCheckUtils]: 173: Hoare triple {49356#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:33,998 INFO L273 TraceCheckUtils]: 174: Hoare triple {49357#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:33,999 INFO L273 TraceCheckUtils]: 175: Hoare triple {49357#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:33,999 INFO L273 TraceCheckUtils]: 176: Hoare triple {49357#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:34,000 INFO L273 TraceCheckUtils]: 177: Hoare triple {49358#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:34,001 INFO L273 TraceCheckUtils]: 178: Hoare triple {49358#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:34,001 INFO L273 TraceCheckUtils]: 179: Hoare triple {49358#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {49359#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:34,002 INFO L273 TraceCheckUtils]: 180: Hoare triple {49359#(<= main_~i~0 58)} assume !(~i~0 < 100000); {49300#false} is VALID [2018-11-23 12:07:34,002 INFO L273 TraceCheckUtils]: 181: Hoare triple {49300#false} havoc ~x~0;~x~0 := 0; {49300#false} is VALID [2018-11-23 12:07:34,002 INFO L273 TraceCheckUtils]: 182: Hoare triple {49300#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {49300#false} is VALID [2018-11-23 12:07:34,002 INFO L256 TraceCheckUtils]: 183: Hoare triple {49300#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {49300#false} is VALID [2018-11-23 12:07:34,003 INFO L273 TraceCheckUtils]: 184: Hoare triple {49300#false} ~cond := #in~cond; {49300#false} is VALID [2018-11-23 12:07:34,003 INFO L273 TraceCheckUtils]: 185: Hoare triple {49300#false} assume 0 == ~cond; {49300#false} is VALID [2018-11-23 12:07:34,003 INFO L273 TraceCheckUtils]: 186: Hoare triple {49300#false} assume !false; {49300#false} is VALID [2018-11-23 12:07:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:34,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:34,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:34,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:07:34,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:07:34,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:34,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:34,565 INFO L256 TraceCheckUtils]: 0: Hoare triple {49299#true} call ULTIMATE.init(); {49299#true} is VALID [2018-11-23 12:07:34,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {49299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49299#true} is VALID [2018-11-23 12:07:34,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {49299#true} assume true; {49299#true} is VALID [2018-11-23 12:07:34,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49299#true} {49299#true} #55#return; {49299#true} is VALID [2018-11-23 12:07:34,566 INFO L256 TraceCheckUtils]: 4: Hoare triple {49299#true} call #t~ret4 := main(); {49299#true} is VALID [2018-11-23 12:07:34,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {49299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {49378#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:34,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {49378#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49378#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:34,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {49378#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49378#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:34,568 INFO L273 TraceCheckUtils]: 8: Hoare triple {49378#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:34,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {49302#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:34,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {49302#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:34,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {49302#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:34,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {49303#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:34,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {49303#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:34,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {49303#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:34,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {49304#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:34,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {49304#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:34,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {49304#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:34,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {49305#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:34,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {49305#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:34,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {49305#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:34,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {49306#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:34,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {49306#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:34,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {49306#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:34,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {49307#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:34,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {49307#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:34,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {49307#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:34,578 INFO L273 TraceCheckUtils]: 27: Hoare triple {49308#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:34,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {49308#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:34,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {49308#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:34,580 INFO L273 TraceCheckUtils]: 30: Hoare triple {49309#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:34,580 INFO L273 TraceCheckUtils]: 31: Hoare triple {49309#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:34,581 INFO L273 TraceCheckUtils]: 32: Hoare triple {49309#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:34,582 INFO L273 TraceCheckUtils]: 33: Hoare triple {49310#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:34,582 INFO L273 TraceCheckUtils]: 34: Hoare triple {49310#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:34,583 INFO L273 TraceCheckUtils]: 35: Hoare triple {49310#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:34,583 INFO L273 TraceCheckUtils]: 36: Hoare triple {49311#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:34,584 INFO L273 TraceCheckUtils]: 37: Hoare triple {49311#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:34,584 INFO L273 TraceCheckUtils]: 38: Hoare triple {49311#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:34,585 INFO L273 TraceCheckUtils]: 39: Hoare triple {49312#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:34,585 INFO L273 TraceCheckUtils]: 40: Hoare triple {49312#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:34,586 INFO L273 TraceCheckUtils]: 41: Hoare triple {49312#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:34,587 INFO L273 TraceCheckUtils]: 42: Hoare triple {49313#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:34,587 INFO L273 TraceCheckUtils]: 43: Hoare triple {49313#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:34,588 INFO L273 TraceCheckUtils]: 44: Hoare triple {49313#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:34,588 INFO L273 TraceCheckUtils]: 45: Hoare triple {49314#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:34,589 INFO L273 TraceCheckUtils]: 46: Hoare triple {49314#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:34,590 INFO L273 TraceCheckUtils]: 47: Hoare triple {49314#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:34,590 INFO L273 TraceCheckUtils]: 48: Hoare triple {49315#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:34,591 INFO L273 TraceCheckUtils]: 49: Hoare triple {49315#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:34,591 INFO L273 TraceCheckUtils]: 50: Hoare triple {49315#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:34,592 INFO L273 TraceCheckUtils]: 51: Hoare triple {49316#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:34,592 INFO L273 TraceCheckUtils]: 52: Hoare triple {49316#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:34,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {49316#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:34,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {49317#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:34,594 INFO L273 TraceCheckUtils]: 55: Hoare triple {49317#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:34,595 INFO L273 TraceCheckUtils]: 56: Hoare triple {49317#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:34,595 INFO L273 TraceCheckUtils]: 57: Hoare triple {49318#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:34,596 INFO L273 TraceCheckUtils]: 58: Hoare triple {49318#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:34,596 INFO L273 TraceCheckUtils]: 59: Hoare triple {49318#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:34,597 INFO L273 TraceCheckUtils]: 60: Hoare triple {49319#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:34,597 INFO L273 TraceCheckUtils]: 61: Hoare triple {49319#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:34,598 INFO L273 TraceCheckUtils]: 62: Hoare triple {49319#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:34,599 INFO L273 TraceCheckUtils]: 63: Hoare triple {49320#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:34,599 INFO L273 TraceCheckUtils]: 64: Hoare triple {49320#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:34,600 INFO L273 TraceCheckUtils]: 65: Hoare triple {49320#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:34,600 INFO L273 TraceCheckUtils]: 66: Hoare triple {49321#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:34,601 INFO L273 TraceCheckUtils]: 67: Hoare triple {49321#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:34,602 INFO L273 TraceCheckUtils]: 68: Hoare triple {49321#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:34,602 INFO L273 TraceCheckUtils]: 69: Hoare triple {49322#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:34,603 INFO L273 TraceCheckUtils]: 70: Hoare triple {49322#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:34,603 INFO L273 TraceCheckUtils]: 71: Hoare triple {49322#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:34,604 INFO L273 TraceCheckUtils]: 72: Hoare triple {49323#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:34,604 INFO L273 TraceCheckUtils]: 73: Hoare triple {49323#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:34,605 INFO L273 TraceCheckUtils]: 74: Hoare triple {49323#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:34,605 INFO L273 TraceCheckUtils]: 75: Hoare triple {49324#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:34,606 INFO L273 TraceCheckUtils]: 76: Hoare triple {49324#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:34,607 INFO L273 TraceCheckUtils]: 77: Hoare triple {49324#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:34,607 INFO L273 TraceCheckUtils]: 78: Hoare triple {49325#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:34,608 INFO L273 TraceCheckUtils]: 79: Hoare triple {49325#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:34,608 INFO L273 TraceCheckUtils]: 80: Hoare triple {49325#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:34,609 INFO L273 TraceCheckUtils]: 81: Hoare triple {49326#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:34,609 INFO L273 TraceCheckUtils]: 82: Hoare triple {49326#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:34,610 INFO L273 TraceCheckUtils]: 83: Hoare triple {49326#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:34,611 INFO L273 TraceCheckUtils]: 84: Hoare triple {49327#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:34,611 INFO L273 TraceCheckUtils]: 85: Hoare triple {49327#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:34,612 INFO L273 TraceCheckUtils]: 86: Hoare triple {49327#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:34,612 INFO L273 TraceCheckUtils]: 87: Hoare triple {49328#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:34,613 INFO L273 TraceCheckUtils]: 88: Hoare triple {49328#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:34,613 INFO L273 TraceCheckUtils]: 89: Hoare triple {49328#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:34,614 INFO L273 TraceCheckUtils]: 90: Hoare triple {49329#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:34,614 INFO L273 TraceCheckUtils]: 91: Hoare triple {49329#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:34,615 INFO L273 TraceCheckUtils]: 92: Hoare triple {49329#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:34,616 INFO L273 TraceCheckUtils]: 93: Hoare triple {49330#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:34,616 INFO L273 TraceCheckUtils]: 94: Hoare triple {49330#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:34,617 INFO L273 TraceCheckUtils]: 95: Hoare triple {49330#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:34,617 INFO L273 TraceCheckUtils]: 96: Hoare triple {49331#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:34,618 INFO L273 TraceCheckUtils]: 97: Hoare triple {49331#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:34,619 INFO L273 TraceCheckUtils]: 98: Hoare triple {49331#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:34,619 INFO L273 TraceCheckUtils]: 99: Hoare triple {49332#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:34,620 INFO L273 TraceCheckUtils]: 100: Hoare triple {49332#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:34,620 INFO L273 TraceCheckUtils]: 101: Hoare triple {49332#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:34,621 INFO L273 TraceCheckUtils]: 102: Hoare triple {49333#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:34,621 INFO L273 TraceCheckUtils]: 103: Hoare triple {49333#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:34,622 INFO L273 TraceCheckUtils]: 104: Hoare triple {49333#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:34,623 INFO L273 TraceCheckUtils]: 105: Hoare triple {49334#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:34,623 INFO L273 TraceCheckUtils]: 106: Hoare triple {49334#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:34,624 INFO L273 TraceCheckUtils]: 107: Hoare triple {49334#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:34,624 INFO L273 TraceCheckUtils]: 108: Hoare triple {49335#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:34,625 INFO L273 TraceCheckUtils]: 109: Hoare triple {49335#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:34,625 INFO L273 TraceCheckUtils]: 110: Hoare triple {49335#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:34,626 INFO L273 TraceCheckUtils]: 111: Hoare triple {49336#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:34,626 INFO L273 TraceCheckUtils]: 112: Hoare triple {49336#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:34,627 INFO L273 TraceCheckUtils]: 113: Hoare triple {49336#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:34,628 INFO L273 TraceCheckUtils]: 114: Hoare triple {49337#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:34,628 INFO L273 TraceCheckUtils]: 115: Hoare triple {49337#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:34,629 INFO L273 TraceCheckUtils]: 116: Hoare triple {49337#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:34,629 INFO L273 TraceCheckUtils]: 117: Hoare triple {49338#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:34,630 INFO L273 TraceCheckUtils]: 118: Hoare triple {49338#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:34,631 INFO L273 TraceCheckUtils]: 119: Hoare triple {49338#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:34,631 INFO L273 TraceCheckUtils]: 120: Hoare triple {49339#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:34,632 INFO L273 TraceCheckUtils]: 121: Hoare triple {49339#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:34,632 INFO L273 TraceCheckUtils]: 122: Hoare triple {49339#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:34,633 INFO L273 TraceCheckUtils]: 123: Hoare triple {49340#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:34,633 INFO L273 TraceCheckUtils]: 124: Hoare triple {49340#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:34,634 INFO L273 TraceCheckUtils]: 125: Hoare triple {49340#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:34,634 INFO L273 TraceCheckUtils]: 126: Hoare triple {49341#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:34,635 INFO L273 TraceCheckUtils]: 127: Hoare triple {49341#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:34,636 INFO L273 TraceCheckUtils]: 128: Hoare triple {49341#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:34,636 INFO L273 TraceCheckUtils]: 129: Hoare triple {49342#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:34,637 INFO L273 TraceCheckUtils]: 130: Hoare triple {49342#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:34,637 INFO L273 TraceCheckUtils]: 131: Hoare triple {49342#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:34,638 INFO L273 TraceCheckUtils]: 132: Hoare triple {49343#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:34,638 INFO L273 TraceCheckUtils]: 133: Hoare triple {49343#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:34,639 INFO L273 TraceCheckUtils]: 134: Hoare triple {49343#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:34,640 INFO L273 TraceCheckUtils]: 135: Hoare triple {49344#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:34,640 INFO L273 TraceCheckUtils]: 136: Hoare triple {49344#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:34,641 INFO L273 TraceCheckUtils]: 137: Hoare triple {49344#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:34,641 INFO L273 TraceCheckUtils]: 138: Hoare triple {49345#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:34,642 INFO L273 TraceCheckUtils]: 139: Hoare triple {49345#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:34,643 INFO L273 TraceCheckUtils]: 140: Hoare triple {49345#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:34,643 INFO L273 TraceCheckUtils]: 141: Hoare triple {49346#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:34,644 INFO L273 TraceCheckUtils]: 142: Hoare triple {49346#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:34,644 INFO L273 TraceCheckUtils]: 143: Hoare triple {49346#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:34,645 INFO L273 TraceCheckUtils]: 144: Hoare triple {49347#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:34,645 INFO L273 TraceCheckUtils]: 145: Hoare triple {49347#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:34,646 INFO L273 TraceCheckUtils]: 146: Hoare triple {49347#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:34,646 INFO L273 TraceCheckUtils]: 147: Hoare triple {49348#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:34,647 INFO L273 TraceCheckUtils]: 148: Hoare triple {49348#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:34,648 INFO L273 TraceCheckUtils]: 149: Hoare triple {49348#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:34,648 INFO L273 TraceCheckUtils]: 150: Hoare triple {49349#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:34,649 INFO L273 TraceCheckUtils]: 151: Hoare triple {49349#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:34,649 INFO L273 TraceCheckUtils]: 152: Hoare triple {49349#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:34,650 INFO L273 TraceCheckUtils]: 153: Hoare triple {49350#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:34,650 INFO L273 TraceCheckUtils]: 154: Hoare triple {49350#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:34,651 INFO L273 TraceCheckUtils]: 155: Hoare triple {49350#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:34,652 INFO L273 TraceCheckUtils]: 156: Hoare triple {49351#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:34,652 INFO L273 TraceCheckUtils]: 157: Hoare triple {49351#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:34,653 INFO L273 TraceCheckUtils]: 158: Hoare triple {49351#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:34,653 INFO L273 TraceCheckUtils]: 159: Hoare triple {49352#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:34,654 INFO L273 TraceCheckUtils]: 160: Hoare triple {49352#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:34,654 INFO L273 TraceCheckUtils]: 161: Hoare triple {49352#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:34,655 INFO L273 TraceCheckUtils]: 162: Hoare triple {49353#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:34,655 INFO L273 TraceCheckUtils]: 163: Hoare triple {49353#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:34,656 INFO L273 TraceCheckUtils]: 164: Hoare triple {49353#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:34,657 INFO L273 TraceCheckUtils]: 165: Hoare triple {49354#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:34,657 INFO L273 TraceCheckUtils]: 166: Hoare triple {49354#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:34,658 INFO L273 TraceCheckUtils]: 167: Hoare triple {49354#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:34,658 INFO L273 TraceCheckUtils]: 168: Hoare triple {49355#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:34,659 INFO L273 TraceCheckUtils]: 169: Hoare triple {49355#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:34,660 INFO L273 TraceCheckUtils]: 170: Hoare triple {49355#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:34,660 INFO L273 TraceCheckUtils]: 171: Hoare triple {49356#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:34,661 INFO L273 TraceCheckUtils]: 172: Hoare triple {49356#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:34,661 INFO L273 TraceCheckUtils]: 173: Hoare triple {49356#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:34,662 INFO L273 TraceCheckUtils]: 174: Hoare triple {49357#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:34,662 INFO L273 TraceCheckUtils]: 175: Hoare triple {49357#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:34,663 INFO L273 TraceCheckUtils]: 176: Hoare triple {49357#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:34,664 INFO L273 TraceCheckUtils]: 177: Hoare triple {49358#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:34,664 INFO L273 TraceCheckUtils]: 178: Hoare triple {49358#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:34,665 INFO L273 TraceCheckUtils]: 179: Hoare triple {49358#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {49359#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:34,665 INFO L273 TraceCheckUtils]: 180: Hoare triple {49359#(<= main_~i~0 58)} assume !(~i~0 < 100000); {49300#false} is VALID [2018-11-23 12:07:34,666 INFO L273 TraceCheckUtils]: 181: Hoare triple {49300#false} havoc ~x~0;~x~0 := 0; {49300#false} is VALID [2018-11-23 12:07:34,666 INFO L273 TraceCheckUtils]: 182: Hoare triple {49300#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {49300#false} is VALID [2018-11-23 12:07:34,666 INFO L256 TraceCheckUtils]: 183: Hoare triple {49300#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {49300#false} is VALID [2018-11-23 12:07:34,666 INFO L273 TraceCheckUtils]: 184: Hoare triple {49300#false} ~cond := #in~cond; {49300#false} is VALID [2018-11-23 12:07:34,666 INFO L273 TraceCheckUtils]: 185: Hoare triple {49300#false} assume 0 == ~cond; {49300#false} is VALID [2018-11-23 12:07:34,666 INFO L273 TraceCheckUtils]: 186: Hoare triple {49300#false} assume !false; {49300#false} is VALID [2018-11-23 12:07:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:34,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:34,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2018-11-23 12:07:34,708 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 187 [2018-11-23 12:07:34,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:34,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2018-11-23 12:07:34,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:34,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-23 12:07:34,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-23 12:07:34,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 12:07:34,951 INFO L87 Difference]: Start difference. First operand 192 states and 251 transitions. Second operand 62 states. [2018-11-23 12:07:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:36,410 INFO L93 Difference]: Finished difference Result 208 states and 270 transitions. [2018-11-23 12:07:36,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-23 12:07:36,410 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 187 [2018-11-23 12:07:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:07:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 270 transitions. [2018-11-23 12:07:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:07:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 270 transitions. [2018-11-23 12:07:36,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 270 transitions. [2018-11-23 12:07:36,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:36,673 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:07:36,674 INFO L226 Difference]: Without dead ends: 197 [2018-11-23 12:07:36,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 12:07:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-23 12:07:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-11-23 12:07:36,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:36,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 195 states. [2018-11-23 12:07:36,869 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 195 states. [2018-11-23 12:07:36,869 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 195 states. [2018-11-23 12:07:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:36,873 INFO L93 Difference]: Finished difference Result 197 states and 258 transitions. [2018-11-23 12:07:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2018-11-23 12:07:36,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:36,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:36,874 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 197 states. [2018-11-23 12:07:36,874 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 197 states. [2018-11-23 12:07:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:36,877 INFO L93 Difference]: Finished difference Result 197 states and 258 transitions. [2018-11-23 12:07:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2018-11-23 12:07:36,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:36,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:36,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:36,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-23 12:07:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2018-11-23 12:07:36,880 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 187 [2018-11-23 12:07:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:36,880 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2018-11-23 12:07:36,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-23 12:07:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2018-11-23 12:07:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 12:07:36,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:36,881 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:36,881 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:36,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:36,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1983237085, now seen corresponding path program 59 times [2018-11-23 12:07:36,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:36,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:36,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:36,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:36,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:38,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {50855#true} call ULTIMATE.init(); {50855#true} is VALID [2018-11-23 12:07:38,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {50855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50855#true} is VALID [2018-11-23 12:07:38,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {50855#true} assume true; {50855#true} is VALID [2018-11-23 12:07:38,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50855#true} {50855#true} #55#return; {50855#true} is VALID [2018-11-23 12:07:38,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {50855#true} call #t~ret4 := main(); {50855#true} is VALID [2018-11-23 12:07:38,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {50855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {50857#(= main_~i~0 0)} is VALID [2018-11-23 12:07:38,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {50857#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50857#(= main_~i~0 0)} is VALID [2018-11-23 12:07:38,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {50857#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50857#(= main_~i~0 0)} is VALID [2018-11-23 12:07:38,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {50857#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:38,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {50858#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:38,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {50858#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:38,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {50858#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:38,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {50859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:38,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {50859#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:38,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {50859#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:38,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {50860#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:38,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {50860#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:38,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {50860#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:38,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {50861#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:38,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {50861#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:38,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {50861#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:38,620 INFO L273 TraceCheckUtils]: 21: Hoare triple {50862#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:38,621 INFO L273 TraceCheckUtils]: 22: Hoare triple {50862#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:38,621 INFO L273 TraceCheckUtils]: 23: Hoare triple {50862#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:38,622 INFO L273 TraceCheckUtils]: 24: Hoare triple {50863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:38,622 INFO L273 TraceCheckUtils]: 25: Hoare triple {50863#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:38,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {50863#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:38,624 INFO L273 TraceCheckUtils]: 27: Hoare triple {50864#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:38,624 INFO L273 TraceCheckUtils]: 28: Hoare triple {50864#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:38,625 INFO L273 TraceCheckUtils]: 29: Hoare triple {50864#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:38,625 INFO L273 TraceCheckUtils]: 30: Hoare triple {50865#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:38,626 INFO L273 TraceCheckUtils]: 31: Hoare triple {50865#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:38,627 INFO L273 TraceCheckUtils]: 32: Hoare triple {50865#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:38,627 INFO L273 TraceCheckUtils]: 33: Hoare triple {50866#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:38,628 INFO L273 TraceCheckUtils]: 34: Hoare triple {50866#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:38,628 INFO L273 TraceCheckUtils]: 35: Hoare triple {50866#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:38,629 INFO L273 TraceCheckUtils]: 36: Hoare triple {50867#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:38,629 INFO L273 TraceCheckUtils]: 37: Hoare triple {50867#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:38,630 INFO L273 TraceCheckUtils]: 38: Hoare triple {50867#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:38,631 INFO L273 TraceCheckUtils]: 39: Hoare triple {50868#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:38,631 INFO L273 TraceCheckUtils]: 40: Hoare triple {50868#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:38,632 INFO L273 TraceCheckUtils]: 41: Hoare triple {50868#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:38,632 INFO L273 TraceCheckUtils]: 42: Hoare triple {50869#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:38,633 INFO L273 TraceCheckUtils]: 43: Hoare triple {50869#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:38,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {50869#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:38,634 INFO L273 TraceCheckUtils]: 45: Hoare triple {50870#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:38,634 INFO L273 TraceCheckUtils]: 46: Hoare triple {50870#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:38,635 INFO L273 TraceCheckUtils]: 47: Hoare triple {50870#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:38,636 INFO L273 TraceCheckUtils]: 48: Hoare triple {50871#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:38,636 INFO L273 TraceCheckUtils]: 49: Hoare triple {50871#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:38,637 INFO L273 TraceCheckUtils]: 50: Hoare triple {50871#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:38,637 INFO L273 TraceCheckUtils]: 51: Hoare triple {50872#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:38,638 INFO L273 TraceCheckUtils]: 52: Hoare triple {50872#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:38,639 INFO L273 TraceCheckUtils]: 53: Hoare triple {50872#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:38,639 INFO L273 TraceCheckUtils]: 54: Hoare triple {50873#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:38,640 INFO L273 TraceCheckUtils]: 55: Hoare triple {50873#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:38,640 INFO L273 TraceCheckUtils]: 56: Hoare triple {50873#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:38,641 INFO L273 TraceCheckUtils]: 57: Hoare triple {50874#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:38,641 INFO L273 TraceCheckUtils]: 58: Hoare triple {50874#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:38,642 INFO L273 TraceCheckUtils]: 59: Hoare triple {50874#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:38,643 INFO L273 TraceCheckUtils]: 60: Hoare triple {50875#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:38,643 INFO L273 TraceCheckUtils]: 61: Hoare triple {50875#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:38,644 INFO L273 TraceCheckUtils]: 62: Hoare triple {50875#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:38,644 INFO L273 TraceCheckUtils]: 63: Hoare triple {50876#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:38,645 INFO L273 TraceCheckUtils]: 64: Hoare triple {50876#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:38,645 INFO L273 TraceCheckUtils]: 65: Hoare triple {50876#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:38,646 INFO L273 TraceCheckUtils]: 66: Hoare triple {50877#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:38,646 INFO L273 TraceCheckUtils]: 67: Hoare triple {50877#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:38,647 INFO L273 TraceCheckUtils]: 68: Hoare triple {50877#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:38,648 INFO L273 TraceCheckUtils]: 69: Hoare triple {50878#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:38,648 INFO L273 TraceCheckUtils]: 70: Hoare triple {50878#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:38,649 INFO L273 TraceCheckUtils]: 71: Hoare triple {50878#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:38,649 INFO L273 TraceCheckUtils]: 72: Hoare triple {50879#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:38,650 INFO L273 TraceCheckUtils]: 73: Hoare triple {50879#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:38,651 INFO L273 TraceCheckUtils]: 74: Hoare triple {50879#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:38,651 INFO L273 TraceCheckUtils]: 75: Hoare triple {50880#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:38,652 INFO L273 TraceCheckUtils]: 76: Hoare triple {50880#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:38,652 INFO L273 TraceCheckUtils]: 77: Hoare triple {50880#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:38,653 INFO L273 TraceCheckUtils]: 78: Hoare triple {50881#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:38,653 INFO L273 TraceCheckUtils]: 79: Hoare triple {50881#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:38,654 INFO L273 TraceCheckUtils]: 80: Hoare triple {50881#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:38,655 INFO L273 TraceCheckUtils]: 81: Hoare triple {50882#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:38,655 INFO L273 TraceCheckUtils]: 82: Hoare triple {50882#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:38,656 INFO L273 TraceCheckUtils]: 83: Hoare triple {50882#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:38,656 INFO L273 TraceCheckUtils]: 84: Hoare triple {50883#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:38,657 INFO L273 TraceCheckUtils]: 85: Hoare triple {50883#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:38,658 INFO L273 TraceCheckUtils]: 86: Hoare triple {50883#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:38,658 INFO L273 TraceCheckUtils]: 87: Hoare triple {50884#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:38,659 INFO L273 TraceCheckUtils]: 88: Hoare triple {50884#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:38,659 INFO L273 TraceCheckUtils]: 89: Hoare triple {50884#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:38,660 INFO L273 TraceCheckUtils]: 90: Hoare triple {50885#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:38,660 INFO L273 TraceCheckUtils]: 91: Hoare triple {50885#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:38,661 INFO L273 TraceCheckUtils]: 92: Hoare triple {50885#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:38,661 INFO L273 TraceCheckUtils]: 93: Hoare triple {50886#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:38,662 INFO L273 TraceCheckUtils]: 94: Hoare triple {50886#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:38,663 INFO L273 TraceCheckUtils]: 95: Hoare triple {50886#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:38,663 INFO L273 TraceCheckUtils]: 96: Hoare triple {50887#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:38,664 INFO L273 TraceCheckUtils]: 97: Hoare triple {50887#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:38,664 INFO L273 TraceCheckUtils]: 98: Hoare triple {50887#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:38,665 INFO L273 TraceCheckUtils]: 99: Hoare triple {50888#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:38,665 INFO L273 TraceCheckUtils]: 100: Hoare triple {50888#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:38,666 INFO L273 TraceCheckUtils]: 101: Hoare triple {50888#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:38,667 INFO L273 TraceCheckUtils]: 102: Hoare triple {50889#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:38,667 INFO L273 TraceCheckUtils]: 103: Hoare triple {50889#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:38,668 INFO L273 TraceCheckUtils]: 104: Hoare triple {50889#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:38,668 INFO L273 TraceCheckUtils]: 105: Hoare triple {50890#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:38,669 INFO L273 TraceCheckUtils]: 106: Hoare triple {50890#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:38,670 INFO L273 TraceCheckUtils]: 107: Hoare triple {50890#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:38,670 INFO L273 TraceCheckUtils]: 108: Hoare triple {50891#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:38,671 INFO L273 TraceCheckUtils]: 109: Hoare triple {50891#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:38,671 INFO L273 TraceCheckUtils]: 110: Hoare triple {50891#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:38,672 INFO L273 TraceCheckUtils]: 111: Hoare triple {50892#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:38,672 INFO L273 TraceCheckUtils]: 112: Hoare triple {50892#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:38,673 INFO L273 TraceCheckUtils]: 113: Hoare triple {50892#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:38,673 INFO L273 TraceCheckUtils]: 114: Hoare triple {50893#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:38,674 INFO L273 TraceCheckUtils]: 115: Hoare triple {50893#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:38,675 INFO L273 TraceCheckUtils]: 116: Hoare triple {50893#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:38,675 INFO L273 TraceCheckUtils]: 117: Hoare triple {50894#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:38,676 INFO L273 TraceCheckUtils]: 118: Hoare triple {50894#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:38,676 INFO L273 TraceCheckUtils]: 119: Hoare triple {50894#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:38,677 INFO L273 TraceCheckUtils]: 120: Hoare triple {50895#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:38,677 INFO L273 TraceCheckUtils]: 121: Hoare triple {50895#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:38,678 INFO L273 TraceCheckUtils]: 122: Hoare triple {50895#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:38,679 INFO L273 TraceCheckUtils]: 123: Hoare triple {50896#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:38,679 INFO L273 TraceCheckUtils]: 124: Hoare triple {50896#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:38,680 INFO L273 TraceCheckUtils]: 125: Hoare triple {50896#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:38,680 INFO L273 TraceCheckUtils]: 126: Hoare triple {50897#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:38,681 INFO L273 TraceCheckUtils]: 127: Hoare triple {50897#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:38,682 INFO L273 TraceCheckUtils]: 128: Hoare triple {50897#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:38,682 INFO L273 TraceCheckUtils]: 129: Hoare triple {50898#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:38,683 INFO L273 TraceCheckUtils]: 130: Hoare triple {50898#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:38,683 INFO L273 TraceCheckUtils]: 131: Hoare triple {50898#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:38,684 INFO L273 TraceCheckUtils]: 132: Hoare triple {50899#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:38,684 INFO L273 TraceCheckUtils]: 133: Hoare triple {50899#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:38,685 INFO L273 TraceCheckUtils]: 134: Hoare triple {50899#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:38,685 INFO L273 TraceCheckUtils]: 135: Hoare triple {50900#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:38,686 INFO L273 TraceCheckUtils]: 136: Hoare triple {50900#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:38,687 INFO L273 TraceCheckUtils]: 137: Hoare triple {50900#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:38,687 INFO L273 TraceCheckUtils]: 138: Hoare triple {50901#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:38,688 INFO L273 TraceCheckUtils]: 139: Hoare triple {50901#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:38,688 INFO L273 TraceCheckUtils]: 140: Hoare triple {50901#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:38,689 INFO L273 TraceCheckUtils]: 141: Hoare triple {50902#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:38,689 INFO L273 TraceCheckUtils]: 142: Hoare triple {50902#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:38,690 INFO L273 TraceCheckUtils]: 143: Hoare triple {50902#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:38,691 INFO L273 TraceCheckUtils]: 144: Hoare triple {50903#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:38,691 INFO L273 TraceCheckUtils]: 145: Hoare triple {50903#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:38,692 INFO L273 TraceCheckUtils]: 146: Hoare triple {50903#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:38,692 INFO L273 TraceCheckUtils]: 147: Hoare triple {50904#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:38,693 INFO L273 TraceCheckUtils]: 148: Hoare triple {50904#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:38,694 INFO L273 TraceCheckUtils]: 149: Hoare triple {50904#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:38,694 INFO L273 TraceCheckUtils]: 150: Hoare triple {50905#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:38,695 INFO L273 TraceCheckUtils]: 151: Hoare triple {50905#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:38,695 INFO L273 TraceCheckUtils]: 152: Hoare triple {50905#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:38,696 INFO L273 TraceCheckUtils]: 153: Hoare triple {50906#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:38,696 INFO L273 TraceCheckUtils]: 154: Hoare triple {50906#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:38,697 INFO L273 TraceCheckUtils]: 155: Hoare triple {50906#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:38,697 INFO L273 TraceCheckUtils]: 156: Hoare triple {50907#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:38,698 INFO L273 TraceCheckUtils]: 157: Hoare triple {50907#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:38,699 INFO L273 TraceCheckUtils]: 158: Hoare triple {50907#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:38,699 INFO L273 TraceCheckUtils]: 159: Hoare triple {50908#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:38,700 INFO L273 TraceCheckUtils]: 160: Hoare triple {50908#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:38,700 INFO L273 TraceCheckUtils]: 161: Hoare triple {50908#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:38,701 INFO L273 TraceCheckUtils]: 162: Hoare triple {50909#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:38,701 INFO L273 TraceCheckUtils]: 163: Hoare triple {50909#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:38,702 INFO L273 TraceCheckUtils]: 164: Hoare triple {50909#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:38,703 INFO L273 TraceCheckUtils]: 165: Hoare triple {50910#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:38,703 INFO L273 TraceCheckUtils]: 166: Hoare triple {50910#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:38,704 INFO L273 TraceCheckUtils]: 167: Hoare triple {50910#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:38,704 INFO L273 TraceCheckUtils]: 168: Hoare triple {50911#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:38,705 INFO L273 TraceCheckUtils]: 169: Hoare triple {50911#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:38,706 INFO L273 TraceCheckUtils]: 170: Hoare triple {50911#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:38,706 INFO L273 TraceCheckUtils]: 171: Hoare triple {50912#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:38,707 INFO L273 TraceCheckUtils]: 172: Hoare triple {50912#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:38,707 INFO L273 TraceCheckUtils]: 173: Hoare triple {50912#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:38,708 INFO L273 TraceCheckUtils]: 174: Hoare triple {50913#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:38,708 INFO L273 TraceCheckUtils]: 175: Hoare triple {50913#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:38,709 INFO L273 TraceCheckUtils]: 176: Hoare triple {50913#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:38,709 INFO L273 TraceCheckUtils]: 177: Hoare triple {50914#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:38,710 INFO L273 TraceCheckUtils]: 178: Hoare triple {50914#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:38,711 INFO L273 TraceCheckUtils]: 179: Hoare triple {50914#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:38,711 INFO L273 TraceCheckUtils]: 180: Hoare triple {50915#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:38,712 INFO L273 TraceCheckUtils]: 181: Hoare triple {50915#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:38,712 INFO L273 TraceCheckUtils]: 182: Hoare triple {50915#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {50916#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:38,713 INFO L273 TraceCheckUtils]: 183: Hoare triple {50916#(<= main_~i~0 59)} assume !(~i~0 < 100000); {50856#false} is VALID [2018-11-23 12:07:38,713 INFO L273 TraceCheckUtils]: 184: Hoare triple {50856#false} havoc ~x~0;~x~0 := 0; {50856#false} is VALID [2018-11-23 12:07:38,713 INFO L273 TraceCheckUtils]: 185: Hoare triple {50856#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {50856#false} is VALID [2018-11-23 12:07:38,714 INFO L256 TraceCheckUtils]: 186: Hoare triple {50856#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {50856#false} is VALID [2018-11-23 12:07:38,714 INFO L273 TraceCheckUtils]: 187: Hoare triple {50856#false} ~cond := #in~cond; {50856#false} is VALID [2018-11-23 12:07:38,714 INFO L273 TraceCheckUtils]: 188: Hoare triple {50856#false} assume 0 == ~cond; {50856#false} is VALID [2018-11-23 12:07:38,714 INFO L273 TraceCheckUtils]: 189: Hoare triple {50856#false} assume !false; {50856#false} is VALID [2018-11-23 12:07:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:38,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:38,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:38,745 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:07:38,924 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-11-23 12:07:38,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:38,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:39,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {50855#true} call ULTIMATE.init(); {50855#true} is VALID [2018-11-23 12:07:39,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {50855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50855#true} is VALID [2018-11-23 12:07:39,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {50855#true} assume true; {50855#true} is VALID [2018-11-23 12:07:39,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50855#true} {50855#true} #55#return; {50855#true} is VALID [2018-11-23 12:07:39,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {50855#true} call #t~ret4 := main(); {50855#true} is VALID [2018-11-23 12:07:39,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {50855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {50935#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:39,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {50935#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50935#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:39,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {50935#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50935#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:39,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {50935#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:39,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {50858#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:39,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {50858#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:39,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {50858#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:39,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {50859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:39,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {50859#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:39,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {50859#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:39,429 INFO L273 TraceCheckUtils]: 15: Hoare triple {50860#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:39,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {50860#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:39,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {50860#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:39,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {50861#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:39,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {50861#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:39,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {50861#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:39,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {50862#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:39,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {50862#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:39,434 INFO L273 TraceCheckUtils]: 23: Hoare triple {50862#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:39,434 INFO L273 TraceCheckUtils]: 24: Hoare triple {50863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:39,435 INFO L273 TraceCheckUtils]: 25: Hoare triple {50863#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:39,435 INFO L273 TraceCheckUtils]: 26: Hoare triple {50863#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:39,436 INFO L273 TraceCheckUtils]: 27: Hoare triple {50864#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:39,436 INFO L273 TraceCheckUtils]: 28: Hoare triple {50864#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:39,437 INFO L273 TraceCheckUtils]: 29: Hoare triple {50864#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:39,437 INFO L273 TraceCheckUtils]: 30: Hoare triple {50865#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:39,438 INFO L273 TraceCheckUtils]: 31: Hoare triple {50865#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:39,439 INFO L273 TraceCheckUtils]: 32: Hoare triple {50865#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:39,439 INFO L273 TraceCheckUtils]: 33: Hoare triple {50866#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:39,440 INFO L273 TraceCheckUtils]: 34: Hoare triple {50866#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:39,440 INFO L273 TraceCheckUtils]: 35: Hoare triple {50866#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:39,441 INFO L273 TraceCheckUtils]: 36: Hoare triple {50867#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:39,441 INFO L273 TraceCheckUtils]: 37: Hoare triple {50867#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:39,442 INFO L273 TraceCheckUtils]: 38: Hoare triple {50867#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:39,443 INFO L273 TraceCheckUtils]: 39: Hoare triple {50868#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:39,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {50868#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:39,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {50868#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:39,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {50869#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:39,445 INFO L273 TraceCheckUtils]: 43: Hoare triple {50869#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:39,445 INFO L273 TraceCheckUtils]: 44: Hoare triple {50869#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:39,446 INFO L273 TraceCheckUtils]: 45: Hoare triple {50870#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:39,446 INFO L273 TraceCheckUtils]: 46: Hoare triple {50870#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:39,447 INFO L273 TraceCheckUtils]: 47: Hoare triple {50870#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:39,448 INFO L273 TraceCheckUtils]: 48: Hoare triple {50871#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:39,448 INFO L273 TraceCheckUtils]: 49: Hoare triple {50871#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:39,449 INFO L273 TraceCheckUtils]: 50: Hoare triple {50871#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:39,449 INFO L273 TraceCheckUtils]: 51: Hoare triple {50872#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:39,450 INFO L273 TraceCheckUtils]: 52: Hoare triple {50872#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:39,451 INFO L273 TraceCheckUtils]: 53: Hoare triple {50872#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:39,451 INFO L273 TraceCheckUtils]: 54: Hoare triple {50873#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:39,452 INFO L273 TraceCheckUtils]: 55: Hoare triple {50873#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:39,452 INFO L273 TraceCheckUtils]: 56: Hoare triple {50873#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:39,453 INFO L273 TraceCheckUtils]: 57: Hoare triple {50874#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:39,453 INFO L273 TraceCheckUtils]: 58: Hoare triple {50874#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:39,454 INFO L273 TraceCheckUtils]: 59: Hoare triple {50874#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:39,455 INFO L273 TraceCheckUtils]: 60: Hoare triple {50875#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:39,455 INFO L273 TraceCheckUtils]: 61: Hoare triple {50875#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:39,456 INFO L273 TraceCheckUtils]: 62: Hoare triple {50875#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:39,456 INFO L273 TraceCheckUtils]: 63: Hoare triple {50876#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:39,457 INFO L273 TraceCheckUtils]: 64: Hoare triple {50876#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:39,457 INFO L273 TraceCheckUtils]: 65: Hoare triple {50876#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:39,458 INFO L273 TraceCheckUtils]: 66: Hoare triple {50877#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:39,458 INFO L273 TraceCheckUtils]: 67: Hoare triple {50877#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:39,459 INFO L273 TraceCheckUtils]: 68: Hoare triple {50877#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:39,460 INFO L273 TraceCheckUtils]: 69: Hoare triple {50878#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:39,460 INFO L273 TraceCheckUtils]: 70: Hoare triple {50878#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:39,461 INFO L273 TraceCheckUtils]: 71: Hoare triple {50878#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:39,461 INFO L273 TraceCheckUtils]: 72: Hoare triple {50879#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:39,462 INFO L273 TraceCheckUtils]: 73: Hoare triple {50879#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:39,463 INFO L273 TraceCheckUtils]: 74: Hoare triple {50879#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:39,463 INFO L273 TraceCheckUtils]: 75: Hoare triple {50880#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:39,464 INFO L273 TraceCheckUtils]: 76: Hoare triple {50880#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:39,464 INFO L273 TraceCheckUtils]: 77: Hoare triple {50880#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:39,465 INFO L273 TraceCheckUtils]: 78: Hoare triple {50881#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:39,465 INFO L273 TraceCheckUtils]: 79: Hoare triple {50881#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:39,466 INFO L273 TraceCheckUtils]: 80: Hoare triple {50881#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:39,466 INFO L273 TraceCheckUtils]: 81: Hoare triple {50882#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:39,467 INFO L273 TraceCheckUtils]: 82: Hoare triple {50882#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:39,468 INFO L273 TraceCheckUtils]: 83: Hoare triple {50882#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:39,468 INFO L273 TraceCheckUtils]: 84: Hoare triple {50883#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:39,469 INFO L273 TraceCheckUtils]: 85: Hoare triple {50883#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:39,469 INFO L273 TraceCheckUtils]: 86: Hoare triple {50883#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:39,470 INFO L273 TraceCheckUtils]: 87: Hoare triple {50884#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:39,470 INFO L273 TraceCheckUtils]: 88: Hoare triple {50884#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:39,471 INFO L273 TraceCheckUtils]: 89: Hoare triple {50884#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:39,472 INFO L273 TraceCheckUtils]: 90: Hoare triple {50885#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:39,472 INFO L273 TraceCheckUtils]: 91: Hoare triple {50885#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:39,473 INFO L273 TraceCheckUtils]: 92: Hoare triple {50885#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:39,473 INFO L273 TraceCheckUtils]: 93: Hoare triple {50886#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:39,474 INFO L273 TraceCheckUtils]: 94: Hoare triple {50886#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:39,475 INFO L273 TraceCheckUtils]: 95: Hoare triple {50886#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:39,475 INFO L273 TraceCheckUtils]: 96: Hoare triple {50887#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:39,476 INFO L273 TraceCheckUtils]: 97: Hoare triple {50887#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:39,476 INFO L273 TraceCheckUtils]: 98: Hoare triple {50887#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:39,477 INFO L273 TraceCheckUtils]: 99: Hoare triple {50888#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:39,477 INFO L273 TraceCheckUtils]: 100: Hoare triple {50888#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:39,478 INFO L273 TraceCheckUtils]: 101: Hoare triple {50888#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:39,478 INFO L273 TraceCheckUtils]: 102: Hoare triple {50889#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:39,479 INFO L273 TraceCheckUtils]: 103: Hoare triple {50889#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:39,480 INFO L273 TraceCheckUtils]: 104: Hoare triple {50889#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:39,480 INFO L273 TraceCheckUtils]: 105: Hoare triple {50890#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:39,481 INFO L273 TraceCheckUtils]: 106: Hoare triple {50890#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:39,481 INFO L273 TraceCheckUtils]: 107: Hoare triple {50890#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:39,482 INFO L273 TraceCheckUtils]: 108: Hoare triple {50891#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:39,482 INFO L273 TraceCheckUtils]: 109: Hoare triple {50891#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:39,483 INFO L273 TraceCheckUtils]: 110: Hoare triple {50891#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:39,484 INFO L273 TraceCheckUtils]: 111: Hoare triple {50892#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:39,484 INFO L273 TraceCheckUtils]: 112: Hoare triple {50892#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:39,485 INFO L273 TraceCheckUtils]: 113: Hoare triple {50892#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:39,485 INFO L273 TraceCheckUtils]: 114: Hoare triple {50893#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:39,486 INFO L273 TraceCheckUtils]: 115: Hoare triple {50893#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:39,487 INFO L273 TraceCheckUtils]: 116: Hoare triple {50893#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:39,487 INFO L273 TraceCheckUtils]: 117: Hoare triple {50894#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:39,488 INFO L273 TraceCheckUtils]: 118: Hoare triple {50894#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:39,488 INFO L273 TraceCheckUtils]: 119: Hoare triple {50894#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:39,489 INFO L273 TraceCheckUtils]: 120: Hoare triple {50895#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:39,489 INFO L273 TraceCheckUtils]: 121: Hoare triple {50895#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:39,490 INFO L273 TraceCheckUtils]: 122: Hoare triple {50895#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:39,490 INFO L273 TraceCheckUtils]: 123: Hoare triple {50896#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:39,491 INFO L273 TraceCheckUtils]: 124: Hoare triple {50896#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:39,492 INFO L273 TraceCheckUtils]: 125: Hoare triple {50896#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:39,492 INFO L273 TraceCheckUtils]: 126: Hoare triple {50897#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:39,493 INFO L273 TraceCheckUtils]: 127: Hoare triple {50897#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:39,493 INFO L273 TraceCheckUtils]: 128: Hoare triple {50897#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:39,494 INFO L273 TraceCheckUtils]: 129: Hoare triple {50898#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:39,494 INFO L273 TraceCheckUtils]: 130: Hoare triple {50898#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:39,495 INFO L273 TraceCheckUtils]: 131: Hoare triple {50898#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:39,496 INFO L273 TraceCheckUtils]: 132: Hoare triple {50899#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:39,496 INFO L273 TraceCheckUtils]: 133: Hoare triple {50899#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:39,497 INFO L273 TraceCheckUtils]: 134: Hoare triple {50899#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:39,497 INFO L273 TraceCheckUtils]: 135: Hoare triple {50900#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:39,498 INFO L273 TraceCheckUtils]: 136: Hoare triple {50900#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:39,499 INFO L273 TraceCheckUtils]: 137: Hoare triple {50900#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:39,499 INFO L273 TraceCheckUtils]: 138: Hoare triple {50901#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:39,500 INFO L273 TraceCheckUtils]: 139: Hoare triple {50901#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:39,500 INFO L273 TraceCheckUtils]: 140: Hoare triple {50901#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:39,501 INFO L273 TraceCheckUtils]: 141: Hoare triple {50902#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:39,501 INFO L273 TraceCheckUtils]: 142: Hoare triple {50902#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:39,502 INFO L273 TraceCheckUtils]: 143: Hoare triple {50902#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:39,503 INFO L273 TraceCheckUtils]: 144: Hoare triple {50903#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:39,503 INFO L273 TraceCheckUtils]: 145: Hoare triple {50903#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:39,504 INFO L273 TraceCheckUtils]: 146: Hoare triple {50903#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:39,504 INFO L273 TraceCheckUtils]: 147: Hoare triple {50904#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:39,505 INFO L273 TraceCheckUtils]: 148: Hoare triple {50904#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:39,505 INFO L273 TraceCheckUtils]: 149: Hoare triple {50904#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:39,506 INFO L273 TraceCheckUtils]: 150: Hoare triple {50905#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:39,506 INFO L273 TraceCheckUtils]: 151: Hoare triple {50905#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:39,507 INFO L273 TraceCheckUtils]: 152: Hoare triple {50905#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:39,508 INFO L273 TraceCheckUtils]: 153: Hoare triple {50906#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:39,508 INFO L273 TraceCheckUtils]: 154: Hoare triple {50906#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:39,509 INFO L273 TraceCheckUtils]: 155: Hoare triple {50906#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:39,509 INFO L273 TraceCheckUtils]: 156: Hoare triple {50907#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:39,510 INFO L273 TraceCheckUtils]: 157: Hoare triple {50907#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:39,511 INFO L273 TraceCheckUtils]: 158: Hoare triple {50907#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:39,511 INFO L273 TraceCheckUtils]: 159: Hoare triple {50908#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:39,512 INFO L273 TraceCheckUtils]: 160: Hoare triple {50908#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:39,512 INFO L273 TraceCheckUtils]: 161: Hoare triple {50908#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:39,513 INFO L273 TraceCheckUtils]: 162: Hoare triple {50909#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:39,513 INFO L273 TraceCheckUtils]: 163: Hoare triple {50909#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:39,514 INFO L273 TraceCheckUtils]: 164: Hoare triple {50909#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:39,515 INFO L273 TraceCheckUtils]: 165: Hoare triple {50910#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:39,515 INFO L273 TraceCheckUtils]: 166: Hoare triple {50910#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:39,516 INFO L273 TraceCheckUtils]: 167: Hoare triple {50910#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:39,516 INFO L273 TraceCheckUtils]: 168: Hoare triple {50911#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:39,517 INFO L273 TraceCheckUtils]: 169: Hoare triple {50911#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:39,518 INFO L273 TraceCheckUtils]: 170: Hoare triple {50911#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:39,518 INFO L273 TraceCheckUtils]: 171: Hoare triple {50912#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:39,519 INFO L273 TraceCheckUtils]: 172: Hoare triple {50912#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:39,519 INFO L273 TraceCheckUtils]: 173: Hoare triple {50912#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:39,520 INFO L273 TraceCheckUtils]: 174: Hoare triple {50913#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:39,520 INFO L273 TraceCheckUtils]: 175: Hoare triple {50913#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:39,521 INFO L273 TraceCheckUtils]: 176: Hoare triple {50913#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:39,521 INFO L273 TraceCheckUtils]: 177: Hoare triple {50914#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:39,522 INFO L273 TraceCheckUtils]: 178: Hoare triple {50914#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:39,523 INFO L273 TraceCheckUtils]: 179: Hoare triple {50914#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:39,523 INFO L273 TraceCheckUtils]: 180: Hoare triple {50915#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:39,524 INFO L273 TraceCheckUtils]: 181: Hoare triple {50915#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:39,524 INFO L273 TraceCheckUtils]: 182: Hoare triple {50915#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {50916#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:39,525 INFO L273 TraceCheckUtils]: 183: Hoare triple {50916#(<= main_~i~0 59)} assume !(~i~0 < 100000); {50856#false} is VALID [2018-11-23 12:07:39,525 INFO L273 TraceCheckUtils]: 184: Hoare triple {50856#false} havoc ~x~0;~x~0 := 0; {50856#false} is VALID [2018-11-23 12:07:39,525 INFO L273 TraceCheckUtils]: 185: Hoare triple {50856#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {50856#false} is VALID [2018-11-23 12:07:39,526 INFO L256 TraceCheckUtils]: 186: Hoare triple {50856#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {50856#false} is VALID [2018-11-23 12:07:39,526 INFO L273 TraceCheckUtils]: 187: Hoare triple {50856#false} ~cond := #in~cond; {50856#false} is VALID [2018-11-23 12:07:39,526 INFO L273 TraceCheckUtils]: 188: Hoare triple {50856#false} assume 0 == ~cond; {50856#false} is VALID [2018-11-23 12:07:39,526 INFO L273 TraceCheckUtils]: 189: Hoare triple {50856#false} assume !false; {50856#false} is VALID [2018-11-23 12:07:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:39,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:39,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2018-11-23 12:07:39,568 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 190 [2018-11-23 12:07:39,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:39,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states. [2018-11-23 12:07:39,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:39,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-23 12:07:39,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-23 12:07:39,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 12:07:39,750 INFO L87 Difference]: Start difference. First operand 195 states and 255 transitions. Second operand 63 states. [2018-11-23 12:07:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:41,175 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2018-11-23 12:07:41,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 12:07:41,175 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 190 [2018-11-23 12:07:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:07:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 274 transitions. [2018-11-23 12:07:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:07:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 274 transitions. [2018-11-23 12:07:41,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 274 transitions. [2018-11-23 12:07:41,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:41,428 INFO L225 Difference]: With dead ends: 211 [2018-11-23 12:07:41,428 INFO L226 Difference]: Without dead ends: 200 [2018-11-23 12:07:41,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 12:07:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-23 12:07:41,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-11-23 12:07:41,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:41,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 198 states. [2018-11-23 12:07:41,507 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 198 states. [2018-11-23 12:07:41,507 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 198 states. [2018-11-23 12:07:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:41,511 INFO L93 Difference]: Finished difference Result 200 states and 262 transitions. [2018-11-23 12:07:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-11-23 12:07:41,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:41,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:41,511 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 200 states. [2018-11-23 12:07:41,511 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 200 states. [2018-11-23 12:07:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:41,514 INFO L93 Difference]: Finished difference Result 200 states and 262 transitions. [2018-11-23 12:07:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-11-23 12:07:41,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:41,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:41,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:41,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-23 12:07:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2018-11-23 12:07:41,517 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 190 [2018-11-23 12:07:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:41,517 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2018-11-23 12:07:41,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-23 12:07:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2018-11-23 12:07:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-23 12:07:41,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:41,518 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:41,518 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:41,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:41,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2000509639, now seen corresponding path program 60 times [2018-11-23 12:07:41,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:41,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:41,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:41,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:41,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:43,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {52435#true} call ULTIMATE.init(); {52435#true} is VALID [2018-11-23 12:07:43,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {52435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52435#true} is VALID [2018-11-23 12:07:43,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {52435#true} assume true; {52435#true} is VALID [2018-11-23 12:07:43,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52435#true} {52435#true} #55#return; {52435#true} is VALID [2018-11-23 12:07:43,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {52435#true} call #t~ret4 := main(); {52435#true} is VALID [2018-11-23 12:07:43,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {52435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {52437#(= main_~i~0 0)} is VALID [2018-11-23 12:07:43,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {52437#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52437#(= main_~i~0 0)} is VALID [2018-11-23 12:07:43,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {52437#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52437#(= main_~i~0 0)} is VALID [2018-11-23 12:07:43,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {52437#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:43,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {52438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:43,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {52438#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:43,172 INFO L273 TraceCheckUtils]: 11: Hoare triple {52438#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:43,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {52439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:43,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {52439#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:43,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {52439#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:43,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {52440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:43,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {52440#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:43,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {52440#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:43,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {52441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:43,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {52441#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:43,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {52441#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:43,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {52442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:43,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {52442#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:43,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {52442#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:43,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {52443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:43,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {52443#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:43,179 INFO L273 TraceCheckUtils]: 26: Hoare triple {52443#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:43,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {52444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:43,180 INFO L273 TraceCheckUtils]: 28: Hoare triple {52444#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:43,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {52444#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:43,182 INFO L273 TraceCheckUtils]: 30: Hoare triple {52445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:43,182 INFO L273 TraceCheckUtils]: 31: Hoare triple {52445#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:43,183 INFO L273 TraceCheckUtils]: 32: Hoare triple {52445#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:43,183 INFO L273 TraceCheckUtils]: 33: Hoare triple {52446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:43,184 INFO L273 TraceCheckUtils]: 34: Hoare triple {52446#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:43,185 INFO L273 TraceCheckUtils]: 35: Hoare triple {52446#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:43,185 INFO L273 TraceCheckUtils]: 36: Hoare triple {52447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:43,185 INFO L273 TraceCheckUtils]: 37: Hoare triple {52447#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:43,186 INFO L273 TraceCheckUtils]: 38: Hoare triple {52447#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:43,187 INFO L273 TraceCheckUtils]: 39: Hoare triple {52448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:43,187 INFO L273 TraceCheckUtils]: 40: Hoare triple {52448#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:43,188 INFO L273 TraceCheckUtils]: 41: Hoare triple {52448#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:43,188 INFO L273 TraceCheckUtils]: 42: Hoare triple {52449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:43,189 INFO L273 TraceCheckUtils]: 43: Hoare triple {52449#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:43,190 INFO L273 TraceCheckUtils]: 44: Hoare triple {52449#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:43,190 INFO L273 TraceCheckUtils]: 45: Hoare triple {52450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:43,191 INFO L273 TraceCheckUtils]: 46: Hoare triple {52450#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:43,191 INFO L273 TraceCheckUtils]: 47: Hoare triple {52450#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:43,192 INFO L273 TraceCheckUtils]: 48: Hoare triple {52451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:43,192 INFO L273 TraceCheckUtils]: 49: Hoare triple {52451#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:43,193 INFO L273 TraceCheckUtils]: 50: Hoare triple {52451#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:43,194 INFO L273 TraceCheckUtils]: 51: Hoare triple {52452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:43,194 INFO L273 TraceCheckUtils]: 52: Hoare triple {52452#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:43,195 INFO L273 TraceCheckUtils]: 53: Hoare triple {52452#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:43,195 INFO L273 TraceCheckUtils]: 54: Hoare triple {52453#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:43,196 INFO L273 TraceCheckUtils]: 55: Hoare triple {52453#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:43,196 INFO L273 TraceCheckUtils]: 56: Hoare triple {52453#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:43,197 INFO L273 TraceCheckUtils]: 57: Hoare triple {52454#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:43,197 INFO L273 TraceCheckUtils]: 58: Hoare triple {52454#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:43,198 INFO L273 TraceCheckUtils]: 59: Hoare triple {52454#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:43,199 INFO L273 TraceCheckUtils]: 60: Hoare triple {52455#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:43,199 INFO L273 TraceCheckUtils]: 61: Hoare triple {52455#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:43,200 INFO L273 TraceCheckUtils]: 62: Hoare triple {52455#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:43,200 INFO L273 TraceCheckUtils]: 63: Hoare triple {52456#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:43,201 INFO L273 TraceCheckUtils]: 64: Hoare triple {52456#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:43,202 INFO L273 TraceCheckUtils]: 65: Hoare triple {52456#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:43,202 INFO L273 TraceCheckUtils]: 66: Hoare triple {52457#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:43,203 INFO L273 TraceCheckUtils]: 67: Hoare triple {52457#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:43,203 INFO L273 TraceCheckUtils]: 68: Hoare triple {52457#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:43,204 INFO L273 TraceCheckUtils]: 69: Hoare triple {52458#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:43,204 INFO L273 TraceCheckUtils]: 70: Hoare triple {52458#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:43,205 INFO L273 TraceCheckUtils]: 71: Hoare triple {52458#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:43,206 INFO L273 TraceCheckUtils]: 72: Hoare triple {52459#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:43,206 INFO L273 TraceCheckUtils]: 73: Hoare triple {52459#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:43,207 INFO L273 TraceCheckUtils]: 74: Hoare triple {52459#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:43,207 INFO L273 TraceCheckUtils]: 75: Hoare triple {52460#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:43,208 INFO L273 TraceCheckUtils]: 76: Hoare triple {52460#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:43,208 INFO L273 TraceCheckUtils]: 77: Hoare triple {52460#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:43,209 INFO L273 TraceCheckUtils]: 78: Hoare triple {52461#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:43,209 INFO L273 TraceCheckUtils]: 79: Hoare triple {52461#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:43,210 INFO L273 TraceCheckUtils]: 80: Hoare triple {52461#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:43,211 INFO L273 TraceCheckUtils]: 81: Hoare triple {52462#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:43,211 INFO L273 TraceCheckUtils]: 82: Hoare triple {52462#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:43,212 INFO L273 TraceCheckUtils]: 83: Hoare triple {52462#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:43,212 INFO L273 TraceCheckUtils]: 84: Hoare triple {52463#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:43,213 INFO L273 TraceCheckUtils]: 85: Hoare triple {52463#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:43,214 INFO L273 TraceCheckUtils]: 86: Hoare triple {52463#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:43,214 INFO L273 TraceCheckUtils]: 87: Hoare triple {52464#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:43,215 INFO L273 TraceCheckUtils]: 88: Hoare triple {52464#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:43,215 INFO L273 TraceCheckUtils]: 89: Hoare triple {52464#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:43,216 INFO L273 TraceCheckUtils]: 90: Hoare triple {52465#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:43,216 INFO L273 TraceCheckUtils]: 91: Hoare triple {52465#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:43,217 INFO L273 TraceCheckUtils]: 92: Hoare triple {52465#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:43,217 INFO L273 TraceCheckUtils]: 93: Hoare triple {52466#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:43,218 INFO L273 TraceCheckUtils]: 94: Hoare triple {52466#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:43,219 INFO L273 TraceCheckUtils]: 95: Hoare triple {52466#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:43,219 INFO L273 TraceCheckUtils]: 96: Hoare triple {52467#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:43,220 INFO L273 TraceCheckUtils]: 97: Hoare triple {52467#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:43,220 INFO L273 TraceCheckUtils]: 98: Hoare triple {52467#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:43,221 INFO L273 TraceCheckUtils]: 99: Hoare triple {52468#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:43,221 INFO L273 TraceCheckUtils]: 100: Hoare triple {52468#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:43,222 INFO L273 TraceCheckUtils]: 101: Hoare triple {52468#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:43,223 INFO L273 TraceCheckUtils]: 102: Hoare triple {52469#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:43,223 INFO L273 TraceCheckUtils]: 103: Hoare triple {52469#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:43,224 INFO L273 TraceCheckUtils]: 104: Hoare triple {52469#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:43,224 INFO L273 TraceCheckUtils]: 105: Hoare triple {52470#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:43,225 INFO L273 TraceCheckUtils]: 106: Hoare triple {52470#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:43,225 INFO L273 TraceCheckUtils]: 107: Hoare triple {52470#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:43,226 INFO L273 TraceCheckUtils]: 108: Hoare triple {52471#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:43,226 INFO L273 TraceCheckUtils]: 109: Hoare triple {52471#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:43,227 INFO L273 TraceCheckUtils]: 110: Hoare triple {52471#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:43,228 INFO L273 TraceCheckUtils]: 111: Hoare triple {52472#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:43,228 INFO L273 TraceCheckUtils]: 112: Hoare triple {52472#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:43,229 INFO L273 TraceCheckUtils]: 113: Hoare triple {52472#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:43,229 INFO L273 TraceCheckUtils]: 114: Hoare triple {52473#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:43,230 INFO L273 TraceCheckUtils]: 115: Hoare triple {52473#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:43,231 INFO L273 TraceCheckUtils]: 116: Hoare triple {52473#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:43,231 INFO L273 TraceCheckUtils]: 117: Hoare triple {52474#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:43,232 INFO L273 TraceCheckUtils]: 118: Hoare triple {52474#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:43,232 INFO L273 TraceCheckUtils]: 119: Hoare triple {52474#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:43,233 INFO L273 TraceCheckUtils]: 120: Hoare triple {52475#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:43,233 INFO L273 TraceCheckUtils]: 121: Hoare triple {52475#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:43,234 INFO L273 TraceCheckUtils]: 122: Hoare triple {52475#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:43,235 INFO L273 TraceCheckUtils]: 123: Hoare triple {52476#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:43,235 INFO L273 TraceCheckUtils]: 124: Hoare triple {52476#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:43,236 INFO L273 TraceCheckUtils]: 125: Hoare triple {52476#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:43,236 INFO L273 TraceCheckUtils]: 126: Hoare triple {52477#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:43,237 INFO L273 TraceCheckUtils]: 127: Hoare triple {52477#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:43,237 INFO L273 TraceCheckUtils]: 128: Hoare triple {52477#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:43,238 INFO L273 TraceCheckUtils]: 129: Hoare triple {52478#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:43,238 INFO L273 TraceCheckUtils]: 130: Hoare triple {52478#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:43,239 INFO L273 TraceCheckUtils]: 131: Hoare triple {52478#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:43,240 INFO L273 TraceCheckUtils]: 132: Hoare triple {52479#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:43,240 INFO L273 TraceCheckUtils]: 133: Hoare triple {52479#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:43,241 INFO L273 TraceCheckUtils]: 134: Hoare triple {52479#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:43,241 INFO L273 TraceCheckUtils]: 135: Hoare triple {52480#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:43,242 INFO L273 TraceCheckUtils]: 136: Hoare triple {52480#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:43,243 INFO L273 TraceCheckUtils]: 137: Hoare triple {52480#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:43,243 INFO L273 TraceCheckUtils]: 138: Hoare triple {52481#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:43,244 INFO L273 TraceCheckUtils]: 139: Hoare triple {52481#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:43,244 INFO L273 TraceCheckUtils]: 140: Hoare triple {52481#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:43,245 INFO L273 TraceCheckUtils]: 141: Hoare triple {52482#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:43,245 INFO L273 TraceCheckUtils]: 142: Hoare triple {52482#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:43,246 INFO L273 TraceCheckUtils]: 143: Hoare triple {52482#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:43,247 INFO L273 TraceCheckUtils]: 144: Hoare triple {52483#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:43,247 INFO L273 TraceCheckUtils]: 145: Hoare triple {52483#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:43,248 INFO L273 TraceCheckUtils]: 146: Hoare triple {52483#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:43,248 INFO L273 TraceCheckUtils]: 147: Hoare triple {52484#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:43,249 INFO L273 TraceCheckUtils]: 148: Hoare triple {52484#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:43,249 INFO L273 TraceCheckUtils]: 149: Hoare triple {52484#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:43,250 INFO L273 TraceCheckUtils]: 150: Hoare triple {52485#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:43,250 INFO L273 TraceCheckUtils]: 151: Hoare triple {52485#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:43,251 INFO L273 TraceCheckUtils]: 152: Hoare triple {52485#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:43,252 INFO L273 TraceCheckUtils]: 153: Hoare triple {52486#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:43,252 INFO L273 TraceCheckUtils]: 154: Hoare triple {52486#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:43,253 INFO L273 TraceCheckUtils]: 155: Hoare triple {52486#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:43,253 INFO L273 TraceCheckUtils]: 156: Hoare triple {52487#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:43,254 INFO L273 TraceCheckUtils]: 157: Hoare triple {52487#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:43,255 INFO L273 TraceCheckUtils]: 158: Hoare triple {52487#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:43,255 INFO L273 TraceCheckUtils]: 159: Hoare triple {52488#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:43,256 INFO L273 TraceCheckUtils]: 160: Hoare triple {52488#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:43,256 INFO L273 TraceCheckUtils]: 161: Hoare triple {52488#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:43,257 INFO L273 TraceCheckUtils]: 162: Hoare triple {52489#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:43,257 INFO L273 TraceCheckUtils]: 163: Hoare triple {52489#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:43,258 INFO L273 TraceCheckUtils]: 164: Hoare triple {52489#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:43,258 INFO L273 TraceCheckUtils]: 165: Hoare triple {52490#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:43,259 INFO L273 TraceCheckUtils]: 166: Hoare triple {52490#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:43,260 INFO L273 TraceCheckUtils]: 167: Hoare triple {52490#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:43,260 INFO L273 TraceCheckUtils]: 168: Hoare triple {52491#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:43,261 INFO L273 TraceCheckUtils]: 169: Hoare triple {52491#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:43,261 INFO L273 TraceCheckUtils]: 170: Hoare triple {52491#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:43,262 INFO L273 TraceCheckUtils]: 171: Hoare triple {52492#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:43,262 INFO L273 TraceCheckUtils]: 172: Hoare triple {52492#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:43,263 INFO L273 TraceCheckUtils]: 173: Hoare triple {52492#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:43,264 INFO L273 TraceCheckUtils]: 174: Hoare triple {52493#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:43,264 INFO L273 TraceCheckUtils]: 175: Hoare triple {52493#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:43,265 INFO L273 TraceCheckUtils]: 176: Hoare triple {52493#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:43,265 INFO L273 TraceCheckUtils]: 177: Hoare triple {52494#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:43,266 INFO L273 TraceCheckUtils]: 178: Hoare triple {52494#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:43,267 INFO L273 TraceCheckUtils]: 179: Hoare triple {52494#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:43,267 INFO L273 TraceCheckUtils]: 180: Hoare triple {52495#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:43,268 INFO L273 TraceCheckUtils]: 181: Hoare triple {52495#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:43,268 INFO L273 TraceCheckUtils]: 182: Hoare triple {52495#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:43,269 INFO L273 TraceCheckUtils]: 183: Hoare triple {52496#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:43,269 INFO L273 TraceCheckUtils]: 184: Hoare triple {52496#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:43,270 INFO L273 TraceCheckUtils]: 185: Hoare triple {52496#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {52497#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:43,271 INFO L273 TraceCheckUtils]: 186: Hoare triple {52497#(<= main_~i~0 60)} assume !(~i~0 < 100000); {52436#false} is VALID [2018-11-23 12:07:43,271 INFO L273 TraceCheckUtils]: 187: Hoare triple {52436#false} havoc ~x~0;~x~0 := 0; {52436#false} is VALID [2018-11-23 12:07:43,271 INFO L273 TraceCheckUtils]: 188: Hoare triple {52436#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {52436#false} is VALID [2018-11-23 12:07:43,271 INFO L256 TraceCheckUtils]: 189: Hoare triple {52436#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {52436#false} is VALID [2018-11-23 12:07:43,271 INFO L273 TraceCheckUtils]: 190: Hoare triple {52436#false} ~cond := #in~cond; {52436#false} is VALID [2018-11-23 12:07:43,272 INFO L273 TraceCheckUtils]: 191: Hoare triple {52436#false} assume 0 == ~cond; {52436#false} is VALID [2018-11-23 12:07:43,272 INFO L273 TraceCheckUtils]: 192: Hoare triple {52436#false} assume !false; {52436#false} is VALID [2018-11-23 12:07:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:43,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:43,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:43,304 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:07:43,476 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-11-23 12:07:43,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:43,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:43,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {52435#true} call ULTIMATE.init(); {52435#true} is VALID [2018-11-23 12:07:43,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {52435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52435#true} is VALID [2018-11-23 12:07:43,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {52435#true} assume true; {52435#true} is VALID [2018-11-23 12:07:43,930 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52435#true} {52435#true} #55#return; {52435#true} is VALID [2018-11-23 12:07:43,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {52435#true} call #t~ret4 := main(); {52435#true} is VALID [2018-11-23 12:07:43,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {52435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {52516#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:43,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {52516#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52516#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:43,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {52516#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52516#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:43,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {52516#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:43,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {52438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:43,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {52438#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:43,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {52438#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:43,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {52439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:43,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {52439#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:43,934 INFO L273 TraceCheckUtils]: 14: Hoare triple {52439#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:43,935 INFO L273 TraceCheckUtils]: 15: Hoare triple {52440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:43,935 INFO L273 TraceCheckUtils]: 16: Hoare triple {52440#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:43,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {52440#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:43,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {52441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:43,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {52441#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:43,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {52441#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:43,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {52442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:43,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {52442#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:43,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {52442#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:43,940 INFO L273 TraceCheckUtils]: 24: Hoare triple {52443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:43,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {52443#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:43,941 INFO L273 TraceCheckUtils]: 26: Hoare triple {52443#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:43,942 INFO L273 TraceCheckUtils]: 27: Hoare triple {52444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:43,942 INFO L273 TraceCheckUtils]: 28: Hoare triple {52444#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:43,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {52444#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:43,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {52445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:43,944 INFO L273 TraceCheckUtils]: 31: Hoare triple {52445#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:43,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {52445#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:43,945 INFO L273 TraceCheckUtils]: 33: Hoare triple {52446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:43,945 INFO L273 TraceCheckUtils]: 34: Hoare triple {52446#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:43,946 INFO L273 TraceCheckUtils]: 35: Hoare triple {52446#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:43,947 INFO L273 TraceCheckUtils]: 36: Hoare triple {52447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:43,947 INFO L273 TraceCheckUtils]: 37: Hoare triple {52447#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:43,948 INFO L273 TraceCheckUtils]: 38: Hoare triple {52447#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:43,948 INFO L273 TraceCheckUtils]: 39: Hoare triple {52448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:43,949 INFO L273 TraceCheckUtils]: 40: Hoare triple {52448#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:43,950 INFO L273 TraceCheckUtils]: 41: Hoare triple {52448#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:43,950 INFO L273 TraceCheckUtils]: 42: Hoare triple {52449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:43,951 INFO L273 TraceCheckUtils]: 43: Hoare triple {52449#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:43,951 INFO L273 TraceCheckUtils]: 44: Hoare triple {52449#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:43,952 INFO L273 TraceCheckUtils]: 45: Hoare triple {52450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:43,952 INFO L273 TraceCheckUtils]: 46: Hoare triple {52450#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:43,953 INFO L273 TraceCheckUtils]: 47: Hoare triple {52450#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:43,954 INFO L273 TraceCheckUtils]: 48: Hoare triple {52451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:43,954 INFO L273 TraceCheckUtils]: 49: Hoare triple {52451#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:43,955 INFO L273 TraceCheckUtils]: 50: Hoare triple {52451#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:43,955 INFO L273 TraceCheckUtils]: 51: Hoare triple {52452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:43,956 INFO L273 TraceCheckUtils]: 52: Hoare triple {52452#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:43,956 INFO L273 TraceCheckUtils]: 53: Hoare triple {52452#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:43,957 INFO L273 TraceCheckUtils]: 54: Hoare triple {52453#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:43,957 INFO L273 TraceCheckUtils]: 55: Hoare triple {52453#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:43,958 INFO L273 TraceCheckUtils]: 56: Hoare triple {52453#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:43,959 INFO L273 TraceCheckUtils]: 57: Hoare triple {52454#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:43,959 INFO L273 TraceCheckUtils]: 58: Hoare triple {52454#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:43,960 INFO L273 TraceCheckUtils]: 59: Hoare triple {52454#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:43,960 INFO L273 TraceCheckUtils]: 60: Hoare triple {52455#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:43,961 INFO L273 TraceCheckUtils]: 61: Hoare triple {52455#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:43,962 INFO L273 TraceCheckUtils]: 62: Hoare triple {52455#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:43,962 INFO L273 TraceCheckUtils]: 63: Hoare triple {52456#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:43,963 INFO L273 TraceCheckUtils]: 64: Hoare triple {52456#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:43,963 INFO L273 TraceCheckUtils]: 65: Hoare triple {52456#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:43,964 INFO L273 TraceCheckUtils]: 66: Hoare triple {52457#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:43,964 INFO L273 TraceCheckUtils]: 67: Hoare triple {52457#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:43,965 INFO L273 TraceCheckUtils]: 68: Hoare triple {52457#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:43,965 INFO L273 TraceCheckUtils]: 69: Hoare triple {52458#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:43,966 INFO L273 TraceCheckUtils]: 70: Hoare triple {52458#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:43,967 INFO L273 TraceCheckUtils]: 71: Hoare triple {52458#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:43,967 INFO L273 TraceCheckUtils]: 72: Hoare triple {52459#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:43,968 INFO L273 TraceCheckUtils]: 73: Hoare triple {52459#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:43,968 INFO L273 TraceCheckUtils]: 74: Hoare triple {52459#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:43,969 INFO L273 TraceCheckUtils]: 75: Hoare triple {52460#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:43,969 INFO L273 TraceCheckUtils]: 76: Hoare triple {52460#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:43,970 INFO L273 TraceCheckUtils]: 77: Hoare triple {52460#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:43,971 INFO L273 TraceCheckUtils]: 78: Hoare triple {52461#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:43,971 INFO L273 TraceCheckUtils]: 79: Hoare triple {52461#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:43,972 INFO L273 TraceCheckUtils]: 80: Hoare triple {52461#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:43,972 INFO L273 TraceCheckUtils]: 81: Hoare triple {52462#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:43,973 INFO L273 TraceCheckUtils]: 82: Hoare triple {52462#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:43,973 INFO L273 TraceCheckUtils]: 83: Hoare triple {52462#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:43,974 INFO L273 TraceCheckUtils]: 84: Hoare triple {52463#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:43,974 INFO L273 TraceCheckUtils]: 85: Hoare triple {52463#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:43,975 INFO L273 TraceCheckUtils]: 86: Hoare triple {52463#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:43,976 INFO L273 TraceCheckUtils]: 87: Hoare triple {52464#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:43,976 INFO L273 TraceCheckUtils]: 88: Hoare triple {52464#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:43,977 INFO L273 TraceCheckUtils]: 89: Hoare triple {52464#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:43,977 INFO L273 TraceCheckUtils]: 90: Hoare triple {52465#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:43,978 INFO L273 TraceCheckUtils]: 91: Hoare triple {52465#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:43,979 INFO L273 TraceCheckUtils]: 92: Hoare triple {52465#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:43,979 INFO L273 TraceCheckUtils]: 93: Hoare triple {52466#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:43,980 INFO L273 TraceCheckUtils]: 94: Hoare triple {52466#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:43,980 INFO L273 TraceCheckUtils]: 95: Hoare triple {52466#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:43,981 INFO L273 TraceCheckUtils]: 96: Hoare triple {52467#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:43,981 INFO L273 TraceCheckUtils]: 97: Hoare triple {52467#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:43,982 INFO L273 TraceCheckUtils]: 98: Hoare triple {52467#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:43,982 INFO L273 TraceCheckUtils]: 99: Hoare triple {52468#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:43,983 INFO L273 TraceCheckUtils]: 100: Hoare triple {52468#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:43,984 INFO L273 TraceCheckUtils]: 101: Hoare triple {52468#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:43,984 INFO L273 TraceCheckUtils]: 102: Hoare triple {52469#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:43,985 INFO L273 TraceCheckUtils]: 103: Hoare triple {52469#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:43,985 INFO L273 TraceCheckUtils]: 104: Hoare triple {52469#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:43,986 INFO L273 TraceCheckUtils]: 105: Hoare triple {52470#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:43,986 INFO L273 TraceCheckUtils]: 106: Hoare triple {52470#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:43,987 INFO L273 TraceCheckUtils]: 107: Hoare triple {52470#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:43,988 INFO L273 TraceCheckUtils]: 108: Hoare triple {52471#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:43,988 INFO L273 TraceCheckUtils]: 109: Hoare triple {52471#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:43,989 INFO L273 TraceCheckUtils]: 110: Hoare triple {52471#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:43,989 INFO L273 TraceCheckUtils]: 111: Hoare triple {52472#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:43,990 INFO L273 TraceCheckUtils]: 112: Hoare triple {52472#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:43,990 INFO L273 TraceCheckUtils]: 113: Hoare triple {52472#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:43,991 INFO L273 TraceCheckUtils]: 114: Hoare triple {52473#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:43,991 INFO L273 TraceCheckUtils]: 115: Hoare triple {52473#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:43,992 INFO L273 TraceCheckUtils]: 116: Hoare triple {52473#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:43,993 INFO L273 TraceCheckUtils]: 117: Hoare triple {52474#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:43,993 INFO L273 TraceCheckUtils]: 118: Hoare triple {52474#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:43,994 INFO L273 TraceCheckUtils]: 119: Hoare triple {52474#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:43,994 INFO L273 TraceCheckUtils]: 120: Hoare triple {52475#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:43,995 INFO L273 TraceCheckUtils]: 121: Hoare triple {52475#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:43,996 INFO L273 TraceCheckUtils]: 122: Hoare triple {52475#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:43,996 INFO L273 TraceCheckUtils]: 123: Hoare triple {52476#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:43,997 INFO L273 TraceCheckUtils]: 124: Hoare triple {52476#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:43,997 INFO L273 TraceCheckUtils]: 125: Hoare triple {52476#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:43,998 INFO L273 TraceCheckUtils]: 126: Hoare triple {52477#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:43,998 INFO L273 TraceCheckUtils]: 127: Hoare triple {52477#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:43,999 INFO L273 TraceCheckUtils]: 128: Hoare triple {52477#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:43,999 INFO L273 TraceCheckUtils]: 129: Hoare triple {52478#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:44,000 INFO L273 TraceCheckUtils]: 130: Hoare triple {52478#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:44,001 INFO L273 TraceCheckUtils]: 131: Hoare triple {52478#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:44,001 INFO L273 TraceCheckUtils]: 132: Hoare triple {52479#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:44,002 INFO L273 TraceCheckUtils]: 133: Hoare triple {52479#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:44,002 INFO L273 TraceCheckUtils]: 134: Hoare triple {52479#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:44,003 INFO L273 TraceCheckUtils]: 135: Hoare triple {52480#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:44,003 INFO L273 TraceCheckUtils]: 136: Hoare triple {52480#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:44,004 INFO L273 TraceCheckUtils]: 137: Hoare triple {52480#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:44,005 INFO L273 TraceCheckUtils]: 138: Hoare triple {52481#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:44,005 INFO L273 TraceCheckUtils]: 139: Hoare triple {52481#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:44,006 INFO L273 TraceCheckUtils]: 140: Hoare triple {52481#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:44,006 INFO L273 TraceCheckUtils]: 141: Hoare triple {52482#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:44,007 INFO L273 TraceCheckUtils]: 142: Hoare triple {52482#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:44,007 INFO L273 TraceCheckUtils]: 143: Hoare triple {52482#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:44,008 INFO L273 TraceCheckUtils]: 144: Hoare triple {52483#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:44,008 INFO L273 TraceCheckUtils]: 145: Hoare triple {52483#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:44,009 INFO L273 TraceCheckUtils]: 146: Hoare triple {52483#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:44,010 INFO L273 TraceCheckUtils]: 147: Hoare triple {52484#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:44,010 INFO L273 TraceCheckUtils]: 148: Hoare triple {52484#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:44,011 INFO L273 TraceCheckUtils]: 149: Hoare triple {52484#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:44,011 INFO L273 TraceCheckUtils]: 150: Hoare triple {52485#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:44,012 INFO L273 TraceCheckUtils]: 151: Hoare triple {52485#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:44,013 INFO L273 TraceCheckUtils]: 152: Hoare triple {52485#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:44,013 INFO L273 TraceCheckUtils]: 153: Hoare triple {52486#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:44,014 INFO L273 TraceCheckUtils]: 154: Hoare triple {52486#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:44,014 INFO L273 TraceCheckUtils]: 155: Hoare triple {52486#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:44,015 INFO L273 TraceCheckUtils]: 156: Hoare triple {52487#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:44,015 INFO L273 TraceCheckUtils]: 157: Hoare triple {52487#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:44,016 INFO L273 TraceCheckUtils]: 158: Hoare triple {52487#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:44,016 INFO L273 TraceCheckUtils]: 159: Hoare triple {52488#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:44,017 INFO L273 TraceCheckUtils]: 160: Hoare triple {52488#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:44,018 INFO L273 TraceCheckUtils]: 161: Hoare triple {52488#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:44,018 INFO L273 TraceCheckUtils]: 162: Hoare triple {52489#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:44,019 INFO L273 TraceCheckUtils]: 163: Hoare triple {52489#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:44,019 INFO L273 TraceCheckUtils]: 164: Hoare triple {52489#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:44,020 INFO L273 TraceCheckUtils]: 165: Hoare triple {52490#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:44,020 INFO L273 TraceCheckUtils]: 166: Hoare triple {52490#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:44,021 INFO L273 TraceCheckUtils]: 167: Hoare triple {52490#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:44,022 INFO L273 TraceCheckUtils]: 168: Hoare triple {52491#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:44,022 INFO L273 TraceCheckUtils]: 169: Hoare triple {52491#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:44,023 INFO L273 TraceCheckUtils]: 170: Hoare triple {52491#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:44,023 INFO L273 TraceCheckUtils]: 171: Hoare triple {52492#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:44,024 INFO L273 TraceCheckUtils]: 172: Hoare triple {52492#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:44,024 INFO L273 TraceCheckUtils]: 173: Hoare triple {52492#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:44,025 INFO L273 TraceCheckUtils]: 174: Hoare triple {52493#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:44,025 INFO L273 TraceCheckUtils]: 175: Hoare triple {52493#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:44,026 INFO L273 TraceCheckUtils]: 176: Hoare triple {52493#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:44,027 INFO L273 TraceCheckUtils]: 177: Hoare triple {52494#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:44,027 INFO L273 TraceCheckUtils]: 178: Hoare triple {52494#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:44,028 INFO L273 TraceCheckUtils]: 179: Hoare triple {52494#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:44,028 INFO L273 TraceCheckUtils]: 180: Hoare triple {52495#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:44,029 INFO L273 TraceCheckUtils]: 181: Hoare triple {52495#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:44,030 INFO L273 TraceCheckUtils]: 182: Hoare triple {52495#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:44,030 INFO L273 TraceCheckUtils]: 183: Hoare triple {52496#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:44,031 INFO L273 TraceCheckUtils]: 184: Hoare triple {52496#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:44,031 INFO L273 TraceCheckUtils]: 185: Hoare triple {52496#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {52497#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:44,032 INFO L273 TraceCheckUtils]: 186: Hoare triple {52497#(<= main_~i~0 60)} assume !(~i~0 < 100000); {52436#false} is VALID [2018-11-23 12:07:44,032 INFO L273 TraceCheckUtils]: 187: Hoare triple {52436#false} havoc ~x~0;~x~0 := 0; {52436#false} is VALID [2018-11-23 12:07:44,032 INFO L273 TraceCheckUtils]: 188: Hoare triple {52436#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {52436#false} is VALID [2018-11-23 12:07:44,033 INFO L256 TraceCheckUtils]: 189: Hoare triple {52436#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {52436#false} is VALID [2018-11-23 12:07:44,033 INFO L273 TraceCheckUtils]: 190: Hoare triple {52436#false} ~cond := #in~cond; {52436#false} is VALID [2018-11-23 12:07:44,033 INFO L273 TraceCheckUtils]: 191: Hoare triple {52436#false} assume 0 == ~cond; {52436#false} is VALID [2018-11-23 12:07:44,033 INFO L273 TraceCheckUtils]: 192: Hoare triple {52436#false} assume !false; {52436#false} is VALID [2018-11-23 12:07:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:44,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:44,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2018-11-23 12:07:44,089 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 193 [2018-11-23 12:07:44,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:44,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2018-11-23 12:07:44,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:44,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-23 12:07:44,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-23 12:07:44,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 12:07:44,287 INFO L87 Difference]: Start difference. First operand 198 states and 259 transitions. Second operand 64 states. [2018-11-23 12:07:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:45,329 INFO L93 Difference]: Finished difference Result 214 states and 278 transitions. [2018-11-23 12:07:45,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-23 12:07:45,329 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 193 [2018-11-23 12:07:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:07:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 278 transitions. [2018-11-23 12:07:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:07:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 278 transitions. [2018-11-23 12:07:45,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states and 278 transitions. [2018-11-23 12:07:45,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:45,606 INFO L225 Difference]: With dead ends: 214 [2018-11-23 12:07:45,606 INFO L226 Difference]: Without dead ends: 203 [2018-11-23 12:07:45,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 12:07:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-23 12:07:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-23 12:07:45,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:45,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand 201 states. [2018-11-23 12:07:45,656 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 201 states. [2018-11-23 12:07:45,656 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 201 states. [2018-11-23 12:07:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:45,660 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2018-11-23 12:07:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2018-11-23 12:07:45,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:45,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:45,660 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 203 states. [2018-11-23 12:07:45,660 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 203 states. [2018-11-23 12:07:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:45,663 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2018-11-23 12:07:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2018-11-23 12:07:45,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:45,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:45,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:45,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-23 12:07:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 263 transitions. [2018-11-23 12:07:45,666 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 263 transitions. Word has length 193 [2018-11-23 12:07:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:45,666 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 263 transitions. [2018-11-23 12:07:45,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-23 12:07:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2018-11-23 12:07:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-23 12:07:45,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:45,667 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:45,668 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:45,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:45,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1171090333, now seen corresponding path program 61 times [2018-11-23 12:07:45,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:45,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:45,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:45,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:45,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:47,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {54039#true} call ULTIMATE.init(); {54039#true} is VALID [2018-11-23 12:07:47,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {54039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54039#true} is VALID [2018-11-23 12:07:47,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {54039#true} assume true; {54039#true} is VALID [2018-11-23 12:07:47,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54039#true} {54039#true} #55#return; {54039#true} is VALID [2018-11-23 12:07:47,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {54039#true} call #t~ret4 := main(); {54039#true} is VALID [2018-11-23 12:07:47,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {54039#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {54041#(= main_~i~0 0)} is VALID [2018-11-23 12:07:47,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {54041#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54041#(= main_~i~0 0)} is VALID [2018-11-23 12:07:47,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {54041#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54041#(= main_~i~0 0)} is VALID [2018-11-23 12:07:47,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {54041#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:47,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {54042#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:47,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {54042#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:47,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {54042#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:47,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {54043#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:47,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {54043#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:47,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {54043#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:47,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {54044#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:47,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {54044#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:47,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {54044#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:47,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {54045#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:47,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {54045#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:47,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {54045#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:47,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {54046#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:47,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {54046#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:47,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {54046#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:47,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {54047#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:47,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {54047#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:47,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {54047#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:47,402 INFO L273 TraceCheckUtils]: 27: Hoare triple {54048#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:47,403 INFO L273 TraceCheckUtils]: 28: Hoare triple {54048#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:47,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {54048#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:47,404 INFO L273 TraceCheckUtils]: 30: Hoare triple {54049#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:47,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {54049#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:47,405 INFO L273 TraceCheckUtils]: 32: Hoare triple {54049#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:47,405 INFO L273 TraceCheckUtils]: 33: Hoare triple {54050#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:47,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {54050#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:47,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {54050#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:47,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {54051#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:47,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {54051#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:47,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {54051#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:47,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {54052#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:47,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {54052#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:47,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {54052#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:47,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {54053#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:47,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {54053#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:47,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {54053#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:47,412 INFO L273 TraceCheckUtils]: 45: Hoare triple {54054#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:47,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {54054#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:47,413 INFO L273 TraceCheckUtils]: 47: Hoare triple {54054#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:47,413 INFO L273 TraceCheckUtils]: 48: Hoare triple {54055#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:47,414 INFO L273 TraceCheckUtils]: 49: Hoare triple {54055#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:47,414 INFO L273 TraceCheckUtils]: 50: Hoare triple {54055#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:47,415 INFO L273 TraceCheckUtils]: 51: Hoare triple {54056#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:47,415 INFO L273 TraceCheckUtils]: 52: Hoare triple {54056#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:47,416 INFO L273 TraceCheckUtils]: 53: Hoare triple {54056#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:47,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {54057#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:47,417 INFO L273 TraceCheckUtils]: 55: Hoare triple {54057#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:47,418 INFO L273 TraceCheckUtils]: 56: Hoare triple {54057#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:47,418 INFO L273 TraceCheckUtils]: 57: Hoare triple {54058#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:47,419 INFO L273 TraceCheckUtils]: 58: Hoare triple {54058#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:47,419 INFO L273 TraceCheckUtils]: 59: Hoare triple {54058#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:47,420 INFO L273 TraceCheckUtils]: 60: Hoare triple {54059#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:47,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {54059#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:47,421 INFO L273 TraceCheckUtils]: 62: Hoare triple {54059#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:47,421 INFO L273 TraceCheckUtils]: 63: Hoare triple {54060#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:47,422 INFO L273 TraceCheckUtils]: 64: Hoare triple {54060#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:47,422 INFO L273 TraceCheckUtils]: 65: Hoare triple {54060#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:47,423 INFO L273 TraceCheckUtils]: 66: Hoare triple {54061#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:47,423 INFO L273 TraceCheckUtils]: 67: Hoare triple {54061#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:47,424 INFO L273 TraceCheckUtils]: 68: Hoare triple {54061#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:47,425 INFO L273 TraceCheckUtils]: 69: Hoare triple {54062#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:47,425 INFO L273 TraceCheckUtils]: 70: Hoare triple {54062#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:47,426 INFO L273 TraceCheckUtils]: 71: Hoare triple {54062#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:47,426 INFO L273 TraceCheckUtils]: 72: Hoare triple {54063#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:47,427 INFO L273 TraceCheckUtils]: 73: Hoare triple {54063#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:47,427 INFO L273 TraceCheckUtils]: 74: Hoare triple {54063#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:47,428 INFO L273 TraceCheckUtils]: 75: Hoare triple {54064#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:47,428 INFO L273 TraceCheckUtils]: 76: Hoare triple {54064#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:47,429 INFO L273 TraceCheckUtils]: 77: Hoare triple {54064#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:47,429 INFO L273 TraceCheckUtils]: 78: Hoare triple {54065#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:47,430 INFO L273 TraceCheckUtils]: 79: Hoare triple {54065#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:47,430 INFO L273 TraceCheckUtils]: 80: Hoare triple {54065#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:47,431 INFO L273 TraceCheckUtils]: 81: Hoare triple {54066#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:47,431 INFO L273 TraceCheckUtils]: 82: Hoare triple {54066#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:47,432 INFO L273 TraceCheckUtils]: 83: Hoare triple {54066#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:47,433 INFO L273 TraceCheckUtils]: 84: Hoare triple {54067#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:47,433 INFO L273 TraceCheckUtils]: 85: Hoare triple {54067#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:47,434 INFO L273 TraceCheckUtils]: 86: Hoare triple {54067#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:47,434 INFO L273 TraceCheckUtils]: 87: Hoare triple {54068#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:47,435 INFO L273 TraceCheckUtils]: 88: Hoare triple {54068#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:47,435 INFO L273 TraceCheckUtils]: 89: Hoare triple {54068#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:47,436 INFO L273 TraceCheckUtils]: 90: Hoare triple {54069#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:47,436 INFO L273 TraceCheckUtils]: 91: Hoare triple {54069#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:47,437 INFO L273 TraceCheckUtils]: 92: Hoare triple {54069#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:47,437 INFO L273 TraceCheckUtils]: 93: Hoare triple {54070#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:47,438 INFO L273 TraceCheckUtils]: 94: Hoare triple {54070#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:47,439 INFO L273 TraceCheckUtils]: 95: Hoare triple {54070#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:47,439 INFO L273 TraceCheckUtils]: 96: Hoare triple {54071#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:47,439 INFO L273 TraceCheckUtils]: 97: Hoare triple {54071#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:47,440 INFO L273 TraceCheckUtils]: 98: Hoare triple {54071#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:47,441 INFO L273 TraceCheckUtils]: 99: Hoare triple {54072#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:47,441 INFO L273 TraceCheckUtils]: 100: Hoare triple {54072#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:47,442 INFO L273 TraceCheckUtils]: 101: Hoare triple {54072#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:47,442 INFO L273 TraceCheckUtils]: 102: Hoare triple {54073#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:47,443 INFO L273 TraceCheckUtils]: 103: Hoare triple {54073#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:47,443 INFO L273 TraceCheckUtils]: 104: Hoare triple {54073#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:47,444 INFO L273 TraceCheckUtils]: 105: Hoare triple {54074#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:47,444 INFO L273 TraceCheckUtils]: 106: Hoare triple {54074#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:47,445 INFO L273 TraceCheckUtils]: 107: Hoare triple {54074#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:47,445 INFO L273 TraceCheckUtils]: 108: Hoare triple {54075#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:47,446 INFO L273 TraceCheckUtils]: 109: Hoare triple {54075#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:47,447 INFO L273 TraceCheckUtils]: 110: Hoare triple {54075#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:47,447 INFO L273 TraceCheckUtils]: 111: Hoare triple {54076#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:47,447 INFO L273 TraceCheckUtils]: 112: Hoare triple {54076#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:47,448 INFO L273 TraceCheckUtils]: 113: Hoare triple {54076#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:47,449 INFO L273 TraceCheckUtils]: 114: Hoare triple {54077#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:47,449 INFO L273 TraceCheckUtils]: 115: Hoare triple {54077#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:47,450 INFO L273 TraceCheckUtils]: 116: Hoare triple {54077#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:47,450 INFO L273 TraceCheckUtils]: 117: Hoare triple {54078#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:47,451 INFO L273 TraceCheckUtils]: 118: Hoare triple {54078#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:47,451 INFO L273 TraceCheckUtils]: 119: Hoare triple {54078#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:47,452 INFO L273 TraceCheckUtils]: 120: Hoare triple {54079#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:47,452 INFO L273 TraceCheckUtils]: 121: Hoare triple {54079#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:47,453 INFO L273 TraceCheckUtils]: 122: Hoare triple {54079#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:47,453 INFO L273 TraceCheckUtils]: 123: Hoare triple {54080#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:47,454 INFO L273 TraceCheckUtils]: 124: Hoare triple {54080#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:47,455 INFO L273 TraceCheckUtils]: 125: Hoare triple {54080#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:47,455 INFO L273 TraceCheckUtils]: 126: Hoare triple {54081#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:47,456 INFO L273 TraceCheckUtils]: 127: Hoare triple {54081#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:47,456 INFO L273 TraceCheckUtils]: 128: Hoare triple {54081#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:47,457 INFO L273 TraceCheckUtils]: 129: Hoare triple {54082#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:47,457 INFO L273 TraceCheckUtils]: 130: Hoare triple {54082#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:47,458 INFO L273 TraceCheckUtils]: 131: Hoare triple {54082#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:47,458 INFO L273 TraceCheckUtils]: 132: Hoare triple {54083#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:47,459 INFO L273 TraceCheckUtils]: 133: Hoare triple {54083#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:47,459 INFO L273 TraceCheckUtils]: 134: Hoare triple {54083#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:47,460 INFO L273 TraceCheckUtils]: 135: Hoare triple {54084#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:47,460 INFO L273 TraceCheckUtils]: 136: Hoare triple {54084#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:47,461 INFO L273 TraceCheckUtils]: 137: Hoare triple {54084#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:47,462 INFO L273 TraceCheckUtils]: 138: Hoare triple {54085#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:47,462 INFO L273 TraceCheckUtils]: 139: Hoare triple {54085#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:47,463 INFO L273 TraceCheckUtils]: 140: Hoare triple {54085#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:47,463 INFO L273 TraceCheckUtils]: 141: Hoare triple {54086#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:47,464 INFO L273 TraceCheckUtils]: 142: Hoare triple {54086#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:47,464 INFO L273 TraceCheckUtils]: 143: Hoare triple {54086#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:47,465 INFO L273 TraceCheckUtils]: 144: Hoare triple {54087#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:47,465 INFO L273 TraceCheckUtils]: 145: Hoare triple {54087#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:47,466 INFO L273 TraceCheckUtils]: 146: Hoare triple {54087#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:47,466 INFO L273 TraceCheckUtils]: 147: Hoare triple {54088#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:47,467 INFO L273 TraceCheckUtils]: 148: Hoare triple {54088#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:47,467 INFO L273 TraceCheckUtils]: 149: Hoare triple {54088#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:47,468 INFO L273 TraceCheckUtils]: 150: Hoare triple {54089#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:47,468 INFO L273 TraceCheckUtils]: 151: Hoare triple {54089#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:47,469 INFO L273 TraceCheckUtils]: 152: Hoare triple {54089#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:47,470 INFO L273 TraceCheckUtils]: 153: Hoare triple {54090#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:47,470 INFO L273 TraceCheckUtils]: 154: Hoare triple {54090#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:47,471 INFO L273 TraceCheckUtils]: 155: Hoare triple {54090#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:47,471 INFO L273 TraceCheckUtils]: 156: Hoare triple {54091#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:47,472 INFO L273 TraceCheckUtils]: 157: Hoare triple {54091#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:47,472 INFO L273 TraceCheckUtils]: 158: Hoare triple {54091#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:47,473 INFO L273 TraceCheckUtils]: 159: Hoare triple {54092#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:47,473 INFO L273 TraceCheckUtils]: 160: Hoare triple {54092#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:47,474 INFO L273 TraceCheckUtils]: 161: Hoare triple {54092#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:47,474 INFO L273 TraceCheckUtils]: 162: Hoare triple {54093#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:47,475 INFO L273 TraceCheckUtils]: 163: Hoare triple {54093#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:47,476 INFO L273 TraceCheckUtils]: 164: Hoare triple {54093#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:47,476 INFO L273 TraceCheckUtils]: 165: Hoare triple {54094#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:47,477 INFO L273 TraceCheckUtils]: 166: Hoare triple {54094#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:47,477 INFO L273 TraceCheckUtils]: 167: Hoare triple {54094#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:47,478 INFO L273 TraceCheckUtils]: 168: Hoare triple {54095#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:47,478 INFO L273 TraceCheckUtils]: 169: Hoare triple {54095#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:47,479 INFO L273 TraceCheckUtils]: 170: Hoare triple {54095#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:47,479 INFO L273 TraceCheckUtils]: 171: Hoare triple {54096#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:47,480 INFO L273 TraceCheckUtils]: 172: Hoare triple {54096#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:47,480 INFO L273 TraceCheckUtils]: 173: Hoare triple {54096#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:47,481 INFO L273 TraceCheckUtils]: 174: Hoare triple {54097#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:47,481 INFO L273 TraceCheckUtils]: 175: Hoare triple {54097#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:47,482 INFO L273 TraceCheckUtils]: 176: Hoare triple {54097#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:47,482 INFO L273 TraceCheckUtils]: 177: Hoare triple {54098#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:47,483 INFO L273 TraceCheckUtils]: 178: Hoare triple {54098#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:47,484 INFO L273 TraceCheckUtils]: 179: Hoare triple {54098#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:47,484 INFO L273 TraceCheckUtils]: 180: Hoare triple {54099#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:47,485 INFO L273 TraceCheckUtils]: 181: Hoare triple {54099#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:47,485 INFO L273 TraceCheckUtils]: 182: Hoare triple {54099#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:47,486 INFO L273 TraceCheckUtils]: 183: Hoare triple {54100#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:47,486 INFO L273 TraceCheckUtils]: 184: Hoare triple {54100#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:47,487 INFO L273 TraceCheckUtils]: 185: Hoare triple {54100#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:47,487 INFO L273 TraceCheckUtils]: 186: Hoare triple {54101#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:47,488 INFO L273 TraceCheckUtils]: 187: Hoare triple {54101#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:47,488 INFO L273 TraceCheckUtils]: 188: Hoare triple {54101#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {54102#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:47,489 INFO L273 TraceCheckUtils]: 189: Hoare triple {54102#(<= main_~i~0 61)} assume !(~i~0 < 100000); {54040#false} is VALID [2018-11-23 12:07:47,489 INFO L273 TraceCheckUtils]: 190: Hoare triple {54040#false} havoc ~x~0;~x~0 := 0; {54040#false} is VALID [2018-11-23 12:07:47,489 INFO L273 TraceCheckUtils]: 191: Hoare triple {54040#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {54040#false} is VALID [2018-11-23 12:07:47,490 INFO L256 TraceCheckUtils]: 192: Hoare triple {54040#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {54040#false} is VALID [2018-11-23 12:07:47,490 INFO L273 TraceCheckUtils]: 193: Hoare triple {54040#false} ~cond := #in~cond; {54040#false} is VALID [2018-11-23 12:07:47,490 INFO L273 TraceCheckUtils]: 194: Hoare triple {54040#false} assume 0 == ~cond; {54040#false} is VALID [2018-11-23 12:07:47,490 INFO L273 TraceCheckUtils]: 195: Hoare triple {54040#false} assume !false; {54040#false} is VALID [2018-11-23 12:07:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:47,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:47,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:47,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:47,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:48,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {54039#true} call ULTIMATE.init(); {54039#true} is VALID [2018-11-23 12:07:48,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {54039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54039#true} is VALID [2018-11-23 12:07:48,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {54039#true} assume true; {54039#true} is VALID [2018-11-23 12:07:48,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54039#true} {54039#true} #55#return; {54039#true} is VALID [2018-11-23 12:07:48,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {54039#true} call #t~ret4 := main(); {54039#true} is VALID [2018-11-23 12:07:48,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {54039#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {54121#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:48,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {54121#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54121#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:48,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {54121#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54121#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:48,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {54121#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:48,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {54042#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:48,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {54042#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:48,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {54042#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:48,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {54043#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:48,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {54043#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:48,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {54043#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:48,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {54044#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:48,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {54044#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:48,082 INFO L273 TraceCheckUtils]: 17: Hoare triple {54044#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:48,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {54045#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:48,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {54045#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:48,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {54045#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:48,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {54046#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:48,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {54046#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:48,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {54046#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:48,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {54047#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:48,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {54047#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:48,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {54047#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:48,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {54048#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:48,088 INFO L273 TraceCheckUtils]: 28: Hoare triple {54048#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:48,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {54048#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:48,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {54049#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:48,090 INFO L273 TraceCheckUtils]: 31: Hoare triple {54049#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:48,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {54049#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:48,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {54050#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:48,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {54050#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:48,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {54050#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:48,093 INFO L273 TraceCheckUtils]: 36: Hoare triple {54051#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:48,093 INFO L273 TraceCheckUtils]: 37: Hoare triple {54051#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:48,094 INFO L273 TraceCheckUtils]: 38: Hoare triple {54051#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:48,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {54052#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:48,095 INFO L273 TraceCheckUtils]: 40: Hoare triple {54052#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:48,095 INFO L273 TraceCheckUtils]: 41: Hoare triple {54052#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:48,096 INFO L273 TraceCheckUtils]: 42: Hoare triple {54053#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:48,096 INFO L273 TraceCheckUtils]: 43: Hoare triple {54053#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:48,097 INFO L273 TraceCheckUtils]: 44: Hoare triple {54053#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:48,098 INFO L273 TraceCheckUtils]: 45: Hoare triple {54054#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:48,098 INFO L273 TraceCheckUtils]: 46: Hoare triple {54054#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:48,099 INFO L273 TraceCheckUtils]: 47: Hoare triple {54054#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:48,099 INFO L273 TraceCheckUtils]: 48: Hoare triple {54055#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:48,100 INFO L273 TraceCheckUtils]: 49: Hoare triple {54055#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:48,100 INFO L273 TraceCheckUtils]: 50: Hoare triple {54055#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:48,101 INFO L273 TraceCheckUtils]: 51: Hoare triple {54056#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:48,101 INFO L273 TraceCheckUtils]: 52: Hoare triple {54056#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:48,102 INFO L273 TraceCheckUtils]: 53: Hoare triple {54056#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:48,102 INFO L273 TraceCheckUtils]: 54: Hoare triple {54057#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:48,103 INFO L273 TraceCheckUtils]: 55: Hoare triple {54057#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:48,104 INFO L273 TraceCheckUtils]: 56: Hoare triple {54057#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:48,104 INFO L273 TraceCheckUtils]: 57: Hoare triple {54058#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:48,105 INFO L273 TraceCheckUtils]: 58: Hoare triple {54058#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:48,105 INFO L273 TraceCheckUtils]: 59: Hoare triple {54058#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:48,106 INFO L273 TraceCheckUtils]: 60: Hoare triple {54059#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:48,106 INFO L273 TraceCheckUtils]: 61: Hoare triple {54059#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:48,107 INFO L273 TraceCheckUtils]: 62: Hoare triple {54059#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:48,107 INFO L273 TraceCheckUtils]: 63: Hoare triple {54060#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:48,108 INFO L273 TraceCheckUtils]: 64: Hoare triple {54060#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:48,109 INFO L273 TraceCheckUtils]: 65: Hoare triple {54060#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:48,109 INFO L273 TraceCheckUtils]: 66: Hoare triple {54061#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:48,110 INFO L273 TraceCheckUtils]: 67: Hoare triple {54061#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:48,110 INFO L273 TraceCheckUtils]: 68: Hoare triple {54061#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:48,111 INFO L273 TraceCheckUtils]: 69: Hoare triple {54062#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:48,111 INFO L273 TraceCheckUtils]: 70: Hoare triple {54062#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:48,112 INFO L273 TraceCheckUtils]: 71: Hoare triple {54062#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:48,112 INFO L273 TraceCheckUtils]: 72: Hoare triple {54063#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:48,113 INFO L273 TraceCheckUtils]: 73: Hoare triple {54063#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:48,114 INFO L273 TraceCheckUtils]: 74: Hoare triple {54063#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:48,114 INFO L273 TraceCheckUtils]: 75: Hoare triple {54064#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:48,114 INFO L273 TraceCheckUtils]: 76: Hoare triple {54064#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:48,115 INFO L273 TraceCheckUtils]: 77: Hoare triple {54064#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:48,116 INFO L273 TraceCheckUtils]: 78: Hoare triple {54065#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:48,116 INFO L273 TraceCheckUtils]: 79: Hoare triple {54065#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:48,117 INFO L273 TraceCheckUtils]: 80: Hoare triple {54065#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:48,117 INFO L273 TraceCheckUtils]: 81: Hoare triple {54066#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:48,118 INFO L273 TraceCheckUtils]: 82: Hoare triple {54066#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:48,119 INFO L273 TraceCheckUtils]: 83: Hoare triple {54066#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:48,119 INFO L273 TraceCheckUtils]: 84: Hoare triple {54067#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:48,120 INFO L273 TraceCheckUtils]: 85: Hoare triple {54067#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:48,120 INFO L273 TraceCheckUtils]: 86: Hoare triple {54067#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:48,121 INFO L273 TraceCheckUtils]: 87: Hoare triple {54068#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:48,121 INFO L273 TraceCheckUtils]: 88: Hoare triple {54068#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:48,122 INFO L273 TraceCheckUtils]: 89: Hoare triple {54068#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:48,122 INFO L273 TraceCheckUtils]: 90: Hoare triple {54069#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:48,123 INFO L273 TraceCheckUtils]: 91: Hoare triple {54069#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:48,124 INFO L273 TraceCheckUtils]: 92: Hoare triple {54069#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:48,124 INFO L273 TraceCheckUtils]: 93: Hoare triple {54070#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:48,125 INFO L273 TraceCheckUtils]: 94: Hoare triple {54070#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:48,125 INFO L273 TraceCheckUtils]: 95: Hoare triple {54070#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:48,126 INFO L273 TraceCheckUtils]: 96: Hoare triple {54071#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:48,126 INFO L273 TraceCheckUtils]: 97: Hoare triple {54071#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:48,127 INFO L273 TraceCheckUtils]: 98: Hoare triple {54071#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:48,128 INFO L273 TraceCheckUtils]: 99: Hoare triple {54072#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:48,128 INFO L273 TraceCheckUtils]: 100: Hoare triple {54072#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:48,129 INFO L273 TraceCheckUtils]: 101: Hoare triple {54072#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:48,129 INFO L273 TraceCheckUtils]: 102: Hoare triple {54073#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:48,130 INFO L273 TraceCheckUtils]: 103: Hoare triple {54073#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:48,130 INFO L273 TraceCheckUtils]: 104: Hoare triple {54073#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:48,131 INFO L273 TraceCheckUtils]: 105: Hoare triple {54074#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:48,131 INFO L273 TraceCheckUtils]: 106: Hoare triple {54074#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:48,132 INFO L273 TraceCheckUtils]: 107: Hoare triple {54074#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:48,133 INFO L273 TraceCheckUtils]: 108: Hoare triple {54075#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:48,133 INFO L273 TraceCheckUtils]: 109: Hoare triple {54075#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:48,134 INFO L273 TraceCheckUtils]: 110: Hoare triple {54075#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:48,134 INFO L273 TraceCheckUtils]: 111: Hoare triple {54076#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:48,135 INFO L273 TraceCheckUtils]: 112: Hoare triple {54076#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:48,135 INFO L273 TraceCheckUtils]: 113: Hoare triple {54076#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:48,136 INFO L273 TraceCheckUtils]: 114: Hoare triple {54077#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:48,136 INFO L273 TraceCheckUtils]: 115: Hoare triple {54077#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:48,137 INFO L273 TraceCheckUtils]: 116: Hoare triple {54077#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:48,137 INFO L273 TraceCheckUtils]: 117: Hoare triple {54078#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:48,138 INFO L273 TraceCheckUtils]: 118: Hoare triple {54078#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:48,139 INFO L273 TraceCheckUtils]: 119: Hoare triple {54078#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:48,139 INFO L273 TraceCheckUtils]: 120: Hoare triple {54079#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:48,140 INFO L273 TraceCheckUtils]: 121: Hoare triple {54079#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:48,140 INFO L273 TraceCheckUtils]: 122: Hoare triple {54079#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:48,141 INFO L273 TraceCheckUtils]: 123: Hoare triple {54080#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:48,141 INFO L273 TraceCheckUtils]: 124: Hoare triple {54080#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:48,142 INFO L273 TraceCheckUtils]: 125: Hoare triple {54080#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:48,143 INFO L273 TraceCheckUtils]: 126: Hoare triple {54081#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:48,143 INFO L273 TraceCheckUtils]: 127: Hoare triple {54081#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:48,144 INFO L273 TraceCheckUtils]: 128: Hoare triple {54081#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:48,144 INFO L273 TraceCheckUtils]: 129: Hoare triple {54082#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:48,145 INFO L273 TraceCheckUtils]: 130: Hoare triple {54082#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:48,145 INFO L273 TraceCheckUtils]: 131: Hoare triple {54082#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:48,146 INFO L273 TraceCheckUtils]: 132: Hoare triple {54083#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:48,146 INFO L273 TraceCheckUtils]: 133: Hoare triple {54083#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:48,147 INFO L273 TraceCheckUtils]: 134: Hoare triple {54083#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:48,148 INFO L273 TraceCheckUtils]: 135: Hoare triple {54084#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:48,148 INFO L273 TraceCheckUtils]: 136: Hoare triple {54084#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:48,149 INFO L273 TraceCheckUtils]: 137: Hoare triple {54084#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:48,149 INFO L273 TraceCheckUtils]: 138: Hoare triple {54085#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:48,150 INFO L273 TraceCheckUtils]: 139: Hoare triple {54085#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:48,151 INFO L273 TraceCheckUtils]: 140: Hoare triple {54085#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:48,151 INFO L273 TraceCheckUtils]: 141: Hoare triple {54086#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:48,151 INFO L273 TraceCheckUtils]: 142: Hoare triple {54086#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:48,152 INFO L273 TraceCheckUtils]: 143: Hoare triple {54086#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:48,153 INFO L273 TraceCheckUtils]: 144: Hoare triple {54087#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:48,153 INFO L273 TraceCheckUtils]: 145: Hoare triple {54087#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:48,154 INFO L273 TraceCheckUtils]: 146: Hoare triple {54087#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:48,154 INFO L273 TraceCheckUtils]: 147: Hoare triple {54088#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:48,155 INFO L273 TraceCheckUtils]: 148: Hoare triple {54088#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:48,155 INFO L273 TraceCheckUtils]: 149: Hoare triple {54088#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:48,156 INFO L273 TraceCheckUtils]: 150: Hoare triple {54089#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:48,156 INFO L273 TraceCheckUtils]: 151: Hoare triple {54089#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:48,157 INFO L273 TraceCheckUtils]: 152: Hoare triple {54089#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:48,158 INFO L273 TraceCheckUtils]: 153: Hoare triple {54090#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:48,158 INFO L273 TraceCheckUtils]: 154: Hoare triple {54090#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:48,159 INFO L273 TraceCheckUtils]: 155: Hoare triple {54090#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:48,159 INFO L273 TraceCheckUtils]: 156: Hoare triple {54091#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:48,160 INFO L273 TraceCheckUtils]: 157: Hoare triple {54091#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:48,160 INFO L273 TraceCheckUtils]: 158: Hoare triple {54091#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:48,161 INFO L273 TraceCheckUtils]: 159: Hoare triple {54092#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:48,161 INFO L273 TraceCheckUtils]: 160: Hoare triple {54092#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:48,162 INFO L273 TraceCheckUtils]: 161: Hoare triple {54092#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:48,163 INFO L273 TraceCheckUtils]: 162: Hoare triple {54093#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:48,163 INFO L273 TraceCheckUtils]: 163: Hoare triple {54093#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:48,164 INFO L273 TraceCheckUtils]: 164: Hoare triple {54093#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:48,164 INFO L273 TraceCheckUtils]: 165: Hoare triple {54094#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:48,165 INFO L273 TraceCheckUtils]: 166: Hoare triple {54094#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:48,166 INFO L273 TraceCheckUtils]: 167: Hoare triple {54094#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:48,166 INFO L273 TraceCheckUtils]: 168: Hoare triple {54095#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:48,166 INFO L273 TraceCheckUtils]: 169: Hoare triple {54095#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:48,167 INFO L273 TraceCheckUtils]: 170: Hoare triple {54095#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:48,168 INFO L273 TraceCheckUtils]: 171: Hoare triple {54096#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:48,168 INFO L273 TraceCheckUtils]: 172: Hoare triple {54096#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:48,169 INFO L273 TraceCheckUtils]: 173: Hoare triple {54096#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:48,169 INFO L273 TraceCheckUtils]: 174: Hoare triple {54097#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:48,170 INFO L273 TraceCheckUtils]: 175: Hoare triple {54097#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:48,171 INFO L273 TraceCheckUtils]: 176: Hoare triple {54097#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:48,171 INFO L273 TraceCheckUtils]: 177: Hoare triple {54098#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:48,172 INFO L273 TraceCheckUtils]: 178: Hoare triple {54098#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:48,172 INFO L273 TraceCheckUtils]: 179: Hoare triple {54098#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:48,173 INFO L273 TraceCheckUtils]: 180: Hoare triple {54099#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:48,173 INFO L273 TraceCheckUtils]: 181: Hoare triple {54099#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:48,174 INFO L273 TraceCheckUtils]: 182: Hoare triple {54099#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:48,174 INFO L273 TraceCheckUtils]: 183: Hoare triple {54100#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:48,175 INFO L273 TraceCheckUtils]: 184: Hoare triple {54100#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:48,175 INFO L273 TraceCheckUtils]: 185: Hoare triple {54100#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:48,176 INFO L273 TraceCheckUtils]: 186: Hoare triple {54101#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:48,176 INFO L273 TraceCheckUtils]: 187: Hoare triple {54101#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:48,177 INFO L273 TraceCheckUtils]: 188: Hoare triple {54101#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {54102#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:48,178 INFO L273 TraceCheckUtils]: 189: Hoare triple {54102#(<= main_~i~0 61)} assume !(~i~0 < 100000); {54040#false} is VALID [2018-11-23 12:07:48,178 INFO L273 TraceCheckUtils]: 190: Hoare triple {54040#false} havoc ~x~0;~x~0 := 0; {54040#false} is VALID [2018-11-23 12:07:48,178 INFO L273 TraceCheckUtils]: 191: Hoare triple {54040#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {54040#false} is VALID [2018-11-23 12:07:48,178 INFO L256 TraceCheckUtils]: 192: Hoare triple {54040#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {54040#false} is VALID [2018-11-23 12:07:48,178 INFO L273 TraceCheckUtils]: 193: Hoare triple {54040#false} ~cond := #in~cond; {54040#false} is VALID [2018-11-23 12:07:48,179 INFO L273 TraceCheckUtils]: 194: Hoare triple {54040#false} assume 0 == ~cond; {54040#false} is VALID [2018-11-23 12:07:48,179 INFO L273 TraceCheckUtils]: 195: Hoare triple {54040#false} assume !false; {54040#false} is VALID [2018-11-23 12:07:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:48,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:48,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2018-11-23 12:07:48,222 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 196 [2018-11-23 12:07:48,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:48,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states. [2018-11-23 12:07:48,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:48,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-23 12:07:48,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-23 12:07:48,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 12:07:48,418 INFO L87 Difference]: Start difference. First operand 201 states and 263 transitions. Second operand 65 states. [2018-11-23 12:07:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:49,809 INFO L93 Difference]: Finished difference Result 217 states and 282 transitions. [2018-11-23 12:07:49,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-23 12:07:49,809 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 196 [2018-11-23 12:07:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:07:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 282 transitions. [2018-11-23 12:07:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:07:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 282 transitions. [2018-11-23 12:07:49,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 282 transitions. [2018-11-23 12:07:50,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:50,083 INFO L225 Difference]: With dead ends: 217 [2018-11-23 12:07:50,083 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 12:07:50,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 12:07:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 12:07:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-11-23 12:07:50,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:50,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 204 states. [2018-11-23 12:07:50,244 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 204 states. [2018-11-23 12:07:50,244 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 204 states. [2018-11-23 12:07:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:50,247 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2018-11-23 12:07:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2018-11-23 12:07:50,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:50,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:50,248 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 206 states. [2018-11-23 12:07:50,248 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 206 states. [2018-11-23 12:07:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:50,251 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2018-11-23 12:07:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2018-11-23 12:07:50,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:50,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:50,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:50,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 12:07:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 267 transitions. [2018-11-23 12:07:50,254 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 267 transitions. Word has length 196 [2018-11-23 12:07:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:50,254 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 267 transitions. [2018-11-23 12:07:50,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-23 12:07:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 267 transitions. [2018-11-23 12:07:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-23 12:07:50,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:50,255 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:50,256 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:50,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash -887399175, now seen corresponding path program 62 times [2018-11-23 12:07:50,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:50,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:50,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:52,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {55667#true} call ULTIMATE.init(); {55667#true} is VALID [2018-11-23 12:07:52,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {55667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {55667#true} is VALID [2018-11-23 12:07:52,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {55667#true} assume true; {55667#true} is VALID [2018-11-23 12:07:52,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55667#true} {55667#true} #55#return; {55667#true} is VALID [2018-11-23 12:07:52,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {55667#true} call #t~ret4 := main(); {55667#true} is VALID [2018-11-23 12:07:52,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {55667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {55669#(= main_~i~0 0)} is VALID [2018-11-23 12:07:52,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {55669#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55669#(= main_~i~0 0)} is VALID [2018-11-23 12:07:52,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {55669#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55669#(= main_~i~0 0)} is VALID [2018-11-23 12:07:52,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {55669#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:52,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {55670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:52,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {55670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:52,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {55670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:52,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {55671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:52,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {55671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:52,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {55671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:52,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {55672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:52,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {55672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:52,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {55672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:52,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {55673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:52,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {55673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:52,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {55673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:52,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {55674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:52,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {55674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:52,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {55674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:52,094 INFO L273 TraceCheckUtils]: 24: Hoare triple {55675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:52,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {55675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:52,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {55675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:52,096 INFO L273 TraceCheckUtils]: 27: Hoare triple {55676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:52,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {55676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:52,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {55676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:52,098 INFO L273 TraceCheckUtils]: 30: Hoare triple {55677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:52,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {55677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:52,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {55677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:52,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {55678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:52,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {55678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:52,100 INFO L273 TraceCheckUtils]: 35: Hoare triple {55678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:52,101 INFO L273 TraceCheckUtils]: 36: Hoare triple {55679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:52,101 INFO L273 TraceCheckUtils]: 37: Hoare triple {55679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:52,102 INFO L273 TraceCheckUtils]: 38: Hoare triple {55679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:52,103 INFO L273 TraceCheckUtils]: 39: Hoare triple {55680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:52,103 INFO L273 TraceCheckUtils]: 40: Hoare triple {55680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:52,104 INFO L273 TraceCheckUtils]: 41: Hoare triple {55680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:52,104 INFO L273 TraceCheckUtils]: 42: Hoare triple {55681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:52,105 INFO L273 TraceCheckUtils]: 43: Hoare triple {55681#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:52,106 INFO L273 TraceCheckUtils]: 44: Hoare triple {55681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:52,106 INFO L273 TraceCheckUtils]: 45: Hoare triple {55682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:52,107 INFO L273 TraceCheckUtils]: 46: Hoare triple {55682#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:52,107 INFO L273 TraceCheckUtils]: 47: Hoare triple {55682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:52,108 INFO L273 TraceCheckUtils]: 48: Hoare triple {55683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:52,108 INFO L273 TraceCheckUtils]: 49: Hoare triple {55683#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:52,109 INFO L273 TraceCheckUtils]: 50: Hoare triple {55683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:52,110 INFO L273 TraceCheckUtils]: 51: Hoare triple {55684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:52,110 INFO L273 TraceCheckUtils]: 52: Hoare triple {55684#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:52,111 INFO L273 TraceCheckUtils]: 53: Hoare triple {55684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:52,111 INFO L273 TraceCheckUtils]: 54: Hoare triple {55685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:52,112 INFO L273 TraceCheckUtils]: 55: Hoare triple {55685#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:52,112 INFO L273 TraceCheckUtils]: 56: Hoare triple {55685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:52,113 INFO L273 TraceCheckUtils]: 57: Hoare triple {55686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:52,113 INFO L273 TraceCheckUtils]: 58: Hoare triple {55686#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:52,114 INFO L273 TraceCheckUtils]: 59: Hoare triple {55686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:52,115 INFO L273 TraceCheckUtils]: 60: Hoare triple {55687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:52,115 INFO L273 TraceCheckUtils]: 61: Hoare triple {55687#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:52,116 INFO L273 TraceCheckUtils]: 62: Hoare triple {55687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:52,116 INFO L273 TraceCheckUtils]: 63: Hoare triple {55688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:52,117 INFO L273 TraceCheckUtils]: 64: Hoare triple {55688#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:52,118 INFO L273 TraceCheckUtils]: 65: Hoare triple {55688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:52,118 INFO L273 TraceCheckUtils]: 66: Hoare triple {55689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:52,119 INFO L273 TraceCheckUtils]: 67: Hoare triple {55689#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:52,119 INFO L273 TraceCheckUtils]: 68: Hoare triple {55689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:52,120 INFO L273 TraceCheckUtils]: 69: Hoare triple {55690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:52,120 INFO L273 TraceCheckUtils]: 70: Hoare triple {55690#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:52,121 INFO L273 TraceCheckUtils]: 71: Hoare triple {55690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:52,121 INFO L273 TraceCheckUtils]: 72: Hoare triple {55691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:52,122 INFO L273 TraceCheckUtils]: 73: Hoare triple {55691#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:52,123 INFO L273 TraceCheckUtils]: 74: Hoare triple {55691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:52,123 INFO L273 TraceCheckUtils]: 75: Hoare triple {55692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:52,124 INFO L273 TraceCheckUtils]: 76: Hoare triple {55692#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:52,124 INFO L273 TraceCheckUtils]: 77: Hoare triple {55692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:52,125 INFO L273 TraceCheckUtils]: 78: Hoare triple {55693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:52,125 INFO L273 TraceCheckUtils]: 79: Hoare triple {55693#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:52,126 INFO L273 TraceCheckUtils]: 80: Hoare triple {55693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:52,127 INFO L273 TraceCheckUtils]: 81: Hoare triple {55694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:52,127 INFO L273 TraceCheckUtils]: 82: Hoare triple {55694#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:52,128 INFO L273 TraceCheckUtils]: 83: Hoare triple {55694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:52,128 INFO L273 TraceCheckUtils]: 84: Hoare triple {55695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:52,129 INFO L273 TraceCheckUtils]: 85: Hoare triple {55695#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:52,130 INFO L273 TraceCheckUtils]: 86: Hoare triple {55695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:52,130 INFO L273 TraceCheckUtils]: 87: Hoare triple {55696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:52,131 INFO L273 TraceCheckUtils]: 88: Hoare triple {55696#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:52,131 INFO L273 TraceCheckUtils]: 89: Hoare triple {55696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:52,132 INFO L273 TraceCheckUtils]: 90: Hoare triple {55697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:52,132 INFO L273 TraceCheckUtils]: 91: Hoare triple {55697#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:52,133 INFO L273 TraceCheckUtils]: 92: Hoare triple {55697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:52,133 INFO L273 TraceCheckUtils]: 93: Hoare triple {55698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:52,134 INFO L273 TraceCheckUtils]: 94: Hoare triple {55698#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:52,135 INFO L273 TraceCheckUtils]: 95: Hoare triple {55698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:52,135 INFO L273 TraceCheckUtils]: 96: Hoare triple {55699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:52,136 INFO L273 TraceCheckUtils]: 97: Hoare triple {55699#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:52,136 INFO L273 TraceCheckUtils]: 98: Hoare triple {55699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:52,137 INFO L273 TraceCheckUtils]: 99: Hoare triple {55700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:52,137 INFO L273 TraceCheckUtils]: 100: Hoare triple {55700#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:52,138 INFO L273 TraceCheckUtils]: 101: Hoare triple {55700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:52,139 INFO L273 TraceCheckUtils]: 102: Hoare triple {55701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:52,139 INFO L273 TraceCheckUtils]: 103: Hoare triple {55701#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:52,140 INFO L273 TraceCheckUtils]: 104: Hoare triple {55701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:52,140 INFO L273 TraceCheckUtils]: 105: Hoare triple {55702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:52,141 INFO L273 TraceCheckUtils]: 106: Hoare triple {55702#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:52,141 INFO L273 TraceCheckUtils]: 107: Hoare triple {55702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:52,142 INFO L273 TraceCheckUtils]: 108: Hoare triple {55703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:52,142 INFO L273 TraceCheckUtils]: 109: Hoare triple {55703#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:52,143 INFO L273 TraceCheckUtils]: 110: Hoare triple {55703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:52,144 INFO L273 TraceCheckUtils]: 111: Hoare triple {55704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:52,144 INFO L273 TraceCheckUtils]: 112: Hoare triple {55704#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:52,145 INFO L273 TraceCheckUtils]: 113: Hoare triple {55704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:52,145 INFO L273 TraceCheckUtils]: 114: Hoare triple {55705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:52,146 INFO L273 TraceCheckUtils]: 115: Hoare triple {55705#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:52,147 INFO L273 TraceCheckUtils]: 116: Hoare triple {55705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:52,147 INFO L273 TraceCheckUtils]: 117: Hoare triple {55706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:52,148 INFO L273 TraceCheckUtils]: 118: Hoare triple {55706#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:52,148 INFO L273 TraceCheckUtils]: 119: Hoare triple {55706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:52,149 INFO L273 TraceCheckUtils]: 120: Hoare triple {55707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:52,149 INFO L273 TraceCheckUtils]: 121: Hoare triple {55707#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:52,150 INFO L273 TraceCheckUtils]: 122: Hoare triple {55707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:52,151 INFO L273 TraceCheckUtils]: 123: Hoare triple {55708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:52,151 INFO L273 TraceCheckUtils]: 124: Hoare triple {55708#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:52,152 INFO L273 TraceCheckUtils]: 125: Hoare triple {55708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:52,152 INFO L273 TraceCheckUtils]: 126: Hoare triple {55709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:52,153 INFO L273 TraceCheckUtils]: 127: Hoare triple {55709#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:52,153 INFO L273 TraceCheckUtils]: 128: Hoare triple {55709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:52,154 INFO L273 TraceCheckUtils]: 129: Hoare triple {55710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:52,154 INFO L273 TraceCheckUtils]: 130: Hoare triple {55710#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:52,155 INFO L273 TraceCheckUtils]: 131: Hoare triple {55710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:52,156 INFO L273 TraceCheckUtils]: 132: Hoare triple {55711#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:52,156 INFO L273 TraceCheckUtils]: 133: Hoare triple {55711#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:52,157 INFO L273 TraceCheckUtils]: 134: Hoare triple {55711#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:52,157 INFO L273 TraceCheckUtils]: 135: Hoare triple {55712#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:52,158 INFO L273 TraceCheckUtils]: 136: Hoare triple {55712#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:52,159 INFO L273 TraceCheckUtils]: 137: Hoare triple {55712#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:52,159 INFO L273 TraceCheckUtils]: 138: Hoare triple {55713#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:52,160 INFO L273 TraceCheckUtils]: 139: Hoare triple {55713#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:52,160 INFO L273 TraceCheckUtils]: 140: Hoare triple {55713#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:52,161 INFO L273 TraceCheckUtils]: 141: Hoare triple {55714#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:52,161 INFO L273 TraceCheckUtils]: 142: Hoare triple {55714#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:52,162 INFO L273 TraceCheckUtils]: 143: Hoare triple {55714#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:52,162 INFO L273 TraceCheckUtils]: 144: Hoare triple {55715#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:52,163 INFO L273 TraceCheckUtils]: 145: Hoare triple {55715#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:52,164 INFO L273 TraceCheckUtils]: 146: Hoare triple {55715#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:52,164 INFO L273 TraceCheckUtils]: 147: Hoare triple {55716#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:52,165 INFO L273 TraceCheckUtils]: 148: Hoare triple {55716#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:52,165 INFO L273 TraceCheckUtils]: 149: Hoare triple {55716#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:52,166 INFO L273 TraceCheckUtils]: 150: Hoare triple {55717#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:52,166 INFO L273 TraceCheckUtils]: 151: Hoare triple {55717#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:52,167 INFO L273 TraceCheckUtils]: 152: Hoare triple {55717#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:52,168 INFO L273 TraceCheckUtils]: 153: Hoare triple {55718#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:52,168 INFO L273 TraceCheckUtils]: 154: Hoare triple {55718#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:52,169 INFO L273 TraceCheckUtils]: 155: Hoare triple {55718#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:52,169 INFO L273 TraceCheckUtils]: 156: Hoare triple {55719#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:52,170 INFO L273 TraceCheckUtils]: 157: Hoare triple {55719#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:52,170 INFO L273 TraceCheckUtils]: 158: Hoare triple {55719#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:52,171 INFO L273 TraceCheckUtils]: 159: Hoare triple {55720#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:52,171 INFO L273 TraceCheckUtils]: 160: Hoare triple {55720#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:52,172 INFO L273 TraceCheckUtils]: 161: Hoare triple {55720#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:52,173 INFO L273 TraceCheckUtils]: 162: Hoare triple {55721#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:52,173 INFO L273 TraceCheckUtils]: 163: Hoare triple {55721#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:52,174 INFO L273 TraceCheckUtils]: 164: Hoare triple {55721#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:52,174 INFO L273 TraceCheckUtils]: 165: Hoare triple {55722#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:52,175 INFO L273 TraceCheckUtils]: 166: Hoare triple {55722#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:52,176 INFO L273 TraceCheckUtils]: 167: Hoare triple {55722#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:52,176 INFO L273 TraceCheckUtils]: 168: Hoare triple {55723#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:52,177 INFO L273 TraceCheckUtils]: 169: Hoare triple {55723#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:52,177 INFO L273 TraceCheckUtils]: 170: Hoare triple {55723#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:52,178 INFO L273 TraceCheckUtils]: 171: Hoare triple {55724#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:52,178 INFO L273 TraceCheckUtils]: 172: Hoare triple {55724#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:52,179 INFO L273 TraceCheckUtils]: 173: Hoare triple {55724#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:52,180 INFO L273 TraceCheckUtils]: 174: Hoare triple {55725#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:52,180 INFO L273 TraceCheckUtils]: 175: Hoare triple {55725#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:52,181 INFO L273 TraceCheckUtils]: 176: Hoare triple {55725#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:52,181 INFO L273 TraceCheckUtils]: 177: Hoare triple {55726#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:52,182 INFO L273 TraceCheckUtils]: 178: Hoare triple {55726#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:52,182 INFO L273 TraceCheckUtils]: 179: Hoare triple {55726#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:52,183 INFO L273 TraceCheckUtils]: 180: Hoare triple {55727#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:52,183 INFO L273 TraceCheckUtils]: 181: Hoare triple {55727#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:52,184 INFO L273 TraceCheckUtils]: 182: Hoare triple {55727#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:52,185 INFO L273 TraceCheckUtils]: 183: Hoare triple {55728#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:52,185 INFO L273 TraceCheckUtils]: 184: Hoare triple {55728#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:52,186 INFO L273 TraceCheckUtils]: 185: Hoare triple {55728#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:52,186 INFO L273 TraceCheckUtils]: 186: Hoare triple {55729#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:52,187 INFO L273 TraceCheckUtils]: 187: Hoare triple {55729#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:52,188 INFO L273 TraceCheckUtils]: 188: Hoare triple {55729#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:52,188 INFO L273 TraceCheckUtils]: 189: Hoare triple {55730#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:52,189 INFO L273 TraceCheckUtils]: 190: Hoare triple {55730#(<= main_~i~0 61)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:52,189 INFO L273 TraceCheckUtils]: 191: Hoare triple {55730#(<= main_~i~0 61)} ~i~0 := 1 + ~i~0; {55731#(<= main_~i~0 62)} is VALID [2018-11-23 12:07:52,190 INFO L273 TraceCheckUtils]: 192: Hoare triple {55731#(<= main_~i~0 62)} assume !(~i~0 < 100000); {55668#false} is VALID [2018-11-23 12:07:52,190 INFO L273 TraceCheckUtils]: 193: Hoare triple {55668#false} havoc ~x~0;~x~0 := 0; {55668#false} is VALID [2018-11-23 12:07:52,190 INFO L273 TraceCheckUtils]: 194: Hoare triple {55668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {55668#false} is VALID [2018-11-23 12:07:52,191 INFO L256 TraceCheckUtils]: 195: Hoare triple {55668#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {55668#false} is VALID [2018-11-23 12:07:52,191 INFO L273 TraceCheckUtils]: 196: Hoare triple {55668#false} ~cond := #in~cond; {55668#false} is VALID [2018-11-23 12:07:52,191 INFO L273 TraceCheckUtils]: 197: Hoare triple {55668#false} assume 0 == ~cond; {55668#false} is VALID [2018-11-23 12:07:52,191 INFO L273 TraceCheckUtils]: 198: Hoare triple {55668#false} assume !false; {55668#false} is VALID [2018-11-23 12:07:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:52,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:52,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:52,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:07:52,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:07:52,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:52,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:52,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {55667#true} call ULTIMATE.init(); {55667#true} is VALID [2018-11-23 12:07:52,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {55667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {55667#true} is VALID [2018-11-23 12:07:52,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {55667#true} assume true; {55667#true} is VALID [2018-11-23 12:07:52,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55667#true} {55667#true} #55#return; {55667#true} is VALID [2018-11-23 12:07:52,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {55667#true} call #t~ret4 := main(); {55667#true} is VALID [2018-11-23 12:07:52,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {55667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {55750#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:52,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {55750#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55750#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:52,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {55750#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55750#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:52,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {55750#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:52,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {55670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:52,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {55670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:52,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {55670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:52,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {55671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:52,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {55671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:52,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {55671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:52,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {55672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:52,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {55672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:52,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {55672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:52,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {55673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:52,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {55673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:52,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {55673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:52,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {55674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:52,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {55674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:52,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {55674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:52,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {55675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:52,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {55675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:52,781 INFO L273 TraceCheckUtils]: 26: Hoare triple {55675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:52,782 INFO L273 TraceCheckUtils]: 27: Hoare triple {55676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:52,782 INFO L273 TraceCheckUtils]: 28: Hoare triple {55676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:52,783 INFO L273 TraceCheckUtils]: 29: Hoare triple {55676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:52,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {55677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:52,784 INFO L273 TraceCheckUtils]: 31: Hoare triple {55677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:52,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {55677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:52,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {55678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:52,786 INFO L273 TraceCheckUtils]: 34: Hoare triple {55678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:52,786 INFO L273 TraceCheckUtils]: 35: Hoare triple {55678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:52,787 INFO L273 TraceCheckUtils]: 36: Hoare triple {55679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:52,787 INFO L273 TraceCheckUtils]: 37: Hoare triple {55679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:52,788 INFO L273 TraceCheckUtils]: 38: Hoare triple {55679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:52,789 INFO L273 TraceCheckUtils]: 39: Hoare triple {55680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:52,789 INFO L273 TraceCheckUtils]: 40: Hoare triple {55680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:52,790 INFO L273 TraceCheckUtils]: 41: Hoare triple {55680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:52,790 INFO L273 TraceCheckUtils]: 42: Hoare triple {55681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:52,791 INFO L273 TraceCheckUtils]: 43: Hoare triple {55681#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:52,792 INFO L273 TraceCheckUtils]: 44: Hoare triple {55681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:52,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {55682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:52,793 INFO L273 TraceCheckUtils]: 46: Hoare triple {55682#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:52,793 INFO L273 TraceCheckUtils]: 47: Hoare triple {55682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:52,794 INFO L273 TraceCheckUtils]: 48: Hoare triple {55683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:52,794 INFO L273 TraceCheckUtils]: 49: Hoare triple {55683#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:52,795 INFO L273 TraceCheckUtils]: 50: Hoare triple {55683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:52,796 INFO L273 TraceCheckUtils]: 51: Hoare triple {55684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:52,796 INFO L273 TraceCheckUtils]: 52: Hoare triple {55684#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:52,797 INFO L273 TraceCheckUtils]: 53: Hoare triple {55684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:52,797 INFO L273 TraceCheckUtils]: 54: Hoare triple {55685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:52,798 INFO L273 TraceCheckUtils]: 55: Hoare triple {55685#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:52,798 INFO L273 TraceCheckUtils]: 56: Hoare triple {55685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:52,799 INFO L273 TraceCheckUtils]: 57: Hoare triple {55686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:52,799 INFO L273 TraceCheckUtils]: 58: Hoare triple {55686#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:52,800 INFO L273 TraceCheckUtils]: 59: Hoare triple {55686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:52,801 INFO L273 TraceCheckUtils]: 60: Hoare triple {55687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:52,801 INFO L273 TraceCheckUtils]: 61: Hoare triple {55687#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:52,802 INFO L273 TraceCheckUtils]: 62: Hoare triple {55687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:52,802 INFO L273 TraceCheckUtils]: 63: Hoare triple {55688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:52,803 INFO L273 TraceCheckUtils]: 64: Hoare triple {55688#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:52,804 INFO L273 TraceCheckUtils]: 65: Hoare triple {55688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:52,804 INFO L273 TraceCheckUtils]: 66: Hoare triple {55689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:52,805 INFO L273 TraceCheckUtils]: 67: Hoare triple {55689#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:52,805 INFO L273 TraceCheckUtils]: 68: Hoare triple {55689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:52,806 INFO L273 TraceCheckUtils]: 69: Hoare triple {55690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:52,806 INFO L273 TraceCheckUtils]: 70: Hoare triple {55690#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:52,807 INFO L273 TraceCheckUtils]: 71: Hoare triple {55690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:52,808 INFO L273 TraceCheckUtils]: 72: Hoare triple {55691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:52,808 INFO L273 TraceCheckUtils]: 73: Hoare triple {55691#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:52,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {55691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:52,809 INFO L273 TraceCheckUtils]: 75: Hoare triple {55692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:52,810 INFO L273 TraceCheckUtils]: 76: Hoare triple {55692#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:52,810 INFO L273 TraceCheckUtils]: 77: Hoare triple {55692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:52,811 INFO L273 TraceCheckUtils]: 78: Hoare triple {55693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:52,811 INFO L273 TraceCheckUtils]: 79: Hoare triple {55693#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:52,812 INFO L273 TraceCheckUtils]: 80: Hoare triple {55693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:52,813 INFO L273 TraceCheckUtils]: 81: Hoare triple {55694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:52,813 INFO L273 TraceCheckUtils]: 82: Hoare triple {55694#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:52,814 INFO L273 TraceCheckUtils]: 83: Hoare triple {55694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:52,814 INFO L273 TraceCheckUtils]: 84: Hoare triple {55695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:52,815 INFO L273 TraceCheckUtils]: 85: Hoare triple {55695#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:52,816 INFO L273 TraceCheckUtils]: 86: Hoare triple {55695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:52,816 INFO L273 TraceCheckUtils]: 87: Hoare triple {55696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:52,817 INFO L273 TraceCheckUtils]: 88: Hoare triple {55696#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:52,817 INFO L273 TraceCheckUtils]: 89: Hoare triple {55696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:52,818 INFO L273 TraceCheckUtils]: 90: Hoare triple {55697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:52,818 INFO L273 TraceCheckUtils]: 91: Hoare triple {55697#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:52,819 INFO L273 TraceCheckUtils]: 92: Hoare triple {55697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:52,820 INFO L273 TraceCheckUtils]: 93: Hoare triple {55698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:52,820 INFO L273 TraceCheckUtils]: 94: Hoare triple {55698#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:52,821 INFO L273 TraceCheckUtils]: 95: Hoare triple {55698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:52,821 INFO L273 TraceCheckUtils]: 96: Hoare triple {55699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:52,822 INFO L273 TraceCheckUtils]: 97: Hoare triple {55699#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:52,822 INFO L273 TraceCheckUtils]: 98: Hoare triple {55699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:52,823 INFO L273 TraceCheckUtils]: 99: Hoare triple {55700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:52,823 INFO L273 TraceCheckUtils]: 100: Hoare triple {55700#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:52,824 INFO L273 TraceCheckUtils]: 101: Hoare triple {55700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:52,825 INFO L273 TraceCheckUtils]: 102: Hoare triple {55701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:52,825 INFO L273 TraceCheckUtils]: 103: Hoare triple {55701#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:52,826 INFO L273 TraceCheckUtils]: 104: Hoare triple {55701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:52,826 INFO L273 TraceCheckUtils]: 105: Hoare triple {55702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:52,827 INFO L273 TraceCheckUtils]: 106: Hoare triple {55702#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:52,828 INFO L273 TraceCheckUtils]: 107: Hoare triple {55702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:52,828 INFO L273 TraceCheckUtils]: 108: Hoare triple {55703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:52,829 INFO L273 TraceCheckUtils]: 109: Hoare triple {55703#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:52,829 INFO L273 TraceCheckUtils]: 110: Hoare triple {55703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:52,830 INFO L273 TraceCheckUtils]: 111: Hoare triple {55704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:52,830 INFO L273 TraceCheckUtils]: 112: Hoare triple {55704#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:52,831 INFO L273 TraceCheckUtils]: 113: Hoare triple {55704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:52,832 INFO L273 TraceCheckUtils]: 114: Hoare triple {55705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:52,832 INFO L273 TraceCheckUtils]: 115: Hoare triple {55705#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:52,833 INFO L273 TraceCheckUtils]: 116: Hoare triple {55705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:52,833 INFO L273 TraceCheckUtils]: 117: Hoare triple {55706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:52,834 INFO L273 TraceCheckUtils]: 118: Hoare triple {55706#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:52,834 INFO L273 TraceCheckUtils]: 119: Hoare triple {55706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:52,835 INFO L273 TraceCheckUtils]: 120: Hoare triple {55707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:52,835 INFO L273 TraceCheckUtils]: 121: Hoare triple {55707#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:52,836 INFO L273 TraceCheckUtils]: 122: Hoare triple {55707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:52,837 INFO L273 TraceCheckUtils]: 123: Hoare triple {55708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:52,837 INFO L273 TraceCheckUtils]: 124: Hoare triple {55708#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:52,838 INFO L273 TraceCheckUtils]: 125: Hoare triple {55708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:52,838 INFO L273 TraceCheckUtils]: 126: Hoare triple {55709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:52,839 INFO L273 TraceCheckUtils]: 127: Hoare triple {55709#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:52,840 INFO L273 TraceCheckUtils]: 128: Hoare triple {55709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:52,840 INFO L273 TraceCheckUtils]: 129: Hoare triple {55710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:52,841 INFO L273 TraceCheckUtils]: 130: Hoare triple {55710#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:52,841 INFO L273 TraceCheckUtils]: 131: Hoare triple {55710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:52,842 INFO L273 TraceCheckUtils]: 132: Hoare triple {55711#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:52,842 INFO L273 TraceCheckUtils]: 133: Hoare triple {55711#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:52,843 INFO L273 TraceCheckUtils]: 134: Hoare triple {55711#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:52,844 INFO L273 TraceCheckUtils]: 135: Hoare triple {55712#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:52,844 INFO L273 TraceCheckUtils]: 136: Hoare triple {55712#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:52,845 INFO L273 TraceCheckUtils]: 137: Hoare triple {55712#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:52,845 INFO L273 TraceCheckUtils]: 138: Hoare triple {55713#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:52,846 INFO L273 TraceCheckUtils]: 139: Hoare triple {55713#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:52,846 INFO L273 TraceCheckUtils]: 140: Hoare triple {55713#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:52,847 INFO L273 TraceCheckUtils]: 141: Hoare triple {55714#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:52,847 INFO L273 TraceCheckUtils]: 142: Hoare triple {55714#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:52,848 INFO L273 TraceCheckUtils]: 143: Hoare triple {55714#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:52,849 INFO L273 TraceCheckUtils]: 144: Hoare triple {55715#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:52,849 INFO L273 TraceCheckUtils]: 145: Hoare triple {55715#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:52,850 INFO L273 TraceCheckUtils]: 146: Hoare triple {55715#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:52,850 INFO L273 TraceCheckUtils]: 147: Hoare triple {55716#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:52,851 INFO L273 TraceCheckUtils]: 148: Hoare triple {55716#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:52,852 INFO L273 TraceCheckUtils]: 149: Hoare triple {55716#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:52,852 INFO L273 TraceCheckUtils]: 150: Hoare triple {55717#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:52,853 INFO L273 TraceCheckUtils]: 151: Hoare triple {55717#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:52,853 INFO L273 TraceCheckUtils]: 152: Hoare triple {55717#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:52,854 INFO L273 TraceCheckUtils]: 153: Hoare triple {55718#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:52,854 INFO L273 TraceCheckUtils]: 154: Hoare triple {55718#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:52,855 INFO L273 TraceCheckUtils]: 155: Hoare triple {55718#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:52,856 INFO L273 TraceCheckUtils]: 156: Hoare triple {55719#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:52,856 INFO L273 TraceCheckUtils]: 157: Hoare triple {55719#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:52,857 INFO L273 TraceCheckUtils]: 158: Hoare triple {55719#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:52,857 INFO L273 TraceCheckUtils]: 159: Hoare triple {55720#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:52,858 INFO L273 TraceCheckUtils]: 160: Hoare triple {55720#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:52,858 INFO L273 TraceCheckUtils]: 161: Hoare triple {55720#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:52,859 INFO L273 TraceCheckUtils]: 162: Hoare triple {55721#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:52,859 INFO L273 TraceCheckUtils]: 163: Hoare triple {55721#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:52,860 INFO L273 TraceCheckUtils]: 164: Hoare triple {55721#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:52,861 INFO L273 TraceCheckUtils]: 165: Hoare triple {55722#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:52,861 INFO L273 TraceCheckUtils]: 166: Hoare triple {55722#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:52,862 INFO L273 TraceCheckUtils]: 167: Hoare triple {55722#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:52,862 INFO L273 TraceCheckUtils]: 168: Hoare triple {55723#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:52,863 INFO L273 TraceCheckUtils]: 169: Hoare triple {55723#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:52,864 INFO L273 TraceCheckUtils]: 170: Hoare triple {55723#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:52,864 INFO L273 TraceCheckUtils]: 171: Hoare triple {55724#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:52,865 INFO L273 TraceCheckUtils]: 172: Hoare triple {55724#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:52,865 INFO L273 TraceCheckUtils]: 173: Hoare triple {55724#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:52,866 INFO L273 TraceCheckUtils]: 174: Hoare triple {55725#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:52,866 INFO L273 TraceCheckUtils]: 175: Hoare triple {55725#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:52,867 INFO L273 TraceCheckUtils]: 176: Hoare triple {55725#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:52,867 INFO L273 TraceCheckUtils]: 177: Hoare triple {55726#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:52,868 INFO L273 TraceCheckUtils]: 178: Hoare triple {55726#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:52,869 INFO L273 TraceCheckUtils]: 179: Hoare triple {55726#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:52,869 INFO L273 TraceCheckUtils]: 180: Hoare triple {55727#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:52,870 INFO L273 TraceCheckUtils]: 181: Hoare triple {55727#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:52,870 INFO L273 TraceCheckUtils]: 182: Hoare triple {55727#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:52,871 INFO L273 TraceCheckUtils]: 183: Hoare triple {55728#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:52,871 INFO L273 TraceCheckUtils]: 184: Hoare triple {55728#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:52,872 INFO L273 TraceCheckUtils]: 185: Hoare triple {55728#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:52,873 INFO L273 TraceCheckUtils]: 186: Hoare triple {55729#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:52,873 INFO L273 TraceCheckUtils]: 187: Hoare triple {55729#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:52,874 INFO L273 TraceCheckUtils]: 188: Hoare triple {55729#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:52,874 INFO L273 TraceCheckUtils]: 189: Hoare triple {55730#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:52,875 INFO L273 TraceCheckUtils]: 190: Hoare triple {55730#(<= main_~i~0 61)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:52,875 INFO L273 TraceCheckUtils]: 191: Hoare triple {55730#(<= main_~i~0 61)} ~i~0 := 1 + ~i~0; {55731#(<= main_~i~0 62)} is VALID [2018-11-23 12:07:52,876 INFO L273 TraceCheckUtils]: 192: Hoare triple {55731#(<= main_~i~0 62)} assume !(~i~0 < 100000); {55668#false} is VALID [2018-11-23 12:07:52,876 INFO L273 TraceCheckUtils]: 193: Hoare triple {55668#false} havoc ~x~0;~x~0 := 0; {55668#false} is VALID [2018-11-23 12:07:52,877 INFO L273 TraceCheckUtils]: 194: Hoare triple {55668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {55668#false} is VALID [2018-11-23 12:07:52,877 INFO L256 TraceCheckUtils]: 195: Hoare triple {55668#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {55668#false} is VALID [2018-11-23 12:07:52,877 INFO L273 TraceCheckUtils]: 196: Hoare triple {55668#false} ~cond := #in~cond; {55668#false} is VALID [2018-11-23 12:07:52,877 INFO L273 TraceCheckUtils]: 197: Hoare triple {55668#false} assume 0 == ~cond; {55668#false} is VALID [2018-11-23 12:07:52,877 INFO L273 TraceCheckUtils]: 198: Hoare triple {55668#false} assume !false; {55668#false} is VALID [2018-11-23 12:07:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:52,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:52,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2018-11-23 12:07:52,922 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 199 [2018-11-23 12:07:52,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:52,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2018-11-23 12:07:53,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:53,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-23 12:07:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-23 12:07:53,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 12:07:53,133 INFO L87 Difference]: Start difference. First operand 204 states and 267 transitions. Second operand 66 states. [2018-11-23 12:07:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:54,452 INFO L93 Difference]: Finished difference Result 220 states and 286 transitions. [2018-11-23 12:07:54,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-23 12:07:54,452 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 199 [2018-11-23 12:07:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:07:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 286 transitions. [2018-11-23 12:07:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:07:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 286 transitions. [2018-11-23 12:07:54,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 286 transitions. [2018-11-23 12:07:54,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:54,731 INFO L225 Difference]: With dead ends: 220 [2018-11-23 12:07:54,731 INFO L226 Difference]: Without dead ends: 209 [2018-11-23 12:07:54,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 12:07:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-23 12:07:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-11-23 12:07:54,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:54,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 207 states. [2018-11-23 12:07:54,789 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 207 states. [2018-11-23 12:07:54,789 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 207 states. [2018-11-23 12:07:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:54,793 INFO L93 Difference]: Finished difference Result 209 states and 274 transitions. [2018-11-23 12:07:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2018-11-23 12:07:54,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:54,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:54,793 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 209 states. [2018-11-23 12:07:54,793 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 209 states. [2018-11-23 12:07:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:54,797 INFO L93 Difference]: Finished difference Result 209 states and 274 transitions. [2018-11-23 12:07:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2018-11-23 12:07:54,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:54,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:54,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:54,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 12:07:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 271 transitions. [2018-11-23 12:07:54,801 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 271 transitions. Word has length 199 [2018-11-23 12:07:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:54,801 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 271 transitions. [2018-11-23 12:07:54,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-23 12:07:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 271 transitions. [2018-11-23 12:07:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:07:54,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:54,803 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:54,803 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:54,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:54,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1939749725, now seen corresponding path program 63 times [2018-11-23 12:07:54,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:54,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:54,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:54,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:54,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat