java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:50:35,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:50:35,680 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:50:35,693 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:50:35,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:50:35,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:50:35,695 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:50:35,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:50:35,699 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:50:35,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:50:35,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:50:35,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:50:35,703 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:50:35,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:50:35,705 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:50:35,706 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:50:35,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:50:35,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:50:35,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:50:35,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:50:35,715 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:50:35,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:50:35,719 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:50:35,719 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:50:35,720 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:50:35,721 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:50:35,722 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:50:35,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:50:35,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:50:35,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:50:35,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:50:35,726 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:50:35,726 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:50:35,727 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:50:35,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:50:35,729 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:50:35,729 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-14 16:50:35,745 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:50:35,746 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:50:35,747 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:50:35,747 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:50:35,750 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:50:35,751 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:50:35,752 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:50:35,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:50:35,755 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:50:35,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:50:35,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:50:35,758 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:50:35,758 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:50:35,759 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:50:35,759 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:50:35,759 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:50:35,759 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:50:35,760 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:50:35,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:50:35,760 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:50:35,761 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:50:35,761 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:50:35,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:50:35,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:50:35,762 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:50:35,762 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:50:35,763 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:50:35,764 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:50:35,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:50:35,765 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:50:35,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:50:35,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:50:35,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:50:35,860 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:50:35,860 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:50:35,861 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call_ground.i [2018-11-14 16:50:35,929 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9b9121d3/a48912ce00ee498bb24c2b5e735e109f/FLAG343c874b3 [2018-11-14 16:50:36,446 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:50:36,447 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call_ground.i [2018-11-14 16:50:36,457 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9b9121d3/a48912ce00ee498bb24c2b5e735e109f/FLAG343c874b3 [2018-11-14 16:50:36,482 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9b9121d3/a48912ce00ee498bb24c2b5e735e109f [2018-11-14 16:50:36,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:50:36,500 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:50:36,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:50:36,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:50:36,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:50:36,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15155093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36, skipping insertion in model container [2018-11-14 16:50:36,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:50:36,556 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:50:36,781 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:50:36,785 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:50:36,817 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:50:36,838 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:50:36,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36 WrapperNode [2018-11-14 16:50:36,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:50:36,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:50:36,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:50:36,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:50:36,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:50:36,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:50:36,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:50:36,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:50:36,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:50:37,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:50:37,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:50:37,033 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:50:37,033 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:50:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:50:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:50:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:50:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:50:37,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:50:37,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:50:37,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:50:37,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:50:37,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:50:37,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:50:38,001 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:50:38,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:50:38 BoogieIcfgContainer [2018-11-14 16:50:38,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:50:38,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:50:38,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:50:38,006 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:50:38,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:50:36" (1/3) ... [2018-11-14 16:50:38,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668815c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:50:38, skipping insertion in model container [2018-11-14 16:50:38,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (2/3) ... [2018-11-14 16:50:38,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668815c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:50:38, skipping insertion in model container [2018-11-14 16:50:38,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:50:38" (3/3) ... [2018-11-14 16:50:38,010 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_false-unreach-call_ground.i [2018-11-14 16:50:38,021 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:50:38,029 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:50:38,048 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:50:38,090 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:50:38,091 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:50:38,091 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:50:38,091 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:50:38,091 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:50:38,092 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:50:38,092 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:50:38,092 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:50:38,093 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:50:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-14 16:50:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:50:38,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:38,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:38,124 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:38,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1734015145, now seen corresponding path program 1 times [2018-11-14 16:50:38,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:38,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:38,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:38,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:38,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:38,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {52#true} call ULTIMATE.init(); {52#true} is VALID [2018-11-14 16:50:38,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52#true} is VALID [2018-11-14 16:50:38,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#true} assume true; {52#true} is VALID [2018-11-14 16:50:38,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} #137#return; {52#true} is VALID [2018-11-14 16:50:38,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {52#true} call #t~ret15 := main(); {52#true} is VALID [2018-11-14 16:50:38,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {52#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {52#true} is VALID [2018-11-14 16:50:38,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {52#true} assume !true; {53#false} is VALID [2018-11-14 16:50:38,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#false} ~x~0 := 0; {53#false} is VALID [2018-11-14 16:50:38,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-14 16:50:38,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {53#false} is VALID [2018-11-14 16:50:38,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-14 16:50:38,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {53#false} assume !!(~y~0 < 100000);call #t~mem13 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {53#false} is VALID [2018-11-14 16:50:38,306 INFO L256 TraceCheckUtils]: 12: Hoare triple {53#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {53#false} is VALID [2018-11-14 16:50:38,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {53#false} ~cond := #in~cond; {53#false} is VALID [2018-11-14 16:50:38,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {53#false} assume ~cond == 0; {53#false} is VALID [2018-11-14 16:50:38,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {53#false} assume !false; {53#false} is VALID [2018-11-14 16:50:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:38,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:50:38,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:50:38,319 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 16:50:38,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:38,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:50:38,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:38,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:50:38,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:50:38,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:50:38,425 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-14 16:50:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:38,582 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2018-11-14 16:50:38,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:50:38,583 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 16:50:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:50:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-14 16:50:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:50:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-14 16:50:38,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 131 transitions. [2018-11-14 16:50:39,254 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-14 16:50:39,270 INFO L225 Difference]: With dead ends: 92 [2018-11-14 16:50:39,271 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:50:39,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:50:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:50:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 16:50:39,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:39,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 16:50:39,507 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 16:50:39,507 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 16:50:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:39,518 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-14 16:50:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 16:50:39,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:39,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:39,522 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 16:50:39,522 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 16:50:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:39,534 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-14 16:50:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 16:50:39,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:39,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:39,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:39,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:50:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-14 16:50:39,548 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 16 [2018-11-14 16:50:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:39,549 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-14 16:50:39,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:50:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 16:50:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:50:39,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:39,552 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:39,552 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:39,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:39,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1030099958, now seen corresponding path program 1 times [2018-11-14 16:50:39,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:39,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:39,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:39,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:39,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:39,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {321#true} call ULTIMATE.init(); {321#true} is VALID [2018-11-14 16:50:39,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {321#true} is VALID [2018-11-14 16:50:39,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {321#true} assume true; {321#true} is VALID [2018-11-14 16:50:39,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {321#true} {321#true} #137#return; {321#true} is VALID [2018-11-14 16:50:39,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {321#true} call #t~ret15 := main(); {321#true} is VALID [2018-11-14 16:50:39,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {323#(= main_~i~0 0)} is VALID [2018-11-14 16:50:39,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {323#(= main_~i~0 0)} assume true; {323#(= main_~i~0 0)} is VALID [2018-11-14 16:50:39,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {323#(= main_~i~0 0)} assume !(~i~0 < 100000); {322#false} is VALID [2018-11-14 16:50:39,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {322#false} ~x~0 := 0; {322#false} is VALID [2018-11-14 16:50:39,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {322#false} assume true; {322#false} is VALID [2018-11-14 16:50:39,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {322#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {322#false} is VALID [2018-11-14 16:50:39,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {322#false} assume true; {322#false} is VALID [2018-11-14 16:50:39,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {322#false} assume !!(~y~0 < 100000);call #t~mem13 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {322#false} is VALID [2018-11-14 16:50:39,643 INFO L256 TraceCheckUtils]: 13: Hoare triple {322#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {322#false} is VALID [2018-11-14 16:50:39,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {322#false} ~cond := #in~cond; {322#false} is VALID [2018-11-14 16:50:39,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {322#false} assume ~cond == 0; {322#false} is VALID [2018-11-14 16:50:39,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {322#false} assume !false; {322#false} is VALID [2018-11-14 16:50:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:39,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:50:39,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:50:39,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 16:50:39,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:39,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:50:39,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:39,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:50:39,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:50:39,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:50:39,729 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-11-14 16:50:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:40,140 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-14 16:50:40,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:50:40,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 16:50:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-14 16:50:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-14 16:50:40,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-14 16:50:40,407 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-14 16:50:40,413 INFO L225 Difference]: With dead ends: 82 [2018-11-14 16:50:40,413 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 16:50:40,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:50:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 16:50:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2018-11-14 16:50:40,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:40,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 46 states. [2018-11-14 16:50:40,460 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 46 states. [2018-11-14 16:50:40,460 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 46 states. [2018-11-14 16:50:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:40,466 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-14 16:50:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-14 16:50:40,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:40,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:40,468 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 67 states. [2018-11-14 16:50:40,468 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 67 states. [2018-11-14 16:50:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:40,473 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-14 16:50:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-14 16:50:40,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:40,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:40,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:40,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 16:50:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-11-14 16:50:40,479 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 17 [2018-11-14 16:50:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:40,479 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-14 16:50:40,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:50:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-14 16:50:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:50:40,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:40,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:40,481 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:40,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:40,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1829402631, now seen corresponding path program 1 times [2018-11-14 16:50:40,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:40,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:40,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:40,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:40,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:40,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-14 16:50:40,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {630#true} is VALID [2018-11-14 16:50:40,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-14 16:50:40,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #137#return; {630#true} is VALID [2018-11-14 16:50:40,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret15 := main(); {630#true} is VALID [2018-11-14 16:50:40,601 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {630#true} is VALID [2018-11-14 16:50:40,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-14 16:50:40,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {630#true} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {632#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 16:50:40,604 INFO L273 TraceCheckUtils]: 8: Hoare triple {632#(= main_~s~0 main_~i~0)} assume true; {632#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 16:50:40,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {632#(= main_~s~0 main_~i~0)} assume !(~k~0 < 100000); {632#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 16:50:40,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {632#(= main_~s~0 main_~i~0)} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {631#false} is VALID [2018-11-14 16:50:40,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {631#false} ~x~0 := 0; {631#false} is VALID [2018-11-14 16:50:40,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {631#false} assume true; {631#false} is VALID [2018-11-14 16:50:40,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {631#false} assume !!(~x~0 < ~i~0);~y~0 := ~x~0 + 1; {631#false} is VALID [2018-11-14 16:50:40,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {631#false} assume true; {631#false} is VALID [2018-11-14 16:50:40,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {631#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {631#false} is VALID [2018-11-14 16:50:40,610 INFO L256 TraceCheckUtils]: 16: Hoare triple {631#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {631#false} is VALID [2018-11-14 16:50:40,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {631#false} ~cond := #in~cond; {631#false} is VALID [2018-11-14 16:50:40,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {631#false} assume ~cond == 0; {631#false} is VALID [2018-11-14 16:50:40,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-14 16:50:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:40,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:50:40,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:50:40,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:50:40,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:40,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:50:40,654 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-14 16:50:40,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:50:40,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:50:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:50:40,656 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 3 states. [2018-11-14 16:50:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:40,921 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2018-11-14 16:50:40,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:50:40,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:50:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2018-11-14 16:50:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2018-11-14 16:50:40,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 131 transitions. [2018-11-14 16:50:41,180 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-14 16:50:41,184 INFO L225 Difference]: With dead ends: 105 [2018-11-14 16:50:41,184 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 16:50:41,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:50:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 16:50:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2018-11-14 16:50:41,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:41,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 51 states. [2018-11-14 16:50:41,240 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 51 states. [2018-11-14 16:50:41,240 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 51 states. [2018-11-14 16:50:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:41,244 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2018-11-14 16:50:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2018-11-14 16:50:41,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:41,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:41,246 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 67 states. [2018-11-14 16:50:41,246 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 67 states. [2018-11-14 16:50:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:41,250 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2018-11-14 16:50:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2018-11-14 16:50:41,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:41,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:41,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:41,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 16:50:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-14 16:50:41,256 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 20 [2018-11-14 16:50:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:41,256 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-14 16:50:41,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:50:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-14 16:50:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:50:41,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:41,258 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:41,258 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:41,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:41,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1436375621, now seen corresponding path program 1 times [2018-11-14 16:50:41,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:41,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:41,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:41,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:41,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:41,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {975#true} call ULTIMATE.init(); {975#true} is VALID [2018-11-14 16:50:41,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {975#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {975#true} is VALID [2018-11-14 16:50:41,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-14 16:50:41,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {975#true} {975#true} #137#return; {975#true} is VALID [2018-11-14 16:50:41,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {975#true} call #t~ret15 := main(); {975#true} is VALID [2018-11-14 16:50:41,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {975#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {977#(= main_~i~0 0)} is VALID [2018-11-14 16:50:41,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {977#(= main_~i~0 0)} assume true; {977#(= main_~i~0 0)} is VALID [2018-11-14 16:50:41,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {977#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {978#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:41,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {978#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {978#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:41,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {978#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !(~k~0 < 100000); {976#false} is VALID [2018-11-14 16:50:41,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {976#false} assume !(~s~0 != ~i~0); {976#false} is VALID [2018-11-14 16:50:41,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {976#false} ~x~0 := 0; {976#false} is VALID [2018-11-14 16:50:41,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {976#false} assume true; {976#false} is VALID [2018-11-14 16:50:41,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {976#false} assume !!(~x~0 < ~i~0);~y~0 := ~x~0 + 1; {976#false} is VALID [2018-11-14 16:50:41,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {976#false} assume true; {976#false} is VALID [2018-11-14 16:50:41,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {976#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {976#false} is VALID [2018-11-14 16:50:41,408 INFO L256 TraceCheckUtils]: 16: Hoare triple {976#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {976#false} is VALID [2018-11-14 16:50:41,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {976#false} ~cond := #in~cond; {976#false} is VALID [2018-11-14 16:50:41,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {976#false} assume ~cond == 0; {976#false} is VALID [2018-11-14 16:50:41,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {976#false} assume !false; {976#false} is VALID [2018-11-14 16:50:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:41,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:50:41,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:50:41,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-14 16:50:41,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:41,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:50:41,453 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-14 16:50:41,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:50:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:50:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:50:41,455 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 4 states. [2018-11-14 16:50:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:41,783 INFO L93 Difference]: Finished difference Result 125 states and 161 transitions. [2018-11-14 16:50:41,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:50:41,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-14 16:50:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:50:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2018-11-14 16:50:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:50:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2018-11-14 16:50:41,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2018-11-14 16:50:42,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:42,053 INFO L225 Difference]: With dead ends: 125 [2018-11-14 16:50:42,053 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 16:50:42,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:50:42,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 16:50:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 53. [2018-11-14 16:50:42,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:42,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 53 states. [2018-11-14 16:50:42,076 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 53 states. [2018-11-14 16:50:42,076 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 53 states. [2018-11-14 16:50:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:42,080 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-11-14 16:50:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2018-11-14 16:50:42,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:42,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:42,082 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 82 states. [2018-11-14 16:50:42,082 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 82 states. [2018-11-14 16:50:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:42,086 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-11-14 16:50:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2018-11-14 16:50:42,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:42,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:42,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:42,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 16:50:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-14 16:50:42,091 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 20 [2018-11-14 16:50:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:42,091 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-14 16:50:42,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:50:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-14 16:50:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:50:42,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:42,093 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:42,093 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:42,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:42,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1435057265, now seen corresponding path program 1 times [2018-11-14 16:50:42,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:42,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:42,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:42,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:42,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:42,237 INFO L256 TraceCheckUtils]: 0: Hoare triple {1378#true} call ULTIMATE.init(); {1378#true} is VALID [2018-11-14 16:50:42,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {1378#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1378#true} is VALID [2018-11-14 16:50:42,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 16:50:42,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1378#true} {1378#true} #137#return; {1378#true} is VALID [2018-11-14 16:50:42,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {1378#true} call #t~ret15 := main(); {1378#true} is VALID [2018-11-14 16:50:42,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {1378#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1380#(= main_~i~0 0)} is VALID [2018-11-14 16:50:42,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {1380#(= main_~i~0 0)} assume true; {1380#(= main_~i~0 0)} is VALID [2018-11-14 16:50:42,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {1380#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {1381#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:42,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {1381#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {1381#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:42,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {1381#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {1381#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:42,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {1381#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1381#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:42,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {1381#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {1382#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:42,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {1382#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {1382#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:42,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {1382#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !(~k~0 < 100000); {1379#false} is VALID [2018-11-14 16:50:42,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {1379#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1379#false} is VALID [2018-11-14 16:50:42,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {1379#false} ~x~0 := 0; {1379#false} is VALID [2018-11-14 16:50:42,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {1379#false} assume true; {1379#false} is VALID [2018-11-14 16:50:42,255 INFO L273 TraceCheckUtils]: 17: Hoare triple {1379#false} assume !!(~x~0 < ~i~0);~y~0 := ~x~0 + 1; {1379#false} is VALID [2018-11-14 16:50:42,255 INFO L273 TraceCheckUtils]: 18: Hoare triple {1379#false} assume true; {1379#false} is VALID [2018-11-14 16:50:42,256 INFO L273 TraceCheckUtils]: 19: Hoare triple {1379#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1379#false} is VALID [2018-11-14 16:50:42,256 INFO L256 TraceCheckUtils]: 20: Hoare triple {1379#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1379#false} is VALID [2018-11-14 16:50:42,257 INFO L273 TraceCheckUtils]: 21: Hoare triple {1379#false} ~cond := #in~cond; {1379#false} is VALID [2018-11-14 16:50:42,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {1379#false} assume ~cond == 0; {1379#false} is VALID [2018-11-14 16:50:42,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {1379#false} assume !false; {1379#false} is VALID [2018-11-14 16:50:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:42,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:42,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:42,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:42,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:42,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {1378#true} call ULTIMATE.init(); {1378#true} is VALID [2018-11-14 16:50:42,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {1378#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1378#true} is VALID [2018-11-14 16:50:42,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 16:50:42,609 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1378#true} {1378#true} #137#return; {1378#true} is VALID [2018-11-14 16:50:42,609 INFO L256 TraceCheckUtils]: 4: Hoare triple {1378#true} call #t~ret15 := main(); {1378#true} is VALID [2018-11-14 16:50:42,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {1378#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1401#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:42,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {1401#(<= main_~i~0 0)} assume true; {1401#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:42,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {1401#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {1408#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:42,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {1408#(<= main_~k~0 1)} assume true; {1408#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:42,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {1408#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {1408#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:42,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {1408#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1408#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:42,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {1408#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {1421#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:42,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {1421#(<= main_~k~0 2)} assume true; {1421#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:42,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {1421#(<= main_~k~0 2)} assume !(~k~0 < 100000); {1379#false} is VALID [2018-11-14 16:50:42,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {1379#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1379#false} is VALID [2018-11-14 16:50:42,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {1379#false} ~x~0 := 0; {1379#false} is VALID [2018-11-14 16:50:42,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {1379#false} assume true; {1379#false} is VALID [2018-11-14 16:50:42,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {1379#false} assume !!(~x~0 < ~i~0);~y~0 := ~x~0 + 1; {1379#false} is VALID [2018-11-14 16:50:42,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {1379#false} assume true; {1379#false} is VALID [2018-11-14 16:50:42,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {1379#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1379#false} is VALID [2018-11-14 16:50:42,623 INFO L256 TraceCheckUtils]: 20: Hoare triple {1379#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1379#false} is VALID [2018-11-14 16:50:42,623 INFO L273 TraceCheckUtils]: 21: Hoare triple {1379#false} ~cond := #in~cond; {1379#false} is VALID [2018-11-14 16:50:42,623 INFO L273 TraceCheckUtils]: 22: Hoare triple {1379#false} assume ~cond == 0; {1379#false} is VALID [2018-11-14 16:50:42,624 INFO L273 TraceCheckUtils]: 23: Hoare triple {1379#false} assume !false; {1379#false} is VALID [2018-11-14 16:50:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:42,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:42,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 16:50:42,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 16:50:42,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:42,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:50:42,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:42,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:50:42,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:50:42,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:50:42,876 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 8 states. [2018-11-14 16:50:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:43,439 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2018-11-14 16:50:43,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:50:43,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 16:50:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:50:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2018-11-14 16:50:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:50:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2018-11-14 16:50:43,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 144 transitions. [2018-11-14 16:50:43,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:43,680 INFO L225 Difference]: With dead ends: 133 [2018-11-14 16:50:43,680 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 16:50:43,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:50:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 16:50:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2018-11-14 16:50:43,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:43,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 60 states. [2018-11-14 16:50:43,742 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 60 states. [2018-11-14 16:50:43,743 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 60 states. [2018-11-14 16:50:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:43,747 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2018-11-14 16:50:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2018-11-14 16:50:43,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:43,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:43,748 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 90 states. [2018-11-14 16:50:43,748 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 90 states. [2018-11-14 16:50:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:43,752 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2018-11-14 16:50:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2018-11-14 16:50:43,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:43,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:43,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:43,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 16:50:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-11-14 16:50:43,756 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 24 [2018-11-14 16:50:43,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:43,757 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2018-11-14 16:50:43,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:50:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-11-14 16:50:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:50:43,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:43,758 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:43,758 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:43,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1629766693, now seen corresponding path program 2 times [2018-11-14 16:50:43,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:43,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:43,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:43,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {1889#true} call ULTIMATE.init(); {1889#true} is VALID [2018-11-14 16:50:43,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {1889#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1889#true} is VALID [2018-11-14 16:50:43,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {1889#true} assume true; {1889#true} is VALID [2018-11-14 16:50:43,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1889#true} {1889#true} #137#return; {1889#true} is VALID [2018-11-14 16:50:43,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {1889#true} call #t~ret15 := main(); {1889#true} is VALID [2018-11-14 16:50:43,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {1889#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1891#(= main_~i~0 0)} is VALID [2018-11-14 16:50:43,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {1891#(= main_~i~0 0)} assume true; {1891#(= main_~i~0 0)} is VALID [2018-11-14 16:50:43,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {1891#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {1892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:43,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {1892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {1892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:43,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {1892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {1892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:43,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {1892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:43,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {1892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {1893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:43,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {1893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {1893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:43,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {1893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {1893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:43,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {1893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:43,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {1893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {1894#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:43,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {1894#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {1894#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:43,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {1894#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !(~k~0 < 100000); {1890#false} is VALID [2018-11-14 16:50:43,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {1890#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1890#false} is VALID [2018-11-14 16:50:43,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {1890#false} ~x~0 := 0; {1890#false} is VALID [2018-11-14 16:50:43,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {1890#false} assume true; {1890#false} is VALID [2018-11-14 16:50:43,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {1890#false} assume !!(~x~0 < ~i~0);~y~0 := ~x~0 + 1; {1890#false} is VALID [2018-11-14 16:50:43,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {1890#false} assume true; {1890#false} is VALID [2018-11-14 16:50:43,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {1890#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1890#false} is VALID [2018-11-14 16:50:43,981 INFO L256 TraceCheckUtils]: 24: Hoare triple {1890#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1890#false} is VALID [2018-11-14 16:50:43,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {1890#false} ~cond := #in~cond; {1890#false} is VALID [2018-11-14 16:50:43,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {1890#false} assume ~cond == 0; {1890#false} is VALID [2018-11-14 16:50:43,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {1890#false} assume !false; {1890#false} is VALID [2018-11-14 16:50:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:43,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:43,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:44,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:50:44,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 16:50:44,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:44,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:44,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {1889#true} call ULTIMATE.init(); {1889#true} is VALID [2018-11-14 16:50:44,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {1889#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1889#true} is VALID [2018-11-14 16:50:44,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {1889#true} assume true; {1889#true} is VALID [2018-11-14 16:50:44,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1889#true} {1889#true} #137#return; {1889#true} is VALID [2018-11-14 16:50:44,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {1889#true} call #t~ret15 := main(); {1889#true} is VALID [2018-11-14 16:50:44,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {1889#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {1913#(<= main_~i~0 0)} assume true; {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {1913#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {1913#(<= main_~i~0 0)} assume true; {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {1913#(<= main_~i~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {1913#(<= main_~i~0 0)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {1913#(<= main_~i~0 0)} ~k~0 := ~k~0 + 1; {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {1913#(<= main_~i~0 0)} assume true; {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {1913#(<= main_~i~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {1913#(<= main_~i~0 0)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {1913#(<= main_~i~0 0)} ~k~0 := ~k~0 + 1; {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {1913#(<= main_~i~0 0)} assume true; {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,199 INFO L273 TraceCheckUtils]: 17: Hoare triple {1913#(<= main_~i~0 0)} assume !(~k~0 < 100000); {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {1913#(<= main_~i~0 0)} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1913#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,201 INFO L273 TraceCheckUtils]: 19: Hoare triple {1913#(<= main_~i~0 0)} ~x~0 := 0; {1956#(and (<= main_~i~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 16:50:44,202 INFO L273 TraceCheckUtils]: 20: Hoare triple {1956#(and (<= main_~i~0 0) (<= 0 main_~x~0))} assume true; {1956#(and (<= main_~i~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 16:50:44,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {1956#(and (<= main_~i~0 0) (<= 0 main_~x~0))} assume !!(~x~0 < ~i~0);~y~0 := ~x~0 + 1; {1890#false} is VALID [2018-11-14 16:50:44,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {1890#false} assume true; {1890#false} is VALID [2018-11-14 16:50:44,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {1890#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1890#false} is VALID [2018-11-14 16:50:44,203 INFO L256 TraceCheckUtils]: 24: Hoare triple {1890#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1890#false} is VALID [2018-11-14 16:50:44,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {1890#false} ~cond := #in~cond; {1890#false} is VALID [2018-11-14 16:50:44,204 INFO L273 TraceCheckUtils]: 26: Hoare triple {1890#false} assume ~cond == 0; {1890#false} is VALID [2018-11-14 16:50:44,204 INFO L273 TraceCheckUtils]: 27: Hoare triple {1890#false} assume !false; {1890#false} is VALID [2018-11-14 16:50:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 16:50:44,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:50:44,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-14 16:50:44,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-14 16:50:44,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:44,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:50:44,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:44,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:50:44,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:50:44,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:50:44,274 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 8 states. [2018-11-14 16:50:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:44,977 INFO L93 Difference]: Finished difference Result 135 states and 174 transitions. [2018-11-14 16:50:44,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:50:44,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-14 16:50:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:50:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-14 16:50:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:50:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-14 16:50:44,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 141 transitions. [2018-11-14 16:50:45,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:45,185 INFO L225 Difference]: With dead ends: 135 [2018-11-14 16:50:45,186 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 16:50:45,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:50:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 16:50:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2018-11-14 16:50:45,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:45,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 81 states. [2018-11-14 16:50:45,255 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 81 states. [2018-11-14 16:50:45,255 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 81 states. [2018-11-14 16:50:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:45,261 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2018-11-14 16:50:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2018-11-14 16:50:45,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:45,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:45,262 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 92 states. [2018-11-14 16:50:45,262 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 92 states. [2018-11-14 16:50:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:45,266 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2018-11-14 16:50:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2018-11-14 16:50:45,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:45,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:45,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:45,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-14 16:50:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2018-11-14 16:50:45,270 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 28 [2018-11-14 16:50:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:45,271 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2018-11-14 16:50:45,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:50:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2018-11-14 16:50:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 16:50:45,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:45,272 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:45,272 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:45,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash 780121715, now seen corresponding path program 1 times [2018-11-14 16:50:45,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:45,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:45,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:45,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:45,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:45,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {2446#true} call ULTIMATE.init(); {2446#true} is VALID [2018-11-14 16:50:45,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {2446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2446#true} is VALID [2018-11-14 16:50:45,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {2446#true} assume true; {2446#true} is VALID [2018-11-14 16:50:45,494 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2446#true} {2446#true} #137#return; {2446#true} is VALID [2018-11-14 16:50:45,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {2446#true} call #t~ret15 := main(); {2446#true} is VALID [2018-11-14 16:50:45,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {2446#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2448#(= main_~i~0 0)} is VALID [2018-11-14 16:50:45,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {2448#(= main_~i~0 0)} assume true; {2448#(= main_~i~0 0)} is VALID [2018-11-14 16:50:45,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {2448#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {2449#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {2449#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {2449#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {2449#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {2449#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {2449#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2449#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {2449#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {2450#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {2450#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {2450#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {2450#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {2450#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {2450#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2450#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {2450#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {2451#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {2451#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {2451#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,508 INFO L273 TraceCheckUtils]: 17: Hoare triple {2451#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {2451#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {2451#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2451#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {2451#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {2452#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {2452#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {2452#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:45,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {2452#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !(~k~0 < 100000); {2447#false} is VALID [2018-11-14 16:50:45,520 INFO L273 TraceCheckUtils]: 22: Hoare triple {2447#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2447#false} is VALID [2018-11-14 16:50:45,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {2447#false} ~x~0 := 0; {2447#false} is VALID [2018-11-14 16:50:45,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 16:50:45,521 INFO L273 TraceCheckUtils]: 25: Hoare triple {2447#false} assume !(~x~0 < ~i~0); {2447#false} is VALID [2018-11-14 16:50:45,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {2447#false} ~x~0 := 0; {2447#false} is VALID [2018-11-14 16:50:45,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 16:50:45,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {2447#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2447#false} is VALID [2018-11-14 16:50:45,522 INFO L256 TraceCheckUtils]: 29: Hoare triple {2447#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2447#false} is VALID [2018-11-14 16:50:45,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {2447#false} ~cond := #in~cond; {2447#false} is VALID [2018-11-14 16:50:45,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {2447#false} assume ~cond == 0; {2447#false} is VALID [2018-11-14 16:50:45,523 INFO L273 TraceCheckUtils]: 32: Hoare triple {2447#false} assume !false; {2447#false} is VALID [2018-11-14 16:50:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:45,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:45,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:45,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:45,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:45,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {2446#true} call ULTIMATE.init(); {2446#true} is VALID [2018-11-14 16:50:45,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {2446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2446#true} is VALID [2018-11-14 16:50:45,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {2446#true} assume true; {2446#true} is VALID [2018-11-14 16:50:45,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2446#true} {2446#true} #137#return; {2446#true} is VALID [2018-11-14 16:50:45,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {2446#true} call #t~ret15 := main(); {2446#true} is VALID [2018-11-14 16:50:45,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {2446#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2471#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:45,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {2471#(<= main_~i~0 0)} assume true; {2471#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:45,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {2471#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {2478#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:45,758 INFO L273 TraceCheckUtils]: 8: Hoare triple {2478#(<= main_~k~0 1)} assume true; {2478#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:45,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {2478#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {2478#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:45,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {2478#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2478#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:45,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {2478#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {2491#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:45,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {2491#(<= main_~k~0 2)} assume true; {2491#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:45,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {2491#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {2491#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:45,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {2491#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2491#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:45,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {2491#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {2504#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:45,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {2504#(<= main_~k~0 3)} assume true; {2504#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:45,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {2504#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {2504#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:45,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {2504#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2504#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:45,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {2504#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {2517#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:45,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {2517#(<= main_~k~0 4)} assume true; {2517#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:45,776 INFO L273 TraceCheckUtils]: 21: Hoare triple {2517#(<= main_~k~0 4)} assume !(~k~0 < 100000); {2447#false} is VALID [2018-11-14 16:50:45,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {2447#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2447#false} is VALID [2018-11-14 16:50:45,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {2447#false} ~x~0 := 0; {2447#false} is VALID [2018-11-14 16:50:45,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 16:50:45,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {2447#false} assume !(~x~0 < ~i~0); {2447#false} is VALID [2018-11-14 16:50:45,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {2447#false} ~x~0 := 0; {2447#false} is VALID [2018-11-14 16:50:45,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 16:50:45,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {2447#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2447#false} is VALID [2018-11-14 16:50:45,777 INFO L256 TraceCheckUtils]: 29: Hoare triple {2447#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2447#false} is VALID [2018-11-14 16:50:45,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {2447#false} ~cond := #in~cond; {2447#false} is VALID [2018-11-14 16:50:45,777 INFO L273 TraceCheckUtils]: 31: Hoare triple {2447#false} assume ~cond == 0; {2447#false} is VALID [2018-11-14 16:50:45,777 INFO L273 TraceCheckUtils]: 32: Hoare triple {2447#false} assume !false; {2447#false} is VALID [2018-11-14 16:50:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:45,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:45,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:50:45,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-14 16:50:45,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:45,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:50:45,854 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-14 16:50:45,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:50:45,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:50:45,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:50:45,856 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 12 states. [2018-11-14 16:50:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:46,883 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2018-11-14 16:50:46,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:50:46,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-14 16:50:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:50:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2018-11-14 16:50:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:50:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2018-11-14 16:50:46,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 145 transitions. [2018-11-14 16:50:47,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:47,070 INFO L225 Difference]: With dead ends: 148 [2018-11-14 16:50:47,070 INFO L226 Difference]: Without dead ends: 100 [2018-11-14 16:50:47,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:50:47,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-14 16:50:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-11-14 16:50:47,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:47,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 89 states. [2018-11-14 16:50:47,130 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 89 states. [2018-11-14 16:50:47,130 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 89 states. [2018-11-14 16:50:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:47,134 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-11-14 16:50:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-11-14 16:50:47,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:47,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:47,135 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 100 states. [2018-11-14 16:50:47,135 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 100 states. [2018-11-14 16:50:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:47,138 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-11-14 16:50:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-11-14 16:50:47,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:47,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:47,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:47,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 16:50:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2018-11-14 16:50:47,142 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 33 [2018-11-14 16:50:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:47,143 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-11-14 16:50:47,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:50:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-11-14 16:50:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:50:47,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:47,144 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:47,144 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:47,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash -688591287, now seen corresponding path program 2 times [2018-11-14 16:50:47,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:47,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:47,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:47,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:47,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:47,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {3062#true} call ULTIMATE.init(); {3062#true} is VALID [2018-11-14 16:50:47,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {3062#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3062#true} is VALID [2018-11-14 16:50:47,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {3062#true} assume true; {3062#true} is VALID [2018-11-14 16:50:47,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3062#true} {3062#true} #137#return; {3062#true} is VALID [2018-11-14 16:50:47,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {3062#true} call #t~ret15 := main(); {3062#true} is VALID [2018-11-14 16:50:47,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {3062#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3064#(= main_~i~0 0)} is VALID [2018-11-14 16:50:47,313 INFO L273 TraceCheckUtils]: 6: Hoare triple {3064#(= main_~i~0 0)} assume true; {3064#(= main_~i~0 0)} is VALID [2018-11-14 16:50:47,314 INFO L273 TraceCheckUtils]: 7: Hoare triple {3064#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {3065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {3065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {3065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,315 INFO L273 TraceCheckUtils]: 9: Hoare triple {3065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {3065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {3065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {3066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {3066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {3066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {3066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {3066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {3066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {3067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {3067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {3067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {3067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {3067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {3067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {3068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {3068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {3068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,332 INFO L273 TraceCheckUtils]: 21: Hoare triple {3068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {3068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {3068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {3069#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,334 INFO L273 TraceCheckUtils]: 24: Hoare triple {3069#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {3069#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:47,335 INFO L273 TraceCheckUtils]: 25: Hoare triple {3069#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !(~k~0 < 100000); {3063#false} is VALID [2018-11-14 16:50:47,335 INFO L273 TraceCheckUtils]: 26: Hoare triple {3063#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3063#false} is VALID [2018-11-14 16:50:47,336 INFO L273 TraceCheckUtils]: 27: Hoare triple {3063#false} ~x~0 := 0; {3063#false} is VALID [2018-11-14 16:50:47,336 INFO L273 TraceCheckUtils]: 28: Hoare triple {3063#false} assume true; {3063#false} is VALID [2018-11-14 16:50:47,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {3063#false} assume !(~x~0 < ~i~0); {3063#false} is VALID [2018-11-14 16:50:47,336 INFO L273 TraceCheckUtils]: 30: Hoare triple {3063#false} ~x~0 := 0; {3063#false} is VALID [2018-11-14 16:50:47,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {3063#false} assume true; {3063#false} is VALID [2018-11-14 16:50:47,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {3063#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3063#false} is VALID [2018-11-14 16:50:47,337 INFO L256 TraceCheckUtils]: 33: Hoare triple {3063#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3063#false} is VALID [2018-11-14 16:50:47,337 INFO L273 TraceCheckUtils]: 34: Hoare triple {3063#false} ~cond := #in~cond; {3063#false} is VALID [2018-11-14 16:50:47,337 INFO L273 TraceCheckUtils]: 35: Hoare triple {3063#false} assume ~cond == 0; {3063#false} is VALID [2018-11-14 16:50:47,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {3063#false} assume !false; {3063#false} is VALID [2018-11-14 16:50:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:47,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:47,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:47,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:50:47,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 16:50:47,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:47,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:47,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-14 16:50:47,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-11-14 16:50:47,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-11-14 16:50:47,891 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-14 16:50:47,899 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:50:47,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:50:47,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:50:47,924 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2018-11-14 16:50:47,928 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:50:47,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:50:47,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-14 16:50:47,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:50:47,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:50:47,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:50:47,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 16:50:47,980 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:50:48,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {3062#true} call ULTIMATE.init(); {3062#true} is VALID [2018-11-14 16:50:48,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {3062#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3062#true} is VALID [2018-11-14 16:50:48,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {3062#true} assume true; {3062#true} is VALID [2018-11-14 16:50:48,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3062#true} {3062#true} #137#return; {3062#true} is VALID [2018-11-14 16:50:48,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {3062#true} call #t~ret15 := main(); {3062#true} is VALID [2018-11-14 16:50:48,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {3062#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,022 INFO L273 TraceCheckUtils]: 8: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,023 INFO L273 TraceCheckUtils]: 9: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,024 INFO L273 TraceCheckUtils]: 10: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~k~0 := ~k~0 + 1; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~k~0 := ~k~0 + 1; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,030 INFO L273 TraceCheckUtils]: 18: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~k~0 := ~k~0 + 1; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,031 INFO L273 TraceCheckUtils]: 20: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,033 INFO L273 TraceCheckUtils]: 22: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~k~0 := ~k~0 + 1; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,036 INFO L273 TraceCheckUtils]: 24: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,037 INFO L273 TraceCheckUtils]: 25: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !(~k~0 < 100000); {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,038 INFO L273 TraceCheckUtils]: 27: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~x~0 := 0; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,038 INFO L273 TraceCheckUtils]: 28: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,038 INFO L273 TraceCheckUtils]: 29: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !(~x~0 < ~i~0); {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,039 INFO L273 TraceCheckUtils]: 30: Hoare triple {3088#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~x~0 := 0; {3164#(and (= main_~x~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,040 INFO L273 TraceCheckUtils]: 31: Hoare triple {3164#(and (= main_~x~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {3164#(and (= main_~x~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:50:48,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {3164#(and (= main_~x~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3171#(<= |main_#t~mem10| |main_#t~mem9|)} is VALID [2018-11-14 16:50:48,042 INFO L256 TraceCheckUtils]: 33: Hoare triple {3171#(<= |main_#t~mem10| |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3175#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 16:50:48,043 INFO L273 TraceCheckUtils]: 34: Hoare triple {3175#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3179#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 16:50:48,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {3179#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {3063#false} is VALID [2018-11-14 16:50:48,044 INFO L273 TraceCheckUtils]: 36: Hoare triple {3063#false} assume !false; {3063#false} is VALID [2018-11-14 16:50:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-14 16:50:48,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:50:48,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-11-14 16:50:48,067 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-11-14 16:50:48,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:48,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 16:50:48,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:48,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 16:50:48,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 16:50:48,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:50:48,137 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 13 states. [2018-11-14 16:50:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:49,201 INFO L93 Difference]: Finished difference Result 165 states and 210 transitions. [2018-11-14 16:50:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:50:49,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-11-14 16:50:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:50:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2018-11-14 16:50:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:50:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2018-11-14 16:50:49,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2018-11-14 16:50:49,425 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-14 16:50:49,428 INFO L225 Difference]: With dead ends: 165 [2018-11-14 16:50:49,428 INFO L226 Difference]: Without dead ends: 117 [2018-11-14 16:50:49,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:50:49,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-14 16:50:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2018-11-14 16:50:49,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:49,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 105 states. [2018-11-14 16:50:49,482 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 105 states. [2018-11-14 16:50:49,482 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 105 states. [2018-11-14 16:50:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:49,487 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2018-11-14 16:50:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2018-11-14 16:50:49,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:49,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:49,488 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 117 states. [2018-11-14 16:50:49,488 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 117 states. [2018-11-14 16:50:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:49,493 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2018-11-14 16:50:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2018-11-14 16:50:49,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:49,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:49,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:49,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-14 16:50:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 129 transitions. [2018-11-14 16:50:49,498 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 129 transitions. Word has length 37 [2018-11-14 16:50:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:49,498 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 129 transitions. [2018-11-14 16:50:49,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 16:50:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2018-11-14 16:50:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 16:50:49,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:49,499 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:49,500 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:49,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash -469309816, now seen corresponding path program 1 times [2018-11-14 16:50:49,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:49,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:49,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:50,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {3782#true} call ULTIMATE.init(); {3782#true} is VALID [2018-11-14 16:50:50,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {3782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3782#true} is VALID [2018-11-14 16:50:50,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {3782#true} assume true; {3782#true} is VALID [2018-11-14 16:50:50,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3782#true} {3782#true} #137#return; {3782#true} is VALID [2018-11-14 16:50:50,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {3782#true} call #t~ret15 := main(); {3782#true} is VALID [2018-11-14 16:50:50,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {3782#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3784#(= main_~i~0 0)} is VALID [2018-11-14 16:50:50,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {3784#(= main_~i~0 0)} assume true; {3784#(= main_~i~0 0)} is VALID [2018-11-14 16:50:50,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {3784#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {3785#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {3785#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {3785#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {3785#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3785#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {3785#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3785#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {3785#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {3786#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {3786#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {3786#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {3786#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3786#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {3786#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3786#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {3786#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {3787#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {3787#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {3787#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {3787#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3787#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {3787#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3787#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {3787#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {3788#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,136 INFO L273 TraceCheckUtils]: 20: Hoare triple {3788#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {3788#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {3788#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3788#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {3788#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3788#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,137 INFO L273 TraceCheckUtils]: 23: Hoare triple {3788#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {3789#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,138 INFO L273 TraceCheckUtils]: 24: Hoare triple {3789#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {3789#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,139 INFO L273 TraceCheckUtils]: 25: Hoare triple {3789#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3789#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {3789#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3789#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,141 INFO L273 TraceCheckUtils]: 27: Hoare triple {3789#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {3790#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {3790#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {3790#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:50,143 INFO L273 TraceCheckUtils]: 29: Hoare triple {3790#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !(~k~0 < 100000); {3783#false} is VALID [2018-11-14 16:50:50,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {3783#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3783#false} is VALID [2018-11-14 16:50:50,143 INFO L273 TraceCheckUtils]: 31: Hoare triple {3783#false} ~x~0 := 0; {3783#false} is VALID [2018-11-14 16:50:50,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-14 16:50:50,144 INFO L273 TraceCheckUtils]: 33: Hoare triple {3783#false} assume !(~x~0 < ~i~0); {3783#false} is VALID [2018-11-14 16:50:50,144 INFO L273 TraceCheckUtils]: 34: Hoare triple {3783#false} ~x~0 := 0; {3783#false} is VALID [2018-11-14 16:50:50,144 INFO L273 TraceCheckUtils]: 35: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-14 16:50:50,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {3783#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3783#false} is VALID [2018-11-14 16:50:50,145 INFO L256 TraceCheckUtils]: 37: Hoare triple {3783#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3782#true} is VALID [2018-11-14 16:50:50,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {3782#true} ~cond := #in~cond; {3782#true} is VALID [2018-11-14 16:50:50,145 INFO L273 TraceCheckUtils]: 39: Hoare triple {3782#true} assume !(~cond == 0); {3782#true} is VALID [2018-11-14 16:50:50,146 INFO L273 TraceCheckUtils]: 40: Hoare triple {3782#true} assume true; {3782#true} is VALID [2018-11-14 16:50:50,146 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3782#true} {3783#false} #143#return; {3783#false} is VALID [2018-11-14 16:50:50,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {3783#false} havoc #t~mem9;havoc #t~mem10; {3783#false} is VALID [2018-11-14 16:50:50,146 INFO L273 TraceCheckUtils]: 43: Hoare triple {3783#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {3783#false} is VALID [2018-11-14 16:50:50,146 INFO L273 TraceCheckUtils]: 44: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-14 16:50:50,146 INFO L273 TraceCheckUtils]: 45: Hoare triple {3783#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3783#false} is VALID [2018-11-14 16:50:50,146 INFO L256 TraceCheckUtils]: 46: Hoare triple {3783#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3783#false} is VALID [2018-11-14 16:50:50,147 INFO L273 TraceCheckUtils]: 47: Hoare triple {3783#false} ~cond := #in~cond; {3783#false} is VALID [2018-11-14 16:50:50,147 INFO L273 TraceCheckUtils]: 48: Hoare triple {3783#false} assume ~cond == 0; {3783#false} is VALID [2018-11-14 16:50:50,147 INFO L273 TraceCheckUtils]: 49: Hoare triple {3783#false} assume !false; {3783#false} is VALID [2018-11-14 16:50:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:50:50,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:50,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:50,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:50,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:50,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {3782#true} call ULTIMATE.init(); {3782#true} is VALID [2018-11-14 16:50:50,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {3782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3782#true} is VALID [2018-11-14 16:50:50,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {3782#true} assume true; {3782#true} is VALID [2018-11-14 16:50:50,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3782#true} {3782#true} #137#return; {3782#true} is VALID [2018-11-14 16:50:50,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {3782#true} call #t~ret15 := main(); {3782#true} is VALID [2018-11-14 16:50:50,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {3782#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3809#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:50,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {3809#(<= main_~i~0 0)} assume true; {3809#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:50,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {3809#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {3816#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:50,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {3816#(<= main_~k~0 1)} assume true; {3816#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:50,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {3816#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3816#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:50,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {3816#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3816#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:50,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {3816#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {3829#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:50,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {3829#(<= main_~k~0 2)} assume true; {3829#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:50,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {3829#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3829#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:50,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {3829#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3829#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:50,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {3829#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {3842#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:50,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {3842#(<= main_~k~0 3)} assume true; {3842#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:50,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {3842#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3842#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:50,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {3842#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3842#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:50,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {3842#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {3855#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:50,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {3855#(<= main_~k~0 4)} assume true; {3855#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:50,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {3855#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3855#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:50,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {3855#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3855#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:50,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {3855#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {3868#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:50,541 INFO L273 TraceCheckUtils]: 24: Hoare triple {3868#(<= main_~k~0 5)} assume true; {3868#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:50,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {3868#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {3868#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:50,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {3868#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3868#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:50,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {3868#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {3881#(<= main_~k~0 6)} is VALID [2018-11-14 16:50:50,543 INFO L273 TraceCheckUtils]: 28: Hoare triple {3881#(<= main_~k~0 6)} assume true; {3881#(<= main_~k~0 6)} is VALID [2018-11-14 16:50:50,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {3881#(<= main_~k~0 6)} assume !(~k~0 < 100000); {3783#false} is VALID [2018-11-14 16:50:50,544 INFO L273 TraceCheckUtils]: 30: Hoare triple {3783#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3783#false} is VALID [2018-11-14 16:50:50,544 INFO L273 TraceCheckUtils]: 31: Hoare triple {3783#false} ~x~0 := 0; {3783#false} is VALID [2018-11-14 16:50:50,544 INFO L273 TraceCheckUtils]: 32: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-14 16:50:50,545 INFO L273 TraceCheckUtils]: 33: Hoare triple {3783#false} assume !(~x~0 < ~i~0); {3783#false} is VALID [2018-11-14 16:50:50,545 INFO L273 TraceCheckUtils]: 34: Hoare triple {3783#false} ~x~0 := 0; {3783#false} is VALID [2018-11-14 16:50:50,545 INFO L273 TraceCheckUtils]: 35: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-14 16:50:50,545 INFO L273 TraceCheckUtils]: 36: Hoare triple {3783#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3783#false} is VALID [2018-11-14 16:50:50,545 INFO L256 TraceCheckUtils]: 37: Hoare triple {3783#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3783#false} is VALID [2018-11-14 16:50:50,546 INFO L273 TraceCheckUtils]: 38: Hoare triple {3783#false} ~cond := #in~cond; {3783#false} is VALID [2018-11-14 16:50:50,546 INFO L273 TraceCheckUtils]: 39: Hoare triple {3783#false} assume !(~cond == 0); {3783#false} is VALID [2018-11-14 16:50:50,546 INFO L273 TraceCheckUtils]: 40: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-14 16:50:50,546 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3783#false} {3783#false} #143#return; {3783#false} is VALID [2018-11-14 16:50:50,546 INFO L273 TraceCheckUtils]: 42: Hoare triple {3783#false} havoc #t~mem9;havoc #t~mem10; {3783#false} is VALID [2018-11-14 16:50:50,547 INFO L273 TraceCheckUtils]: 43: Hoare triple {3783#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {3783#false} is VALID [2018-11-14 16:50:50,547 INFO L273 TraceCheckUtils]: 44: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-14 16:50:50,547 INFO L273 TraceCheckUtils]: 45: Hoare triple {3783#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3783#false} is VALID [2018-11-14 16:50:50,547 INFO L256 TraceCheckUtils]: 46: Hoare triple {3783#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3783#false} is VALID [2018-11-14 16:50:50,547 INFO L273 TraceCheckUtils]: 47: Hoare triple {3783#false} ~cond := #in~cond; {3783#false} is VALID [2018-11-14 16:50:50,548 INFO L273 TraceCheckUtils]: 48: Hoare triple {3783#false} assume ~cond == 0; {3783#false} is VALID [2018-11-14 16:50:50,548 INFO L273 TraceCheckUtils]: 49: Hoare triple {3783#false} assume !false; {3783#false} is VALID [2018-11-14 16:50:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:50:50,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:50,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 16:50:50,574 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-14 16:50:50,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:50,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:50:50,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:50,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:50:50,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:50:50,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:50:50,645 INFO L87 Difference]: Start difference. First operand 105 states and 129 transitions. Second operand 16 states. [2018-11-14 16:50:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:51,485 INFO L93 Difference]: Finished difference Result 179 states and 224 transitions. [2018-11-14 16:50:51,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:50:51,486 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-14 16:50:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:50:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2018-11-14 16:50:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:50:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2018-11-14 16:50:51,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 155 transitions. [2018-11-14 16:50:51,745 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-14 16:50:51,749 INFO L225 Difference]: With dead ends: 179 [2018-11-14 16:50:51,749 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 16:50:51,750 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:50:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 16:50:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-11-14 16:50:51,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:51,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 113 states. [2018-11-14 16:50:51,836 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 113 states. [2018-11-14 16:50:51,836 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 113 states. [2018-11-14 16:50:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:51,841 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2018-11-14 16:50:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions. [2018-11-14 16:50:51,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:51,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:51,842 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 123 states. [2018-11-14 16:50:51,842 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 123 states. [2018-11-14 16:50:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:51,845 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2018-11-14 16:50:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions. [2018-11-14 16:50:51,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:51,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:51,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:51,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 16:50:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 139 transitions. [2018-11-14 16:50:51,849 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 139 transitions. Word has length 50 [2018-11-14 16:50:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:51,849 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 139 transitions. [2018-11-14 16:50:51,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:50:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2018-11-14 16:50:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 16:50:51,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:51,851 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:51,851 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:51,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:51,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1035572594, now seen corresponding path program 2 times [2018-11-14 16:50:51,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:51,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:51,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:51,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:51,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:52,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {4571#true} call ULTIMATE.init(); {4571#true} is VALID [2018-11-14 16:50:52,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {4571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4571#true} is VALID [2018-11-14 16:50:52,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {4571#true} assume true; {4571#true} is VALID [2018-11-14 16:50:52,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4571#true} {4571#true} #137#return; {4571#true} is VALID [2018-11-14 16:50:52,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {4571#true} call #t~ret15 := main(); {4571#true} is VALID [2018-11-14 16:50:52,653 INFO L273 TraceCheckUtils]: 5: Hoare triple {4571#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4573#(= main_~i~0 0)} is VALID [2018-11-14 16:50:52,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {4573#(= main_~i~0 0)} assume true; {4573#(= main_~i~0 0)} is VALID [2018-11-14 16:50:52,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {4573#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {4574#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {4574#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {4574#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,655 INFO L273 TraceCheckUtils]: 9: Hoare triple {4574#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4574#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {4574#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4574#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {4574#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {4575#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {4575#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {4575#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {4575#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4575#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {4575#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4575#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {4575#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {4576#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {4576#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {4576#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {4576#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4576#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {4576#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4576#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {4576#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {4577#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {4577#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {4577#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {4577#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4577#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {4577#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4577#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {4577#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {4578#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,666 INFO L273 TraceCheckUtils]: 24: Hoare triple {4578#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {4578#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,668 INFO L273 TraceCheckUtils]: 25: Hoare triple {4578#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4578#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,669 INFO L273 TraceCheckUtils]: 26: Hoare triple {4578#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4578#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {4578#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {4579#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,670 INFO L273 TraceCheckUtils]: 28: Hoare triple {4579#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {4579#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,671 INFO L273 TraceCheckUtils]: 29: Hoare triple {4579#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4579#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {4579#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4579#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {4579#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {4580#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {4580#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {4580#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:52,675 INFO L273 TraceCheckUtils]: 33: Hoare triple {4580#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !(~k~0 < 100000); {4572#false} is VALID [2018-11-14 16:50:52,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {4572#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4572#false} is VALID [2018-11-14 16:50:52,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {4572#false} ~x~0 := 0; {4572#false} is VALID [2018-11-14 16:50:52,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {4572#false} assume true; {4572#false} is VALID [2018-11-14 16:50:52,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {4572#false} assume !(~x~0 < ~i~0); {4572#false} is VALID [2018-11-14 16:50:52,676 INFO L273 TraceCheckUtils]: 38: Hoare triple {4572#false} ~x~0 := 0; {4572#false} is VALID [2018-11-14 16:50:52,677 INFO L273 TraceCheckUtils]: 39: Hoare triple {4572#false} assume true; {4572#false} is VALID [2018-11-14 16:50:52,677 INFO L273 TraceCheckUtils]: 40: Hoare triple {4572#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4572#false} is VALID [2018-11-14 16:50:52,677 INFO L256 TraceCheckUtils]: 41: Hoare triple {4572#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4571#true} is VALID [2018-11-14 16:50:52,678 INFO L273 TraceCheckUtils]: 42: Hoare triple {4571#true} ~cond := #in~cond; {4571#true} is VALID [2018-11-14 16:50:52,678 INFO L273 TraceCheckUtils]: 43: Hoare triple {4571#true} assume !(~cond == 0); {4571#true} is VALID [2018-11-14 16:50:52,678 INFO L273 TraceCheckUtils]: 44: Hoare triple {4571#true} assume true; {4571#true} is VALID [2018-11-14 16:50:52,678 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4571#true} {4572#false} #143#return; {4572#false} is VALID [2018-11-14 16:50:52,679 INFO L273 TraceCheckUtils]: 46: Hoare triple {4572#false} havoc #t~mem9;havoc #t~mem10; {4572#false} is VALID [2018-11-14 16:50:52,679 INFO L273 TraceCheckUtils]: 47: Hoare triple {4572#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {4572#false} is VALID [2018-11-14 16:50:52,679 INFO L273 TraceCheckUtils]: 48: Hoare triple {4572#false} assume true; {4572#false} is VALID [2018-11-14 16:50:52,679 INFO L273 TraceCheckUtils]: 49: Hoare triple {4572#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4572#false} is VALID [2018-11-14 16:50:52,680 INFO L256 TraceCheckUtils]: 50: Hoare triple {4572#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4572#false} is VALID [2018-11-14 16:50:52,680 INFO L273 TraceCheckUtils]: 51: Hoare triple {4572#false} ~cond := #in~cond; {4572#false} is VALID [2018-11-14 16:50:52,680 INFO L273 TraceCheckUtils]: 52: Hoare triple {4572#false} assume ~cond == 0; {4572#false} is VALID [2018-11-14 16:50:52,680 INFO L273 TraceCheckUtils]: 53: Hoare triple {4572#false} assume !false; {4572#false} is VALID [2018-11-14 16:50:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:50:52,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:52,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:52,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:50:52,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:50:52,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:52,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:53,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {4571#true} call ULTIMATE.init(); {4571#true} is VALID [2018-11-14 16:50:53,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {4571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4571#true} is VALID [2018-11-14 16:50:53,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {4571#true} assume true; {4571#true} is VALID [2018-11-14 16:50:53,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4571#true} {4571#true} #137#return; {4571#true} is VALID [2018-11-14 16:50:53,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {4571#true} call #t~ret15 := main(); {4571#true} is VALID [2018-11-14 16:50:53,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {4571#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4599#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:53,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {4599#(<= main_~i~0 0)} assume true; {4599#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:53,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {4599#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {4606#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:53,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {4606#(<= main_~k~0 1)} assume true; {4606#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:53,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {4606#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4606#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:53,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {4606#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4606#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:53,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {4606#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {4619#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:53,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {4619#(<= main_~k~0 2)} assume true; {4619#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:53,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {4619#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4619#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:53,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {4619#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4619#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:53,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {4619#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {4632#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:53,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {4632#(<= main_~k~0 3)} assume true; {4632#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:53,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {4632#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4632#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:53,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {4632#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4632#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:53,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {4632#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {4645#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:53,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {4645#(<= main_~k~0 4)} assume true; {4645#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:53,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {4645#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4645#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:53,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {4645#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4645#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:53,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {4645#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {4658#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:53,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {4658#(<= main_~k~0 5)} assume true; {4658#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:53,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {4658#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4658#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:53,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {4658#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4658#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:53,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {4658#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {4671#(<= main_~k~0 6)} is VALID [2018-11-14 16:50:53,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#(<= main_~k~0 6)} assume true; {4671#(<= main_~k~0 6)} is VALID [2018-11-14 16:50:53,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {4671#(<= main_~k~0 6)} is VALID [2018-11-14 16:50:53,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4671#(<= main_~k~0 6)} is VALID [2018-11-14 16:50:53,078 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {4684#(<= main_~k~0 7)} is VALID [2018-11-14 16:50:53,078 INFO L273 TraceCheckUtils]: 32: Hoare triple {4684#(<= main_~k~0 7)} assume true; {4684#(<= main_~k~0 7)} is VALID [2018-11-14 16:50:53,079 INFO L273 TraceCheckUtils]: 33: Hoare triple {4684#(<= main_~k~0 7)} assume !(~k~0 < 100000); {4572#false} is VALID [2018-11-14 16:50:53,080 INFO L273 TraceCheckUtils]: 34: Hoare triple {4572#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4572#false} is VALID [2018-11-14 16:50:53,080 INFO L273 TraceCheckUtils]: 35: Hoare triple {4572#false} ~x~0 := 0; {4572#false} is VALID [2018-11-14 16:50:53,080 INFO L273 TraceCheckUtils]: 36: Hoare triple {4572#false} assume true; {4572#false} is VALID [2018-11-14 16:50:53,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {4572#false} assume !(~x~0 < ~i~0); {4572#false} is VALID [2018-11-14 16:50:53,081 INFO L273 TraceCheckUtils]: 38: Hoare triple {4572#false} ~x~0 := 0; {4572#false} is VALID [2018-11-14 16:50:53,081 INFO L273 TraceCheckUtils]: 39: Hoare triple {4572#false} assume true; {4572#false} is VALID [2018-11-14 16:50:53,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {4572#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4572#false} is VALID [2018-11-14 16:50:53,082 INFO L256 TraceCheckUtils]: 41: Hoare triple {4572#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4572#false} is VALID [2018-11-14 16:50:53,082 INFO L273 TraceCheckUtils]: 42: Hoare triple {4572#false} ~cond := #in~cond; {4572#false} is VALID [2018-11-14 16:50:53,082 INFO L273 TraceCheckUtils]: 43: Hoare triple {4572#false} assume !(~cond == 0); {4572#false} is VALID [2018-11-14 16:50:53,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {4572#false} assume true; {4572#false} is VALID [2018-11-14 16:50:53,083 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4572#false} {4572#false} #143#return; {4572#false} is VALID [2018-11-14 16:50:53,083 INFO L273 TraceCheckUtils]: 46: Hoare triple {4572#false} havoc #t~mem9;havoc #t~mem10; {4572#false} is VALID [2018-11-14 16:50:53,083 INFO L273 TraceCheckUtils]: 47: Hoare triple {4572#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {4572#false} is VALID [2018-11-14 16:50:53,083 INFO L273 TraceCheckUtils]: 48: Hoare triple {4572#false} assume true; {4572#false} is VALID [2018-11-14 16:50:53,084 INFO L273 TraceCheckUtils]: 49: Hoare triple {4572#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4572#false} is VALID [2018-11-14 16:50:53,084 INFO L256 TraceCheckUtils]: 50: Hoare triple {4572#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4572#false} is VALID [2018-11-14 16:50:53,084 INFO L273 TraceCheckUtils]: 51: Hoare triple {4572#false} ~cond := #in~cond; {4572#false} is VALID [2018-11-14 16:50:53,084 INFO L273 TraceCheckUtils]: 52: Hoare triple {4572#false} assume ~cond == 0; {4572#false} is VALID [2018-11-14 16:50:53,085 INFO L273 TraceCheckUtils]: 53: Hoare triple {4572#false} assume !false; {4572#false} is VALID [2018-11-14 16:50:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:50:53,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:53,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-14 16:50:53,113 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-11-14 16:50:53,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:53,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:50:53,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:53,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:50:53,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:50:53,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:50:53,199 INFO L87 Difference]: Start difference. First operand 113 states and 139 transitions. Second operand 18 states. [2018-11-14 16:50:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:54,134 INFO L93 Difference]: Finished difference Result 187 states and 234 transitions. [2018-11-14 16:50:54,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:50:54,134 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-11-14 16:50:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:50:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2018-11-14 16:50:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:50:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2018-11-14 16:50:54,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 160 transitions. [2018-11-14 16:50:54,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:54,283 INFO L225 Difference]: With dead ends: 187 [2018-11-14 16:50:54,283 INFO L226 Difference]: Without dead ends: 131 [2018-11-14 16:50:54,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:50:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-14 16:50:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2018-11-14 16:50:54,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:54,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 121 states. [2018-11-14 16:50:54,339 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 121 states. [2018-11-14 16:50:54,339 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 121 states. [2018-11-14 16:50:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:54,343 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2018-11-14 16:50:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2018-11-14 16:50:54,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:54,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:54,344 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 131 states. [2018-11-14 16:50:54,344 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 131 states. [2018-11-14 16:50:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:54,348 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2018-11-14 16:50:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2018-11-14 16:50:54,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:54,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:54,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:54,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-14 16:50:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 149 transitions. [2018-11-14 16:50:54,352 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 149 transitions. Word has length 54 [2018-11-14 16:50:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:54,353 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 149 transitions. [2018-11-14 16:50:54,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:50:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2018-11-14 16:50:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 16:50:54,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:54,354 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:54,354 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:54,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash 256294748, now seen corresponding path program 3 times [2018-11-14 16:50:54,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:54,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:54,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:54,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:54,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:54,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {5410#true} call ULTIMATE.init(); {5410#true} is VALID [2018-11-14 16:50:54,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {5410#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5410#true} is VALID [2018-11-14 16:50:54,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {5410#true} assume true; {5410#true} is VALID [2018-11-14 16:50:54,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5410#true} {5410#true} #137#return; {5410#true} is VALID [2018-11-14 16:50:54,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {5410#true} call #t~ret15 := main(); {5410#true} is VALID [2018-11-14 16:50:54,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {5410#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5412#(= main_~i~0 0)} is VALID [2018-11-14 16:50:54,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {5412#(= main_~i~0 0)} assume true; {5412#(= main_~i~0 0)} is VALID [2018-11-14 16:50:54,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {5412#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {5413#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {5413#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {5413#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {5413#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5413#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {5413#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5413#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {5413#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {5414#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,612 INFO L273 TraceCheckUtils]: 12: Hoare triple {5414#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {5414#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {5414#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5414#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {5414#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5414#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {5414#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {5415#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {5415#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {5415#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {5415#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5415#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {5415#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5415#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {5415#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {5416#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {5416#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {5416#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {5416#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5416#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {5416#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5416#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,621 INFO L273 TraceCheckUtils]: 23: Hoare triple {5416#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {5417#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,621 INFO L273 TraceCheckUtils]: 24: Hoare triple {5417#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {5417#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,622 INFO L273 TraceCheckUtils]: 25: Hoare triple {5417#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5417#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {5417#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5417#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,624 INFO L273 TraceCheckUtils]: 27: Hoare triple {5417#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {5418#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,625 INFO L273 TraceCheckUtils]: 28: Hoare triple {5418#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {5418#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,626 INFO L273 TraceCheckUtils]: 29: Hoare triple {5418#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5418#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {5418#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5418#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,627 INFO L273 TraceCheckUtils]: 31: Hoare triple {5418#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {5419#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,628 INFO L273 TraceCheckUtils]: 32: Hoare triple {5419#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {5419#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,629 INFO L273 TraceCheckUtils]: 33: Hoare triple {5419#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5419#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,630 INFO L273 TraceCheckUtils]: 34: Hoare triple {5419#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5419#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,630 INFO L273 TraceCheckUtils]: 35: Hoare triple {5419#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {5420#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,631 INFO L273 TraceCheckUtils]: 36: Hoare triple {5420#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {5420#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:54,632 INFO L273 TraceCheckUtils]: 37: Hoare triple {5420#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !(~k~0 < 100000); {5411#false} is VALID [2018-11-14 16:50:54,632 INFO L273 TraceCheckUtils]: 38: Hoare triple {5411#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5411#false} is VALID [2018-11-14 16:50:54,632 INFO L273 TraceCheckUtils]: 39: Hoare triple {5411#false} ~x~0 := 0; {5411#false} is VALID [2018-11-14 16:50:54,633 INFO L273 TraceCheckUtils]: 40: Hoare triple {5411#false} assume true; {5411#false} is VALID [2018-11-14 16:50:54,633 INFO L273 TraceCheckUtils]: 41: Hoare triple {5411#false} assume !(~x~0 < ~i~0); {5411#false} is VALID [2018-11-14 16:50:54,633 INFO L273 TraceCheckUtils]: 42: Hoare triple {5411#false} ~x~0 := 0; {5411#false} is VALID [2018-11-14 16:50:54,633 INFO L273 TraceCheckUtils]: 43: Hoare triple {5411#false} assume true; {5411#false} is VALID [2018-11-14 16:50:54,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {5411#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5411#false} is VALID [2018-11-14 16:50:54,634 INFO L256 TraceCheckUtils]: 45: Hoare triple {5411#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5410#true} is VALID [2018-11-14 16:50:54,634 INFO L273 TraceCheckUtils]: 46: Hoare triple {5410#true} ~cond := #in~cond; {5410#true} is VALID [2018-11-14 16:50:54,634 INFO L273 TraceCheckUtils]: 47: Hoare triple {5410#true} assume !(~cond == 0); {5410#true} is VALID [2018-11-14 16:50:54,635 INFO L273 TraceCheckUtils]: 48: Hoare triple {5410#true} assume true; {5410#true} is VALID [2018-11-14 16:50:54,635 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {5410#true} {5411#false} #143#return; {5411#false} is VALID [2018-11-14 16:50:54,635 INFO L273 TraceCheckUtils]: 50: Hoare triple {5411#false} havoc #t~mem9;havoc #t~mem10; {5411#false} is VALID [2018-11-14 16:50:54,635 INFO L273 TraceCheckUtils]: 51: Hoare triple {5411#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {5411#false} is VALID [2018-11-14 16:50:54,636 INFO L273 TraceCheckUtils]: 52: Hoare triple {5411#false} assume true; {5411#false} is VALID [2018-11-14 16:50:54,636 INFO L273 TraceCheckUtils]: 53: Hoare triple {5411#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5411#false} is VALID [2018-11-14 16:50:54,636 INFO L256 TraceCheckUtils]: 54: Hoare triple {5411#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5411#false} is VALID [2018-11-14 16:50:54,636 INFO L273 TraceCheckUtils]: 55: Hoare triple {5411#false} ~cond := #in~cond; {5411#false} is VALID [2018-11-14 16:50:54,636 INFO L273 TraceCheckUtils]: 56: Hoare triple {5411#false} assume ~cond == 0; {5411#false} is VALID [2018-11-14 16:50:54,636 INFO L273 TraceCheckUtils]: 57: Hoare triple {5411#false} assume !false; {5411#false} is VALID [2018-11-14 16:50:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 98 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:50:54,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:54,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:54,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:50:54,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-14 16:50:54,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:54,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:54,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {5410#true} call ULTIMATE.init(); {5410#true} is VALID [2018-11-14 16:50:54,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {5410#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5410#true} is VALID [2018-11-14 16:50:54,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {5410#true} assume true; {5410#true} is VALID [2018-11-14 16:50:54,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5410#true} {5410#true} #137#return; {5410#true} is VALID [2018-11-14 16:50:54,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {5410#true} call #t~ret15 := main(); {5410#true} is VALID [2018-11-14 16:50:54,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {5410#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5439#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:54,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {5439#(<= main_~i~0 0)} assume true; {5439#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:54,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {5439#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {5446#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:54,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {5446#(<= main_~k~0 1)} assume true; {5446#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:54,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {5446#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5446#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:54,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {5446#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5446#(<= main_~k~0 1)} is VALID [2018-11-14 16:50:54,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {5446#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {5459#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:54,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {5459#(<= main_~k~0 2)} assume true; {5459#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:54,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {5459#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5459#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:54,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {5459#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5459#(<= main_~k~0 2)} is VALID [2018-11-14 16:50:54,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {5459#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {5472#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:54,939 INFO L273 TraceCheckUtils]: 16: Hoare triple {5472#(<= main_~k~0 3)} assume true; {5472#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:54,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {5472#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5472#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:54,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {5472#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5472#(<= main_~k~0 3)} is VALID [2018-11-14 16:50:54,941 INFO L273 TraceCheckUtils]: 19: Hoare triple {5472#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {5485#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:54,941 INFO L273 TraceCheckUtils]: 20: Hoare triple {5485#(<= main_~k~0 4)} assume true; {5485#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:54,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {5485#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5485#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:54,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {5485#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5485#(<= main_~k~0 4)} is VALID [2018-11-14 16:50:54,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {5485#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {5498#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:54,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {5498#(<= main_~k~0 5)} assume true; {5498#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:54,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {5498#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5498#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:54,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {5498#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5498#(<= main_~k~0 5)} is VALID [2018-11-14 16:50:54,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {5498#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {5511#(<= main_~k~0 6)} is VALID [2018-11-14 16:50:54,946 INFO L273 TraceCheckUtils]: 28: Hoare triple {5511#(<= main_~k~0 6)} assume true; {5511#(<= main_~k~0 6)} is VALID [2018-11-14 16:50:54,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {5511#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5511#(<= main_~k~0 6)} is VALID [2018-11-14 16:50:54,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {5511#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5511#(<= main_~k~0 6)} is VALID [2018-11-14 16:50:54,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {5511#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {5524#(<= main_~k~0 7)} is VALID [2018-11-14 16:50:54,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {5524#(<= main_~k~0 7)} assume true; {5524#(<= main_~k~0 7)} is VALID [2018-11-14 16:50:54,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {5524#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {5524#(<= main_~k~0 7)} is VALID [2018-11-14 16:50:54,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {5524#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5524#(<= main_~k~0 7)} is VALID [2018-11-14 16:50:54,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {5524#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {5537#(<= main_~k~0 8)} is VALID [2018-11-14 16:50:54,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {5537#(<= main_~k~0 8)} assume true; {5537#(<= main_~k~0 8)} is VALID [2018-11-14 16:50:54,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {5537#(<= main_~k~0 8)} assume !(~k~0 < 100000); {5411#false} is VALID [2018-11-14 16:50:54,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {5411#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5411#false} is VALID [2018-11-14 16:50:54,952 INFO L273 TraceCheckUtils]: 39: Hoare triple {5411#false} ~x~0 := 0; {5411#false} is VALID [2018-11-14 16:50:54,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {5411#false} assume true; {5411#false} is VALID [2018-11-14 16:50:54,952 INFO L273 TraceCheckUtils]: 41: Hoare triple {5411#false} assume !(~x~0 < ~i~0); {5411#false} is VALID [2018-11-14 16:50:54,952 INFO L273 TraceCheckUtils]: 42: Hoare triple {5411#false} ~x~0 := 0; {5411#false} is VALID [2018-11-14 16:50:54,952 INFO L273 TraceCheckUtils]: 43: Hoare triple {5411#false} assume true; {5411#false} is VALID [2018-11-14 16:50:54,953 INFO L273 TraceCheckUtils]: 44: Hoare triple {5411#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5411#false} is VALID [2018-11-14 16:50:54,953 INFO L256 TraceCheckUtils]: 45: Hoare triple {5411#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5411#false} is VALID [2018-11-14 16:50:54,953 INFO L273 TraceCheckUtils]: 46: Hoare triple {5411#false} ~cond := #in~cond; {5411#false} is VALID [2018-11-14 16:50:54,953 INFO L273 TraceCheckUtils]: 47: Hoare triple {5411#false} assume !(~cond == 0); {5411#false} is VALID [2018-11-14 16:50:54,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {5411#false} assume true; {5411#false} is VALID [2018-11-14 16:50:54,954 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {5411#false} {5411#false} #143#return; {5411#false} is VALID [2018-11-14 16:50:54,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {5411#false} havoc #t~mem9;havoc #t~mem10; {5411#false} is VALID [2018-11-14 16:50:54,954 INFO L273 TraceCheckUtils]: 51: Hoare triple {5411#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {5411#false} is VALID [2018-11-14 16:50:54,954 INFO L273 TraceCheckUtils]: 52: Hoare triple {5411#false} assume true; {5411#false} is VALID [2018-11-14 16:50:54,954 INFO L273 TraceCheckUtils]: 53: Hoare triple {5411#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5411#false} is VALID [2018-11-14 16:50:54,954 INFO L256 TraceCheckUtils]: 54: Hoare triple {5411#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5411#false} is VALID [2018-11-14 16:50:54,954 INFO L273 TraceCheckUtils]: 55: Hoare triple {5411#false} ~cond := #in~cond; {5411#false} is VALID [2018-11-14 16:50:54,954 INFO L273 TraceCheckUtils]: 56: Hoare triple {5411#false} assume ~cond == 0; {5411#false} is VALID [2018-11-14 16:50:54,955 INFO L273 TraceCheckUtils]: 57: Hoare triple {5411#false} assume !false; {5411#false} is VALID [2018-11-14 16:50:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:50:54,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:54,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-14 16:50:54,978 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-11-14 16:50:54,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:54,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 16:50:55,058 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-14 16:50:55,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 16:50:55,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 16:50:55,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:50:55,060 INFO L87 Difference]: Start difference. First operand 121 states and 149 transitions. Second operand 20 states. [2018-11-14 16:50:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:55,887 INFO L93 Difference]: Finished difference Result 195 states and 244 transitions. [2018-11-14 16:50:55,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:50:55,887 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-11-14 16:50:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:50:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2018-11-14 16:50:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:50:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2018-11-14 16:50:55,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 165 transitions. [2018-11-14 16:50:56,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:56,499 INFO L225 Difference]: With dead ends: 195 [2018-11-14 16:50:56,499 INFO L226 Difference]: Without dead ends: 139 [2018-11-14 16:50:56,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:50:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-14 16:50:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2018-11-14 16:50:56,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:56,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 129 states. [2018-11-14 16:50:56,604 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 129 states. [2018-11-14 16:50:56,604 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 129 states. [2018-11-14 16:50:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:56,608 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2018-11-14 16:50:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions. [2018-11-14 16:50:56,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:56,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:56,609 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 139 states. [2018-11-14 16:50:56,609 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 139 states. [2018-11-14 16:50:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:56,613 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2018-11-14 16:50:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions. [2018-11-14 16:50:56,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:56,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:56,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:56,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-14 16:50:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2018-11-14 16:50:56,617 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 58 [2018-11-14 16:50:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:56,618 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2018-11-14 16:50:56,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 16:50:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2018-11-14 16:50:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-14 16:50:56,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:56,619 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:56,619 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:56,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1594301370, now seen corresponding path program 4 times [2018-11-14 16:50:56,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:56,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:56,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:56,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:56,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:57,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {6299#true} call ULTIMATE.init(); {6299#true} is VALID [2018-11-14 16:50:57,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {6299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6299#true} is VALID [2018-11-14 16:50:57,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {6299#true} assume true; {6299#true} is VALID [2018-11-14 16:50:57,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6299#true} {6299#true} #137#return; {6299#true} is VALID [2018-11-14 16:50:57,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {6299#true} call #t~ret15 := main(); {6299#true} is VALID [2018-11-14 16:50:57,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {6299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6301#(= main_~i~0 0)} is VALID [2018-11-14 16:50:57,253 INFO L273 TraceCheckUtils]: 6: Hoare triple {6301#(= main_~i~0 0)} assume true; {6301#(= main_~i~0 0)} is VALID [2018-11-14 16:50:57,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {6301#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {6302#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {6302#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {6302#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {6302#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6302#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {6302#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6302#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {6302#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {6303#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {6303#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {6303#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,259 INFO L273 TraceCheckUtils]: 13: Hoare triple {6303#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6303#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {6303#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6303#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {6303#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {6304#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {6304#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {6304#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {6304#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6304#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {6304#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6304#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {6304#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {6305#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {6305#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {6305#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {6305#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6305#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {6305#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6305#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {6305#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {6306#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {6306#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {6306#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {6306#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6306#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {6306#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6306#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {6306#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {6307#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {6307#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {6307#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {6307#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6307#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {6307#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6307#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {6307#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {6308#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,273 INFO L273 TraceCheckUtils]: 32: Hoare triple {6308#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {6308#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {6308#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6308#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {6308#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6308#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {6308#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {6309#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {6309#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {6309#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {6309#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6309#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {6309#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6309#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {6309#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {6310#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {6310#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {6310#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:50:57,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {6310#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !(~k~0 < 100000); {6300#false} is VALID [2018-11-14 16:50:57,280 INFO L273 TraceCheckUtils]: 42: Hoare triple {6300#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6300#false} is VALID [2018-11-14 16:50:57,280 INFO L273 TraceCheckUtils]: 43: Hoare triple {6300#false} ~x~0 := 0; {6300#false} is VALID [2018-11-14 16:50:57,280 INFO L273 TraceCheckUtils]: 44: Hoare triple {6300#false} assume true; {6300#false} is VALID [2018-11-14 16:50:57,280 INFO L273 TraceCheckUtils]: 45: Hoare triple {6300#false} assume !(~x~0 < ~i~0); {6300#false} is VALID [2018-11-14 16:50:57,281 INFO L273 TraceCheckUtils]: 46: Hoare triple {6300#false} ~x~0 := 0; {6300#false} is VALID [2018-11-14 16:50:57,281 INFO L273 TraceCheckUtils]: 47: Hoare triple {6300#false} assume true; {6300#false} is VALID [2018-11-14 16:50:57,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {6300#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6300#false} is VALID [2018-11-14 16:50:57,282 INFO L256 TraceCheckUtils]: 49: Hoare triple {6300#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6299#true} is VALID [2018-11-14 16:50:57,282 INFO L273 TraceCheckUtils]: 50: Hoare triple {6299#true} ~cond := #in~cond; {6299#true} is VALID [2018-11-14 16:50:57,282 INFO L273 TraceCheckUtils]: 51: Hoare triple {6299#true} assume !(~cond == 0); {6299#true} is VALID [2018-11-14 16:50:57,282 INFO L273 TraceCheckUtils]: 52: Hoare triple {6299#true} assume true; {6299#true} is VALID [2018-11-14 16:50:57,283 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {6299#true} {6300#false} #143#return; {6300#false} is VALID [2018-11-14 16:50:57,283 INFO L273 TraceCheckUtils]: 54: Hoare triple {6300#false} havoc #t~mem9;havoc #t~mem10; {6300#false} is VALID [2018-11-14 16:50:57,283 INFO L273 TraceCheckUtils]: 55: Hoare triple {6300#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {6300#false} is VALID [2018-11-14 16:50:57,284 INFO L273 TraceCheckUtils]: 56: Hoare triple {6300#false} assume true; {6300#false} is VALID [2018-11-14 16:50:57,284 INFO L273 TraceCheckUtils]: 57: Hoare triple {6300#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6300#false} is VALID [2018-11-14 16:50:57,284 INFO L256 TraceCheckUtils]: 58: Hoare triple {6300#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6300#false} is VALID [2018-11-14 16:50:57,284 INFO L273 TraceCheckUtils]: 59: Hoare triple {6300#false} ~cond := #in~cond; {6300#false} is VALID [2018-11-14 16:50:57,284 INFO L273 TraceCheckUtils]: 60: Hoare triple {6300#false} assume ~cond == 0; {6300#false} is VALID [2018-11-14 16:50:57,285 INFO L273 TraceCheckUtils]: 61: Hoare triple {6300#false} assume !false; {6300#false} is VALID [2018-11-14 16:50:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 128 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:50:57,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:57,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:57,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:50:57,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:50:57,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:57,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:57,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {6299#true} call ULTIMATE.init(); {6299#true} is VALID [2018-11-14 16:50:57,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {6299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6299#true} is VALID [2018-11-14 16:50:57,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {6299#true} assume true; {6299#true} is VALID [2018-11-14 16:50:57,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6299#true} {6299#true} #137#return; {6299#true} is VALID [2018-11-14 16:50:57,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {6299#true} call #t~ret15 := main(); {6299#true} is VALID [2018-11-14 16:50:57,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {6299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6299#true} is VALID [2018-11-14 16:50:57,667 INFO L273 TraceCheckUtils]: 6: Hoare triple {6299#true} assume true; {6299#true} is VALID [2018-11-14 16:50:57,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {6299#true} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {6335#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2018-11-14 16:50:57,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {6335#(<= main_~k~0 (+ main_~i~0 1))} assume true; {6335#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2018-11-14 16:50:57,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {6335#(<= main_~k~0 (+ main_~i~0 1))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6335#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2018-11-14 16:50:57,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {6335#(<= main_~k~0 (+ main_~i~0 1))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6335#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2018-11-14 16:50:57,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {6335#(<= main_~k~0 (+ main_~i~0 1))} ~k~0 := ~k~0 + 1; {6348#(<= main_~k~0 (+ main_~i~0 2))} is VALID [2018-11-14 16:50:57,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {6348#(<= main_~k~0 (+ main_~i~0 2))} assume true; {6348#(<= main_~k~0 (+ main_~i~0 2))} is VALID [2018-11-14 16:50:57,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {6348#(<= main_~k~0 (+ main_~i~0 2))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6348#(<= main_~k~0 (+ main_~i~0 2))} is VALID [2018-11-14 16:50:57,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {6348#(<= main_~k~0 (+ main_~i~0 2))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6348#(<= main_~k~0 (+ main_~i~0 2))} is VALID [2018-11-14 16:50:57,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {6348#(<= main_~k~0 (+ main_~i~0 2))} ~k~0 := ~k~0 + 1; {6361#(<= main_~k~0 (+ main_~i~0 3))} is VALID [2018-11-14 16:50:57,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {6361#(<= main_~k~0 (+ main_~i~0 3))} assume true; {6361#(<= main_~k~0 (+ main_~i~0 3))} is VALID [2018-11-14 16:50:57,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {6361#(<= main_~k~0 (+ main_~i~0 3))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6361#(<= main_~k~0 (+ main_~i~0 3))} is VALID [2018-11-14 16:50:57,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {6361#(<= main_~k~0 (+ main_~i~0 3))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6361#(<= main_~k~0 (+ main_~i~0 3))} is VALID [2018-11-14 16:50:57,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {6361#(<= main_~k~0 (+ main_~i~0 3))} ~k~0 := ~k~0 + 1; {6374#(<= main_~k~0 (+ main_~i~0 4))} is VALID [2018-11-14 16:50:57,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {6374#(<= main_~k~0 (+ main_~i~0 4))} assume true; {6374#(<= main_~k~0 (+ main_~i~0 4))} is VALID [2018-11-14 16:50:57,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {6374#(<= main_~k~0 (+ main_~i~0 4))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6374#(<= main_~k~0 (+ main_~i~0 4))} is VALID [2018-11-14 16:50:57,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {6374#(<= main_~k~0 (+ main_~i~0 4))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6374#(<= main_~k~0 (+ main_~i~0 4))} is VALID [2018-11-14 16:50:57,675 INFO L273 TraceCheckUtils]: 23: Hoare triple {6374#(<= main_~k~0 (+ main_~i~0 4))} ~k~0 := ~k~0 + 1; {6387#(<= main_~k~0 (+ main_~i~0 5))} is VALID [2018-11-14 16:50:57,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {6387#(<= main_~k~0 (+ main_~i~0 5))} assume true; {6387#(<= main_~k~0 (+ main_~i~0 5))} is VALID [2018-11-14 16:50:57,676 INFO L273 TraceCheckUtils]: 25: Hoare triple {6387#(<= main_~k~0 (+ main_~i~0 5))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6387#(<= main_~k~0 (+ main_~i~0 5))} is VALID [2018-11-14 16:50:57,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {6387#(<= main_~k~0 (+ main_~i~0 5))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6387#(<= main_~k~0 (+ main_~i~0 5))} is VALID [2018-11-14 16:50:57,677 INFO L273 TraceCheckUtils]: 27: Hoare triple {6387#(<= main_~k~0 (+ main_~i~0 5))} ~k~0 := ~k~0 + 1; {6400#(<= main_~k~0 (+ main_~i~0 6))} is VALID [2018-11-14 16:50:57,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {6400#(<= main_~k~0 (+ main_~i~0 6))} assume true; {6400#(<= main_~k~0 (+ main_~i~0 6))} is VALID [2018-11-14 16:50:57,678 INFO L273 TraceCheckUtils]: 29: Hoare triple {6400#(<= main_~k~0 (+ main_~i~0 6))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6400#(<= main_~k~0 (+ main_~i~0 6))} is VALID [2018-11-14 16:50:57,679 INFO L273 TraceCheckUtils]: 30: Hoare triple {6400#(<= main_~k~0 (+ main_~i~0 6))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6400#(<= main_~k~0 (+ main_~i~0 6))} is VALID [2018-11-14 16:50:57,679 INFO L273 TraceCheckUtils]: 31: Hoare triple {6400#(<= main_~k~0 (+ main_~i~0 6))} ~k~0 := ~k~0 + 1; {6413#(<= main_~k~0 (+ main_~i~0 7))} is VALID [2018-11-14 16:50:57,680 INFO L273 TraceCheckUtils]: 32: Hoare triple {6413#(<= main_~k~0 (+ main_~i~0 7))} assume true; {6413#(<= main_~k~0 (+ main_~i~0 7))} is VALID [2018-11-14 16:50:57,680 INFO L273 TraceCheckUtils]: 33: Hoare triple {6413#(<= main_~k~0 (+ main_~i~0 7))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6413#(<= main_~k~0 (+ main_~i~0 7))} is VALID [2018-11-14 16:50:57,681 INFO L273 TraceCheckUtils]: 34: Hoare triple {6413#(<= main_~k~0 (+ main_~i~0 7))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6413#(<= main_~k~0 (+ main_~i~0 7))} is VALID [2018-11-14 16:50:57,693 INFO L273 TraceCheckUtils]: 35: Hoare triple {6413#(<= main_~k~0 (+ main_~i~0 7))} ~k~0 := ~k~0 + 1; {6426#(<= main_~k~0 (+ main_~i~0 8))} is VALID [2018-11-14 16:50:57,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {6426#(<= main_~k~0 (+ main_~i~0 8))} assume true; {6426#(<= main_~k~0 (+ main_~i~0 8))} is VALID [2018-11-14 16:50:57,694 INFO L273 TraceCheckUtils]: 37: Hoare triple {6426#(<= main_~k~0 (+ main_~i~0 8))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {6426#(<= main_~k~0 (+ main_~i~0 8))} is VALID [2018-11-14 16:50:57,694 INFO L273 TraceCheckUtils]: 38: Hoare triple {6426#(<= main_~k~0 (+ main_~i~0 8))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6426#(<= main_~k~0 (+ main_~i~0 8))} is VALID [2018-11-14 16:50:57,695 INFO L273 TraceCheckUtils]: 39: Hoare triple {6426#(<= main_~k~0 (+ main_~i~0 8))} ~k~0 := ~k~0 + 1; {6439#(<= main_~k~0 (+ main_~i~0 9))} is VALID [2018-11-14 16:50:57,695 INFO L273 TraceCheckUtils]: 40: Hoare triple {6439#(<= main_~k~0 (+ main_~i~0 9))} assume true; {6439#(<= main_~k~0 (+ main_~i~0 9))} is VALID [2018-11-14 16:50:57,696 INFO L273 TraceCheckUtils]: 41: Hoare triple {6439#(<= main_~k~0 (+ main_~i~0 9))} assume !(~k~0 < 100000); {6446#(<= 99991 main_~i~0)} is VALID [2018-11-14 16:50:57,696 INFO L273 TraceCheckUtils]: 42: Hoare triple {6446#(<= 99991 main_~i~0)} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6446#(<= 99991 main_~i~0)} is VALID [2018-11-14 16:50:57,701 INFO L273 TraceCheckUtils]: 43: Hoare triple {6446#(<= 99991 main_~i~0)} ~x~0 := 0; {6453#(and (<= 99991 main_~i~0) (<= main_~x~0 0))} is VALID [2018-11-14 16:50:57,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {6453#(and (<= 99991 main_~i~0) (<= main_~x~0 0))} assume true; {6453#(and (<= 99991 main_~i~0) (<= main_~x~0 0))} is VALID [2018-11-14 16:50:57,703 INFO L273 TraceCheckUtils]: 45: Hoare triple {6453#(and (<= 99991 main_~i~0) (<= main_~x~0 0))} assume !(~x~0 < ~i~0); {6300#false} is VALID [2018-11-14 16:50:57,703 INFO L273 TraceCheckUtils]: 46: Hoare triple {6300#false} ~x~0 := 0; {6300#false} is VALID [2018-11-14 16:50:57,703 INFO L273 TraceCheckUtils]: 47: Hoare triple {6300#false} assume true; {6300#false} is VALID [2018-11-14 16:50:57,703 INFO L273 TraceCheckUtils]: 48: Hoare triple {6300#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6300#false} is VALID [2018-11-14 16:50:57,703 INFO L256 TraceCheckUtils]: 49: Hoare triple {6300#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6300#false} is VALID [2018-11-14 16:50:57,703 INFO L273 TraceCheckUtils]: 50: Hoare triple {6300#false} ~cond := #in~cond; {6300#false} is VALID [2018-11-14 16:50:57,703 INFO L273 TraceCheckUtils]: 51: Hoare triple {6300#false} assume !(~cond == 0); {6300#false} is VALID [2018-11-14 16:50:57,704 INFO L273 TraceCheckUtils]: 52: Hoare triple {6300#false} assume true; {6300#false} is VALID [2018-11-14 16:50:57,704 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {6300#false} {6300#false} #143#return; {6300#false} is VALID [2018-11-14 16:50:57,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {6300#false} havoc #t~mem9;havoc #t~mem10; {6300#false} is VALID [2018-11-14 16:50:57,704 INFO L273 TraceCheckUtils]: 55: Hoare triple {6300#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {6300#false} is VALID [2018-11-14 16:50:57,704 INFO L273 TraceCheckUtils]: 56: Hoare triple {6300#false} assume true; {6300#false} is VALID [2018-11-14 16:50:57,704 INFO L273 TraceCheckUtils]: 57: Hoare triple {6300#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6300#false} is VALID [2018-11-14 16:50:57,704 INFO L256 TraceCheckUtils]: 58: Hoare triple {6300#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6300#false} is VALID [2018-11-14 16:50:57,704 INFO L273 TraceCheckUtils]: 59: Hoare triple {6300#false} ~cond := #in~cond; {6300#false} is VALID [2018-11-14 16:50:57,705 INFO L273 TraceCheckUtils]: 60: Hoare triple {6300#false} assume ~cond == 0; {6300#false} is VALID [2018-11-14 16:50:57,705 INFO L273 TraceCheckUtils]: 61: Hoare triple {6300#false} assume !false; {6300#false} is VALID [2018-11-14 16:50:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:50:57,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:57,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-11-14 16:50:57,730 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2018-11-14 16:50:57,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:57,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 16:50:57,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:57,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 16:50:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 16:50:57,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:50:57,828 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand 23 states. [2018-11-14 16:51:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:05,383 INFO L93 Difference]: Finished difference Result 775 states and 1032 transitions. [2018-11-14 16:51:05,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-14 16:51:05,384 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2018-11-14 16:51:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:51:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 845 transitions. [2018-11-14 16:51:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:51:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 845 transitions. [2018-11-14 16:51:05,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 845 transitions. [2018-11-14 16:51:07,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 845 edges. 845 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:07,266 INFO L225 Difference]: With dead ends: 775 [2018-11-14 16:51:07,266 INFO L226 Difference]: Without dead ends: 719 [2018-11-14 16:51:07,267 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-11-14 16:51:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-11-14 16:51:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 234. [2018-11-14 16:51:07,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:07,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 719 states. Second operand 234 states. [2018-11-14 16:51:07,688 INFO L74 IsIncluded]: Start isIncluded. First operand 719 states. Second operand 234 states. [2018-11-14 16:51:07,688 INFO L87 Difference]: Start difference. First operand 719 states. Second operand 234 states. [2018-11-14 16:51:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:07,733 INFO L93 Difference]: Finished difference Result 719 states and 943 transitions. [2018-11-14 16:51:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 943 transitions. [2018-11-14 16:51:07,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:07,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:07,736 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 719 states. [2018-11-14 16:51:07,736 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 719 states. [2018-11-14 16:51:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:07,779 INFO L93 Difference]: Finished difference Result 719 states and 943 transitions. [2018-11-14 16:51:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 943 transitions. [2018-11-14 16:51:07,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:07,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:07,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:07,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-14 16:51:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 309 transitions. [2018-11-14 16:51:07,791 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 309 transitions. Word has length 62 [2018-11-14 16:51:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:07,791 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 309 transitions. [2018-11-14 16:51:07,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 16:51:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 309 transitions. [2018-11-14 16:51:07,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-14 16:51:07,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:07,792 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:07,793 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:07,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:07,793 INFO L82 PathProgramCache]: Analyzing trace with hash 299533360, now seen corresponding path program 5 times [2018-11-14 16:51:07,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:07,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:07,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:08,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {9306#true} call ULTIMATE.init(); {9306#true} is VALID [2018-11-14 16:51:08,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {9306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9306#true} is VALID [2018-11-14 16:51:08,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {9306#true} assume true; {9306#true} is VALID [2018-11-14 16:51:08,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9306#true} {9306#true} #137#return; {9306#true} is VALID [2018-11-14 16:51:08,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {9306#true} call #t~ret15 := main(); {9306#true} is VALID [2018-11-14 16:51:08,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {9306#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {9308#(= main_~i~0 0)} is VALID [2018-11-14 16:51:08,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {9308#(= main_~i~0 0)} assume true; {9308#(= main_~i~0 0)} is VALID [2018-11-14 16:51:08,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {9308#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {9309#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {9309#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {9309#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {9309#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9309#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {9309#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9309#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {9309#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {9310#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {9310#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {9310#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {9310#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9310#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,415 INFO L273 TraceCheckUtils]: 14: Hoare triple {9310#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9310#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {9310#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {9311#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {9311#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {9311#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {9311#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9311#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {9311#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9311#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,468 INFO L273 TraceCheckUtils]: 19: Hoare triple {9311#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {9312#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {9312#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {9312#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {9312#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9312#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,483 INFO L273 TraceCheckUtils]: 22: Hoare triple {9312#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9312#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,483 INFO L273 TraceCheckUtils]: 23: Hoare triple {9312#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {9313#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {9313#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {9313#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,484 INFO L273 TraceCheckUtils]: 25: Hoare triple {9313#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9313#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {9313#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9313#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,485 INFO L273 TraceCheckUtils]: 27: Hoare triple {9313#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {9314#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {9314#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {9314#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,486 INFO L273 TraceCheckUtils]: 29: Hoare triple {9314#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9314#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {9314#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9314#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,487 INFO L273 TraceCheckUtils]: 31: Hoare triple {9314#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {9315#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,488 INFO L273 TraceCheckUtils]: 32: Hoare triple {9315#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {9315#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,488 INFO L273 TraceCheckUtils]: 33: Hoare triple {9315#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9315#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,489 INFO L273 TraceCheckUtils]: 34: Hoare triple {9315#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9315#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,490 INFO L273 TraceCheckUtils]: 35: Hoare triple {9315#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {9316#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {9316#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {9316#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {9316#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9316#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {9316#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9316#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,493 INFO L273 TraceCheckUtils]: 39: Hoare triple {9316#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {9317#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,493 INFO L273 TraceCheckUtils]: 40: Hoare triple {9317#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {9317#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {9317#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9317#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,495 INFO L273 TraceCheckUtils]: 42: Hoare triple {9317#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9317#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,496 INFO L273 TraceCheckUtils]: 43: Hoare triple {9317#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {9318#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,497 INFO L273 TraceCheckUtils]: 44: Hoare triple {9318#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {9318#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:08,497 INFO L273 TraceCheckUtils]: 45: Hoare triple {9318#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !(~k~0 < 100000); {9307#false} is VALID [2018-11-14 16:51:08,498 INFO L273 TraceCheckUtils]: 46: Hoare triple {9307#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9307#false} is VALID [2018-11-14 16:51:08,498 INFO L273 TraceCheckUtils]: 47: Hoare triple {9307#false} ~x~0 := 0; {9307#false} is VALID [2018-11-14 16:51:08,498 INFO L273 TraceCheckUtils]: 48: Hoare triple {9307#false} assume true; {9307#false} is VALID [2018-11-14 16:51:08,498 INFO L273 TraceCheckUtils]: 49: Hoare triple {9307#false} assume !(~x~0 < ~i~0); {9307#false} is VALID [2018-11-14 16:51:08,498 INFO L273 TraceCheckUtils]: 50: Hoare triple {9307#false} ~x~0 := 0; {9307#false} is VALID [2018-11-14 16:51:08,499 INFO L273 TraceCheckUtils]: 51: Hoare triple {9307#false} assume true; {9307#false} is VALID [2018-11-14 16:51:08,499 INFO L273 TraceCheckUtils]: 52: Hoare triple {9307#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9307#false} is VALID [2018-11-14 16:51:08,499 INFO L256 TraceCheckUtils]: 53: Hoare triple {9307#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9306#true} is VALID [2018-11-14 16:51:08,499 INFO L273 TraceCheckUtils]: 54: Hoare triple {9306#true} ~cond := #in~cond; {9306#true} is VALID [2018-11-14 16:51:08,499 INFO L273 TraceCheckUtils]: 55: Hoare triple {9306#true} assume !(~cond == 0); {9306#true} is VALID [2018-11-14 16:51:08,499 INFO L273 TraceCheckUtils]: 56: Hoare triple {9306#true} assume true; {9306#true} is VALID [2018-11-14 16:51:08,500 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {9306#true} {9307#false} #143#return; {9307#false} is VALID [2018-11-14 16:51:08,500 INFO L273 TraceCheckUtils]: 58: Hoare triple {9307#false} havoc #t~mem9;havoc #t~mem10; {9307#false} is VALID [2018-11-14 16:51:08,500 INFO L273 TraceCheckUtils]: 59: Hoare triple {9307#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {9307#false} is VALID [2018-11-14 16:51:08,500 INFO L273 TraceCheckUtils]: 60: Hoare triple {9307#false} assume true; {9307#false} is VALID [2018-11-14 16:51:08,500 INFO L273 TraceCheckUtils]: 61: Hoare triple {9307#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9307#false} is VALID [2018-11-14 16:51:08,500 INFO L256 TraceCheckUtils]: 62: Hoare triple {9307#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9307#false} is VALID [2018-11-14 16:51:08,500 INFO L273 TraceCheckUtils]: 63: Hoare triple {9307#false} ~cond := #in~cond; {9307#false} is VALID [2018-11-14 16:51:08,500 INFO L273 TraceCheckUtils]: 64: Hoare triple {9307#false} assume ~cond == 0; {9307#false} is VALID [2018-11-14 16:51:08,501 INFO L273 TraceCheckUtils]: 65: Hoare triple {9307#false} assume !false; {9307#false} is VALID [2018-11-14 16:51:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 162 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:08,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:08,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:08,521 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:51:08,557 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-14 16:51:08,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:08,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:08,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {9306#true} call ULTIMATE.init(); {9306#true} is VALID [2018-11-14 16:51:08,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {9306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9306#true} is VALID [2018-11-14 16:51:08,778 INFO L273 TraceCheckUtils]: 2: Hoare triple {9306#true} assume true; {9306#true} is VALID [2018-11-14 16:51:08,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9306#true} {9306#true} #137#return; {9306#true} is VALID [2018-11-14 16:51:08,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {9306#true} call #t~ret15 := main(); {9306#true} is VALID [2018-11-14 16:51:08,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {9306#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {9337#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:08,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {9337#(<= main_~i~0 0)} assume true; {9337#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:08,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {9337#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {9344#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:08,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {9344#(<= main_~k~0 1)} assume true; {9344#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:08,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {9344#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9344#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:08,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {9344#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9344#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:08,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {9344#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {9357#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:08,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {9357#(<= main_~k~0 2)} assume true; {9357#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:08,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {9357#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9357#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:08,784 INFO L273 TraceCheckUtils]: 14: Hoare triple {9357#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9357#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:08,785 INFO L273 TraceCheckUtils]: 15: Hoare triple {9357#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {9370#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:08,785 INFO L273 TraceCheckUtils]: 16: Hoare triple {9370#(<= main_~k~0 3)} assume true; {9370#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:08,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {9370#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9370#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:08,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {9370#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9370#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:08,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {9370#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {9383#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:08,787 INFO L273 TraceCheckUtils]: 20: Hoare triple {9383#(<= main_~k~0 4)} assume true; {9383#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:08,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {9383#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9383#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:08,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {9383#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9383#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:08,789 INFO L273 TraceCheckUtils]: 23: Hoare triple {9383#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {9396#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:08,790 INFO L273 TraceCheckUtils]: 24: Hoare triple {9396#(<= main_~k~0 5)} assume true; {9396#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:08,790 INFO L273 TraceCheckUtils]: 25: Hoare triple {9396#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9396#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:08,791 INFO L273 TraceCheckUtils]: 26: Hoare triple {9396#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9396#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:08,791 INFO L273 TraceCheckUtils]: 27: Hoare triple {9396#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {9409#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:08,792 INFO L273 TraceCheckUtils]: 28: Hoare triple {9409#(<= main_~k~0 6)} assume true; {9409#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:08,792 INFO L273 TraceCheckUtils]: 29: Hoare triple {9409#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9409#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:08,793 INFO L273 TraceCheckUtils]: 30: Hoare triple {9409#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9409#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:08,794 INFO L273 TraceCheckUtils]: 31: Hoare triple {9409#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {9422#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:08,794 INFO L273 TraceCheckUtils]: 32: Hoare triple {9422#(<= main_~k~0 7)} assume true; {9422#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:08,795 INFO L273 TraceCheckUtils]: 33: Hoare triple {9422#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9422#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:08,795 INFO L273 TraceCheckUtils]: 34: Hoare triple {9422#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9422#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:08,796 INFO L273 TraceCheckUtils]: 35: Hoare triple {9422#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {9435#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:08,796 INFO L273 TraceCheckUtils]: 36: Hoare triple {9435#(<= main_~k~0 8)} assume true; {9435#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:08,797 INFO L273 TraceCheckUtils]: 37: Hoare triple {9435#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9435#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:08,797 INFO L273 TraceCheckUtils]: 38: Hoare triple {9435#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9435#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:08,798 INFO L273 TraceCheckUtils]: 39: Hoare triple {9435#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {9448#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:08,799 INFO L273 TraceCheckUtils]: 40: Hoare triple {9448#(<= main_~k~0 9)} assume true; {9448#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:08,799 INFO L273 TraceCheckUtils]: 41: Hoare triple {9448#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {9448#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:08,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {9448#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9448#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:08,800 INFO L273 TraceCheckUtils]: 43: Hoare triple {9448#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {9461#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:08,801 INFO L273 TraceCheckUtils]: 44: Hoare triple {9461#(<= main_~k~0 10)} assume true; {9461#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:08,801 INFO L273 TraceCheckUtils]: 45: Hoare triple {9461#(<= main_~k~0 10)} assume !(~k~0 < 100000); {9307#false} is VALID [2018-11-14 16:51:08,802 INFO L273 TraceCheckUtils]: 46: Hoare triple {9307#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9307#false} is VALID [2018-11-14 16:51:08,802 INFO L273 TraceCheckUtils]: 47: Hoare triple {9307#false} ~x~0 := 0; {9307#false} is VALID [2018-11-14 16:51:08,802 INFO L273 TraceCheckUtils]: 48: Hoare triple {9307#false} assume true; {9307#false} is VALID [2018-11-14 16:51:08,802 INFO L273 TraceCheckUtils]: 49: Hoare triple {9307#false} assume !(~x~0 < ~i~0); {9307#false} is VALID [2018-11-14 16:51:08,802 INFO L273 TraceCheckUtils]: 50: Hoare triple {9307#false} ~x~0 := 0; {9307#false} is VALID [2018-11-14 16:51:08,803 INFO L273 TraceCheckUtils]: 51: Hoare triple {9307#false} assume true; {9307#false} is VALID [2018-11-14 16:51:08,803 INFO L273 TraceCheckUtils]: 52: Hoare triple {9307#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9307#false} is VALID [2018-11-14 16:51:08,803 INFO L256 TraceCheckUtils]: 53: Hoare triple {9307#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9307#false} is VALID [2018-11-14 16:51:08,803 INFO L273 TraceCheckUtils]: 54: Hoare triple {9307#false} ~cond := #in~cond; {9307#false} is VALID [2018-11-14 16:51:08,803 INFO L273 TraceCheckUtils]: 55: Hoare triple {9307#false} assume !(~cond == 0); {9307#false} is VALID [2018-11-14 16:51:08,804 INFO L273 TraceCheckUtils]: 56: Hoare triple {9307#false} assume true; {9307#false} is VALID [2018-11-14 16:51:08,804 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {9307#false} {9307#false} #143#return; {9307#false} is VALID [2018-11-14 16:51:08,804 INFO L273 TraceCheckUtils]: 58: Hoare triple {9307#false} havoc #t~mem9;havoc #t~mem10; {9307#false} is VALID [2018-11-14 16:51:08,804 INFO L273 TraceCheckUtils]: 59: Hoare triple {9307#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {9307#false} is VALID [2018-11-14 16:51:08,804 INFO L273 TraceCheckUtils]: 60: Hoare triple {9307#false} assume true; {9307#false} is VALID [2018-11-14 16:51:08,804 INFO L273 TraceCheckUtils]: 61: Hoare triple {9307#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9307#false} is VALID [2018-11-14 16:51:08,804 INFO L256 TraceCheckUtils]: 62: Hoare triple {9307#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9307#false} is VALID [2018-11-14 16:51:08,804 INFO L273 TraceCheckUtils]: 63: Hoare triple {9307#false} ~cond := #in~cond; {9307#false} is VALID [2018-11-14 16:51:08,805 INFO L273 TraceCheckUtils]: 64: Hoare triple {9307#false} assume ~cond == 0; {9307#false} is VALID [2018-11-14 16:51:08,805 INFO L273 TraceCheckUtils]: 65: Hoare triple {9307#false} assume !false; {9307#false} is VALID [2018-11-14 16:51:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:08,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:08,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 16:51:08,828 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-11-14 16:51:08,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:08,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 16:51:09,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:09,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 16:51:09,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 16:51:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:51:09,099 INFO L87 Difference]: Start difference. First operand 234 states and 309 transitions. Second operand 24 states. [2018-11-14 16:51:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:12,470 INFO L93 Difference]: Finished difference Result 405 states and 544 transitions. [2018-11-14 16:51:12,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:51:12,471 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-11-14 16:51:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:51:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 175 transitions. [2018-11-14 16:51:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:51:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 175 transitions. [2018-11-14 16:51:12,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 175 transitions. [2018-11-14 16:51:13,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:13,026 INFO L225 Difference]: With dead ends: 405 [2018-11-14 16:51:13,026 INFO L226 Difference]: Without dead ends: 252 [2018-11-14 16:51:13,027 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:51:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-14 16:51:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 242. [2018-11-14 16:51:13,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:13,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand 242 states. [2018-11-14 16:51:13,411 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 242 states. [2018-11-14 16:51:13,411 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 242 states. [2018-11-14 16:51:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:13,420 INFO L93 Difference]: Finished difference Result 252 states and 333 transitions. [2018-11-14 16:51:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 333 transitions. [2018-11-14 16:51:13,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:13,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:13,422 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 252 states. [2018-11-14 16:51:13,422 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 252 states. [2018-11-14 16:51:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:13,432 INFO L93 Difference]: Finished difference Result 252 states and 333 transitions. [2018-11-14 16:51:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 333 transitions. [2018-11-14 16:51:13,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:13,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:13,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:13,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-14 16:51:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-11-14 16:51:13,442 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 66 [2018-11-14 16:51:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:13,442 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-11-14 16:51:13,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 16:51:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-11-14 16:51:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 16:51:13,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:13,444 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:13,444 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:13,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:13,444 INFO L82 PathProgramCache]: Analyzing trace with hash -139059430, now seen corresponding path program 6 times [2018-11-14 16:51:13,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:13,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:13,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:13,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:14,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {10861#true} call ULTIMATE.init(); {10861#true} is VALID [2018-11-14 16:51:14,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {10861#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10861#true} is VALID [2018-11-14 16:51:14,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {10861#true} assume true; {10861#true} is VALID [2018-11-14 16:51:14,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10861#true} {10861#true} #137#return; {10861#true} is VALID [2018-11-14 16:51:14,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {10861#true} call #t~ret15 := main(); {10861#true} is VALID [2018-11-14 16:51:14,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {10861#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10863#(= main_~i~0 0)} is VALID [2018-11-14 16:51:14,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {10863#(= main_~i~0 0)} assume true; {10863#(= main_~i~0 0)} is VALID [2018-11-14 16:51:14,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {10863#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {10864#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {10864#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {10864#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {10864#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10864#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {10864#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10864#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {10864#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {10865#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {10865#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {10865#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {10865#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10865#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,100 INFO L273 TraceCheckUtils]: 14: Hoare triple {10865#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10865#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,101 INFO L273 TraceCheckUtils]: 15: Hoare triple {10865#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {10866#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,102 INFO L273 TraceCheckUtils]: 16: Hoare triple {10866#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {10866#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {10866#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10866#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {10866#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10866#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {10866#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {10867#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {10867#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {10867#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,105 INFO L273 TraceCheckUtils]: 21: Hoare triple {10867#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10867#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,106 INFO L273 TraceCheckUtils]: 22: Hoare triple {10867#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10867#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,107 INFO L273 TraceCheckUtils]: 23: Hoare triple {10867#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {10868#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {10868#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {10868#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,109 INFO L273 TraceCheckUtils]: 25: Hoare triple {10868#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10868#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {10868#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10868#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,110 INFO L273 TraceCheckUtils]: 27: Hoare triple {10868#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {10869#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,111 INFO L273 TraceCheckUtils]: 28: Hoare triple {10869#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {10869#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,112 INFO L273 TraceCheckUtils]: 29: Hoare triple {10869#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10869#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,112 INFO L273 TraceCheckUtils]: 30: Hoare triple {10869#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10869#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {10869#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {10870#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,114 INFO L273 TraceCheckUtils]: 32: Hoare triple {10870#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {10870#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,115 INFO L273 TraceCheckUtils]: 33: Hoare triple {10870#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10870#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,115 INFO L273 TraceCheckUtils]: 34: Hoare triple {10870#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10870#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,116 INFO L273 TraceCheckUtils]: 35: Hoare triple {10870#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {10871#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {10871#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {10871#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,117 INFO L273 TraceCheckUtils]: 37: Hoare triple {10871#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10871#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,118 INFO L273 TraceCheckUtils]: 38: Hoare triple {10871#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10871#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,119 INFO L273 TraceCheckUtils]: 39: Hoare triple {10871#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {10872#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,119 INFO L273 TraceCheckUtils]: 40: Hoare triple {10872#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {10872#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,120 INFO L273 TraceCheckUtils]: 41: Hoare triple {10872#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10872#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,121 INFO L273 TraceCheckUtils]: 42: Hoare triple {10872#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10872#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,122 INFO L273 TraceCheckUtils]: 43: Hoare triple {10872#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {10873#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,122 INFO L273 TraceCheckUtils]: 44: Hoare triple {10873#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {10873#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,123 INFO L273 TraceCheckUtils]: 45: Hoare triple {10873#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10873#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,124 INFO L273 TraceCheckUtils]: 46: Hoare triple {10873#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10873#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,125 INFO L273 TraceCheckUtils]: 47: Hoare triple {10873#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {10874#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,126 INFO L273 TraceCheckUtils]: 48: Hoare triple {10874#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {10874#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:14,126 INFO L273 TraceCheckUtils]: 49: Hoare triple {10874#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !(~k~0 < 100000); {10862#false} is VALID [2018-11-14 16:51:14,126 INFO L273 TraceCheckUtils]: 50: Hoare triple {10862#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10862#false} is VALID [2018-11-14 16:51:14,126 INFO L273 TraceCheckUtils]: 51: Hoare triple {10862#false} ~x~0 := 0; {10862#false} is VALID [2018-11-14 16:51:14,127 INFO L273 TraceCheckUtils]: 52: Hoare triple {10862#false} assume true; {10862#false} is VALID [2018-11-14 16:51:14,127 INFO L273 TraceCheckUtils]: 53: Hoare triple {10862#false} assume !(~x~0 < ~i~0); {10862#false} is VALID [2018-11-14 16:51:14,127 INFO L273 TraceCheckUtils]: 54: Hoare triple {10862#false} ~x~0 := 0; {10862#false} is VALID [2018-11-14 16:51:14,127 INFO L273 TraceCheckUtils]: 55: Hoare triple {10862#false} assume true; {10862#false} is VALID [2018-11-14 16:51:14,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {10862#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10862#false} is VALID [2018-11-14 16:51:14,127 INFO L256 TraceCheckUtils]: 57: Hoare triple {10862#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10861#true} is VALID [2018-11-14 16:51:14,127 INFO L273 TraceCheckUtils]: 58: Hoare triple {10861#true} ~cond := #in~cond; {10861#true} is VALID [2018-11-14 16:51:14,127 INFO L273 TraceCheckUtils]: 59: Hoare triple {10861#true} assume !(~cond == 0); {10861#true} is VALID [2018-11-14 16:51:14,128 INFO L273 TraceCheckUtils]: 60: Hoare triple {10861#true} assume true; {10861#true} is VALID [2018-11-14 16:51:14,128 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {10861#true} {10862#false} #143#return; {10862#false} is VALID [2018-11-14 16:51:14,128 INFO L273 TraceCheckUtils]: 62: Hoare triple {10862#false} havoc #t~mem9;havoc #t~mem10; {10862#false} is VALID [2018-11-14 16:51:14,128 INFO L273 TraceCheckUtils]: 63: Hoare triple {10862#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {10862#false} is VALID [2018-11-14 16:51:14,128 INFO L273 TraceCheckUtils]: 64: Hoare triple {10862#false} assume true; {10862#false} is VALID [2018-11-14 16:51:14,128 INFO L273 TraceCheckUtils]: 65: Hoare triple {10862#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10862#false} is VALID [2018-11-14 16:51:14,128 INFO L256 TraceCheckUtils]: 66: Hoare triple {10862#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10862#false} is VALID [2018-11-14 16:51:14,128 INFO L273 TraceCheckUtils]: 67: Hoare triple {10862#false} ~cond := #in~cond; {10862#false} is VALID [2018-11-14 16:51:14,129 INFO L273 TraceCheckUtils]: 68: Hoare triple {10862#false} assume ~cond == 0; {10862#false} is VALID [2018-11-14 16:51:14,129 INFO L273 TraceCheckUtils]: 69: Hoare triple {10862#false} assume !false; {10862#false} is VALID [2018-11-14 16:51:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 2 proven. 200 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:14,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:14,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:14,146 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:51:14,195 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-14 16:51:14,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:14,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:14,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {10861#true} call ULTIMATE.init(); {10861#true} is VALID [2018-11-14 16:51:14,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {10861#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10861#true} is VALID [2018-11-14 16:51:14,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {10861#true} assume true; {10861#true} is VALID [2018-11-14 16:51:14,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10861#true} {10861#true} #137#return; {10861#true} is VALID [2018-11-14 16:51:14,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {10861#true} call #t~ret15 := main(); {10861#true} is VALID [2018-11-14 16:51:14,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {10861#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10893#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:14,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {10893#(<= main_~i~0 0)} assume true; {10893#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:14,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {10893#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {10900#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:14,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {10900#(<= main_~k~0 1)} assume true; {10900#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:14,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {10900#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10900#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:14,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {10900#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10900#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:14,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {10900#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {10913#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:14,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {10913#(<= main_~k~0 2)} assume true; {10913#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:14,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {10913#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10913#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:14,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {10913#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10913#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:14,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {10913#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {10926#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:14,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {10926#(<= main_~k~0 3)} assume true; {10926#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:14,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {10926#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10926#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:14,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {10926#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10926#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:14,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {10926#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {10939#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:14,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {10939#(<= main_~k~0 4)} assume true; {10939#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:14,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {10939#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10939#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:14,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {10939#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10939#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:14,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {10939#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {10952#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:14,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {10952#(<= main_~k~0 5)} assume true; {10952#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:14,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {10952#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10952#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:14,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {10952#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10952#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:14,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {10952#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {10965#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:14,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {10965#(<= main_~k~0 6)} assume true; {10965#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:14,615 INFO L273 TraceCheckUtils]: 29: Hoare triple {10965#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10965#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:14,615 INFO L273 TraceCheckUtils]: 30: Hoare triple {10965#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10965#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:14,616 INFO L273 TraceCheckUtils]: 31: Hoare triple {10965#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {10978#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:14,616 INFO L273 TraceCheckUtils]: 32: Hoare triple {10978#(<= main_~k~0 7)} assume true; {10978#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:14,617 INFO L273 TraceCheckUtils]: 33: Hoare triple {10978#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10978#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:14,617 INFO L273 TraceCheckUtils]: 34: Hoare triple {10978#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10978#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:14,618 INFO L273 TraceCheckUtils]: 35: Hoare triple {10978#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {10991#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:14,619 INFO L273 TraceCheckUtils]: 36: Hoare triple {10991#(<= main_~k~0 8)} assume true; {10991#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:14,619 INFO L273 TraceCheckUtils]: 37: Hoare triple {10991#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {10991#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:14,620 INFO L273 TraceCheckUtils]: 38: Hoare triple {10991#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10991#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:14,620 INFO L273 TraceCheckUtils]: 39: Hoare triple {10991#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {11004#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:14,621 INFO L273 TraceCheckUtils]: 40: Hoare triple {11004#(<= main_~k~0 9)} assume true; {11004#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:14,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {11004#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {11004#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:14,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {11004#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11004#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:14,623 INFO L273 TraceCheckUtils]: 43: Hoare triple {11004#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {11017#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:14,623 INFO L273 TraceCheckUtils]: 44: Hoare triple {11017#(<= main_~k~0 10)} assume true; {11017#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:14,624 INFO L273 TraceCheckUtils]: 45: Hoare triple {11017#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {11017#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:14,624 INFO L273 TraceCheckUtils]: 46: Hoare triple {11017#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11017#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:14,625 INFO L273 TraceCheckUtils]: 47: Hoare triple {11017#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {11030#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:14,625 INFO L273 TraceCheckUtils]: 48: Hoare triple {11030#(<= main_~k~0 11)} assume true; {11030#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:14,626 INFO L273 TraceCheckUtils]: 49: Hoare triple {11030#(<= main_~k~0 11)} assume !(~k~0 < 100000); {10862#false} is VALID [2018-11-14 16:51:14,626 INFO L273 TraceCheckUtils]: 50: Hoare triple {10862#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10862#false} is VALID [2018-11-14 16:51:14,626 INFO L273 TraceCheckUtils]: 51: Hoare triple {10862#false} ~x~0 := 0; {10862#false} is VALID [2018-11-14 16:51:14,627 INFO L273 TraceCheckUtils]: 52: Hoare triple {10862#false} assume true; {10862#false} is VALID [2018-11-14 16:51:14,627 INFO L273 TraceCheckUtils]: 53: Hoare triple {10862#false} assume !(~x~0 < ~i~0); {10862#false} is VALID [2018-11-14 16:51:14,627 INFO L273 TraceCheckUtils]: 54: Hoare triple {10862#false} ~x~0 := 0; {10862#false} is VALID [2018-11-14 16:51:14,627 INFO L273 TraceCheckUtils]: 55: Hoare triple {10862#false} assume true; {10862#false} is VALID [2018-11-14 16:51:14,627 INFO L273 TraceCheckUtils]: 56: Hoare triple {10862#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10862#false} is VALID [2018-11-14 16:51:14,628 INFO L256 TraceCheckUtils]: 57: Hoare triple {10862#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10862#false} is VALID [2018-11-14 16:51:14,628 INFO L273 TraceCheckUtils]: 58: Hoare triple {10862#false} ~cond := #in~cond; {10862#false} is VALID [2018-11-14 16:51:14,628 INFO L273 TraceCheckUtils]: 59: Hoare triple {10862#false} assume !(~cond == 0); {10862#false} is VALID [2018-11-14 16:51:14,628 INFO L273 TraceCheckUtils]: 60: Hoare triple {10862#false} assume true; {10862#false} is VALID [2018-11-14 16:51:14,628 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {10862#false} {10862#false} #143#return; {10862#false} is VALID [2018-11-14 16:51:14,629 INFO L273 TraceCheckUtils]: 62: Hoare triple {10862#false} havoc #t~mem9;havoc #t~mem10; {10862#false} is VALID [2018-11-14 16:51:14,629 INFO L273 TraceCheckUtils]: 63: Hoare triple {10862#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {10862#false} is VALID [2018-11-14 16:51:14,629 INFO L273 TraceCheckUtils]: 64: Hoare triple {10862#false} assume true; {10862#false} is VALID [2018-11-14 16:51:14,629 INFO L273 TraceCheckUtils]: 65: Hoare triple {10862#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10862#false} is VALID [2018-11-14 16:51:14,629 INFO L256 TraceCheckUtils]: 66: Hoare triple {10862#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10862#false} is VALID [2018-11-14 16:51:14,629 INFO L273 TraceCheckUtils]: 67: Hoare triple {10862#false} ~cond := #in~cond; {10862#false} is VALID [2018-11-14 16:51:14,629 INFO L273 TraceCheckUtils]: 68: Hoare triple {10862#false} assume ~cond == 0; {10862#false} is VALID [2018-11-14 16:51:14,629 INFO L273 TraceCheckUtils]: 69: Hoare triple {10862#false} assume !false; {10862#false} is VALID [2018-11-14 16:51:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:14,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:14,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-14 16:51:14,653 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2018-11-14 16:51:14,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:14,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 16:51:14,755 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-14 16:51:14,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 16:51:14,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 16:51:14,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:51:14,756 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 26 states. [2018-11-14 16:51:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:15,475 INFO L93 Difference]: Finished difference Result 413 states and 554 transitions. [2018-11-14 16:51:15,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:51:15,476 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2018-11-14 16:51:15,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:51:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 180 transitions. [2018-11-14 16:51:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:51:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 180 transitions. [2018-11-14 16:51:15,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 180 transitions. [2018-11-14 16:51:15,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:15,642 INFO L225 Difference]: With dead ends: 413 [2018-11-14 16:51:15,642 INFO L226 Difference]: Without dead ends: 260 [2018-11-14 16:51:15,643 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:51:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-14 16:51:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 250. [2018-11-14 16:51:15,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:15,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand 250 states. [2018-11-14 16:51:15,882 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 250 states. [2018-11-14 16:51:15,882 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 250 states. [2018-11-14 16:51:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:15,889 INFO L93 Difference]: Finished difference Result 260 states and 343 transitions. [2018-11-14 16:51:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 343 transitions. [2018-11-14 16:51:15,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:15,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:15,890 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 260 states. [2018-11-14 16:51:15,890 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 260 states. [2018-11-14 16:51:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:15,897 INFO L93 Difference]: Finished difference Result 260 states and 343 transitions. [2018-11-14 16:51:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 343 transitions. [2018-11-14 16:51:15,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:15,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:15,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:15,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-14 16:51:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 329 transitions. [2018-11-14 16:51:15,905 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 329 transitions. Word has length 70 [2018-11-14 16:51:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:15,905 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 329 transitions. [2018-11-14 16:51:15,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 16:51:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 329 transitions. [2018-11-14 16:51:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-14 16:51:15,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:15,906 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:15,907 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:15,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash -15321852, now seen corresponding path program 7 times [2018-11-14 16:51:15,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:15,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:15,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:15,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:15,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:17,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {12466#true} call ULTIMATE.init(); {12466#true} is VALID [2018-11-14 16:51:17,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {12466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12466#true} is VALID [2018-11-14 16:51:17,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {12466#true} assume true; {12466#true} is VALID [2018-11-14 16:51:17,258 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12466#true} {12466#true} #137#return; {12466#true} is VALID [2018-11-14 16:51:17,258 INFO L256 TraceCheckUtils]: 4: Hoare triple {12466#true} call #t~ret15 := main(); {12466#true} is VALID [2018-11-14 16:51:17,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {12466#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {12468#(= main_~i~0 0)} is VALID [2018-11-14 16:51:17,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {12468#(= main_~i~0 0)} assume true; {12468#(= main_~i~0 0)} is VALID [2018-11-14 16:51:17,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {12468#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {12469#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {12469#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {12469#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {12469#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12469#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {12469#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12469#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {12469#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12470#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {12470#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {12470#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {12470#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12470#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {12470#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12470#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {12470#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12471#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {12471#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {12471#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {12471#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12471#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {12471#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12471#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {12471#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12472#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {12472#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {12472#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {12472#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12472#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {12472#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12472#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {12472#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12473#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {12473#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {12473#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {12473#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12473#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {12473#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12473#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {12473#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12474#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,272 INFO L273 TraceCheckUtils]: 28: Hoare triple {12474#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {12474#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,273 INFO L273 TraceCheckUtils]: 29: Hoare triple {12474#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12474#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,274 INFO L273 TraceCheckUtils]: 30: Hoare triple {12474#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12474#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {12474#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12475#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {12475#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {12475#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {12475#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12475#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {12475#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12475#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {12475#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12476#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {12476#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {12476#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,279 INFO L273 TraceCheckUtils]: 37: Hoare triple {12476#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12476#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,280 INFO L273 TraceCheckUtils]: 38: Hoare triple {12476#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12476#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,280 INFO L273 TraceCheckUtils]: 39: Hoare triple {12476#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12477#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,281 INFO L273 TraceCheckUtils]: 40: Hoare triple {12477#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {12477#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {12477#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12477#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,282 INFO L273 TraceCheckUtils]: 42: Hoare triple {12477#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12477#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,283 INFO L273 TraceCheckUtils]: 43: Hoare triple {12477#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12478#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,284 INFO L273 TraceCheckUtils]: 44: Hoare triple {12478#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {12478#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,285 INFO L273 TraceCheckUtils]: 45: Hoare triple {12478#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12478#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,285 INFO L273 TraceCheckUtils]: 46: Hoare triple {12478#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12478#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,286 INFO L273 TraceCheckUtils]: 47: Hoare triple {12478#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12479#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,287 INFO L273 TraceCheckUtils]: 48: Hoare triple {12479#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {12479#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {12479#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12479#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,289 INFO L273 TraceCheckUtils]: 50: Hoare triple {12479#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12479#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,289 INFO L273 TraceCheckUtils]: 51: Hoare triple {12479#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {12480#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,290 INFO L273 TraceCheckUtils]: 52: Hoare triple {12480#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {12480#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:17,291 INFO L273 TraceCheckUtils]: 53: Hoare triple {12480#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !(~k~0 < 100000); {12467#false} is VALID [2018-11-14 16:51:17,291 INFO L273 TraceCheckUtils]: 54: Hoare triple {12467#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12467#false} is VALID [2018-11-14 16:51:17,291 INFO L273 TraceCheckUtils]: 55: Hoare triple {12467#false} ~x~0 := 0; {12467#false} is VALID [2018-11-14 16:51:17,291 INFO L273 TraceCheckUtils]: 56: Hoare triple {12467#false} assume true; {12467#false} is VALID [2018-11-14 16:51:17,292 INFO L273 TraceCheckUtils]: 57: Hoare triple {12467#false} assume !(~x~0 < ~i~0); {12467#false} is VALID [2018-11-14 16:51:17,292 INFO L273 TraceCheckUtils]: 58: Hoare triple {12467#false} ~x~0 := 0; {12467#false} is VALID [2018-11-14 16:51:17,292 INFO L273 TraceCheckUtils]: 59: Hoare triple {12467#false} assume true; {12467#false} is VALID [2018-11-14 16:51:17,292 INFO L273 TraceCheckUtils]: 60: Hoare triple {12467#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12467#false} is VALID [2018-11-14 16:51:17,292 INFO L256 TraceCheckUtils]: 61: Hoare triple {12467#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12466#true} is VALID [2018-11-14 16:51:17,293 INFO L273 TraceCheckUtils]: 62: Hoare triple {12466#true} ~cond := #in~cond; {12466#true} is VALID [2018-11-14 16:51:17,293 INFO L273 TraceCheckUtils]: 63: Hoare triple {12466#true} assume !(~cond == 0); {12466#true} is VALID [2018-11-14 16:51:17,293 INFO L273 TraceCheckUtils]: 64: Hoare triple {12466#true} assume true; {12466#true} is VALID [2018-11-14 16:51:17,293 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {12466#true} {12467#false} #143#return; {12467#false} is VALID [2018-11-14 16:51:17,293 INFO L273 TraceCheckUtils]: 66: Hoare triple {12467#false} havoc #t~mem9;havoc #t~mem10; {12467#false} is VALID [2018-11-14 16:51:17,294 INFO L273 TraceCheckUtils]: 67: Hoare triple {12467#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {12467#false} is VALID [2018-11-14 16:51:17,294 INFO L273 TraceCheckUtils]: 68: Hoare triple {12467#false} assume true; {12467#false} is VALID [2018-11-14 16:51:17,294 INFO L273 TraceCheckUtils]: 69: Hoare triple {12467#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12467#false} is VALID [2018-11-14 16:51:17,294 INFO L256 TraceCheckUtils]: 70: Hoare triple {12467#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12467#false} is VALID [2018-11-14 16:51:17,294 INFO L273 TraceCheckUtils]: 71: Hoare triple {12467#false} ~cond := #in~cond; {12467#false} is VALID [2018-11-14 16:51:17,294 INFO L273 TraceCheckUtils]: 72: Hoare triple {12467#false} assume ~cond == 0; {12467#false} is VALID [2018-11-14 16:51:17,294 INFO L273 TraceCheckUtils]: 73: Hoare triple {12467#false} assume !false; {12467#false} is VALID [2018-11-14 16:51:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 2 proven. 242 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:17,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:17,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:17,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:51:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:17,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:17,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {12466#true} call ULTIMATE.init(); {12466#true} is VALID [2018-11-14 16:51:17,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {12466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12466#true} is VALID [2018-11-14 16:51:17,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {12466#true} assume true; {12466#true} is VALID [2018-11-14 16:51:17,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12466#true} {12466#true} #137#return; {12466#true} is VALID [2018-11-14 16:51:17,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {12466#true} call #t~ret15 := main(); {12466#true} is VALID [2018-11-14 16:51:17,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {12466#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {12499#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:17,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {12499#(<= main_~i~0 0)} assume true; {12499#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:17,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {12499#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {12506#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:17,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {12506#(<= main_~k~0 1)} assume true; {12506#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:17,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {12506#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12506#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:17,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {12506#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12506#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:17,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {12506#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {12519#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:17,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {12519#(<= main_~k~0 2)} assume true; {12519#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:17,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {12519#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12519#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:17,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {12519#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12519#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:17,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {12519#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {12532#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:17,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {12532#(<= main_~k~0 3)} assume true; {12532#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:17,653 INFO L273 TraceCheckUtils]: 17: Hoare triple {12532#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12532#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:17,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {12532#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12532#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:17,654 INFO L273 TraceCheckUtils]: 19: Hoare triple {12532#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {12545#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:17,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {12545#(<= main_~k~0 4)} assume true; {12545#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:17,655 INFO L273 TraceCheckUtils]: 21: Hoare triple {12545#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12545#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:17,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {12545#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12545#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:17,656 INFO L273 TraceCheckUtils]: 23: Hoare triple {12545#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {12558#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:17,656 INFO L273 TraceCheckUtils]: 24: Hoare triple {12558#(<= main_~k~0 5)} assume true; {12558#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:17,657 INFO L273 TraceCheckUtils]: 25: Hoare triple {12558#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12558#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:17,657 INFO L273 TraceCheckUtils]: 26: Hoare triple {12558#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12558#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:17,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {12558#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {12571#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:17,659 INFO L273 TraceCheckUtils]: 28: Hoare triple {12571#(<= main_~k~0 6)} assume true; {12571#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:17,659 INFO L273 TraceCheckUtils]: 29: Hoare triple {12571#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12571#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:17,660 INFO L273 TraceCheckUtils]: 30: Hoare triple {12571#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12571#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:17,660 INFO L273 TraceCheckUtils]: 31: Hoare triple {12571#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {12584#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:17,661 INFO L273 TraceCheckUtils]: 32: Hoare triple {12584#(<= main_~k~0 7)} assume true; {12584#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:17,661 INFO L273 TraceCheckUtils]: 33: Hoare triple {12584#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12584#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:17,662 INFO L273 TraceCheckUtils]: 34: Hoare triple {12584#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12584#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:17,662 INFO L273 TraceCheckUtils]: 35: Hoare triple {12584#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {12597#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:17,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {12597#(<= main_~k~0 8)} assume true; {12597#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:17,663 INFO L273 TraceCheckUtils]: 37: Hoare triple {12597#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12597#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:17,664 INFO L273 TraceCheckUtils]: 38: Hoare triple {12597#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12597#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:17,665 INFO L273 TraceCheckUtils]: 39: Hoare triple {12597#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {12610#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:17,665 INFO L273 TraceCheckUtils]: 40: Hoare triple {12610#(<= main_~k~0 9)} assume true; {12610#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:17,666 INFO L273 TraceCheckUtils]: 41: Hoare triple {12610#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12610#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:17,666 INFO L273 TraceCheckUtils]: 42: Hoare triple {12610#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12610#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:17,667 INFO L273 TraceCheckUtils]: 43: Hoare triple {12610#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {12623#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:17,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {12623#(<= main_~k~0 10)} assume true; {12623#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:17,668 INFO L273 TraceCheckUtils]: 45: Hoare triple {12623#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12623#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:17,668 INFO L273 TraceCheckUtils]: 46: Hoare triple {12623#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12623#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:17,669 INFO L273 TraceCheckUtils]: 47: Hoare triple {12623#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {12636#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:17,670 INFO L273 TraceCheckUtils]: 48: Hoare triple {12636#(<= main_~k~0 11)} assume true; {12636#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:17,670 INFO L273 TraceCheckUtils]: 49: Hoare triple {12636#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {12636#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:17,671 INFO L273 TraceCheckUtils]: 50: Hoare triple {12636#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12636#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:17,671 INFO L273 TraceCheckUtils]: 51: Hoare triple {12636#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {12649#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:17,672 INFO L273 TraceCheckUtils]: 52: Hoare triple {12649#(<= main_~k~0 12)} assume true; {12649#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:17,672 INFO L273 TraceCheckUtils]: 53: Hoare triple {12649#(<= main_~k~0 12)} assume !(~k~0 < 100000); {12467#false} is VALID [2018-11-14 16:51:17,673 INFO L273 TraceCheckUtils]: 54: Hoare triple {12467#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12467#false} is VALID [2018-11-14 16:51:17,673 INFO L273 TraceCheckUtils]: 55: Hoare triple {12467#false} ~x~0 := 0; {12467#false} is VALID [2018-11-14 16:51:17,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {12467#false} assume true; {12467#false} is VALID [2018-11-14 16:51:17,673 INFO L273 TraceCheckUtils]: 57: Hoare triple {12467#false} assume !(~x~0 < ~i~0); {12467#false} is VALID [2018-11-14 16:51:17,674 INFO L273 TraceCheckUtils]: 58: Hoare triple {12467#false} ~x~0 := 0; {12467#false} is VALID [2018-11-14 16:51:17,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {12467#false} assume true; {12467#false} is VALID [2018-11-14 16:51:17,674 INFO L273 TraceCheckUtils]: 60: Hoare triple {12467#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12467#false} is VALID [2018-11-14 16:51:17,674 INFO L256 TraceCheckUtils]: 61: Hoare triple {12467#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12467#false} is VALID [2018-11-14 16:51:17,674 INFO L273 TraceCheckUtils]: 62: Hoare triple {12467#false} ~cond := #in~cond; {12467#false} is VALID [2018-11-14 16:51:17,675 INFO L273 TraceCheckUtils]: 63: Hoare triple {12467#false} assume !(~cond == 0); {12467#false} is VALID [2018-11-14 16:51:17,675 INFO L273 TraceCheckUtils]: 64: Hoare triple {12467#false} assume true; {12467#false} is VALID [2018-11-14 16:51:17,675 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {12467#false} {12467#false} #143#return; {12467#false} is VALID [2018-11-14 16:51:17,675 INFO L273 TraceCheckUtils]: 66: Hoare triple {12467#false} havoc #t~mem9;havoc #t~mem10; {12467#false} is VALID [2018-11-14 16:51:17,675 INFO L273 TraceCheckUtils]: 67: Hoare triple {12467#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {12467#false} is VALID [2018-11-14 16:51:17,676 INFO L273 TraceCheckUtils]: 68: Hoare triple {12467#false} assume true; {12467#false} is VALID [2018-11-14 16:51:17,676 INFO L273 TraceCheckUtils]: 69: Hoare triple {12467#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12467#false} is VALID [2018-11-14 16:51:17,676 INFO L256 TraceCheckUtils]: 70: Hoare triple {12467#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12467#false} is VALID [2018-11-14 16:51:17,676 INFO L273 TraceCheckUtils]: 71: Hoare triple {12467#false} ~cond := #in~cond; {12467#false} is VALID [2018-11-14 16:51:17,676 INFO L273 TraceCheckUtils]: 72: Hoare triple {12467#false} assume ~cond == 0; {12467#false} is VALID [2018-11-14 16:51:17,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {12467#false} assume !false; {12467#false} is VALID [2018-11-14 16:51:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:17,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:17,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-14 16:51:17,700 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-11-14 16:51:17,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:17,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 16:51:17,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:17,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 16:51:17,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 16:51:17,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=468, Unknown=0, NotChecked=0, Total=756 [2018-11-14 16:51:17,816 INFO L87 Difference]: Start difference. First operand 250 states and 329 transitions. Second operand 28 states. [2018-11-14 16:51:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:19,401 INFO L93 Difference]: Finished difference Result 421 states and 564 transitions. [2018-11-14 16:51:19,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:51:19,401 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-11-14 16:51:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:51:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 185 transitions. [2018-11-14 16:51:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:51:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 185 transitions. [2018-11-14 16:51:19,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 185 transitions. [2018-11-14 16:51:19,617 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-14 16:51:19,623 INFO L225 Difference]: With dead ends: 421 [2018-11-14 16:51:19,623 INFO L226 Difference]: Without dead ends: 268 [2018-11-14 16:51:19,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=288, Invalid=468, Unknown=0, NotChecked=0, Total=756 [2018-11-14 16:51:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-14 16:51:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2018-11-14 16:51:19,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:19,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand 258 states. [2018-11-14 16:51:19,995 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand 258 states. [2018-11-14 16:51:19,995 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 258 states. [2018-11-14 16:51:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:20,002 INFO L93 Difference]: Finished difference Result 268 states and 353 transitions. [2018-11-14 16:51:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 353 transitions. [2018-11-14 16:51:20,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:20,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:20,004 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 268 states. [2018-11-14 16:51:20,004 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 268 states. [2018-11-14 16:51:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:20,011 INFO L93 Difference]: Finished difference Result 268 states and 353 transitions. [2018-11-14 16:51:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 353 transitions. [2018-11-14 16:51:20,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:20,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:20,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:20,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-14 16:51:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2018-11-14 16:51:20,020 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 74 [2018-11-14 16:51:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:20,020 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2018-11-14 16:51:20,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 16:51:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2018-11-14 16:51:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 16:51:20,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:20,022 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:20,022 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:20,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:20,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1958394386, now seen corresponding path program 8 times [2018-11-14 16:51:20,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:20,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:20,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:20,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:51:20,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:20,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {14121#true} call ULTIMATE.init(); {14121#true} is VALID [2018-11-14 16:51:20,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {14121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14121#true} is VALID [2018-11-14 16:51:20,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {14121#true} assume true; {14121#true} is VALID [2018-11-14 16:51:20,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14121#true} {14121#true} #137#return; {14121#true} is VALID [2018-11-14 16:51:20,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {14121#true} call #t~ret15 := main(); {14121#true} is VALID [2018-11-14 16:51:20,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {14121#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {14123#(= main_~i~0 0)} is VALID [2018-11-14 16:51:20,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {14123#(= main_~i~0 0)} assume true; {14123#(= main_~i~0 0)} is VALID [2018-11-14 16:51:20,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {14123#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {14124#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {14124#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {14124#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {14124#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14124#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {14124#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14124#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {14124#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14125#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {14125#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {14125#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {14125#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14125#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {14125#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14125#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {14125#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14126#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {14126#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {14126#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {14126#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14126#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,489 INFO L273 TraceCheckUtils]: 18: Hoare triple {14126#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14126#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {14126#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14127#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {14127#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {14127#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,491 INFO L273 TraceCheckUtils]: 21: Hoare triple {14127#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14127#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,492 INFO L273 TraceCheckUtils]: 22: Hoare triple {14127#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14127#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,493 INFO L273 TraceCheckUtils]: 23: Hoare triple {14127#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14128#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {14128#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {14128#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,495 INFO L273 TraceCheckUtils]: 25: Hoare triple {14128#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14128#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,495 INFO L273 TraceCheckUtils]: 26: Hoare triple {14128#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14128#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,496 INFO L273 TraceCheckUtils]: 27: Hoare triple {14128#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14129#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,497 INFO L273 TraceCheckUtils]: 28: Hoare triple {14129#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {14129#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,498 INFO L273 TraceCheckUtils]: 29: Hoare triple {14129#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14129#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {14129#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14129#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {14129#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14130#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {14130#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {14130#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,501 INFO L273 TraceCheckUtils]: 33: Hoare triple {14130#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14130#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,501 INFO L273 TraceCheckUtils]: 34: Hoare triple {14130#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14130#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,502 INFO L273 TraceCheckUtils]: 35: Hoare triple {14130#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14131#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {14131#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {14131#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {14131#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14131#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {14131#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14131#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {14131#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14132#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,506 INFO L273 TraceCheckUtils]: 40: Hoare triple {14132#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {14132#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,507 INFO L273 TraceCheckUtils]: 41: Hoare triple {14132#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14132#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,507 INFO L273 TraceCheckUtils]: 42: Hoare triple {14132#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14132#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,508 INFO L273 TraceCheckUtils]: 43: Hoare triple {14132#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14133#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,509 INFO L273 TraceCheckUtils]: 44: Hoare triple {14133#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {14133#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,510 INFO L273 TraceCheckUtils]: 45: Hoare triple {14133#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14133#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,510 INFO L273 TraceCheckUtils]: 46: Hoare triple {14133#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14133#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,511 INFO L273 TraceCheckUtils]: 47: Hoare triple {14133#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14134#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,512 INFO L273 TraceCheckUtils]: 48: Hoare triple {14134#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {14134#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,513 INFO L273 TraceCheckUtils]: 49: Hoare triple {14134#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14134#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,514 INFO L273 TraceCheckUtils]: 50: Hoare triple {14134#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14134#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,515 INFO L273 TraceCheckUtils]: 51: Hoare triple {14134#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14135#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,515 INFO L273 TraceCheckUtils]: 52: Hoare triple {14135#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {14135#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,516 INFO L273 TraceCheckUtils]: 53: Hoare triple {14135#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14135#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,517 INFO L273 TraceCheckUtils]: 54: Hoare triple {14135#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14135#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,518 INFO L273 TraceCheckUtils]: 55: Hoare triple {14135#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {14136#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,518 INFO L273 TraceCheckUtils]: 56: Hoare triple {14136#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume true; {14136#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:20,519 INFO L273 TraceCheckUtils]: 57: Hoare triple {14136#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !(~k~0 < 100000); {14122#false} is VALID [2018-11-14 16:51:20,519 INFO L273 TraceCheckUtils]: 58: Hoare triple {14122#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14122#false} is VALID [2018-11-14 16:51:20,519 INFO L273 TraceCheckUtils]: 59: Hoare triple {14122#false} ~x~0 := 0; {14122#false} is VALID [2018-11-14 16:51:20,520 INFO L273 TraceCheckUtils]: 60: Hoare triple {14122#false} assume true; {14122#false} is VALID [2018-11-14 16:51:20,520 INFO L273 TraceCheckUtils]: 61: Hoare triple {14122#false} assume !(~x~0 < ~i~0); {14122#false} is VALID [2018-11-14 16:51:20,520 INFO L273 TraceCheckUtils]: 62: Hoare triple {14122#false} ~x~0 := 0; {14122#false} is VALID [2018-11-14 16:51:20,520 INFO L273 TraceCheckUtils]: 63: Hoare triple {14122#false} assume true; {14122#false} is VALID [2018-11-14 16:51:20,520 INFO L273 TraceCheckUtils]: 64: Hoare triple {14122#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14122#false} is VALID [2018-11-14 16:51:20,521 INFO L256 TraceCheckUtils]: 65: Hoare triple {14122#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14121#true} is VALID [2018-11-14 16:51:20,521 INFO L273 TraceCheckUtils]: 66: Hoare triple {14121#true} ~cond := #in~cond; {14121#true} is VALID [2018-11-14 16:51:20,521 INFO L273 TraceCheckUtils]: 67: Hoare triple {14121#true} assume !(~cond == 0); {14121#true} is VALID [2018-11-14 16:51:20,521 INFO L273 TraceCheckUtils]: 68: Hoare triple {14121#true} assume true; {14121#true} is VALID [2018-11-14 16:51:20,521 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {14121#true} {14122#false} #143#return; {14122#false} is VALID [2018-11-14 16:51:20,522 INFO L273 TraceCheckUtils]: 70: Hoare triple {14122#false} havoc #t~mem9;havoc #t~mem10; {14122#false} is VALID [2018-11-14 16:51:20,522 INFO L273 TraceCheckUtils]: 71: Hoare triple {14122#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {14122#false} is VALID [2018-11-14 16:51:20,522 INFO L273 TraceCheckUtils]: 72: Hoare triple {14122#false} assume true; {14122#false} is VALID [2018-11-14 16:51:20,522 INFO L273 TraceCheckUtils]: 73: Hoare triple {14122#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14122#false} is VALID [2018-11-14 16:51:20,522 INFO L256 TraceCheckUtils]: 74: Hoare triple {14122#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14122#false} is VALID [2018-11-14 16:51:20,522 INFO L273 TraceCheckUtils]: 75: Hoare triple {14122#false} ~cond := #in~cond; {14122#false} is VALID [2018-11-14 16:51:20,522 INFO L273 TraceCheckUtils]: 76: Hoare triple {14122#false} assume ~cond == 0; {14122#false} is VALID [2018-11-14 16:51:20,523 INFO L273 TraceCheckUtils]: 77: Hoare triple {14122#false} assume !false; {14122#false} is VALID [2018-11-14 16:51:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 2 proven. 288 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:20,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:20,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:20,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:51:20,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:51:20,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:20,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:20,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {14121#true} call ULTIMATE.init(); {14121#true} is VALID [2018-11-14 16:51:20,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {14121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14121#true} is VALID [2018-11-14 16:51:20,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {14121#true} assume true; {14121#true} is VALID [2018-11-14 16:51:20,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14121#true} {14121#true} #137#return; {14121#true} is VALID [2018-11-14 16:51:20,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {14121#true} call #t~ret15 := main(); {14121#true} is VALID [2018-11-14 16:51:20,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {14121#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {14155#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:20,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {14155#(<= main_~i~0 0)} assume true; {14155#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:20,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {14155#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {14162#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:20,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {14162#(<= main_~k~0 1)} assume true; {14162#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:20,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {14162#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14162#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:20,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {14162#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14162#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:20,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {14162#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {14175#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:20,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {14175#(<= main_~k~0 2)} assume true; {14175#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:20,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {14175#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14175#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:20,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {14175#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14175#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:20,985 INFO L273 TraceCheckUtils]: 15: Hoare triple {14175#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {14188#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:20,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {14188#(<= main_~k~0 3)} assume true; {14188#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:20,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {14188#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14188#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:20,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {14188#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14188#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:20,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {14188#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {14201#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:20,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {14201#(<= main_~k~0 4)} assume true; {14201#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:20,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {14201#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14201#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:20,989 INFO L273 TraceCheckUtils]: 22: Hoare triple {14201#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14201#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:20,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {14201#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {14214#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:20,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {14214#(<= main_~k~0 5)} assume true; {14214#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:20,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {14214#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14214#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:20,991 INFO L273 TraceCheckUtils]: 26: Hoare triple {14214#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14214#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:20,991 INFO L273 TraceCheckUtils]: 27: Hoare triple {14214#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {14227#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:20,992 INFO L273 TraceCheckUtils]: 28: Hoare triple {14227#(<= main_~k~0 6)} assume true; {14227#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:20,992 INFO L273 TraceCheckUtils]: 29: Hoare triple {14227#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14227#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:20,993 INFO L273 TraceCheckUtils]: 30: Hoare triple {14227#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14227#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:20,994 INFO L273 TraceCheckUtils]: 31: Hoare triple {14227#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {14240#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:20,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {14240#(<= main_~k~0 7)} assume true; {14240#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:20,995 INFO L273 TraceCheckUtils]: 33: Hoare triple {14240#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14240#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:20,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {14240#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14240#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:20,996 INFO L273 TraceCheckUtils]: 35: Hoare triple {14240#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {14253#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:20,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {14253#(<= main_~k~0 8)} assume true; {14253#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:20,997 INFO L273 TraceCheckUtils]: 37: Hoare triple {14253#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14253#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:20,997 INFO L273 TraceCheckUtils]: 38: Hoare triple {14253#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14253#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:20,998 INFO L273 TraceCheckUtils]: 39: Hoare triple {14253#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {14266#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:20,999 INFO L273 TraceCheckUtils]: 40: Hoare triple {14266#(<= main_~k~0 9)} assume true; {14266#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:20,999 INFO L273 TraceCheckUtils]: 41: Hoare triple {14266#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14266#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:21,000 INFO L273 TraceCheckUtils]: 42: Hoare triple {14266#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14266#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:21,000 INFO L273 TraceCheckUtils]: 43: Hoare triple {14266#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {14279#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:21,001 INFO L273 TraceCheckUtils]: 44: Hoare triple {14279#(<= main_~k~0 10)} assume true; {14279#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:21,001 INFO L273 TraceCheckUtils]: 45: Hoare triple {14279#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14279#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:21,002 INFO L273 TraceCheckUtils]: 46: Hoare triple {14279#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14279#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:21,003 INFO L273 TraceCheckUtils]: 47: Hoare triple {14279#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {14292#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:21,003 INFO L273 TraceCheckUtils]: 48: Hoare triple {14292#(<= main_~k~0 11)} assume true; {14292#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:21,004 INFO L273 TraceCheckUtils]: 49: Hoare triple {14292#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14292#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:21,004 INFO L273 TraceCheckUtils]: 50: Hoare triple {14292#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14292#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:21,005 INFO L273 TraceCheckUtils]: 51: Hoare triple {14292#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {14305#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:21,005 INFO L273 TraceCheckUtils]: 52: Hoare triple {14305#(<= main_~k~0 12)} assume true; {14305#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:21,006 INFO L273 TraceCheckUtils]: 53: Hoare triple {14305#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {14305#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:21,006 INFO L273 TraceCheckUtils]: 54: Hoare triple {14305#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14305#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:21,007 INFO L273 TraceCheckUtils]: 55: Hoare triple {14305#(<= main_~k~0 12)} ~k~0 := ~k~0 + 1; {14318#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:21,008 INFO L273 TraceCheckUtils]: 56: Hoare triple {14318#(<= main_~k~0 13)} assume true; {14318#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:21,008 INFO L273 TraceCheckUtils]: 57: Hoare triple {14318#(<= main_~k~0 13)} assume !(~k~0 < 100000); {14122#false} is VALID [2018-11-14 16:51:21,008 INFO L273 TraceCheckUtils]: 58: Hoare triple {14122#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14122#false} is VALID [2018-11-14 16:51:21,009 INFO L273 TraceCheckUtils]: 59: Hoare triple {14122#false} ~x~0 := 0; {14122#false} is VALID [2018-11-14 16:51:21,009 INFO L273 TraceCheckUtils]: 60: Hoare triple {14122#false} assume true; {14122#false} is VALID [2018-11-14 16:51:21,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {14122#false} assume !(~x~0 < ~i~0); {14122#false} is VALID [2018-11-14 16:51:21,009 INFO L273 TraceCheckUtils]: 62: Hoare triple {14122#false} ~x~0 := 0; {14122#false} is VALID [2018-11-14 16:51:21,009 INFO L273 TraceCheckUtils]: 63: Hoare triple {14122#false} assume true; {14122#false} is VALID [2018-11-14 16:51:21,010 INFO L273 TraceCheckUtils]: 64: Hoare triple {14122#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14122#false} is VALID [2018-11-14 16:51:21,010 INFO L256 TraceCheckUtils]: 65: Hoare triple {14122#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14122#false} is VALID [2018-11-14 16:51:21,010 INFO L273 TraceCheckUtils]: 66: Hoare triple {14122#false} ~cond := #in~cond; {14122#false} is VALID [2018-11-14 16:51:21,010 INFO L273 TraceCheckUtils]: 67: Hoare triple {14122#false} assume !(~cond == 0); {14122#false} is VALID [2018-11-14 16:51:21,010 INFO L273 TraceCheckUtils]: 68: Hoare triple {14122#false} assume true; {14122#false} is VALID [2018-11-14 16:51:21,011 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {14122#false} {14122#false} #143#return; {14122#false} is VALID [2018-11-14 16:51:21,011 INFO L273 TraceCheckUtils]: 70: Hoare triple {14122#false} havoc #t~mem9;havoc #t~mem10; {14122#false} is VALID [2018-11-14 16:51:21,011 INFO L273 TraceCheckUtils]: 71: Hoare triple {14122#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {14122#false} is VALID [2018-11-14 16:51:21,011 INFO L273 TraceCheckUtils]: 72: Hoare triple {14122#false} assume true; {14122#false} is VALID [2018-11-14 16:51:21,011 INFO L273 TraceCheckUtils]: 73: Hoare triple {14122#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14122#false} is VALID [2018-11-14 16:51:21,011 INFO L256 TraceCheckUtils]: 74: Hoare triple {14122#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14122#false} is VALID [2018-11-14 16:51:21,011 INFO L273 TraceCheckUtils]: 75: Hoare triple {14122#false} ~cond := #in~cond; {14122#false} is VALID [2018-11-14 16:51:21,011 INFO L273 TraceCheckUtils]: 76: Hoare triple {14122#false} assume ~cond == 0; {14122#false} is VALID [2018-11-14 16:51:21,012 INFO L273 TraceCheckUtils]: 77: Hoare triple {14122#false} assume !false; {14122#false} is VALID [2018-11-14 16:51:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:21,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:21,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-14 16:51:21,037 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 78 [2018-11-14 16:51:21,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:21,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 16:51:21,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:21,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 16:51:21,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 16:51:21,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=539, Unknown=0, NotChecked=0, Total=870 [2018-11-14 16:51:21,156 INFO L87 Difference]: Start difference. First operand 258 states and 339 transitions. Second operand 30 states. [2018-11-14 16:51:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:22,188 INFO L93 Difference]: Finished difference Result 429 states and 574 transitions. [2018-11-14 16:51:22,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:51:22,188 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 78 [2018-11-14 16:51:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:51:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 190 transitions. [2018-11-14 16:51:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:51:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 190 transitions. [2018-11-14 16:51:22,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 190 transitions. [2018-11-14 16:51:22,443 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-14 16:51:22,450 INFO L225 Difference]: With dead ends: 429 [2018-11-14 16:51:22,450 INFO L226 Difference]: Without dead ends: 276 [2018-11-14 16:51:22,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=331, Invalid=539, Unknown=0, NotChecked=0, Total=870 [2018-11-14 16:51:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-14 16:51:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 266. [2018-11-14 16:51:22,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:22,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 276 states. Second operand 266 states. [2018-11-14 16:51:22,703 INFO L74 IsIncluded]: Start isIncluded. First operand 276 states. Second operand 266 states. [2018-11-14 16:51:22,703 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 266 states. [2018-11-14 16:51:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:22,710 INFO L93 Difference]: Finished difference Result 276 states and 363 transitions. [2018-11-14 16:51:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 363 transitions. [2018-11-14 16:51:22,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:22,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:22,711 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand 276 states. [2018-11-14 16:51:22,712 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 276 states. [2018-11-14 16:51:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:22,718 INFO L93 Difference]: Finished difference Result 276 states and 363 transitions. [2018-11-14 16:51:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 363 transitions. [2018-11-14 16:51:22,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:22,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:22,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:22,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-14 16:51:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2018-11-14 16:51:22,726 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 349 transitions. Word has length 78 [2018-11-14 16:51:22,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:22,726 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 349 transitions. [2018-11-14 16:51:22,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 16:51:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 349 transitions. [2018-11-14 16:51:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-14 16:51:22,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:22,728 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:22,728 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:22,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1447940568, now seen corresponding path program 9 times [2018-11-14 16:51:22,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:22,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:22,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:22,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:22,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:23,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {15826#true} call ULTIMATE.init(); {15826#true} is VALID [2018-11-14 16:51:23,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {15826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15826#true} is VALID [2018-11-14 16:51:23,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {15826#true} assume true; {15826#true} is VALID [2018-11-14 16:51:23,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15826#true} {15826#true} #137#return; {15826#true} is VALID [2018-11-14 16:51:23,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {15826#true} call #t~ret15 := main(); {15826#true} is VALID [2018-11-14 16:51:23,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {15826#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {15828#(= main_~i~0 0)} is VALID [2018-11-14 16:51:23,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {15828#(= main_~i~0 0)} assume true; {15828#(= main_~i~0 0)} is VALID [2018-11-14 16:51:23,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {15828#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {15829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {15829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {15829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {15829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {15829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {15829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {15830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {15830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {15830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {15830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {15830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {15831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {15831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {15831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {15831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,769 INFO L273 TraceCheckUtils]: 19: Hoare triple {15831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,770 INFO L273 TraceCheckUtils]: 20: Hoare triple {15832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {15832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,770 INFO L273 TraceCheckUtils]: 21: Hoare triple {15832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {15832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {15832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {15833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {15833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {15833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,774 INFO L273 TraceCheckUtils]: 26: Hoare triple {15833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {15833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,776 INFO L273 TraceCheckUtils]: 28: Hoare triple {15834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {15834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {15834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {15834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,778 INFO L273 TraceCheckUtils]: 31: Hoare triple {15834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {15835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {15835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {15835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,780 INFO L273 TraceCheckUtils]: 34: Hoare triple {15835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,781 INFO L273 TraceCheckUtils]: 35: Hoare triple {15835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,781 INFO L273 TraceCheckUtils]: 36: Hoare triple {15836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {15836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {15836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,814 INFO L273 TraceCheckUtils]: 38: Hoare triple {15836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {15836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,836 INFO L273 TraceCheckUtils]: 40: Hoare triple {15837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {15837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,836 INFO L273 TraceCheckUtils]: 41: Hoare triple {15837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,837 INFO L273 TraceCheckUtils]: 42: Hoare triple {15837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,837 INFO L273 TraceCheckUtils]: 43: Hoare triple {15837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,838 INFO L273 TraceCheckUtils]: 44: Hoare triple {15838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {15838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,838 INFO L273 TraceCheckUtils]: 45: Hoare triple {15838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,839 INFO L273 TraceCheckUtils]: 46: Hoare triple {15838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,839 INFO L273 TraceCheckUtils]: 47: Hoare triple {15838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,840 INFO L273 TraceCheckUtils]: 48: Hoare triple {15839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {15839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,841 INFO L273 TraceCheckUtils]: 49: Hoare triple {15839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,841 INFO L273 TraceCheckUtils]: 50: Hoare triple {15839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,842 INFO L273 TraceCheckUtils]: 51: Hoare triple {15839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,843 INFO L273 TraceCheckUtils]: 52: Hoare triple {15840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {15840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,844 INFO L273 TraceCheckUtils]: 53: Hoare triple {15840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,844 INFO L273 TraceCheckUtils]: 54: Hoare triple {15840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,845 INFO L273 TraceCheckUtils]: 55: Hoare triple {15840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,846 INFO L273 TraceCheckUtils]: 56: Hoare triple {15841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume true; {15841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,847 INFO L273 TraceCheckUtils]: 57: Hoare triple {15841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,847 INFO L273 TraceCheckUtils]: 58: Hoare triple {15841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {15841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {15842#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,849 INFO L273 TraceCheckUtils]: 60: Hoare triple {15842#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume true; {15842#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:23,849 INFO L273 TraceCheckUtils]: 61: Hoare triple {15842#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !(~k~0 < 100000); {15827#false} is VALID [2018-11-14 16:51:23,850 INFO L273 TraceCheckUtils]: 62: Hoare triple {15827#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15827#false} is VALID [2018-11-14 16:51:23,850 INFO L273 TraceCheckUtils]: 63: Hoare triple {15827#false} ~x~0 := 0; {15827#false} is VALID [2018-11-14 16:51:23,850 INFO L273 TraceCheckUtils]: 64: Hoare triple {15827#false} assume true; {15827#false} is VALID [2018-11-14 16:51:23,850 INFO L273 TraceCheckUtils]: 65: Hoare triple {15827#false} assume !(~x~0 < ~i~0); {15827#false} is VALID [2018-11-14 16:51:23,850 INFO L273 TraceCheckUtils]: 66: Hoare triple {15827#false} ~x~0 := 0; {15827#false} is VALID [2018-11-14 16:51:23,851 INFO L273 TraceCheckUtils]: 67: Hoare triple {15827#false} assume true; {15827#false} is VALID [2018-11-14 16:51:23,851 INFO L273 TraceCheckUtils]: 68: Hoare triple {15827#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15827#false} is VALID [2018-11-14 16:51:23,851 INFO L256 TraceCheckUtils]: 69: Hoare triple {15827#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15826#true} is VALID [2018-11-14 16:51:23,851 INFO L273 TraceCheckUtils]: 70: Hoare triple {15826#true} ~cond := #in~cond; {15826#true} is VALID [2018-11-14 16:51:23,852 INFO L273 TraceCheckUtils]: 71: Hoare triple {15826#true} assume !(~cond == 0); {15826#true} is VALID [2018-11-14 16:51:23,852 INFO L273 TraceCheckUtils]: 72: Hoare triple {15826#true} assume true; {15826#true} is VALID [2018-11-14 16:51:23,852 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {15826#true} {15827#false} #143#return; {15827#false} is VALID [2018-11-14 16:51:23,852 INFO L273 TraceCheckUtils]: 74: Hoare triple {15827#false} havoc #t~mem9;havoc #t~mem10; {15827#false} is VALID [2018-11-14 16:51:23,852 INFO L273 TraceCheckUtils]: 75: Hoare triple {15827#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {15827#false} is VALID [2018-11-14 16:51:23,853 INFO L273 TraceCheckUtils]: 76: Hoare triple {15827#false} assume true; {15827#false} is VALID [2018-11-14 16:51:23,853 INFO L273 TraceCheckUtils]: 77: Hoare triple {15827#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15827#false} is VALID [2018-11-14 16:51:23,853 INFO L256 TraceCheckUtils]: 78: Hoare triple {15827#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15827#false} is VALID [2018-11-14 16:51:23,853 INFO L273 TraceCheckUtils]: 79: Hoare triple {15827#false} ~cond := #in~cond; {15827#false} is VALID [2018-11-14 16:51:23,853 INFO L273 TraceCheckUtils]: 80: Hoare triple {15827#false} assume ~cond == 0; {15827#false} is VALID [2018-11-14 16:51:23,853 INFO L273 TraceCheckUtils]: 81: Hoare triple {15827#false} assume !false; {15827#false} is VALID [2018-11-14 16:51:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 2 proven. 338 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:23,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:23,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:23,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:51:23,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-14 16:51:23,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:23,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:24,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {15826#true} call ULTIMATE.init(); {15826#true} is VALID [2018-11-14 16:51:24,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {15826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15826#true} is VALID [2018-11-14 16:51:24,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {15826#true} assume true; {15826#true} is VALID [2018-11-14 16:51:24,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15826#true} {15826#true} #137#return; {15826#true} is VALID [2018-11-14 16:51:24,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {15826#true} call #t~ret15 := main(); {15826#true} is VALID [2018-11-14 16:51:24,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {15826#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {15861#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:24,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {15861#(<= main_~i~0 0)} assume true; {15861#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:24,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {15861#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {15868#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:24,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {15868#(<= main_~k~0 1)} assume true; {15868#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:24,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {15868#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15868#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:24,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {15868#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15868#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:24,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {15868#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {15881#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:24,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {15881#(<= main_~k~0 2)} assume true; {15881#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:24,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {15881#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15881#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:24,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {15881#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15881#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:24,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {15881#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {15894#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:24,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {15894#(<= main_~k~0 3)} assume true; {15894#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:24,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {15894#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15894#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:24,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {15894#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15894#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:24,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {15894#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {15907#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:24,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {15907#(<= main_~k~0 4)} assume true; {15907#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:24,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {15907#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15907#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:24,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {15907#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15907#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:24,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {15907#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {15920#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:24,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {15920#(<= main_~k~0 5)} assume true; {15920#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:24,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {15920#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15920#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:24,267 INFO L273 TraceCheckUtils]: 26: Hoare triple {15920#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15920#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:24,267 INFO L273 TraceCheckUtils]: 27: Hoare triple {15920#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {15933#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:24,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {15933#(<= main_~k~0 6)} assume true; {15933#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:24,268 INFO L273 TraceCheckUtils]: 29: Hoare triple {15933#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15933#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:24,269 INFO L273 TraceCheckUtils]: 30: Hoare triple {15933#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15933#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:24,270 INFO L273 TraceCheckUtils]: 31: Hoare triple {15933#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {15946#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:24,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {15946#(<= main_~k~0 7)} assume true; {15946#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:24,271 INFO L273 TraceCheckUtils]: 33: Hoare triple {15946#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15946#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:24,271 INFO L273 TraceCheckUtils]: 34: Hoare triple {15946#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15946#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:24,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {15946#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {15959#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:24,272 INFO L273 TraceCheckUtils]: 36: Hoare triple {15959#(<= main_~k~0 8)} assume true; {15959#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:24,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {15959#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15959#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:24,273 INFO L273 TraceCheckUtils]: 38: Hoare triple {15959#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15959#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:24,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {15959#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {15972#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:24,274 INFO L273 TraceCheckUtils]: 40: Hoare triple {15972#(<= main_~k~0 9)} assume true; {15972#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:24,275 INFO L273 TraceCheckUtils]: 41: Hoare triple {15972#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15972#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:24,275 INFO L273 TraceCheckUtils]: 42: Hoare triple {15972#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15972#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:24,276 INFO L273 TraceCheckUtils]: 43: Hoare triple {15972#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {15985#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:24,277 INFO L273 TraceCheckUtils]: 44: Hoare triple {15985#(<= main_~k~0 10)} assume true; {15985#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:24,277 INFO L273 TraceCheckUtils]: 45: Hoare triple {15985#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15985#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:24,278 INFO L273 TraceCheckUtils]: 46: Hoare triple {15985#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15985#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:24,278 INFO L273 TraceCheckUtils]: 47: Hoare triple {15985#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {15998#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:24,279 INFO L273 TraceCheckUtils]: 48: Hoare triple {15998#(<= main_~k~0 11)} assume true; {15998#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:24,279 INFO L273 TraceCheckUtils]: 49: Hoare triple {15998#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {15998#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:24,280 INFO L273 TraceCheckUtils]: 50: Hoare triple {15998#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15998#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:24,280 INFO L273 TraceCheckUtils]: 51: Hoare triple {15998#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {16011#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:24,281 INFO L273 TraceCheckUtils]: 52: Hoare triple {16011#(<= main_~k~0 12)} assume true; {16011#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:24,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {16011#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {16011#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:24,282 INFO L273 TraceCheckUtils]: 54: Hoare triple {16011#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16011#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:24,283 INFO L273 TraceCheckUtils]: 55: Hoare triple {16011#(<= main_~k~0 12)} ~k~0 := ~k~0 + 1; {16024#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:24,283 INFO L273 TraceCheckUtils]: 56: Hoare triple {16024#(<= main_~k~0 13)} assume true; {16024#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:24,284 INFO L273 TraceCheckUtils]: 57: Hoare triple {16024#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {16024#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:24,284 INFO L273 TraceCheckUtils]: 58: Hoare triple {16024#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16024#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:24,285 INFO L273 TraceCheckUtils]: 59: Hoare triple {16024#(<= main_~k~0 13)} ~k~0 := ~k~0 + 1; {16037#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:24,285 INFO L273 TraceCheckUtils]: 60: Hoare triple {16037#(<= main_~k~0 14)} assume true; {16037#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:24,286 INFO L273 TraceCheckUtils]: 61: Hoare triple {16037#(<= main_~k~0 14)} assume !(~k~0 < 100000); {15827#false} is VALID [2018-11-14 16:51:24,286 INFO L273 TraceCheckUtils]: 62: Hoare triple {15827#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15827#false} is VALID [2018-11-14 16:51:24,286 INFO L273 TraceCheckUtils]: 63: Hoare triple {15827#false} ~x~0 := 0; {15827#false} is VALID [2018-11-14 16:51:24,286 INFO L273 TraceCheckUtils]: 64: Hoare triple {15827#false} assume true; {15827#false} is VALID [2018-11-14 16:51:24,287 INFO L273 TraceCheckUtils]: 65: Hoare triple {15827#false} assume !(~x~0 < ~i~0); {15827#false} is VALID [2018-11-14 16:51:24,287 INFO L273 TraceCheckUtils]: 66: Hoare triple {15827#false} ~x~0 := 0; {15827#false} is VALID [2018-11-14 16:51:24,287 INFO L273 TraceCheckUtils]: 67: Hoare triple {15827#false} assume true; {15827#false} is VALID [2018-11-14 16:51:24,287 INFO L273 TraceCheckUtils]: 68: Hoare triple {15827#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15827#false} is VALID [2018-11-14 16:51:24,287 INFO L256 TraceCheckUtils]: 69: Hoare triple {15827#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15827#false} is VALID [2018-11-14 16:51:24,288 INFO L273 TraceCheckUtils]: 70: Hoare triple {15827#false} ~cond := #in~cond; {15827#false} is VALID [2018-11-14 16:51:24,288 INFO L273 TraceCheckUtils]: 71: Hoare triple {15827#false} assume !(~cond == 0); {15827#false} is VALID [2018-11-14 16:51:24,288 INFO L273 TraceCheckUtils]: 72: Hoare triple {15827#false} assume true; {15827#false} is VALID [2018-11-14 16:51:24,288 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {15827#false} {15827#false} #143#return; {15827#false} is VALID [2018-11-14 16:51:24,288 INFO L273 TraceCheckUtils]: 74: Hoare triple {15827#false} havoc #t~mem9;havoc #t~mem10; {15827#false} is VALID [2018-11-14 16:51:24,289 INFO L273 TraceCheckUtils]: 75: Hoare triple {15827#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {15827#false} is VALID [2018-11-14 16:51:24,289 INFO L273 TraceCheckUtils]: 76: Hoare triple {15827#false} assume true; {15827#false} is VALID [2018-11-14 16:51:24,289 INFO L273 TraceCheckUtils]: 77: Hoare triple {15827#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15827#false} is VALID [2018-11-14 16:51:24,289 INFO L256 TraceCheckUtils]: 78: Hoare triple {15827#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15827#false} is VALID [2018-11-14 16:51:24,289 INFO L273 TraceCheckUtils]: 79: Hoare triple {15827#false} ~cond := #in~cond; {15827#false} is VALID [2018-11-14 16:51:24,289 INFO L273 TraceCheckUtils]: 80: Hoare triple {15827#false} assume ~cond == 0; {15827#false} is VALID [2018-11-14 16:51:24,290 INFO L273 TraceCheckUtils]: 81: Hoare triple {15827#false} assume !false; {15827#false} is VALID [2018-11-14 16:51:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:24,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:24,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-11-14 16:51:24,316 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 82 [2018-11-14 16:51:24,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:24,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 16:51:24,452 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-14 16:51:24,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 16:51:24,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 16:51:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=615, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:51:24,454 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. Second operand 32 states. [2018-11-14 16:51:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:25,645 INFO L93 Difference]: Finished difference Result 437 states and 584 transitions. [2018-11-14 16:51:25,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:51:25,645 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 82 [2018-11-14 16:51:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:51:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 195 transitions. [2018-11-14 16:51:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:51:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 195 transitions. [2018-11-14 16:51:25,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 195 transitions. [2018-11-14 16:51:25,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:25,890 INFO L225 Difference]: With dead ends: 437 [2018-11-14 16:51:25,891 INFO L226 Difference]: Without dead ends: 284 [2018-11-14 16:51:25,891 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=377, Invalid=615, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:51:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-14 16:51:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2018-11-14 16:51:26,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:26,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand 274 states. [2018-11-14 16:51:26,684 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand 274 states. [2018-11-14 16:51:26,684 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 274 states. [2018-11-14 16:51:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:26,691 INFO L93 Difference]: Finished difference Result 284 states and 373 transitions. [2018-11-14 16:51:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 373 transitions. [2018-11-14 16:51:26,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:26,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:26,692 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 284 states. [2018-11-14 16:51:26,692 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 284 states. [2018-11-14 16:51:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:26,699 INFO L93 Difference]: Finished difference Result 284 states and 373 transitions. [2018-11-14 16:51:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 373 transitions. [2018-11-14 16:51:26,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:26,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:26,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:26,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-14 16:51:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 359 transitions. [2018-11-14 16:51:26,707 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 359 transitions. Word has length 82 [2018-11-14 16:51:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:26,707 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 359 transitions. [2018-11-14 16:51:26,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 16:51:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 359 transitions. [2018-11-14 16:51:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-14 16:51:26,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:26,708 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:26,709 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:26,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:26,709 INFO L82 PathProgramCache]: Analyzing trace with hash 284842178, now seen corresponding path program 10 times [2018-11-14 16:51:26,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:26,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:26,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:26,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:26,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:27,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {17581#true} call ULTIMATE.init(); {17581#true} is VALID [2018-11-14 16:51:27,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {17581#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17581#true} is VALID [2018-11-14 16:51:27,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {17581#true} assume true; {17581#true} is VALID [2018-11-14 16:51:27,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17581#true} {17581#true} #137#return; {17581#true} is VALID [2018-11-14 16:51:27,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {17581#true} call #t~ret15 := main(); {17581#true} is VALID [2018-11-14 16:51:27,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {17581#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {17583#(= main_~i~0 0)} is VALID [2018-11-14 16:51:27,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {17583#(= main_~i~0 0)} assume true; {17583#(= main_~i~0 0)} is VALID [2018-11-14 16:51:27,400 INFO L273 TraceCheckUtils]: 7: Hoare triple {17583#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {17584#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {17584#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {17584#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {17584#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17584#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,402 INFO L273 TraceCheckUtils]: 10: Hoare triple {17584#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17584#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,403 INFO L273 TraceCheckUtils]: 11: Hoare triple {17584#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17585#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {17585#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {17585#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {17585#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17585#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {17585#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17585#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {17585#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17586#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {17586#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {17586#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {17586#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17586#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {17586#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17586#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {17586#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17587#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {17587#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {17587#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {17587#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17587#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,411 INFO L273 TraceCheckUtils]: 22: Hoare triple {17587#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17587#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,412 INFO L273 TraceCheckUtils]: 23: Hoare triple {17587#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17588#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {17588#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {17588#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {17588#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17588#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {17588#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17588#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {17588#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17589#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {17589#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {17589#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {17589#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17589#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {17589#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17589#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {17589#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17590#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,419 INFO L273 TraceCheckUtils]: 32: Hoare triple {17590#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {17590#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,420 INFO L273 TraceCheckUtils]: 33: Hoare triple {17590#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17590#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {17590#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17590#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {17590#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17591#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,422 INFO L273 TraceCheckUtils]: 36: Hoare triple {17591#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {17591#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,423 INFO L273 TraceCheckUtils]: 37: Hoare triple {17591#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17591#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,423 INFO L273 TraceCheckUtils]: 38: Hoare triple {17591#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17591#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,424 INFO L273 TraceCheckUtils]: 39: Hoare triple {17591#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17592#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,425 INFO L273 TraceCheckUtils]: 40: Hoare triple {17592#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {17592#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,426 INFO L273 TraceCheckUtils]: 41: Hoare triple {17592#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17592#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,426 INFO L273 TraceCheckUtils]: 42: Hoare triple {17592#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17592#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,427 INFO L273 TraceCheckUtils]: 43: Hoare triple {17592#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17593#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,428 INFO L273 TraceCheckUtils]: 44: Hoare triple {17593#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {17593#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,429 INFO L273 TraceCheckUtils]: 45: Hoare triple {17593#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17593#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,429 INFO L273 TraceCheckUtils]: 46: Hoare triple {17593#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17593#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,430 INFO L273 TraceCheckUtils]: 47: Hoare triple {17593#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17594#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,431 INFO L273 TraceCheckUtils]: 48: Hoare triple {17594#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {17594#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,432 INFO L273 TraceCheckUtils]: 49: Hoare triple {17594#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17594#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,432 INFO L273 TraceCheckUtils]: 50: Hoare triple {17594#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17594#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,433 INFO L273 TraceCheckUtils]: 51: Hoare triple {17594#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17595#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,434 INFO L273 TraceCheckUtils]: 52: Hoare triple {17595#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {17595#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,435 INFO L273 TraceCheckUtils]: 53: Hoare triple {17595#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17595#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,435 INFO L273 TraceCheckUtils]: 54: Hoare triple {17595#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17595#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,436 INFO L273 TraceCheckUtils]: 55: Hoare triple {17595#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17596#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,437 INFO L273 TraceCheckUtils]: 56: Hoare triple {17596#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume true; {17596#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,438 INFO L273 TraceCheckUtils]: 57: Hoare triple {17596#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17596#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,438 INFO L273 TraceCheckUtils]: 58: Hoare triple {17596#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17596#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,439 INFO L273 TraceCheckUtils]: 59: Hoare triple {17596#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17597#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,440 INFO L273 TraceCheckUtils]: 60: Hoare triple {17597#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume true; {17597#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,441 INFO L273 TraceCheckUtils]: 61: Hoare triple {17597#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17597#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,441 INFO L273 TraceCheckUtils]: 62: Hoare triple {17597#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17597#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,442 INFO L273 TraceCheckUtils]: 63: Hoare triple {17597#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {17598#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,443 INFO L273 TraceCheckUtils]: 64: Hoare triple {17598#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume true; {17598#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:27,443 INFO L273 TraceCheckUtils]: 65: Hoare triple {17598#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume !(~k~0 < 100000); {17582#false} is VALID [2018-11-14 16:51:27,444 INFO L273 TraceCheckUtils]: 66: Hoare triple {17582#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {17582#false} is VALID [2018-11-14 16:51:27,444 INFO L273 TraceCheckUtils]: 67: Hoare triple {17582#false} ~x~0 := 0; {17582#false} is VALID [2018-11-14 16:51:27,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {17582#false} assume true; {17582#false} is VALID [2018-11-14 16:51:27,444 INFO L273 TraceCheckUtils]: 69: Hoare triple {17582#false} assume !(~x~0 < ~i~0); {17582#false} is VALID [2018-11-14 16:51:27,444 INFO L273 TraceCheckUtils]: 70: Hoare triple {17582#false} ~x~0 := 0; {17582#false} is VALID [2018-11-14 16:51:27,444 INFO L273 TraceCheckUtils]: 71: Hoare triple {17582#false} assume true; {17582#false} is VALID [2018-11-14 16:51:27,445 INFO L273 TraceCheckUtils]: 72: Hoare triple {17582#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {17582#false} is VALID [2018-11-14 16:51:27,445 INFO L256 TraceCheckUtils]: 73: Hoare triple {17582#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17581#true} is VALID [2018-11-14 16:51:27,445 INFO L273 TraceCheckUtils]: 74: Hoare triple {17581#true} ~cond := #in~cond; {17581#true} is VALID [2018-11-14 16:51:27,445 INFO L273 TraceCheckUtils]: 75: Hoare triple {17581#true} assume !(~cond == 0); {17581#true} is VALID [2018-11-14 16:51:27,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {17581#true} assume true; {17581#true} is VALID [2018-11-14 16:51:27,446 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {17581#true} {17582#false} #143#return; {17582#false} is VALID [2018-11-14 16:51:27,446 INFO L273 TraceCheckUtils]: 78: Hoare triple {17582#false} havoc #t~mem9;havoc #t~mem10; {17582#false} is VALID [2018-11-14 16:51:27,446 INFO L273 TraceCheckUtils]: 79: Hoare triple {17582#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {17582#false} is VALID [2018-11-14 16:51:27,446 INFO L273 TraceCheckUtils]: 80: Hoare triple {17582#false} assume true; {17582#false} is VALID [2018-11-14 16:51:27,446 INFO L273 TraceCheckUtils]: 81: Hoare triple {17582#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {17582#false} is VALID [2018-11-14 16:51:27,447 INFO L256 TraceCheckUtils]: 82: Hoare triple {17582#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17582#false} is VALID [2018-11-14 16:51:27,447 INFO L273 TraceCheckUtils]: 83: Hoare triple {17582#false} ~cond := #in~cond; {17582#false} is VALID [2018-11-14 16:51:27,447 INFO L273 TraceCheckUtils]: 84: Hoare triple {17582#false} assume ~cond == 0; {17582#false} is VALID [2018-11-14 16:51:27,447 INFO L273 TraceCheckUtils]: 85: Hoare triple {17582#false} assume !false; {17582#false} is VALID [2018-11-14 16:51:27,458 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 2 proven. 392 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:27,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:27,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:27,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:51:27,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:51:27,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:27,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:27,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {17581#true} call ULTIMATE.init(); {17581#true} is VALID [2018-11-14 16:51:27,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {17581#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17581#true} is VALID [2018-11-14 16:51:27,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {17581#true} assume true; {17581#true} is VALID [2018-11-14 16:51:27,915 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17581#true} {17581#true} #137#return; {17581#true} is VALID [2018-11-14 16:51:27,915 INFO L256 TraceCheckUtils]: 4: Hoare triple {17581#true} call #t~ret15 := main(); {17581#true} is VALID [2018-11-14 16:51:27,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {17581#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {17617#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:27,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {17617#(<= main_~i~0 0)} assume true; {17617#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:27,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {17617#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {17624#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:27,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {17624#(<= main_~k~0 1)} assume true; {17624#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:27,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {17624#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17624#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:27,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {17624#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17624#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:27,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {17624#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {17637#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:27,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {17637#(<= main_~k~0 2)} assume true; {17637#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:27,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {17637#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17637#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:27,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {17637#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17637#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:27,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {17637#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {17650#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:27,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {17650#(<= main_~k~0 3)} assume true; {17650#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:27,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {17650#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17650#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:27,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {17650#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17650#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:27,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {17650#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {17663#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:27,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {17663#(<= main_~k~0 4)} assume true; {17663#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:27,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {17663#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17663#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:27,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {17663#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17663#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:27,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {17663#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {17676#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:27,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {17676#(<= main_~k~0 5)} assume true; {17676#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:27,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {17676#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17676#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:27,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {17676#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17676#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:27,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {17676#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {17689#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:27,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {17689#(<= main_~k~0 6)} assume true; {17689#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:27,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {17689#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17689#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:27,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {17689#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17689#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:27,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {17689#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {17702#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:27,930 INFO L273 TraceCheckUtils]: 32: Hoare triple {17702#(<= main_~k~0 7)} assume true; {17702#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:27,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {17702#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17702#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:27,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {17702#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17702#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:27,931 INFO L273 TraceCheckUtils]: 35: Hoare triple {17702#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {17715#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:27,932 INFO L273 TraceCheckUtils]: 36: Hoare triple {17715#(<= main_~k~0 8)} assume true; {17715#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:27,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {17715#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17715#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:27,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {17715#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17715#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:27,934 INFO L273 TraceCheckUtils]: 39: Hoare triple {17715#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {17728#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:27,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {17728#(<= main_~k~0 9)} assume true; {17728#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:27,934 INFO L273 TraceCheckUtils]: 41: Hoare triple {17728#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17728#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:27,935 INFO L273 TraceCheckUtils]: 42: Hoare triple {17728#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17728#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:27,936 INFO L273 TraceCheckUtils]: 43: Hoare triple {17728#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {17741#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:27,936 INFO L273 TraceCheckUtils]: 44: Hoare triple {17741#(<= main_~k~0 10)} assume true; {17741#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:27,937 INFO L273 TraceCheckUtils]: 45: Hoare triple {17741#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17741#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:27,937 INFO L273 TraceCheckUtils]: 46: Hoare triple {17741#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17741#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:27,938 INFO L273 TraceCheckUtils]: 47: Hoare triple {17741#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {17754#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:27,938 INFO L273 TraceCheckUtils]: 48: Hoare triple {17754#(<= main_~k~0 11)} assume true; {17754#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:27,939 INFO L273 TraceCheckUtils]: 49: Hoare triple {17754#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17754#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:27,939 INFO L273 TraceCheckUtils]: 50: Hoare triple {17754#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17754#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:27,940 INFO L273 TraceCheckUtils]: 51: Hoare triple {17754#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {17767#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:27,941 INFO L273 TraceCheckUtils]: 52: Hoare triple {17767#(<= main_~k~0 12)} assume true; {17767#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:27,941 INFO L273 TraceCheckUtils]: 53: Hoare triple {17767#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17767#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:27,942 INFO L273 TraceCheckUtils]: 54: Hoare triple {17767#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17767#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:27,942 INFO L273 TraceCheckUtils]: 55: Hoare triple {17767#(<= main_~k~0 12)} ~k~0 := ~k~0 + 1; {17780#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:27,943 INFO L273 TraceCheckUtils]: 56: Hoare triple {17780#(<= main_~k~0 13)} assume true; {17780#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:27,943 INFO L273 TraceCheckUtils]: 57: Hoare triple {17780#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17780#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:27,944 INFO L273 TraceCheckUtils]: 58: Hoare triple {17780#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17780#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:27,945 INFO L273 TraceCheckUtils]: 59: Hoare triple {17780#(<= main_~k~0 13)} ~k~0 := ~k~0 + 1; {17793#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:27,945 INFO L273 TraceCheckUtils]: 60: Hoare triple {17793#(<= main_~k~0 14)} assume true; {17793#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:27,946 INFO L273 TraceCheckUtils]: 61: Hoare triple {17793#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {17793#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:27,946 INFO L273 TraceCheckUtils]: 62: Hoare triple {17793#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17793#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:27,947 INFO L273 TraceCheckUtils]: 63: Hoare triple {17793#(<= main_~k~0 14)} ~k~0 := ~k~0 + 1; {17806#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:27,947 INFO L273 TraceCheckUtils]: 64: Hoare triple {17806#(<= main_~k~0 15)} assume true; {17806#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:27,948 INFO L273 TraceCheckUtils]: 65: Hoare triple {17806#(<= main_~k~0 15)} assume !(~k~0 < 100000); {17582#false} is VALID [2018-11-14 16:51:27,948 INFO L273 TraceCheckUtils]: 66: Hoare triple {17582#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {17582#false} is VALID [2018-11-14 16:51:27,948 INFO L273 TraceCheckUtils]: 67: Hoare triple {17582#false} ~x~0 := 0; {17582#false} is VALID [2018-11-14 16:51:27,949 INFO L273 TraceCheckUtils]: 68: Hoare triple {17582#false} assume true; {17582#false} is VALID [2018-11-14 16:51:27,949 INFO L273 TraceCheckUtils]: 69: Hoare triple {17582#false} assume !(~x~0 < ~i~0); {17582#false} is VALID [2018-11-14 16:51:27,949 INFO L273 TraceCheckUtils]: 70: Hoare triple {17582#false} ~x~0 := 0; {17582#false} is VALID [2018-11-14 16:51:27,949 INFO L273 TraceCheckUtils]: 71: Hoare triple {17582#false} assume true; {17582#false} is VALID [2018-11-14 16:51:27,949 INFO L273 TraceCheckUtils]: 72: Hoare triple {17582#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {17582#false} is VALID [2018-11-14 16:51:27,950 INFO L256 TraceCheckUtils]: 73: Hoare triple {17582#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17582#false} is VALID [2018-11-14 16:51:27,950 INFO L273 TraceCheckUtils]: 74: Hoare triple {17582#false} ~cond := #in~cond; {17582#false} is VALID [2018-11-14 16:51:27,950 INFO L273 TraceCheckUtils]: 75: Hoare triple {17582#false} assume !(~cond == 0); {17582#false} is VALID [2018-11-14 16:51:27,950 INFO L273 TraceCheckUtils]: 76: Hoare triple {17582#false} assume true; {17582#false} is VALID [2018-11-14 16:51:27,950 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {17582#false} {17582#false} #143#return; {17582#false} is VALID [2018-11-14 16:51:27,951 INFO L273 TraceCheckUtils]: 78: Hoare triple {17582#false} havoc #t~mem9;havoc #t~mem10; {17582#false} is VALID [2018-11-14 16:51:27,951 INFO L273 TraceCheckUtils]: 79: Hoare triple {17582#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {17582#false} is VALID [2018-11-14 16:51:27,951 INFO L273 TraceCheckUtils]: 80: Hoare triple {17582#false} assume true; {17582#false} is VALID [2018-11-14 16:51:27,951 INFO L273 TraceCheckUtils]: 81: Hoare triple {17582#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {17582#false} is VALID [2018-11-14 16:51:27,951 INFO L256 TraceCheckUtils]: 82: Hoare triple {17582#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17582#false} is VALID [2018-11-14 16:51:27,951 INFO L273 TraceCheckUtils]: 83: Hoare triple {17582#false} ~cond := #in~cond; {17582#false} is VALID [2018-11-14 16:51:27,952 INFO L273 TraceCheckUtils]: 84: Hoare triple {17582#false} assume ~cond == 0; {17582#false} is VALID [2018-11-14 16:51:27,952 INFO L273 TraceCheckUtils]: 85: Hoare triple {17582#false} assume !false; {17582#false} is VALID [2018-11-14 16:51:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:27,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:27,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-11-14 16:51:27,980 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 86 [2018-11-14 16:51:27,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:27,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 16:51:28,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:28,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 16:51:28,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 16:51:28,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=696, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 16:51:28,120 INFO L87 Difference]: Start difference. First operand 274 states and 359 transitions. Second operand 34 states. [2018-11-14 16:51:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:28,867 INFO L93 Difference]: Finished difference Result 445 states and 594 transitions. [2018-11-14 16:51:28,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 16:51:28,867 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 86 [2018-11-14 16:51:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:51:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 200 transitions. [2018-11-14 16:51:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:51:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 200 transitions. [2018-11-14 16:51:28,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 200 transitions. [2018-11-14 16:51:29,041 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-14 16:51:29,048 INFO L225 Difference]: With dead ends: 445 [2018-11-14 16:51:29,048 INFO L226 Difference]: Without dead ends: 292 [2018-11-14 16:51:29,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=426, Invalid=696, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 16:51:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-14 16:51:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 282. [2018-11-14 16:51:29,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:29,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand 282 states. [2018-11-14 16:51:29,442 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand 282 states. [2018-11-14 16:51:29,442 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 282 states. [2018-11-14 16:51:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:29,449 INFO L93 Difference]: Finished difference Result 292 states and 383 transitions. [2018-11-14 16:51:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 383 transitions. [2018-11-14 16:51:29,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:29,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:29,451 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 292 states. [2018-11-14 16:51:29,451 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 292 states. [2018-11-14 16:51:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:29,458 INFO L93 Difference]: Finished difference Result 292 states and 383 transitions. [2018-11-14 16:51:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 383 transitions. [2018-11-14 16:51:29,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:29,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:29,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:29,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-14 16:51:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 369 transitions. [2018-11-14 16:51:29,465 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 369 transitions. Word has length 86 [2018-11-14 16:51:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:29,466 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 369 transitions. [2018-11-14 16:51:29,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 16:51:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 369 transitions. [2018-11-14 16:51:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-14 16:51:29,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:29,467 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:29,468 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:29,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:29,468 INFO L82 PathProgramCache]: Analyzing trace with hash 47536812, now seen corresponding path program 11 times [2018-11-14 16:51:29,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:29,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:29,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:29,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:29,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:30,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {19386#true} call ULTIMATE.init(); {19386#true} is VALID [2018-11-14 16:51:30,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {19386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19386#true} is VALID [2018-11-14 16:51:30,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {19386#true} assume true; {19386#true} is VALID [2018-11-14 16:51:30,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19386#true} {19386#true} #137#return; {19386#true} is VALID [2018-11-14 16:51:30,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {19386#true} call #t~ret15 := main(); {19386#true} is VALID [2018-11-14 16:51:30,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {19386#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {19388#(= main_~i~0 0)} is VALID [2018-11-14 16:51:30,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {19388#(= main_~i~0 0)} assume true; {19388#(= main_~i~0 0)} is VALID [2018-11-14 16:51:30,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {19388#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {19389#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {19389#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {19389#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {19389#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19389#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {19389#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19389#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {19389#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19390#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {19390#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {19390#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {19390#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19390#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {19390#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19390#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {19390#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19391#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {19391#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {19391#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {19391#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19391#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,037 INFO L273 TraceCheckUtils]: 18: Hoare triple {19391#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19391#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,038 INFO L273 TraceCheckUtils]: 19: Hoare triple {19391#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19392#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {19392#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {19392#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {19392#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19392#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {19392#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19392#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {19392#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19393#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,041 INFO L273 TraceCheckUtils]: 24: Hoare triple {19393#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {19393#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {19393#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19393#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {19393#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19393#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,044 INFO L273 TraceCheckUtils]: 27: Hoare triple {19393#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19394#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,045 INFO L273 TraceCheckUtils]: 28: Hoare triple {19394#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {19394#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {19394#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19394#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {19394#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19394#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,047 INFO L273 TraceCheckUtils]: 31: Hoare triple {19394#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19395#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,048 INFO L273 TraceCheckUtils]: 32: Hoare triple {19395#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {19395#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {19395#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19395#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {19395#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19395#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {19395#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19396#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {19396#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {19396#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,051 INFO L273 TraceCheckUtils]: 37: Hoare triple {19396#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19396#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,052 INFO L273 TraceCheckUtils]: 38: Hoare triple {19396#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19396#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {19396#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19397#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {19397#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {19397#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,054 INFO L273 TraceCheckUtils]: 41: Hoare triple {19397#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19397#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,055 INFO L273 TraceCheckUtils]: 42: Hoare triple {19397#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19397#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,056 INFO L273 TraceCheckUtils]: 43: Hoare triple {19397#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19398#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,056 INFO L273 TraceCheckUtils]: 44: Hoare triple {19398#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {19398#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,057 INFO L273 TraceCheckUtils]: 45: Hoare triple {19398#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19398#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,058 INFO L273 TraceCheckUtils]: 46: Hoare triple {19398#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19398#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,058 INFO L273 TraceCheckUtils]: 47: Hoare triple {19398#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19399#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,059 INFO L273 TraceCheckUtils]: 48: Hoare triple {19399#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {19399#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,060 INFO L273 TraceCheckUtils]: 49: Hoare triple {19399#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19399#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,061 INFO L273 TraceCheckUtils]: 50: Hoare triple {19399#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19399#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,062 INFO L273 TraceCheckUtils]: 51: Hoare triple {19399#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19400#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,062 INFO L273 TraceCheckUtils]: 52: Hoare triple {19400#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {19400#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,063 INFO L273 TraceCheckUtils]: 53: Hoare triple {19400#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19400#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,064 INFO L273 TraceCheckUtils]: 54: Hoare triple {19400#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19400#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,064 INFO L273 TraceCheckUtils]: 55: Hoare triple {19400#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19401#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,065 INFO L273 TraceCheckUtils]: 56: Hoare triple {19401#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume true; {19401#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,066 INFO L273 TraceCheckUtils]: 57: Hoare triple {19401#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19401#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,067 INFO L273 TraceCheckUtils]: 58: Hoare triple {19401#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19401#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,067 INFO L273 TraceCheckUtils]: 59: Hoare triple {19401#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19402#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,068 INFO L273 TraceCheckUtils]: 60: Hoare triple {19402#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume true; {19402#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,069 INFO L273 TraceCheckUtils]: 61: Hoare triple {19402#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19402#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,069 INFO L273 TraceCheckUtils]: 62: Hoare triple {19402#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19402#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,070 INFO L273 TraceCheckUtils]: 63: Hoare triple {19402#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19403#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,071 INFO L273 TraceCheckUtils]: 64: Hoare triple {19403#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume true; {19403#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,072 INFO L273 TraceCheckUtils]: 65: Hoare triple {19403#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19403#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,072 INFO L273 TraceCheckUtils]: 66: Hoare triple {19403#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19403#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,073 INFO L273 TraceCheckUtils]: 67: Hoare triple {19403#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {19404#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,074 INFO L273 TraceCheckUtils]: 68: Hoare triple {19404#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume true; {19404#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:30,074 INFO L273 TraceCheckUtils]: 69: Hoare triple {19404#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume !(~k~0 < 100000); {19387#false} is VALID [2018-11-14 16:51:30,075 INFO L273 TraceCheckUtils]: 70: Hoare triple {19387#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19387#false} is VALID [2018-11-14 16:51:30,075 INFO L273 TraceCheckUtils]: 71: Hoare triple {19387#false} ~x~0 := 0; {19387#false} is VALID [2018-11-14 16:51:30,075 INFO L273 TraceCheckUtils]: 72: Hoare triple {19387#false} assume true; {19387#false} is VALID [2018-11-14 16:51:30,075 INFO L273 TraceCheckUtils]: 73: Hoare triple {19387#false} assume !(~x~0 < ~i~0); {19387#false} is VALID [2018-11-14 16:51:30,075 INFO L273 TraceCheckUtils]: 74: Hoare triple {19387#false} ~x~0 := 0; {19387#false} is VALID [2018-11-14 16:51:30,076 INFO L273 TraceCheckUtils]: 75: Hoare triple {19387#false} assume true; {19387#false} is VALID [2018-11-14 16:51:30,076 INFO L273 TraceCheckUtils]: 76: Hoare triple {19387#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19387#false} is VALID [2018-11-14 16:51:30,076 INFO L256 TraceCheckUtils]: 77: Hoare triple {19387#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19386#true} is VALID [2018-11-14 16:51:30,076 INFO L273 TraceCheckUtils]: 78: Hoare triple {19386#true} ~cond := #in~cond; {19386#true} is VALID [2018-11-14 16:51:30,076 INFO L273 TraceCheckUtils]: 79: Hoare triple {19386#true} assume !(~cond == 0); {19386#true} is VALID [2018-11-14 16:51:30,076 INFO L273 TraceCheckUtils]: 80: Hoare triple {19386#true} assume true; {19386#true} is VALID [2018-11-14 16:51:30,077 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {19386#true} {19387#false} #143#return; {19387#false} is VALID [2018-11-14 16:51:30,077 INFO L273 TraceCheckUtils]: 82: Hoare triple {19387#false} havoc #t~mem9;havoc #t~mem10; {19387#false} is VALID [2018-11-14 16:51:30,077 INFO L273 TraceCheckUtils]: 83: Hoare triple {19387#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {19387#false} is VALID [2018-11-14 16:51:30,077 INFO L273 TraceCheckUtils]: 84: Hoare triple {19387#false} assume true; {19387#false} is VALID [2018-11-14 16:51:30,077 INFO L273 TraceCheckUtils]: 85: Hoare triple {19387#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19387#false} is VALID [2018-11-14 16:51:30,077 INFO L256 TraceCheckUtils]: 86: Hoare triple {19387#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19387#false} is VALID [2018-11-14 16:51:30,077 INFO L273 TraceCheckUtils]: 87: Hoare triple {19387#false} ~cond := #in~cond; {19387#false} is VALID [2018-11-14 16:51:30,078 INFO L273 TraceCheckUtils]: 88: Hoare triple {19387#false} assume ~cond == 0; {19387#false} is VALID [2018-11-14 16:51:30,078 INFO L273 TraceCheckUtils]: 89: Hoare triple {19387#false} assume !false; {19387#false} is VALID [2018-11-14 16:51:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 2 proven. 450 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:30,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:30,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:30,098 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:51:30,149 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-14 16:51:30,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:30,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:30,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {19386#true} call ULTIMATE.init(); {19386#true} is VALID [2018-11-14 16:51:30,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {19386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19386#true} is VALID [2018-11-14 16:51:30,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {19386#true} assume true; {19386#true} is VALID [2018-11-14 16:51:30,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19386#true} {19386#true} #137#return; {19386#true} is VALID [2018-11-14 16:51:30,586 INFO L256 TraceCheckUtils]: 4: Hoare triple {19386#true} call #t~ret15 := main(); {19386#true} is VALID [2018-11-14 16:51:30,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {19386#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {19423#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:30,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {19423#(<= main_~i~0 0)} assume true; {19423#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:30,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {19423#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {19430#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:30,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {19430#(<= main_~k~0 1)} assume true; {19430#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:30,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {19430#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19430#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:30,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {19430#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19430#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:30,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {19430#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {19443#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:30,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {19443#(<= main_~k~0 2)} assume true; {19443#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:30,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {19443#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19443#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:30,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {19443#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19443#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:30,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {19443#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {19456#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:30,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {19456#(<= main_~k~0 3)} assume true; {19456#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:30,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {19456#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19456#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:30,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {19456#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19456#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:30,594 INFO L273 TraceCheckUtils]: 19: Hoare triple {19456#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {19469#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:30,594 INFO L273 TraceCheckUtils]: 20: Hoare triple {19469#(<= main_~k~0 4)} assume true; {19469#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:30,595 INFO L273 TraceCheckUtils]: 21: Hoare triple {19469#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19469#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:30,595 INFO L273 TraceCheckUtils]: 22: Hoare triple {19469#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19469#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:30,596 INFO L273 TraceCheckUtils]: 23: Hoare triple {19469#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {19482#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:30,596 INFO L273 TraceCheckUtils]: 24: Hoare triple {19482#(<= main_~k~0 5)} assume true; {19482#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:30,597 INFO L273 TraceCheckUtils]: 25: Hoare triple {19482#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19482#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:30,597 INFO L273 TraceCheckUtils]: 26: Hoare triple {19482#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19482#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:30,598 INFO L273 TraceCheckUtils]: 27: Hoare triple {19482#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {19495#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:30,599 INFO L273 TraceCheckUtils]: 28: Hoare triple {19495#(<= main_~k~0 6)} assume true; {19495#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:30,599 INFO L273 TraceCheckUtils]: 29: Hoare triple {19495#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19495#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:30,600 INFO L273 TraceCheckUtils]: 30: Hoare triple {19495#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19495#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:30,600 INFO L273 TraceCheckUtils]: 31: Hoare triple {19495#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {19508#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:30,601 INFO L273 TraceCheckUtils]: 32: Hoare triple {19508#(<= main_~k~0 7)} assume true; {19508#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:30,601 INFO L273 TraceCheckUtils]: 33: Hoare triple {19508#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19508#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:30,602 INFO L273 TraceCheckUtils]: 34: Hoare triple {19508#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19508#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:30,603 INFO L273 TraceCheckUtils]: 35: Hoare triple {19508#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {19521#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:30,603 INFO L273 TraceCheckUtils]: 36: Hoare triple {19521#(<= main_~k~0 8)} assume true; {19521#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:30,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {19521#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19521#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:30,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {19521#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19521#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:30,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {19521#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {19534#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:30,606 INFO L273 TraceCheckUtils]: 40: Hoare triple {19534#(<= main_~k~0 9)} assume true; {19534#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:30,606 INFO L273 TraceCheckUtils]: 41: Hoare triple {19534#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19534#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:30,607 INFO L273 TraceCheckUtils]: 42: Hoare triple {19534#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19534#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:30,607 INFO L273 TraceCheckUtils]: 43: Hoare triple {19534#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {19547#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:30,608 INFO L273 TraceCheckUtils]: 44: Hoare triple {19547#(<= main_~k~0 10)} assume true; {19547#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:30,608 INFO L273 TraceCheckUtils]: 45: Hoare triple {19547#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19547#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:30,609 INFO L273 TraceCheckUtils]: 46: Hoare triple {19547#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19547#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:30,610 INFO L273 TraceCheckUtils]: 47: Hoare triple {19547#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {19560#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:30,610 INFO L273 TraceCheckUtils]: 48: Hoare triple {19560#(<= main_~k~0 11)} assume true; {19560#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:30,611 INFO L273 TraceCheckUtils]: 49: Hoare triple {19560#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19560#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:30,611 INFO L273 TraceCheckUtils]: 50: Hoare triple {19560#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19560#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:30,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {19560#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {19573#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:30,612 INFO L273 TraceCheckUtils]: 52: Hoare triple {19573#(<= main_~k~0 12)} assume true; {19573#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:30,613 INFO L273 TraceCheckUtils]: 53: Hoare triple {19573#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19573#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:30,613 INFO L273 TraceCheckUtils]: 54: Hoare triple {19573#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19573#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:30,614 INFO L273 TraceCheckUtils]: 55: Hoare triple {19573#(<= main_~k~0 12)} ~k~0 := ~k~0 + 1; {19586#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:30,615 INFO L273 TraceCheckUtils]: 56: Hoare triple {19586#(<= main_~k~0 13)} assume true; {19586#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:30,615 INFO L273 TraceCheckUtils]: 57: Hoare triple {19586#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19586#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:30,616 INFO L273 TraceCheckUtils]: 58: Hoare triple {19586#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19586#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:30,617 INFO L273 TraceCheckUtils]: 59: Hoare triple {19586#(<= main_~k~0 13)} ~k~0 := ~k~0 + 1; {19599#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:30,617 INFO L273 TraceCheckUtils]: 60: Hoare triple {19599#(<= main_~k~0 14)} assume true; {19599#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:30,618 INFO L273 TraceCheckUtils]: 61: Hoare triple {19599#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19599#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:30,618 INFO L273 TraceCheckUtils]: 62: Hoare triple {19599#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19599#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:30,619 INFO L273 TraceCheckUtils]: 63: Hoare triple {19599#(<= main_~k~0 14)} ~k~0 := ~k~0 + 1; {19612#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:30,619 INFO L273 TraceCheckUtils]: 64: Hoare triple {19612#(<= main_~k~0 15)} assume true; {19612#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:30,620 INFO L273 TraceCheckUtils]: 65: Hoare triple {19612#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {19612#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:30,620 INFO L273 TraceCheckUtils]: 66: Hoare triple {19612#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19612#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:30,621 INFO L273 TraceCheckUtils]: 67: Hoare triple {19612#(<= main_~k~0 15)} ~k~0 := ~k~0 + 1; {19625#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:30,622 INFO L273 TraceCheckUtils]: 68: Hoare triple {19625#(<= main_~k~0 16)} assume true; {19625#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:30,622 INFO L273 TraceCheckUtils]: 69: Hoare triple {19625#(<= main_~k~0 16)} assume !(~k~0 < 100000); {19387#false} is VALID [2018-11-14 16:51:30,623 INFO L273 TraceCheckUtils]: 70: Hoare triple {19387#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19387#false} is VALID [2018-11-14 16:51:30,623 INFO L273 TraceCheckUtils]: 71: Hoare triple {19387#false} ~x~0 := 0; {19387#false} is VALID [2018-11-14 16:51:30,623 INFO L273 TraceCheckUtils]: 72: Hoare triple {19387#false} assume true; {19387#false} is VALID [2018-11-14 16:51:30,623 INFO L273 TraceCheckUtils]: 73: Hoare triple {19387#false} assume !(~x~0 < ~i~0); {19387#false} is VALID [2018-11-14 16:51:30,623 INFO L273 TraceCheckUtils]: 74: Hoare triple {19387#false} ~x~0 := 0; {19387#false} is VALID [2018-11-14 16:51:30,624 INFO L273 TraceCheckUtils]: 75: Hoare triple {19387#false} assume true; {19387#false} is VALID [2018-11-14 16:51:30,624 INFO L273 TraceCheckUtils]: 76: Hoare triple {19387#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19387#false} is VALID [2018-11-14 16:51:30,624 INFO L256 TraceCheckUtils]: 77: Hoare triple {19387#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19387#false} is VALID [2018-11-14 16:51:30,624 INFO L273 TraceCheckUtils]: 78: Hoare triple {19387#false} ~cond := #in~cond; {19387#false} is VALID [2018-11-14 16:51:30,624 INFO L273 TraceCheckUtils]: 79: Hoare triple {19387#false} assume !(~cond == 0); {19387#false} is VALID [2018-11-14 16:51:30,625 INFO L273 TraceCheckUtils]: 80: Hoare triple {19387#false} assume true; {19387#false} is VALID [2018-11-14 16:51:30,625 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {19387#false} {19387#false} #143#return; {19387#false} is VALID [2018-11-14 16:51:30,625 INFO L273 TraceCheckUtils]: 82: Hoare triple {19387#false} havoc #t~mem9;havoc #t~mem10; {19387#false} is VALID [2018-11-14 16:51:30,625 INFO L273 TraceCheckUtils]: 83: Hoare triple {19387#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {19387#false} is VALID [2018-11-14 16:51:30,625 INFO L273 TraceCheckUtils]: 84: Hoare triple {19387#false} assume true; {19387#false} is VALID [2018-11-14 16:51:30,626 INFO L273 TraceCheckUtils]: 85: Hoare triple {19387#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19387#false} is VALID [2018-11-14 16:51:30,626 INFO L256 TraceCheckUtils]: 86: Hoare triple {19387#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19387#false} is VALID [2018-11-14 16:51:30,626 INFO L273 TraceCheckUtils]: 87: Hoare triple {19387#false} ~cond := #in~cond; {19387#false} is VALID [2018-11-14 16:51:30,626 INFO L273 TraceCheckUtils]: 88: Hoare triple {19387#false} assume ~cond == 0; {19387#false} is VALID [2018-11-14 16:51:30,626 INFO L273 TraceCheckUtils]: 89: Hoare triple {19387#false} assume !false; {19387#false} is VALID [2018-11-14 16:51:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:30,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:30,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-11-14 16:51:30,652 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 90 [2018-11-14 16:51:30,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:30,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 16:51:30,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:30,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 16:51:30,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 16:51:30,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=782, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 16:51:30,806 INFO L87 Difference]: Start difference. First operand 282 states and 369 transitions. Second operand 36 states. [2018-11-14 16:51:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:31,991 INFO L93 Difference]: Finished difference Result 453 states and 604 transitions. [2018-11-14 16:51:31,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 16:51:31,991 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 90 [2018-11-14 16:51:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:51:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 205 transitions. [2018-11-14 16:51:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:51:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 205 transitions. [2018-11-14 16:51:31,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 205 transitions. [2018-11-14 16:51:32,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:32,249 INFO L225 Difference]: With dead ends: 453 [2018-11-14 16:51:32,249 INFO L226 Difference]: Without dead ends: 300 [2018-11-14 16:51:32,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=478, Invalid=782, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 16:51:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-14 16:51:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 290. [2018-11-14 16:51:32,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:32,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand 290 states. [2018-11-14 16:51:32,620 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand 290 states. [2018-11-14 16:51:32,620 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 290 states. [2018-11-14 16:51:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:32,627 INFO L93 Difference]: Finished difference Result 300 states and 393 transitions. [2018-11-14 16:51:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 393 transitions. [2018-11-14 16:51:32,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:32,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:32,628 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand 300 states. [2018-11-14 16:51:32,628 INFO L87 Difference]: Start difference. First operand 290 states. Second operand 300 states. [2018-11-14 16:51:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:32,635 INFO L93 Difference]: Finished difference Result 300 states and 393 transitions. [2018-11-14 16:51:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 393 transitions. [2018-11-14 16:51:32,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:32,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:32,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:32,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-11-14 16:51:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 379 transitions. [2018-11-14 16:51:32,643 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 379 transitions. Word has length 90 [2018-11-14 16:51:32,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:32,643 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 379 transitions. [2018-11-14 16:51:32,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 16:51:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 379 transitions. [2018-11-14 16:51:32,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 16:51:32,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:32,644 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:32,645 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:32,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:32,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1440131178, now seen corresponding path program 12 times [2018-11-14 16:51:32,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:32,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:32,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:33,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {21241#true} call ULTIMATE.init(); {21241#true} is VALID [2018-11-14 16:51:33,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {21241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21241#true} is VALID [2018-11-14 16:51:33,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {21241#true} assume true; {21241#true} is VALID [2018-11-14 16:51:33,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21241#true} {21241#true} #137#return; {21241#true} is VALID [2018-11-14 16:51:33,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {21241#true} call #t~ret15 := main(); {21241#true} is VALID [2018-11-14 16:51:33,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {21241#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {21243#(= main_~i~0 0)} is VALID [2018-11-14 16:51:33,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {21243#(= main_~i~0 0)} assume true; {21243#(= main_~i~0 0)} is VALID [2018-11-14 16:51:33,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {21243#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {21244#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {21244#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {21244#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {21244#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21244#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {21244#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21244#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {21244#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21245#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {21245#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {21245#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {21245#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21245#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {21245#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21245#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {21245#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21246#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {21246#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {21246#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,261 INFO L273 TraceCheckUtils]: 17: Hoare triple {21246#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21246#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {21246#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21246#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {21246#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21247#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {21247#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {21247#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,264 INFO L273 TraceCheckUtils]: 21: Hoare triple {21247#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21247#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {21247#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21247#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,265 INFO L273 TraceCheckUtils]: 23: Hoare triple {21247#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21248#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {21248#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {21248#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,267 INFO L273 TraceCheckUtils]: 25: Hoare triple {21248#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21248#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {21248#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21248#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,269 INFO L273 TraceCheckUtils]: 27: Hoare triple {21248#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21249#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,269 INFO L273 TraceCheckUtils]: 28: Hoare triple {21249#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {21249#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {21249#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21249#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {21249#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21249#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {21249#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21250#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {21250#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {21250#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,273 INFO L273 TraceCheckUtils]: 33: Hoare triple {21250#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21250#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {21250#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21250#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {21250#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21251#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,275 INFO L273 TraceCheckUtils]: 36: Hoare triple {21251#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {21251#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,276 INFO L273 TraceCheckUtils]: 37: Hoare triple {21251#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21251#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {21251#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21251#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {21251#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21252#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,278 INFO L273 TraceCheckUtils]: 40: Hoare triple {21252#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {21252#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {21252#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21252#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,280 INFO L273 TraceCheckUtils]: 42: Hoare triple {21252#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21252#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,281 INFO L273 TraceCheckUtils]: 43: Hoare triple {21252#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21253#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {21253#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {21253#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {21253#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21253#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {21253#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21253#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,284 INFO L273 TraceCheckUtils]: 47: Hoare triple {21253#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21254#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,285 INFO L273 TraceCheckUtils]: 48: Hoare triple {21254#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {21254#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,286 INFO L273 TraceCheckUtils]: 49: Hoare triple {21254#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21254#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,286 INFO L273 TraceCheckUtils]: 50: Hoare triple {21254#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21254#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,287 INFO L273 TraceCheckUtils]: 51: Hoare triple {21254#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21255#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,288 INFO L273 TraceCheckUtils]: 52: Hoare triple {21255#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {21255#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,289 INFO L273 TraceCheckUtils]: 53: Hoare triple {21255#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21255#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,289 INFO L273 TraceCheckUtils]: 54: Hoare triple {21255#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21255#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,290 INFO L273 TraceCheckUtils]: 55: Hoare triple {21255#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21256#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,291 INFO L273 TraceCheckUtils]: 56: Hoare triple {21256#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume true; {21256#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,292 INFO L273 TraceCheckUtils]: 57: Hoare triple {21256#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21256#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,293 INFO L273 TraceCheckUtils]: 58: Hoare triple {21256#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21256#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,293 INFO L273 TraceCheckUtils]: 59: Hoare triple {21256#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21257#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,294 INFO L273 TraceCheckUtils]: 60: Hoare triple {21257#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume true; {21257#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,295 INFO L273 TraceCheckUtils]: 61: Hoare triple {21257#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21257#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,296 INFO L273 TraceCheckUtils]: 62: Hoare triple {21257#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21257#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,296 INFO L273 TraceCheckUtils]: 63: Hoare triple {21257#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21258#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,297 INFO L273 TraceCheckUtils]: 64: Hoare triple {21258#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume true; {21258#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,298 INFO L273 TraceCheckUtils]: 65: Hoare triple {21258#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21258#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,298 INFO L273 TraceCheckUtils]: 66: Hoare triple {21258#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21258#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,299 INFO L273 TraceCheckUtils]: 67: Hoare triple {21258#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21259#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,300 INFO L273 TraceCheckUtils]: 68: Hoare triple {21259#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume true; {21259#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,301 INFO L273 TraceCheckUtils]: 69: Hoare triple {21259#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21259#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,302 INFO L273 TraceCheckUtils]: 70: Hoare triple {21259#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21259#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:33,303 INFO L273 TraceCheckUtils]: 71: Hoare triple {21259#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {21260#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:33,303 INFO L273 TraceCheckUtils]: 72: Hoare triple {21260#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume true; {21260#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:33,304 INFO L273 TraceCheckUtils]: 73: Hoare triple {21260#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume !(~k~0 < 100000); {21242#false} is VALID [2018-11-14 16:51:33,304 INFO L273 TraceCheckUtils]: 74: Hoare triple {21242#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21242#false} is VALID [2018-11-14 16:51:33,304 INFO L273 TraceCheckUtils]: 75: Hoare triple {21242#false} ~x~0 := 0; {21242#false} is VALID [2018-11-14 16:51:33,305 INFO L273 TraceCheckUtils]: 76: Hoare triple {21242#false} assume true; {21242#false} is VALID [2018-11-14 16:51:33,305 INFO L273 TraceCheckUtils]: 77: Hoare triple {21242#false} assume !(~x~0 < ~i~0); {21242#false} is VALID [2018-11-14 16:51:33,305 INFO L273 TraceCheckUtils]: 78: Hoare triple {21242#false} ~x~0 := 0; {21242#false} is VALID [2018-11-14 16:51:33,305 INFO L273 TraceCheckUtils]: 79: Hoare triple {21242#false} assume true; {21242#false} is VALID [2018-11-14 16:51:33,305 INFO L273 TraceCheckUtils]: 80: Hoare triple {21242#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21242#false} is VALID [2018-11-14 16:51:33,306 INFO L256 TraceCheckUtils]: 81: Hoare triple {21242#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21241#true} is VALID [2018-11-14 16:51:33,306 INFO L273 TraceCheckUtils]: 82: Hoare triple {21241#true} ~cond := #in~cond; {21241#true} is VALID [2018-11-14 16:51:33,306 INFO L273 TraceCheckUtils]: 83: Hoare triple {21241#true} assume !(~cond == 0); {21241#true} is VALID [2018-11-14 16:51:33,306 INFO L273 TraceCheckUtils]: 84: Hoare triple {21241#true} assume true; {21241#true} is VALID [2018-11-14 16:51:33,306 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {21241#true} {21242#false} #143#return; {21242#false} is VALID [2018-11-14 16:51:33,307 INFO L273 TraceCheckUtils]: 86: Hoare triple {21242#false} havoc #t~mem9;havoc #t~mem10; {21242#false} is VALID [2018-11-14 16:51:33,307 INFO L273 TraceCheckUtils]: 87: Hoare triple {21242#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {21242#false} is VALID [2018-11-14 16:51:33,307 INFO L273 TraceCheckUtils]: 88: Hoare triple {21242#false} assume true; {21242#false} is VALID [2018-11-14 16:51:33,307 INFO L273 TraceCheckUtils]: 89: Hoare triple {21242#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21242#false} is VALID [2018-11-14 16:51:33,307 INFO L256 TraceCheckUtils]: 90: Hoare triple {21242#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21242#false} is VALID [2018-11-14 16:51:33,307 INFO L273 TraceCheckUtils]: 91: Hoare triple {21242#false} ~cond := #in~cond; {21242#false} is VALID [2018-11-14 16:51:33,307 INFO L273 TraceCheckUtils]: 92: Hoare triple {21242#false} assume ~cond == 0; {21242#false} is VALID [2018-11-14 16:51:33,308 INFO L273 TraceCheckUtils]: 93: Hoare triple {21242#false} assume !false; {21242#false} is VALID [2018-11-14 16:51:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 2 proven. 512 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:33,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:33,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:33,328 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:51:33,421 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-14 16:51:33,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:33,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:34,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {21241#true} call ULTIMATE.init(); {21241#true} is VALID [2018-11-14 16:51:34,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {21241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21241#true} is VALID [2018-11-14 16:51:34,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {21241#true} assume true; {21241#true} is VALID [2018-11-14 16:51:34,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21241#true} {21241#true} #137#return; {21241#true} is VALID [2018-11-14 16:51:34,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {21241#true} call #t~ret15 := main(); {21241#true} is VALID [2018-11-14 16:51:34,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {21241#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {21279#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:34,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {21279#(<= main_~i~0 0)} assume true; {21279#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:34,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {21279#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {21286#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:34,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {21286#(<= main_~k~0 1)} assume true; {21286#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:34,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {21286#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21286#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:34,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {21286#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21286#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:34,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {21286#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {21299#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:34,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {21299#(<= main_~k~0 2)} assume true; {21299#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:34,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {21299#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21299#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:34,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {21299#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21299#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:34,137 INFO L273 TraceCheckUtils]: 15: Hoare triple {21299#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {21312#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:34,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {21312#(<= main_~k~0 3)} assume true; {21312#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:34,138 INFO L273 TraceCheckUtils]: 17: Hoare triple {21312#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21312#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:34,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {21312#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21312#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:34,139 INFO L273 TraceCheckUtils]: 19: Hoare triple {21312#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {21325#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:34,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {21325#(<= main_~k~0 4)} assume true; {21325#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:34,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {21325#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21325#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:34,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {21325#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21325#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:34,142 INFO L273 TraceCheckUtils]: 23: Hoare triple {21325#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {21338#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:34,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {21338#(<= main_~k~0 5)} assume true; {21338#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:34,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {21338#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21338#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:34,144 INFO L273 TraceCheckUtils]: 26: Hoare triple {21338#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21338#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:34,145 INFO L273 TraceCheckUtils]: 27: Hoare triple {21338#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {21351#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:34,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {21351#(<= main_~k~0 6)} assume true; {21351#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:34,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {21351#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21351#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:34,147 INFO L273 TraceCheckUtils]: 30: Hoare triple {21351#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21351#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:34,148 INFO L273 TraceCheckUtils]: 31: Hoare triple {21351#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {21364#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:34,148 INFO L273 TraceCheckUtils]: 32: Hoare triple {21364#(<= main_~k~0 7)} assume true; {21364#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:34,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {21364#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21364#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:34,149 INFO L273 TraceCheckUtils]: 34: Hoare triple {21364#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21364#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:34,150 INFO L273 TraceCheckUtils]: 35: Hoare triple {21364#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {21377#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:34,151 INFO L273 TraceCheckUtils]: 36: Hoare triple {21377#(<= main_~k~0 8)} assume true; {21377#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:34,152 INFO L273 TraceCheckUtils]: 37: Hoare triple {21377#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21377#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:34,152 INFO L273 TraceCheckUtils]: 38: Hoare triple {21377#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21377#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:34,153 INFO L273 TraceCheckUtils]: 39: Hoare triple {21377#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {21390#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:34,154 INFO L273 TraceCheckUtils]: 40: Hoare triple {21390#(<= main_~k~0 9)} assume true; {21390#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:34,154 INFO L273 TraceCheckUtils]: 41: Hoare triple {21390#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21390#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:34,155 INFO L273 TraceCheckUtils]: 42: Hoare triple {21390#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21390#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:34,156 INFO L273 TraceCheckUtils]: 43: Hoare triple {21390#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {21403#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:34,156 INFO L273 TraceCheckUtils]: 44: Hoare triple {21403#(<= main_~k~0 10)} assume true; {21403#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:34,157 INFO L273 TraceCheckUtils]: 45: Hoare triple {21403#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21403#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:34,157 INFO L273 TraceCheckUtils]: 46: Hoare triple {21403#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21403#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:34,158 INFO L273 TraceCheckUtils]: 47: Hoare triple {21403#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {21416#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:34,159 INFO L273 TraceCheckUtils]: 48: Hoare triple {21416#(<= main_~k~0 11)} assume true; {21416#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:34,160 INFO L273 TraceCheckUtils]: 49: Hoare triple {21416#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21416#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:34,160 INFO L273 TraceCheckUtils]: 50: Hoare triple {21416#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21416#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:34,161 INFO L273 TraceCheckUtils]: 51: Hoare triple {21416#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {21429#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:34,162 INFO L273 TraceCheckUtils]: 52: Hoare triple {21429#(<= main_~k~0 12)} assume true; {21429#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:34,162 INFO L273 TraceCheckUtils]: 53: Hoare triple {21429#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21429#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:34,163 INFO L273 TraceCheckUtils]: 54: Hoare triple {21429#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21429#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:34,164 INFO L273 TraceCheckUtils]: 55: Hoare triple {21429#(<= main_~k~0 12)} ~k~0 := ~k~0 + 1; {21442#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:34,164 INFO L273 TraceCheckUtils]: 56: Hoare triple {21442#(<= main_~k~0 13)} assume true; {21442#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:34,165 INFO L273 TraceCheckUtils]: 57: Hoare triple {21442#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21442#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:34,165 INFO L273 TraceCheckUtils]: 58: Hoare triple {21442#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21442#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:34,166 INFO L273 TraceCheckUtils]: 59: Hoare triple {21442#(<= main_~k~0 13)} ~k~0 := ~k~0 + 1; {21455#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:34,167 INFO L273 TraceCheckUtils]: 60: Hoare triple {21455#(<= main_~k~0 14)} assume true; {21455#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:34,168 INFO L273 TraceCheckUtils]: 61: Hoare triple {21455#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21455#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:34,168 INFO L273 TraceCheckUtils]: 62: Hoare triple {21455#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21455#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:34,169 INFO L273 TraceCheckUtils]: 63: Hoare triple {21455#(<= main_~k~0 14)} ~k~0 := ~k~0 + 1; {21468#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:34,170 INFO L273 TraceCheckUtils]: 64: Hoare triple {21468#(<= main_~k~0 15)} assume true; {21468#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:34,170 INFO L273 TraceCheckUtils]: 65: Hoare triple {21468#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21468#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:34,171 INFO L273 TraceCheckUtils]: 66: Hoare triple {21468#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21468#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:34,172 INFO L273 TraceCheckUtils]: 67: Hoare triple {21468#(<= main_~k~0 15)} ~k~0 := ~k~0 + 1; {21481#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:34,172 INFO L273 TraceCheckUtils]: 68: Hoare triple {21481#(<= main_~k~0 16)} assume true; {21481#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:34,173 INFO L273 TraceCheckUtils]: 69: Hoare triple {21481#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {21481#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:34,173 INFO L273 TraceCheckUtils]: 70: Hoare triple {21481#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21481#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:34,174 INFO L273 TraceCheckUtils]: 71: Hoare triple {21481#(<= main_~k~0 16)} ~k~0 := ~k~0 + 1; {21494#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:34,175 INFO L273 TraceCheckUtils]: 72: Hoare triple {21494#(<= main_~k~0 17)} assume true; {21494#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:34,176 INFO L273 TraceCheckUtils]: 73: Hoare triple {21494#(<= main_~k~0 17)} assume !(~k~0 < 100000); {21242#false} is VALID [2018-11-14 16:51:34,176 INFO L273 TraceCheckUtils]: 74: Hoare triple {21242#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21242#false} is VALID [2018-11-14 16:51:34,176 INFO L273 TraceCheckUtils]: 75: Hoare triple {21242#false} ~x~0 := 0; {21242#false} is VALID [2018-11-14 16:51:34,176 INFO L273 TraceCheckUtils]: 76: Hoare triple {21242#false} assume true; {21242#false} is VALID [2018-11-14 16:51:34,177 INFO L273 TraceCheckUtils]: 77: Hoare triple {21242#false} assume !(~x~0 < ~i~0); {21242#false} is VALID [2018-11-14 16:51:34,177 INFO L273 TraceCheckUtils]: 78: Hoare triple {21242#false} ~x~0 := 0; {21242#false} is VALID [2018-11-14 16:51:34,177 INFO L273 TraceCheckUtils]: 79: Hoare triple {21242#false} assume true; {21242#false} is VALID [2018-11-14 16:51:34,177 INFO L273 TraceCheckUtils]: 80: Hoare triple {21242#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21242#false} is VALID [2018-11-14 16:51:34,178 INFO L256 TraceCheckUtils]: 81: Hoare triple {21242#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21242#false} is VALID [2018-11-14 16:51:34,178 INFO L273 TraceCheckUtils]: 82: Hoare triple {21242#false} ~cond := #in~cond; {21242#false} is VALID [2018-11-14 16:51:34,178 INFO L273 TraceCheckUtils]: 83: Hoare triple {21242#false} assume !(~cond == 0); {21242#false} is VALID [2018-11-14 16:51:34,178 INFO L273 TraceCheckUtils]: 84: Hoare triple {21242#false} assume true; {21242#false} is VALID [2018-11-14 16:51:34,179 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {21242#false} {21242#false} #143#return; {21242#false} is VALID [2018-11-14 16:51:34,179 INFO L273 TraceCheckUtils]: 86: Hoare triple {21242#false} havoc #t~mem9;havoc #t~mem10; {21242#false} is VALID [2018-11-14 16:51:34,179 INFO L273 TraceCheckUtils]: 87: Hoare triple {21242#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {21242#false} is VALID [2018-11-14 16:51:34,179 INFO L273 TraceCheckUtils]: 88: Hoare triple {21242#false} assume true; {21242#false} is VALID [2018-11-14 16:51:34,179 INFO L273 TraceCheckUtils]: 89: Hoare triple {21242#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21242#false} is VALID [2018-11-14 16:51:34,179 INFO L256 TraceCheckUtils]: 90: Hoare triple {21242#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21242#false} is VALID [2018-11-14 16:51:34,180 INFO L273 TraceCheckUtils]: 91: Hoare triple {21242#false} ~cond := #in~cond; {21242#false} is VALID [2018-11-14 16:51:34,180 INFO L273 TraceCheckUtils]: 92: Hoare triple {21242#false} assume ~cond == 0; {21242#false} is VALID [2018-11-14 16:51:34,180 INFO L273 TraceCheckUtils]: 93: Hoare triple {21242#false} assume !false; {21242#false} is VALID [2018-11-14 16:51:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:34,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:34,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-11-14 16:51:34,210 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-11-14 16:51:34,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:34,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 16:51:34,400 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-14 16:51:34,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 16:51:34,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 16:51:34,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=873, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 16:51:34,401 INFO L87 Difference]: Start difference. First operand 290 states and 379 transitions. Second operand 38 states. [2018-11-14 16:51:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:36,248 INFO L93 Difference]: Finished difference Result 461 states and 614 transitions. [2018-11-14 16:51:36,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 16:51:36,248 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-11-14 16:51:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:51:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 210 transitions. [2018-11-14 16:51:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:51:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 210 transitions. [2018-11-14 16:51:36,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 210 transitions. [2018-11-14 16:51:36,429 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-14 16:51:36,438 INFO L225 Difference]: With dead ends: 461 [2018-11-14 16:51:36,438 INFO L226 Difference]: Without dead ends: 308 [2018-11-14 16:51:36,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=533, Invalid=873, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 16:51:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-14 16:51:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 298. [2018-11-14 16:51:36,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:36,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 298 states. [2018-11-14 16:51:36,992 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 298 states. [2018-11-14 16:51:36,992 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 298 states. [2018-11-14 16:51:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:36,998 INFO L93 Difference]: Finished difference Result 308 states and 403 transitions. [2018-11-14 16:51:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 403 transitions. [2018-11-14 16:51:36,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:36,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:36,999 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand 308 states. [2018-11-14 16:51:36,999 INFO L87 Difference]: Start difference. First operand 298 states. Second operand 308 states. [2018-11-14 16:51:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:37,006 INFO L93 Difference]: Finished difference Result 308 states and 403 transitions. [2018-11-14 16:51:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 403 transitions. [2018-11-14 16:51:37,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:37,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:37,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:37,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-14 16:51:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 389 transitions. [2018-11-14 16:51:37,013 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 389 transitions. Word has length 94 [2018-11-14 16:51:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:37,014 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 389 transitions. [2018-11-14 16:51:37,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 16:51:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 389 transitions. [2018-11-14 16:51:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-14 16:51:37,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:37,015 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:37,015 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:37,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1543556992, now seen corresponding path program 13 times [2018-11-14 16:51:37,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:37,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:37,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:38,090 INFO L256 TraceCheckUtils]: 0: Hoare triple {23146#true} call ULTIMATE.init(); {23146#true} is VALID [2018-11-14 16:51:38,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {23146#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23146#true} is VALID [2018-11-14 16:51:38,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {23146#true} assume true; {23146#true} is VALID [2018-11-14 16:51:38,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23146#true} {23146#true} #137#return; {23146#true} is VALID [2018-11-14 16:51:38,091 INFO L256 TraceCheckUtils]: 4: Hoare triple {23146#true} call #t~ret15 := main(); {23146#true} is VALID [2018-11-14 16:51:38,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {23146#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {23148#(= main_~i~0 0)} is VALID [2018-11-14 16:51:38,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {23148#(= main_~i~0 0)} assume true; {23148#(= main_~i~0 0)} is VALID [2018-11-14 16:51:38,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {23148#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {23149#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {23149#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {23149#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {23149#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23149#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {23149#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23149#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {23149#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23150#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,096 INFO L273 TraceCheckUtils]: 12: Hoare triple {23150#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {23150#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,097 INFO L273 TraceCheckUtils]: 13: Hoare triple {23150#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23150#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {23150#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23150#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,098 INFO L273 TraceCheckUtils]: 15: Hoare triple {23150#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23151#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {23151#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {23151#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {23151#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23151#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,101 INFO L273 TraceCheckUtils]: 18: Hoare triple {23151#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23151#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {23151#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23152#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,102 INFO L273 TraceCheckUtils]: 20: Hoare triple {23152#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {23152#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,103 INFO L273 TraceCheckUtils]: 21: Hoare triple {23152#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23152#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,103 INFO L273 TraceCheckUtils]: 22: Hoare triple {23152#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23152#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,104 INFO L273 TraceCheckUtils]: 23: Hoare triple {23152#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23153#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,105 INFO L273 TraceCheckUtils]: 24: Hoare triple {23153#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {23153#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {23153#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23153#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,107 INFO L273 TraceCheckUtils]: 26: Hoare triple {23153#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23153#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {23153#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23154#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,108 INFO L273 TraceCheckUtils]: 28: Hoare triple {23154#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {23154#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,109 INFO L273 TraceCheckUtils]: 29: Hoare triple {23154#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23154#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,109 INFO L273 TraceCheckUtils]: 30: Hoare triple {23154#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23154#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,110 INFO L273 TraceCheckUtils]: 31: Hoare triple {23154#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23155#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,111 INFO L273 TraceCheckUtils]: 32: Hoare triple {23155#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {23155#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,112 INFO L273 TraceCheckUtils]: 33: Hoare triple {23155#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23155#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,112 INFO L273 TraceCheckUtils]: 34: Hoare triple {23155#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23155#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,113 INFO L273 TraceCheckUtils]: 35: Hoare triple {23155#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23156#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {23156#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {23156#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,114 INFO L273 TraceCheckUtils]: 37: Hoare triple {23156#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23156#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,115 INFO L273 TraceCheckUtils]: 38: Hoare triple {23156#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23156#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,116 INFO L273 TraceCheckUtils]: 39: Hoare triple {23156#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23157#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,116 INFO L273 TraceCheckUtils]: 40: Hoare triple {23157#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {23157#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,117 INFO L273 TraceCheckUtils]: 41: Hoare triple {23157#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23157#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,118 INFO L273 TraceCheckUtils]: 42: Hoare triple {23157#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23157#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,119 INFO L273 TraceCheckUtils]: 43: Hoare triple {23157#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23158#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,119 INFO L273 TraceCheckUtils]: 44: Hoare triple {23158#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {23158#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,120 INFO L273 TraceCheckUtils]: 45: Hoare triple {23158#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23158#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,121 INFO L273 TraceCheckUtils]: 46: Hoare triple {23158#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23158#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,121 INFO L273 TraceCheckUtils]: 47: Hoare triple {23158#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23159#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,122 INFO L273 TraceCheckUtils]: 48: Hoare triple {23159#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {23159#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,123 INFO L273 TraceCheckUtils]: 49: Hoare triple {23159#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23159#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,124 INFO L273 TraceCheckUtils]: 50: Hoare triple {23159#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23159#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,125 INFO L273 TraceCheckUtils]: 51: Hoare triple {23159#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23160#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,125 INFO L273 TraceCheckUtils]: 52: Hoare triple {23160#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {23160#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,126 INFO L273 TraceCheckUtils]: 53: Hoare triple {23160#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23160#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,127 INFO L273 TraceCheckUtils]: 54: Hoare triple {23160#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23160#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,128 INFO L273 TraceCheckUtils]: 55: Hoare triple {23160#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23161#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,128 INFO L273 TraceCheckUtils]: 56: Hoare triple {23161#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume true; {23161#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,129 INFO L273 TraceCheckUtils]: 57: Hoare triple {23161#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23161#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,130 INFO L273 TraceCheckUtils]: 58: Hoare triple {23161#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23161#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,130 INFO L273 TraceCheckUtils]: 59: Hoare triple {23161#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23162#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,131 INFO L273 TraceCheckUtils]: 60: Hoare triple {23162#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume true; {23162#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,132 INFO L273 TraceCheckUtils]: 61: Hoare triple {23162#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23162#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,132 INFO L273 TraceCheckUtils]: 62: Hoare triple {23162#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23162#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,133 INFO L273 TraceCheckUtils]: 63: Hoare triple {23162#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23163#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,134 INFO L273 TraceCheckUtils]: 64: Hoare triple {23163#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume true; {23163#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,135 INFO L273 TraceCheckUtils]: 65: Hoare triple {23163#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23163#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,135 INFO L273 TraceCheckUtils]: 66: Hoare triple {23163#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23163#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,136 INFO L273 TraceCheckUtils]: 67: Hoare triple {23163#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23164#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,137 INFO L273 TraceCheckUtils]: 68: Hoare triple {23164#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume true; {23164#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,138 INFO L273 TraceCheckUtils]: 69: Hoare triple {23164#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23164#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,139 INFO L273 TraceCheckUtils]: 70: Hoare triple {23164#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23164#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,139 INFO L273 TraceCheckUtils]: 71: Hoare triple {23164#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {23165#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:38,140 INFO L273 TraceCheckUtils]: 72: Hoare triple {23165#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume true; {23165#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:38,141 INFO L273 TraceCheckUtils]: 73: Hoare triple {23165#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23165#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:38,142 INFO L273 TraceCheckUtils]: 74: Hoare triple {23165#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23165#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:38,142 INFO L273 TraceCheckUtils]: 75: Hoare triple {23165#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := ~k~0 + 1; {23166#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,143 INFO L273 TraceCheckUtils]: 76: Hoare triple {23166#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume true; {23166#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:38,144 INFO L273 TraceCheckUtils]: 77: Hoare triple {23166#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume !(~k~0 < 100000); {23147#false} is VALID [2018-11-14 16:51:38,144 INFO L273 TraceCheckUtils]: 78: Hoare triple {23147#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23147#false} is VALID [2018-11-14 16:51:38,144 INFO L273 TraceCheckUtils]: 79: Hoare triple {23147#false} ~x~0 := 0; {23147#false} is VALID [2018-11-14 16:51:38,144 INFO L273 TraceCheckUtils]: 80: Hoare triple {23147#false} assume true; {23147#false} is VALID [2018-11-14 16:51:38,144 INFO L273 TraceCheckUtils]: 81: Hoare triple {23147#false} assume !(~x~0 < ~i~0); {23147#false} is VALID [2018-11-14 16:51:38,145 INFO L273 TraceCheckUtils]: 82: Hoare triple {23147#false} ~x~0 := 0; {23147#false} is VALID [2018-11-14 16:51:38,145 INFO L273 TraceCheckUtils]: 83: Hoare triple {23147#false} assume true; {23147#false} is VALID [2018-11-14 16:51:38,145 INFO L273 TraceCheckUtils]: 84: Hoare triple {23147#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23147#false} is VALID [2018-11-14 16:51:38,145 INFO L256 TraceCheckUtils]: 85: Hoare triple {23147#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23146#true} is VALID [2018-11-14 16:51:38,145 INFO L273 TraceCheckUtils]: 86: Hoare triple {23146#true} ~cond := #in~cond; {23146#true} is VALID [2018-11-14 16:51:38,146 INFO L273 TraceCheckUtils]: 87: Hoare triple {23146#true} assume !(~cond == 0); {23146#true} is VALID [2018-11-14 16:51:38,146 INFO L273 TraceCheckUtils]: 88: Hoare triple {23146#true} assume true; {23146#true} is VALID [2018-11-14 16:51:38,146 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {23146#true} {23147#false} #143#return; {23147#false} is VALID [2018-11-14 16:51:38,146 INFO L273 TraceCheckUtils]: 90: Hoare triple {23147#false} havoc #t~mem9;havoc #t~mem10; {23147#false} is VALID [2018-11-14 16:51:38,146 INFO L273 TraceCheckUtils]: 91: Hoare triple {23147#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {23147#false} is VALID [2018-11-14 16:51:38,146 INFO L273 TraceCheckUtils]: 92: Hoare triple {23147#false} assume true; {23147#false} is VALID [2018-11-14 16:51:38,146 INFO L273 TraceCheckUtils]: 93: Hoare triple {23147#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23147#false} is VALID [2018-11-14 16:51:38,147 INFO L256 TraceCheckUtils]: 94: Hoare triple {23147#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23147#false} is VALID [2018-11-14 16:51:38,147 INFO L273 TraceCheckUtils]: 95: Hoare triple {23147#false} ~cond := #in~cond; {23147#false} is VALID [2018-11-14 16:51:38,147 INFO L273 TraceCheckUtils]: 96: Hoare triple {23147#false} assume ~cond == 0; {23147#false} is VALID [2018-11-14 16:51:38,147 INFO L273 TraceCheckUtils]: 97: Hoare triple {23147#false} assume !false; {23147#false} is VALID [2018-11-14 16:51:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 2 proven. 578 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:38,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:38,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:38,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:51:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:38,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:38,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {23146#true} call ULTIMATE.init(); {23146#true} is VALID [2018-11-14 16:51:38,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {23146#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23146#true} is VALID [2018-11-14 16:51:38,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {23146#true} assume true; {23146#true} is VALID [2018-11-14 16:51:38,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23146#true} {23146#true} #137#return; {23146#true} is VALID [2018-11-14 16:51:38,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {23146#true} call #t~ret15 := main(); {23146#true} is VALID [2018-11-14 16:51:38,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {23146#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {23185#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:38,994 INFO L273 TraceCheckUtils]: 6: Hoare triple {23185#(<= main_~i~0 0)} assume true; {23185#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:38,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {23185#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {23192#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:38,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {23192#(<= main_~k~0 1)} assume true; {23192#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:38,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {23192#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23192#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:38,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {23192#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23192#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:38,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {23192#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {23205#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:38,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {23205#(<= main_~k~0 2)} assume true; {23205#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:38,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {23205#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23205#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:38,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {23205#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23205#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:38,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {23205#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {23218#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:38,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {23218#(<= main_~k~0 3)} assume true; {23218#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:38,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {23218#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23218#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:38,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {23218#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23218#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:38,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {23218#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {23231#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:39,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {23231#(<= main_~k~0 4)} assume true; {23231#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:39,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {23231#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23231#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:39,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {23231#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23231#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:39,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {23231#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {23244#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:39,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {23244#(<= main_~k~0 5)} assume true; {23244#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:39,003 INFO L273 TraceCheckUtils]: 25: Hoare triple {23244#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23244#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:39,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {23244#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23244#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:39,004 INFO L273 TraceCheckUtils]: 27: Hoare triple {23244#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {23257#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:39,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {23257#(<= main_~k~0 6)} assume true; {23257#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:39,005 INFO L273 TraceCheckUtils]: 29: Hoare triple {23257#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23257#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:39,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {23257#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23257#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:39,006 INFO L273 TraceCheckUtils]: 31: Hoare triple {23257#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {23270#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:39,006 INFO L273 TraceCheckUtils]: 32: Hoare triple {23270#(<= main_~k~0 7)} assume true; {23270#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:39,007 INFO L273 TraceCheckUtils]: 33: Hoare triple {23270#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23270#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:39,007 INFO L273 TraceCheckUtils]: 34: Hoare triple {23270#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23270#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:39,008 INFO L273 TraceCheckUtils]: 35: Hoare triple {23270#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {23283#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:39,009 INFO L273 TraceCheckUtils]: 36: Hoare triple {23283#(<= main_~k~0 8)} assume true; {23283#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:39,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {23283#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23283#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:39,010 INFO L273 TraceCheckUtils]: 38: Hoare triple {23283#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23283#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:39,010 INFO L273 TraceCheckUtils]: 39: Hoare triple {23283#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {23296#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:39,011 INFO L273 TraceCheckUtils]: 40: Hoare triple {23296#(<= main_~k~0 9)} assume true; {23296#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:39,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {23296#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23296#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:39,012 INFO L273 TraceCheckUtils]: 42: Hoare triple {23296#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23296#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:39,013 INFO L273 TraceCheckUtils]: 43: Hoare triple {23296#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {23309#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:39,013 INFO L273 TraceCheckUtils]: 44: Hoare triple {23309#(<= main_~k~0 10)} assume true; {23309#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:39,014 INFO L273 TraceCheckUtils]: 45: Hoare triple {23309#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23309#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:39,014 INFO L273 TraceCheckUtils]: 46: Hoare triple {23309#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23309#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:39,015 INFO L273 TraceCheckUtils]: 47: Hoare triple {23309#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {23322#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:39,015 INFO L273 TraceCheckUtils]: 48: Hoare triple {23322#(<= main_~k~0 11)} assume true; {23322#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:39,016 INFO L273 TraceCheckUtils]: 49: Hoare triple {23322#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23322#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:39,016 INFO L273 TraceCheckUtils]: 50: Hoare triple {23322#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23322#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:39,017 INFO L273 TraceCheckUtils]: 51: Hoare triple {23322#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {23335#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:39,018 INFO L273 TraceCheckUtils]: 52: Hoare triple {23335#(<= main_~k~0 12)} assume true; {23335#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:39,018 INFO L273 TraceCheckUtils]: 53: Hoare triple {23335#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23335#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:39,019 INFO L273 TraceCheckUtils]: 54: Hoare triple {23335#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23335#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:39,019 INFO L273 TraceCheckUtils]: 55: Hoare triple {23335#(<= main_~k~0 12)} ~k~0 := ~k~0 + 1; {23348#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:39,020 INFO L273 TraceCheckUtils]: 56: Hoare triple {23348#(<= main_~k~0 13)} assume true; {23348#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:39,020 INFO L273 TraceCheckUtils]: 57: Hoare triple {23348#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23348#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:39,021 INFO L273 TraceCheckUtils]: 58: Hoare triple {23348#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23348#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:39,022 INFO L273 TraceCheckUtils]: 59: Hoare triple {23348#(<= main_~k~0 13)} ~k~0 := ~k~0 + 1; {23361#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:39,022 INFO L273 TraceCheckUtils]: 60: Hoare triple {23361#(<= main_~k~0 14)} assume true; {23361#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:39,023 INFO L273 TraceCheckUtils]: 61: Hoare triple {23361#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23361#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:39,023 INFO L273 TraceCheckUtils]: 62: Hoare triple {23361#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23361#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:39,024 INFO L273 TraceCheckUtils]: 63: Hoare triple {23361#(<= main_~k~0 14)} ~k~0 := ~k~0 + 1; {23374#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:39,024 INFO L273 TraceCheckUtils]: 64: Hoare triple {23374#(<= main_~k~0 15)} assume true; {23374#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:39,025 INFO L273 TraceCheckUtils]: 65: Hoare triple {23374#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23374#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:39,025 INFO L273 TraceCheckUtils]: 66: Hoare triple {23374#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23374#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:39,026 INFO L273 TraceCheckUtils]: 67: Hoare triple {23374#(<= main_~k~0 15)} ~k~0 := ~k~0 + 1; {23387#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:39,026 INFO L273 TraceCheckUtils]: 68: Hoare triple {23387#(<= main_~k~0 16)} assume true; {23387#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:39,027 INFO L273 TraceCheckUtils]: 69: Hoare triple {23387#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23387#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:39,027 INFO L273 TraceCheckUtils]: 70: Hoare triple {23387#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23387#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:39,028 INFO L273 TraceCheckUtils]: 71: Hoare triple {23387#(<= main_~k~0 16)} ~k~0 := ~k~0 + 1; {23400#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:39,029 INFO L273 TraceCheckUtils]: 72: Hoare triple {23400#(<= main_~k~0 17)} assume true; {23400#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:39,029 INFO L273 TraceCheckUtils]: 73: Hoare triple {23400#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {23400#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:39,029 INFO L273 TraceCheckUtils]: 74: Hoare triple {23400#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23400#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:39,030 INFO L273 TraceCheckUtils]: 75: Hoare triple {23400#(<= main_~k~0 17)} ~k~0 := ~k~0 + 1; {23413#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:39,031 INFO L273 TraceCheckUtils]: 76: Hoare triple {23413#(<= main_~k~0 18)} assume true; {23413#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:39,031 INFO L273 TraceCheckUtils]: 77: Hoare triple {23413#(<= main_~k~0 18)} assume !(~k~0 < 100000); {23147#false} is VALID [2018-11-14 16:51:39,032 INFO L273 TraceCheckUtils]: 78: Hoare triple {23147#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23147#false} is VALID [2018-11-14 16:51:39,032 INFO L273 TraceCheckUtils]: 79: Hoare triple {23147#false} ~x~0 := 0; {23147#false} is VALID [2018-11-14 16:51:39,032 INFO L273 TraceCheckUtils]: 80: Hoare triple {23147#false} assume true; {23147#false} is VALID [2018-11-14 16:51:39,032 INFO L273 TraceCheckUtils]: 81: Hoare triple {23147#false} assume !(~x~0 < ~i~0); {23147#false} is VALID [2018-11-14 16:51:39,032 INFO L273 TraceCheckUtils]: 82: Hoare triple {23147#false} ~x~0 := 0; {23147#false} is VALID [2018-11-14 16:51:39,032 INFO L273 TraceCheckUtils]: 83: Hoare triple {23147#false} assume true; {23147#false} is VALID [2018-11-14 16:51:39,033 INFO L273 TraceCheckUtils]: 84: Hoare triple {23147#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23147#false} is VALID [2018-11-14 16:51:39,033 INFO L256 TraceCheckUtils]: 85: Hoare triple {23147#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23147#false} is VALID [2018-11-14 16:51:39,033 INFO L273 TraceCheckUtils]: 86: Hoare triple {23147#false} ~cond := #in~cond; {23147#false} is VALID [2018-11-14 16:51:39,033 INFO L273 TraceCheckUtils]: 87: Hoare triple {23147#false} assume !(~cond == 0); {23147#false} is VALID [2018-11-14 16:51:39,033 INFO L273 TraceCheckUtils]: 88: Hoare triple {23147#false} assume true; {23147#false} is VALID [2018-11-14 16:51:39,034 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {23147#false} {23147#false} #143#return; {23147#false} is VALID [2018-11-14 16:51:39,034 INFO L273 TraceCheckUtils]: 90: Hoare triple {23147#false} havoc #t~mem9;havoc #t~mem10; {23147#false} is VALID [2018-11-14 16:51:39,034 INFO L273 TraceCheckUtils]: 91: Hoare triple {23147#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {23147#false} is VALID [2018-11-14 16:51:39,034 INFO L273 TraceCheckUtils]: 92: Hoare triple {23147#false} assume true; {23147#false} is VALID [2018-11-14 16:51:39,034 INFO L273 TraceCheckUtils]: 93: Hoare triple {23147#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23147#false} is VALID [2018-11-14 16:51:39,034 INFO L256 TraceCheckUtils]: 94: Hoare triple {23147#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23147#false} is VALID [2018-11-14 16:51:39,035 INFO L273 TraceCheckUtils]: 95: Hoare triple {23147#false} ~cond := #in~cond; {23147#false} is VALID [2018-11-14 16:51:39,035 INFO L273 TraceCheckUtils]: 96: Hoare triple {23147#false} assume ~cond == 0; {23147#false} is VALID [2018-11-14 16:51:39,035 INFO L273 TraceCheckUtils]: 97: Hoare triple {23147#false} assume !false; {23147#false} is VALID [2018-11-14 16:51:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:39,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:39,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-11-14 16:51:39,062 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 98 [2018-11-14 16:51:39,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:39,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-14 16:51:39,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:39,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-14 16:51:39,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-14 16:51:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=969, Unknown=0, NotChecked=0, Total=1560 [2018-11-14 16:51:39,238 INFO L87 Difference]: Start difference. First operand 298 states and 389 transitions. Second operand 40 states. [2018-11-14 16:51:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:40,199 INFO L93 Difference]: Finished difference Result 469 states and 624 transitions. [2018-11-14 16:51:40,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 16:51:40,199 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 98 [2018-11-14 16:51:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 16:51:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 215 transitions. [2018-11-14 16:51:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 16:51:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 215 transitions. [2018-11-14 16:51:40,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 215 transitions. [2018-11-14 16:51:40,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:40,440 INFO L225 Difference]: With dead ends: 469 [2018-11-14 16:51:40,440 INFO L226 Difference]: Without dead ends: 316 [2018-11-14 16:51:40,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=591, Invalid=969, Unknown=0, NotChecked=0, Total=1560 [2018-11-14 16:51:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-11-14 16:51:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 306. [2018-11-14 16:51:40,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:40,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand 306 states. [2018-11-14 16:51:40,722 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand 306 states. [2018-11-14 16:51:40,722 INFO L87 Difference]: Start difference. First operand 316 states. Second operand 306 states. [2018-11-14 16:51:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:40,729 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2018-11-14 16:51:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 413 transitions. [2018-11-14 16:51:40,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:40,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:40,730 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 316 states. [2018-11-14 16:51:40,730 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 316 states. [2018-11-14 16:51:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:40,736 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2018-11-14 16:51:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 413 transitions. [2018-11-14 16:51:40,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:40,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:40,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:40,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-14 16:51:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 399 transitions. [2018-11-14 16:51:40,742 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 399 transitions. Word has length 98 [2018-11-14 16:51:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:40,743 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 399 transitions. [2018-11-14 16:51:40,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-14 16:51:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 399 transitions. [2018-11-14 16:51:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-14 16:51:40,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:40,743 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:40,744 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:40,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash -467254678, now seen corresponding path program 14 times [2018-11-14 16:51:40,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:40,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:40,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:51:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:41,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {25101#true} call ULTIMATE.init(); {25101#true} is VALID [2018-11-14 16:51:41,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {25101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25101#true} is VALID [2018-11-14 16:51:41,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {25101#true} assume true; {25101#true} is VALID [2018-11-14 16:51:41,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25101#true} {25101#true} #137#return; {25101#true} is VALID [2018-11-14 16:51:41,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {25101#true} call #t~ret15 := main(); {25101#true} is VALID [2018-11-14 16:51:41,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {25101#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {25103#(= main_~i~0 0)} is VALID [2018-11-14 16:51:41,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {25103#(= main_~i~0 0)} assume true; {25103#(= main_~i~0 0)} is VALID [2018-11-14 16:51:41,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {25103#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {25104#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {25104#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {25104#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {25104#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25104#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {25104#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25104#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {25104#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25105#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {25105#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {25105#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {25105#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25105#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {25105#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25105#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {25105#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25106#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {25106#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {25106#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,424 INFO L273 TraceCheckUtils]: 17: Hoare triple {25106#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25106#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {25106#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25106#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {25106#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25107#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,427 INFO L273 TraceCheckUtils]: 20: Hoare triple {25107#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {25107#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,427 INFO L273 TraceCheckUtils]: 21: Hoare triple {25107#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25107#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,428 INFO L273 TraceCheckUtils]: 22: Hoare triple {25107#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25107#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {25107#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25108#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {25108#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {25108#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {25108#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25108#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {25108#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25108#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {25108#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25109#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,433 INFO L273 TraceCheckUtils]: 28: Hoare triple {25109#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {25109#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {25109#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25109#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,435 INFO L273 TraceCheckUtils]: 30: Hoare triple {25109#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25109#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,436 INFO L273 TraceCheckUtils]: 31: Hoare triple {25109#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25110#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,437 INFO L273 TraceCheckUtils]: 32: Hoare triple {25110#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {25110#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,437 INFO L273 TraceCheckUtils]: 33: Hoare triple {25110#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25110#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,438 INFO L273 TraceCheckUtils]: 34: Hoare triple {25110#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25110#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {25110#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25111#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {25111#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {25111#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,440 INFO L273 TraceCheckUtils]: 37: Hoare triple {25111#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25111#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,441 INFO L273 TraceCheckUtils]: 38: Hoare triple {25111#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25111#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,442 INFO L273 TraceCheckUtils]: 39: Hoare triple {25111#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25112#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {25112#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {25112#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {25112#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25112#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {25112#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25112#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,445 INFO L273 TraceCheckUtils]: 43: Hoare triple {25112#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25113#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,446 INFO L273 TraceCheckUtils]: 44: Hoare triple {25113#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {25113#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,447 INFO L273 TraceCheckUtils]: 45: Hoare triple {25113#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25113#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,447 INFO L273 TraceCheckUtils]: 46: Hoare triple {25113#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25113#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,448 INFO L273 TraceCheckUtils]: 47: Hoare triple {25113#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25114#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,449 INFO L273 TraceCheckUtils]: 48: Hoare triple {25114#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {25114#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,450 INFO L273 TraceCheckUtils]: 49: Hoare triple {25114#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25114#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,451 INFO L273 TraceCheckUtils]: 50: Hoare triple {25114#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25114#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,452 INFO L273 TraceCheckUtils]: 51: Hoare triple {25114#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25115#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,452 INFO L273 TraceCheckUtils]: 52: Hoare triple {25115#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {25115#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,453 INFO L273 TraceCheckUtils]: 53: Hoare triple {25115#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25115#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,454 INFO L273 TraceCheckUtils]: 54: Hoare triple {25115#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25115#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,455 INFO L273 TraceCheckUtils]: 55: Hoare triple {25115#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25116#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,456 INFO L273 TraceCheckUtils]: 56: Hoare triple {25116#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume true; {25116#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,456 INFO L273 TraceCheckUtils]: 57: Hoare triple {25116#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25116#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,457 INFO L273 TraceCheckUtils]: 58: Hoare triple {25116#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25116#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,458 INFO L273 TraceCheckUtils]: 59: Hoare triple {25116#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25117#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,459 INFO L273 TraceCheckUtils]: 60: Hoare triple {25117#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume true; {25117#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,460 INFO L273 TraceCheckUtils]: 61: Hoare triple {25117#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25117#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,460 INFO L273 TraceCheckUtils]: 62: Hoare triple {25117#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25117#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,461 INFO L273 TraceCheckUtils]: 63: Hoare triple {25117#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25118#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,462 INFO L273 TraceCheckUtils]: 64: Hoare triple {25118#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume true; {25118#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,463 INFO L273 TraceCheckUtils]: 65: Hoare triple {25118#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25118#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,463 INFO L273 TraceCheckUtils]: 66: Hoare triple {25118#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25118#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,464 INFO L273 TraceCheckUtils]: 67: Hoare triple {25118#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25119#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,465 INFO L273 TraceCheckUtils]: 68: Hoare triple {25119#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume true; {25119#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,466 INFO L273 TraceCheckUtils]: 69: Hoare triple {25119#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25119#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,467 INFO L273 TraceCheckUtils]: 70: Hoare triple {25119#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25119#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,468 INFO L273 TraceCheckUtils]: 71: Hoare triple {25119#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25120#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:41,468 INFO L273 TraceCheckUtils]: 72: Hoare triple {25120#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume true; {25120#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:41,469 INFO L273 TraceCheckUtils]: 73: Hoare triple {25120#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25120#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:41,470 INFO L273 TraceCheckUtils]: 74: Hoare triple {25120#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25120#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:41,471 INFO L273 TraceCheckUtils]: 75: Hoare triple {25120#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := ~k~0 + 1; {25121#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,472 INFO L273 TraceCheckUtils]: 76: Hoare triple {25121#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume true; {25121#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,472 INFO L273 TraceCheckUtils]: 77: Hoare triple {25121#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25121#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,473 INFO L273 TraceCheckUtils]: 78: Hoare triple {25121#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25121#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,474 INFO L273 TraceCheckUtils]: 79: Hoare triple {25121#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {25122#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,475 INFO L273 TraceCheckUtils]: 80: Hoare triple {25122#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume true; {25122#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:41,475 INFO L273 TraceCheckUtils]: 81: Hoare triple {25122#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume !(~k~0 < 100000); {25102#false} is VALID [2018-11-14 16:51:41,476 INFO L273 TraceCheckUtils]: 82: Hoare triple {25102#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25102#false} is VALID [2018-11-14 16:51:41,476 INFO L273 TraceCheckUtils]: 83: Hoare triple {25102#false} ~x~0 := 0; {25102#false} is VALID [2018-11-14 16:51:41,476 INFO L273 TraceCheckUtils]: 84: Hoare triple {25102#false} assume true; {25102#false} is VALID [2018-11-14 16:51:41,476 INFO L273 TraceCheckUtils]: 85: Hoare triple {25102#false} assume !(~x~0 < ~i~0); {25102#false} is VALID [2018-11-14 16:51:41,476 INFO L273 TraceCheckUtils]: 86: Hoare triple {25102#false} ~x~0 := 0; {25102#false} is VALID [2018-11-14 16:51:41,477 INFO L273 TraceCheckUtils]: 87: Hoare triple {25102#false} assume true; {25102#false} is VALID [2018-11-14 16:51:41,477 INFO L273 TraceCheckUtils]: 88: Hoare triple {25102#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25102#false} is VALID [2018-11-14 16:51:41,477 INFO L256 TraceCheckUtils]: 89: Hoare triple {25102#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25101#true} is VALID [2018-11-14 16:51:41,477 INFO L273 TraceCheckUtils]: 90: Hoare triple {25101#true} ~cond := #in~cond; {25101#true} is VALID [2018-11-14 16:51:41,477 INFO L273 TraceCheckUtils]: 91: Hoare triple {25101#true} assume !(~cond == 0); {25101#true} is VALID [2018-11-14 16:51:41,478 INFO L273 TraceCheckUtils]: 92: Hoare triple {25101#true} assume true; {25101#true} is VALID [2018-11-14 16:51:41,478 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {25101#true} {25102#false} #143#return; {25102#false} is VALID [2018-11-14 16:51:41,478 INFO L273 TraceCheckUtils]: 94: Hoare triple {25102#false} havoc #t~mem9;havoc #t~mem10; {25102#false} is VALID [2018-11-14 16:51:41,478 INFO L273 TraceCheckUtils]: 95: Hoare triple {25102#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {25102#false} is VALID [2018-11-14 16:51:41,478 INFO L273 TraceCheckUtils]: 96: Hoare triple {25102#false} assume true; {25102#false} is VALID [2018-11-14 16:51:41,479 INFO L273 TraceCheckUtils]: 97: Hoare triple {25102#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25102#false} is VALID [2018-11-14 16:51:41,479 INFO L256 TraceCheckUtils]: 98: Hoare triple {25102#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25102#false} is VALID [2018-11-14 16:51:41,479 INFO L273 TraceCheckUtils]: 99: Hoare triple {25102#false} ~cond := #in~cond; {25102#false} is VALID [2018-11-14 16:51:41,479 INFO L273 TraceCheckUtils]: 100: Hoare triple {25102#false} assume ~cond == 0; {25102#false} is VALID [2018-11-14 16:51:41,479 INFO L273 TraceCheckUtils]: 101: Hoare triple {25102#false} assume !false; {25102#false} is VALID [2018-11-14 16:51:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 2 proven. 648 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:41,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:41,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:41,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:51:41,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:51:41,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:41,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:42,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {25101#true} call ULTIMATE.init(); {25101#true} is VALID [2018-11-14 16:51:42,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {25101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25101#true} is VALID [2018-11-14 16:51:42,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {25101#true} assume true; {25101#true} is VALID [2018-11-14 16:51:42,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25101#true} {25101#true} #137#return; {25101#true} is VALID [2018-11-14 16:51:42,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {25101#true} call #t~ret15 := main(); {25101#true} is VALID [2018-11-14 16:51:42,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {25101#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {25141#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:42,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {25141#(<= main_~i~0 0)} assume true; {25141#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:42,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {25141#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {25148#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:42,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {25148#(<= main_~k~0 1)} assume true; {25148#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:42,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {25148#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25148#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:42,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {25148#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25148#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:42,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {25148#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {25161#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:42,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {25161#(<= main_~k~0 2)} assume true; {25161#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:42,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {25161#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25161#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:42,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {25161#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25161#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:42,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {25161#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {25174#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:42,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {25174#(<= main_~k~0 3)} assume true; {25174#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:42,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {25174#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25174#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:42,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {25174#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25174#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:42,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {25174#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {25187#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:42,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {25187#(<= main_~k~0 4)} assume true; {25187#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:42,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {25187#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25187#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:42,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {25187#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25187#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:42,743 INFO L273 TraceCheckUtils]: 23: Hoare triple {25187#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {25200#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:42,743 INFO L273 TraceCheckUtils]: 24: Hoare triple {25200#(<= main_~k~0 5)} assume true; {25200#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:42,744 INFO L273 TraceCheckUtils]: 25: Hoare triple {25200#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25200#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:42,744 INFO L273 TraceCheckUtils]: 26: Hoare triple {25200#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25200#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:42,745 INFO L273 TraceCheckUtils]: 27: Hoare triple {25200#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {25213#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:42,746 INFO L273 TraceCheckUtils]: 28: Hoare triple {25213#(<= main_~k~0 6)} assume true; {25213#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:42,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {25213#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25213#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:42,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {25213#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25213#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:42,748 INFO L273 TraceCheckUtils]: 31: Hoare triple {25213#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {25226#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:42,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {25226#(<= main_~k~0 7)} assume true; {25226#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:42,749 INFO L273 TraceCheckUtils]: 33: Hoare triple {25226#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25226#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:42,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {25226#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25226#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:42,750 INFO L273 TraceCheckUtils]: 35: Hoare triple {25226#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {25239#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:42,751 INFO L273 TraceCheckUtils]: 36: Hoare triple {25239#(<= main_~k~0 8)} assume true; {25239#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:42,751 INFO L273 TraceCheckUtils]: 37: Hoare triple {25239#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25239#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:42,752 INFO L273 TraceCheckUtils]: 38: Hoare triple {25239#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25239#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:42,753 INFO L273 TraceCheckUtils]: 39: Hoare triple {25239#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {25252#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:42,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {25252#(<= main_~k~0 9)} assume true; {25252#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:42,754 INFO L273 TraceCheckUtils]: 41: Hoare triple {25252#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25252#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:42,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {25252#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25252#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:42,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {25252#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {25265#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:42,756 INFO L273 TraceCheckUtils]: 44: Hoare triple {25265#(<= main_~k~0 10)} assume true; {25265#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:42,756 INFO L273 TraceCheckUtils]: 45: Hoare triple {25265#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25265#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:42,757 INFO L273 TraceCheckUtils]: 46: Hoare triple {25265#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25265#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:42,758 INFO L273 TraceCheckUtils]: 47: Hoare triple {25265#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {25278#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:42,758 INFO L273 TraceCheckUtils]: 48: Hoare triple {25278#(<= main_~k~0 11)} assume true; {25278#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:42,759 INFO L273 TraceCheckUtils]: 49: Hoare triple {25278#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25278#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:42,759 INFO L273 TraceCheckUtils]: 50: Hoare triple {25278#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25278#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:42,760 INFO L273 TraceCheckUtils]: 51: Hoare triple {25278#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {25291#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:42,761 INFO L273 TraceCheckUtils]: 52: Hoare triple {25291#(<= main_~k~0 12)} assume true; {25291#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:42,761 INFO L273 TraceCheckUtils]: 53: Hoare triple {25291#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25291#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:42,762 INFO L273 TraceCheckUtils]: 54: Hoare triple {25291#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25291#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:42,763 INFO L273 TraceCheckUtils]: 55: Hoare triple {25291#(<= main_~k~0 12)} ~k~0 := ~k~0 + 1; {25304#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:42,763 INFO L273 TraceCheckUtils]: 56: Hoare triple {25304#(<= main_~k~0 13)} assume true; {25304#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:42,764 INFO L273 TraceCheckUtils]: 57: Hoare triple {25304#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25304#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:42,764 INFO L273 TraceCheckUtils]: 58: Hoare triple {25304#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25304#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:42,765 INFO L273 TraceCheckUtils]: 59: Hoare triple {25304#(<= main_~k~0 13)} ~k~0 := ~k~0 + 1; {25317#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:42,766 INFO L273 TraceCheckUtils]: 60: Hoare triple {25317#(<= main_~k~0 14)} assume true; {25317#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:42,766 INFO L273 TraceCheckUtils]: 61: Hoare triple {25317#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25317#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:42,767 INFO L273 TraceCheckUtils]: 62: Hoare triple {25317#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25317#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:42,767 INFO L273 TraceCheckUtils]: 63: Hoare triple {25317#(<= main_~k~0 14)} ~k~0 := ~k~0 + 1; {25330#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:42,768 INFO L273 TraceCheckUtils]: 64: Hoare triple {25330#(<= main_~k~0 15)} assume true; {25330#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:42,769 INFO L273 TraceCheckUtils]: 65: Hoare triple {25330#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25330#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:42,769 INFO L273 TraceCheckUtils]: 66: Hoare triple {25330#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25330#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:42,770 INFO L273 TraceCheckUtils]: 67: Hoare triple {25330#(<= main_~k~0 15)} ~k~0 := ~k~0 + 1; {25343#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:42,771 INFO L273 TraceCheckUtils]: 68: Hoare triple {25343#(<= main_~k~0 16)} assume true; {25343#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:42,771 INFO L273 TraceCheckUtils]: 69: Hoare triple {25343#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25343#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:42,772 INFO L273 TraceCheckUtils]: 70: Hoare triple {25343#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25343#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:42,772 INFO L273 TraceCheckUtils]: 71: Hoare triple {25343#(<= main_~k~0 16)} ~k~0 := ~k~0 + 1; {25356#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:42,773 INFO L273 TraceCheckUtils]: 72: Hoare triple {25356#(<= main_~k~0 17)} assume true; {25356#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:42,774 INFO L273 TraceCheckUtils]: 73: Hoare triple {25356#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25356#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:42,774 INFO L273 TraceCheckUtils]: 74: Hoare triple {25356#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25356#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:42,775 INFO L273 TraceCheckUtils]: 75: Hoare triple {25356#(<= main_~k~0 17)} ~k~0 := ~k~0 + 1; {25369#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:42,775 INFO L273 TraceCheckUtils]: 76: Hoare triple {25369#(<= main_~k~0 18)} assume true; {25369#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:42,776 INFO L273 TraceCheckUtils]: 77: Hoare triple {25369#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {25369#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:42,777 INFO L273 TraceCheckUtils]: 78: Hoare triple {25369#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25369#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:42,777 INFO L273 TraceCheckUtils]: 79: Hoare triple {25369#(<= main_~k~0 18)} ~k~0 := ~k~0 + 1; {25382#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:42,778 INFO L273 TraceCheckUtils]: 80: Hoare triple {25382#(<= main_~k~0 19)} assume true; {25382#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:42,779 INFO L273 TraceCheckUtils]: 81: Hoare triple {25382#(<= main_~k~0 19)} assume !(~k~0 < 100000); {25102#false} is VALID [2018-11-14 16:51:42,779 INFO L273 TraceCheckUtils]: 82: Hoare triple {25102#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25102#false} is VALID [2018-11-14 16:51:42,779 INFO L273 TraceCheckUtils]: 83: Hoare triple {25102#false} ~x~0 := 0; {25102#false} is VALID [2018-11-14 16:51:42,779 INFO L273 TraceCheckUtils]: 84: Hoare triple {25102#false} assume true; {25102#false} is VALID [2018-11-14 16:51:42,780 INFO L273 TraceCheckUtils]: 85: Hoare triple {25102#false} assume !(~x~0 < ~i~0); {25102#false} is VALID [2018-11-14 16:51:42,780 INFO L273 TraceCheckUtils]: 86: Hoare triple {25102#false} ~x~0 := 0; {25102#false} is VALID [2018-11-14 16:51:42,780 INFO L273 TraceCheckUtils]: 87: Hoare triple {25102#false} assume true; {25102#false} is VALID [2018-11-14 16:51:42,780 INFO L273 TraceCheckUtils]: 88: Hoare triple {25102#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25102#false} is VALID [2018-11-14 16:51:42,781 INFO L256 TraceCheckUtils]: 89: Hoare triple {25102#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25102#false} is VALID [2018-11-14 16:51:42,781 INFO L273 TraceCheckUtils]: 90: Hoare triple {25102#false} ~cond := #in~cond; {25102#false} is VALID [2018-11-14 16:51:42,781 INFO L273 TraceCheckUtils]: 91: Hoare triple {25102#false} assume !(~cond == 0); {25102#false} is VALID [2018-11-14 16:51:42,781 INFO L273 TraceCheckUtils]: 92: Hoare triple {25102#false} assume true; {25102#false} is VALID [2018-11-14 16:51:42,781 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {25102#false} {25102#false} #143#return; {25102#false} is VALID [2018-11-14 16:51:42,781 INFO L273 TraceCheckUtils]: 94: Hoare triple {25102#false} havoc #t~mem9;havoc #t~mem10; {25102#false} is VALID [2018-11-14 16:51:42,782 INFO L273 TraceCheckUtils]: 95: Hoare triple {25102#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {25102#false} is VALID [2018-11-14 16:51:42,782 INFO L273 TraceCheckUtils]: 96: Hoare triple {25102#false} assume true; {25102#false} is VALID [2018-11-14 16:51:42,782 INFO L273 TraceCheckUtils]: 97: Hoare triple {25102#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25102#false} is VALID [2018-11-14 16:51:42,782 INFO L256 TraceCheckUtils]: 98: Hoare triple {25102#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25102#false} is VALID [2018-11-14 16:51:42,782 INFO L273 TraceCheckUtils]: 99: Hoare triple {25102#false} ~cond := #in~cond; {25102#false} is VALID [2018-11-14 16:51:42,782 INFO L273 TraceCheckUtils]: 100: Hoare triple {25102#false} assume ~cond == 0; {25102#false} is VALID [2018-11-14 16:51:42,782 INFO L273 TraceCheckUtils]: 101: Hoare triple {25102#false} assume !false; {25102#false} is VALID [2018-11-14 16:51:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:42,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:42,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-11-14 16:51:42,811 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 102 [2018-11-14 16:51:42,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:42,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-14 16:51:43,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:43,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-14 16:51:43,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-14 16:51:43,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=1070, Unknown=0, NotChecked=0, Total=1722 [2018-11-14 16:51:43,028 INFO L87 Difference]: Start difference. First operand 306 states and 399 transitions. Second operand 42 states. [2018-11-14 16:51:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:44,087 INFO L93 Difference]: Finished difference Result 477 states and 634 transitions. [2018-11-14 16:51:44,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 16:51:44,088 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 102 [2018-11-14 16:51:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 16:51:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 220 transitions. [2018-11-14 16:51:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 16:51:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 220 transitions. [2018-11-14 16:51:44,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 220 transitions. [2018-11-14 16:51:44,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:44,312 INFO L225 Difference]: With dead ends: 477 [2018-11-14 16:51:44,313 INFO L226 Difference]: Without dead ends: 324 [2018-11-14 16:51:44,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=652, Invalid=1070, Unknown=0, NotChecked=0, Total=1722 [2018-11-14 16:51:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-11-14 16:51:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 314. [2018-11-14 16:51:44,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:44,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 324 states. Second operand 314 states. [2018-11-14 16:51:44,546 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand 314 states. [2018-11-14 16:51:44,546 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 314 states. [2018-11-14 16:51:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:44,554 INFO L93 Difference]: Finished difference Result 324 states and 423 transitions. [2018-11-14 16:51:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 423 transitions. [2018-11-14 16:51:44,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:44,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:44,555 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand 324 states. [2018-11-14 16:51:44,555 INFO L87 Difference]: Start difference. First operand 314 states. Second operand 324 states. [2018-11-14 16:51:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:44,563 INFO L93 Difference]: Finished difference Result 324 states and 423 transitions. [2018-11-14 16:51:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 423 transitions. [2018-11-14 16:51:44,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:44,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:44,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:44,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-14 16:51:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 409 transitions. [2018-11-14 16:51:44,573 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 409 transitions. Word has length 102 [2018-11-14 16:51:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:44,573 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 409 transitions. [2018-11-14 16:51:44,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-14 16:51:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 409 transitions. [2018-11-14 16:51:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-14 16:51:44,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:44,575 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:44,575 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:44,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash 623128660, now seen corresponding path program 15 times [2018-11-14 16:51:44,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:44,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:44,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:45,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {27106#true} call ULTIMATE.init(); {27106#true} is VALID [2018-11-14 16:51:45,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {27106#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27106#true} is VALID [2018-11-14 16:51:45,380 INFO L273 TraceCheckUtils]: 2: Hoare triple {27106#true} assume true; {27106#true} is VALID [2018-11-14 16:51:45,380 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27106#true} {27106#true} #137#return; {27106#true} is VALID [2018-11-14 16:51:45,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {27106#true} call #t~ret15 := main(); {27106#true} is VALID [2018-11-14 16:51:45,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {27106#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {27108#(= main_~i~0 0)} is VALID [2018-11-14 16:51:45,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {27108#(= main_~i~0 0)} assume true; {27108#(= main_~i~0 0)} is VALID [2018-11-14 16:51:45,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {27108#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {27109#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {27109#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {27109#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {27109#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27109#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {27109#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27109#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,384 INFO L273 TraceCheckUtils]: 11: Hoare triple {27109#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27110#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {27110#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {27110#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {27110#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27110#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {27110#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27110#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {27110#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27111#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {27111#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {27111#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {27111#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27111#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {27111#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27111#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {27111#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27112#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {27112#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {27112#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,393 INFO L273 TraceCheckUtils]: 21: Hoare triple {27112#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27112#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,393 INFO L273 TraceCheckUtils]: 22: Hoare triple {27112#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27112#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {27112#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27113#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,395 INFO L273 TraceCheckUtils]: 24: Hoare triple {27113#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {27113#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {27113#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27113#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {27113#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27113#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {27113#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27114#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {27114#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {27114#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {27114#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27114#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,401 INFO L273 TraceCheckUtils]: 30: Hoare triple {27114#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27114#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {27114#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27115#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,402 INFO L273 TraceCheckUtils]: 32: Hoare triple {27115#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {27115#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,403 INFO L273 TraceCheckUtils]: 33: Hoare triple {27115#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27115#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,404 INFO L273 TraceCheckUtils]: 34: Hoare triple {27115#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27115#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,405 INFO L273 TraceCheckUtils]: 35: Hoare triple {27115#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27116#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,406 INFO L273 TraceCheckUtils]: 36: Hoare triple {27116#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {27116#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {27116#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27116#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,407 INFO L273 TraceCheckUtils]: 38: Hoare triple {27116#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27116#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {27116#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27117#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {27117#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {27117#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {27117#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27117#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {27117#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27117#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {27117#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27118#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {27118#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {27118#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {27118#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27118#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,414 INFO L273 TraceCheckUtils]: 46: Hoare triple {27118#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27118#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {27118#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27119#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,416 INFO L273 TraceCheckUtils]: 48: Hoare triple {27119#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {27119#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {27119#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27119#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {27119#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27119#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {27119#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27120#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {27120#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {27120#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,421 INFO L273 TraceCheckUtils]: 53: Hoare triple {27120#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27120#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {27120#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27120#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {27120#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27121#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {27121#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume true; {27121#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,424 INFO L273 TraceCheckUtils]: 57: Hoare triple {27121#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27121#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,425 INFO L273 TraceCheckUtils]: 58: Hoare triple {27121#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27121#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,426 INFO L273 TraceCheckUtils]: 59: Hoare triple {27121#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27122#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,427 INFO L273 TraceCheckUtils]: 60: Hoare triple {27122#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume true; {27122#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,427 INFO L273 TraceCheckUtils]: 61: Hoare triple {27122#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27122#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,428 INFO L273 TraceCheckUtils]: 62: Hoare triple {27122#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27122#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {27122#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27123#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,430 INFO L273 TraceCheckUtils]: 64: Hoare triple {27123#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume true; {27123#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,431 INFO L273 TraceCheckUtils]: 65: Hoare triple {27123#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27123#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,432 INFO L273 TraceCheckUtils]: 66: Hoare triple {27123#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27123#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,433 INFO L273 TraceCheckUtils]: 67: Hoare triple {27123#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27124#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,433 INFO L273 TraceCheckUtils]: 68: Hoare triple {27124#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume true; {27124#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,435 INFO L273 TraceCheckUtils]: 69: Hoare triple {27124#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27124#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,435 INFO L273 TraceCheckUtils]: 70: Hoare triple {27124#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27124#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,436 INFO L273 TraceCheckUtils]: 71: Hoare triple {27124#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27125#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:45,437 INFO L273 TraceCheckUtils]: 72: Hoare triple {27125#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume true; {27125#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:45,438 INFO L273 TraceCheckUtils]: 73: Hoare triple {27125#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27125#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:45,439 INFO L273 TraceCheckUtils]: 74: Hoare triple {27125#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27125#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:45,440 INFO L273 TraceCheckUtils]: 75: Hoare triple {27125#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := ~k~0 + 1; {27126#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,441 INFO L273 TraceCheckUtils]: 76: Hoare triple {27126#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume true; {27126#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,441 INFO L273 TraceCheckUtils]: 77: Hoare triple {27126#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27126#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,442 INFO L273 TraceCheckUtils]: 78: Hoare triple {27126#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27126#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,443 INFO L273 TraceCheckUtils]: 79: Hoare triple {27126#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27127#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,444 INFO L273 TraceCheckUtils]: 80: Hoare triple {27127#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume true; {27127#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,445 INFO L273 TraceCheckUtils]: 81: Hoare triple {27127#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27127#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,446 INFO L273 TraceCheckUtils]: 82: Hoare triple {27127#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27127#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,447 INFO L273 TraceCheckUtils]: 83: Hoare triple {27127#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {27128#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,447 INFO L273 TraceCheckUtils]: 84: Hoare triple {27128#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume true; {27128#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:45,448 INFO L273 TraceCheckUtils]: 85: Hoare triple {27128#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume !(~k~0 < 100000); {27107#false} is VALID [2018-11-14 16:51:45,448 INFO L273 TraceCheckUtils]: 86: Hoare triple {27107#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27107#false} is VALID [2018-11-14 16:51:45,449 INFO L273 TraceCheckUtils]: 87: Hoare triple {27107#false} ~x~0 := 0; {27107#false} is VALID [2018-11-14 16:51:45,449 INFO L273 TraceCheckUtils]: 88: Hoare triple {27107#false} assume true; {27107#false} is VALID [2018-11-14 16:51:45,449 INFO L273 TraceCheckUtils]: 89: Hoare triple {27107#false} assume !(~x~0 < ~i~0); {27107#false} is VALID [2018-11-14 16:51:45,449 INFO L273 TraceCheckUtils]: 90: Hoare triple {27107#false} ~x~0 := 0; {27107#false} is VALID [2018-11-14 16:51:45,449 INFO L273 TraceCheckUtils]: 91: Hoare triple {27107#false} assume true; {27107#false} is VALID [2018-11-14 16:51:45,450 INFO L273 TraceCheckUtils]: 92: Hoare triple {27107#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27107#false} is VALID [2018-11-14 16:51:45,450 INFO L256 TraceCheckUtils]: 93: Hoare triple {27107#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {27106#true} is VALID [2018-11-14 16:51:45,450 INFO L273 TraceCheckUtils]: 94: Hoare triple {27106#true} ~cond := #in~cond; {27106#true} is VALID [2018-11-14 16:51:45,450 INFO L273 TraceCheckUtils]: 95: Hoare triple {27106#true} assume !(~cond == 0); {27106#true} is VALID [2018-11-14 16:51:45,450 INFO L273 TraceCheckUtils]: 96: Hoare triple {27106#true} assume true; {27106#true} is VALID [2018-11-14 16:51:45,451 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {27106#true} {27107#false} #143#return; {27107#false} is VALID [2018-11-14 16:51:45,451 INFO L273 TraceCheckUtils]: 98: Hoare triple {27107#false} havoc #t~mem9;havoc #t~mem10; {27107#false} is VALID [2018-11-14 16:51:45,451 INFO L273 TraceCheckUtils]: 99: Hoare triple {27107#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {27107#false} is VALID [2018-11-14 16:51:45,451 INFO L273 TraceCheckUtils]: 100: Hoare triple {27107#false} assume true; {27107#false} is VALID [2018-11-14 16:51:45,452 INFO L273 TraceCheckUtils]: 101: Hoare triple {27107#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27107#false} is VALID [2018-11-14 16:51:45,452 INFO L256 TraceCheckUtils]: 102: Hoare triple {27107#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {27107#false} is VALID [2018-11-14 16:51:45,452 INFO L273 TraceCheckUtils]: 103: Hoare triple {27107#false} ~cond := #in~cond; {27107#false} is VALID [2018-11-14 16:51:45,452 INFO L273 TraceCheckUtils]: 104: Hoare triple {27107#false} assume ~cond == 0; {27107#false} is VALID [2018-11-14 16:51:45,452 INFO L273 TraceCheckUtils]: 105: Hoare triple {27107#false} assume !false; {27107#false} is VALID [2018-11-14 16:51:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 2 proven. 722 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:45,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:45,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:45,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:51:45,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-14 16:51:45,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:45,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:46,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {27106#true} call ULTIMATE.init(); {27106#true} is VALID [2018-11-14 16:51:46,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {27106#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27106#true} is VALID [2018-11-14 16:51:46,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {27106#true} assume true; {27106#true} is VALID [2018-11-14 16:51:46,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27106#true} {27106#true} #137#return; {27106#true} is VALID [2018-11-14 16:51:46,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {27106#true} call #t~ret15 := main(); {27106#true} is VALID [2018-11-14 16:51:46,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {27106#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {27147#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:46,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {27147#(<= main_~i~0 0)} assume true; {27147#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:46,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {27147#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {27154#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:46,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {27154#(<= main_~k~0 1)} assume true; {27154#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:46,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {27154#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27154#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:46,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {27154#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27154#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:46,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {27154#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {27167#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:46,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {27167#(<= main_~k~0 2)} assume true; {27167#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:46,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {27167#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27167#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:46,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {27167#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27167#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:46,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {27167#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {27180#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:46,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {27180#(<= main_~k~0 3)} assume true; {27180#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:46,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {27180#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27180#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:46,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {27180#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27180#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:46,191 INFO L273 TraceCheckUtils]: 19: Hoare triple {27180#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {27193#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:46,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {27193#(<= main_~k~0 4)} assume true; {27193#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:46,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {27193#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27193#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:46,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {27193#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27193#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:46,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {27193#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {27206#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:46,193 INFO L273 TraceCheckUtils]: 24: Hoare triple {27206#(<= main_~k~0 5)} assume true; {27206#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:46,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {27206#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27206#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:46,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {27206#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27206#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:46,195 INFO L273 TraceCheckUtils]: 27: Hoare triple {27206#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {27219#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:46,196 INFO L273 TraceCheckUtils]: 28: Hoare triple {27219#(<= main_~k~0 6)} assume true; {27219#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:46,196 INFO L273 TraceCheckUtils]: 29: Hoare triple {27219#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27219#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:46,197 INFO L273 TraceCheckUtils]: 30: Hoare triple {27219#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27219#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:46,198 INFO L273 TraceCheckUtils]: 31: Hoare triple {27219#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {27232#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:46,198 INFO L273 TraceCheckUtils]: 32: Hoare triple {27232#(<= main_~k~0 7)} assume true; {27232#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:46,199 INFO L273 TraceCheckUtils]: 33: Hoare triple {27232#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27232#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:46,199 INFO L273 TraceCheckUtils]: 34: Hoare triple {27232#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27232#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:46,200 INFO L273 TraceCheckUtils]: 35: Hoare triple {27232#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {27245#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:46,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {27245#(<= main_~k~0 8)} assume true; {27245#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:46,201 INFO L273 TraceCheckUtils]: 37: Hoare triple {27245#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27245#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:46,201 INFO L273 TraceCheckUtils]: 38: Hoare triple {27245#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27245#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:46,202 INFO L273 TraceCheckUtils]: 39: Hoare triple {27245#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {27258#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:46,203 INFO L273 TraceCheckUtils]: 40: Hoare triple {27258#(<= main_~k~0 9)} assume true; {27258#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:46,203 INFO L273 TraceCheckUtils]: 41: Hoare triple {27258#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27258#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:46,204 INFO L273 TraceCheckUtils]: 42: Hoare triple {27258#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27258#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:46,205 INFO L273 TraceCheckUtils]: 43: Hoare triple {27258#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {27271#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:46,205 INFO L273 TraceCheckUtils]: 44: Hoare triple {27271#(<= main_~k~0 10)} assume true; {27271#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:46,206 INFO L273 TraceCheckUtils]: 45: Hoare triple {27271#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27271#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:46,206 INFO L273 TraceCheckUtils]: 46: Hoare triple {27271#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27271#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:46,207 INFO L273 TraceCheckUtils]: 47: Hoare triple {27271#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {27284#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:46,207 INFO L273 TraceCheckUtils]: 48: Hoare triple {27284#(<= main_~k~0 11)} assume true; {27284#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:46,208 INFO L273 TraceCheckUtils]: 49: Hoare triple {27284#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27284#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:46,209 INFO L273 TraceCheckUtils]: 50: Hoare triple {27284#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27284#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:46,209 INFO L273 TraceCheckUtils]: 51: Hoare triple {27284#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {27297#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:46,210 INFO L273 TraceCheckUtils]: 52: Hoare triple {27297#(<= main_~k~0 12)} assume true; {27297#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:46,210 INFO L273 TraceCheckUtils]: 53: Hoare triple {27297#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27297#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:46,211 INFO L273 TraceCheckUtils]: 54: Hoare triple {27297#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27297#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:46,212 INFO L273 TraceCheckUtils]: 55: Hoare triple {27297#(<= main_~k~0 12)} ~k~0 := ~k~0 + 1; {27310#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:46,212 INFO L273 TraceCheckUtils]: 56: Hoare triple {27310#(<= main_~k~0 13)} assume true; {27310#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:46,213 INFO L273 TraceCheckUtils]: 57: Hoare triple {27310#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27310#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:46,213 INFO L273 TraceCheckUtils]: 58: Hoare triple {27310#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27310#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:46,214 INFO L273 TraceCheckUtils]: 59: Hoare triple {27310#(<= main_~k~0 13)} ~k~0 := ~k~0 + 1; {27323#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:46,215 INFO L273 TraceCheckUtils]: 60: Hoare triple {27323#(<= main_~k~0 14)} assume true; {27323#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:46,215 INFO L273 TraceCheckUtils]: 61: Hoare triple {27323#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27323#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:46,216 INFO L273 TraceCheckUtils]: 62: Hoare triple {27323#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27323#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:46,217 INFO L273 TraceCheckUtils]: 63: Hoare triple {27323#(<= main_~k~0 14)} ~k~0 := ~k~0 + 1; {27336#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:46,217 INFO L273 TraceCheckUtils]: 64: Hoare triple {27336#(<= main_~k~0 15)} assume true; {27336#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:46,218 INFO L273 TraceCheckUtils]: 65: Hoare triple {27336#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27336#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:46,218 INFO L273 TraceCheckUtils]: 66: Hoare triple {27336#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27336#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:46,219 INFO L273 TraceCheckUtils]: 67: Hoare triple {27336#(<= main_~k~0 15)} ~k~0 := ~k~0 + 1; {27349#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:46,220 INFO L273 TraceCheckUtils]: 68: Hoare triple {27349#(<= main_~k~0 16)} assume true; {27349#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:46,220 INFO L273 TraceCheckUtils]: 69: Hoare triple {27349#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27349#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:46,221 INFO L273 TraceCheckUtils]: 70: Hoare triple {27349#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27349#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:46,221 INFO L273 TraceCheckUtils]: 71: Hoare triple {27349#(<= main_~k~0 16)} ~k~0 := ~k~0 + 1; {27362#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:46,222 INFO L273 TraceCheckUtils]: 72: Hoare triple {27362#(<= main_~k~0 17)} assume true; {27362#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:46,223 INFO L273 TraceCheckUtils]: 73: Hoare triple {27362#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27362#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:46,223 INFO L273 TraceCheckUtils]: 74: Hoare triple {27362#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27362#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:46,231 INFO L273 TraceCheckUtils]: 75: Hoare triple {27362#(<= main_~k~0 17)} ~k~0 := ~k~0 + 1; {27375#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:46,231 INFO L273 TraceCheckUtils]: 76: Hoare triple {27375#(<= main_~k~0 18)} assume true; {27375#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:46,232 INFO L273 TraceCheckUtils]: 77: Hoare triple {27375#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27375#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:46,232 INFO L273 TraceCheckUtils]: 78: Hoare triple {27375#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27375#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:46,233 INFO L273 TraceCheckUtils]: 79: Hoare triple {27375#(<= main_~k~0 18)} ~k~0 := ~k~0 + 1; {27388#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:46,233 INFO L273 TraceCheckUtils]: 80: Hoare triple {27388#(<= main_~k~0 19)} assume true; {27388#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:46,233 INFO L273 TraceCheckUtils]: 81: Hoare triple {27388#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {27388#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:46,234 INFO L273 TraceCheckUtils]: 82: Hoare triple {27388#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27388#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:46,234 INFO L273 TraceCheckUtils]: 83: Hoare triple {27388#(<= main_~k~0 19)} ~k~0 := ~k~0 + 1; {27401#(<= main_~k~0 20)} is VALID [2018-11-14 16:51:46,234 INFO L273 TraceCheckUtils]: 84: Hoare triple {27401#(<= main_~k~0 20)} assume true; {27401#(<= main_~k~0 20)} is VALID [2018-11-14 16:51:46,235 INFO L273 TraceCheckUtils]: 85: Hoare triple {27401#(<= main_~k~0 20)} assume !(~k~0 < 100000); {27107#false} is VALID [2018-11-14 16:51:46,235 INFO L273 TraceCheckUtils]: 86: Hoare triple {27107#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27107#false} is VALID [2018-11-14 16:51:46,235 INFO L273 TraceCheckUtils]: 87: Hoare triple {27107#false} ~x~0 := 0; {27107#false} is VALID [2018-11-14 16:51:46,235 INFO L273 TraceCheckUtils]: 88: Hoare triple {27107#false} assume true; {27107#false} is VALID [2018-11-14 16:51:46,235 INFO L273 TraceCheckUtils]: 89: Hoare triple {27107#false} assume !(~x~0 < ~i~0); {27107#false} is VALID [2018-11-14 16:51:46,235 INFO L273 TraceCheckUtils]: 90: Hoare triple {27107#false} ~x~0 := 0; {27107#false} is VALID [2018-11-14 16:51:46,236 INFO L273 TraceCheckUtils]: 91: Hoare triple {27107#false} assume true; {27107#false} is VALID [2018-11-14 16:51:46,236 INFO L273 TraceCheckUtils]: 92: Hoare triple {27107#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27107#false} is VALID [2018-11-14 16:51:46,236 INFO L256 TraceCheckUtils]: 93: Hoare triple {27107#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {27107#false} is VALID [2018-11-14 16:51:46,236 INFO L273 TraceCheckUtils]: 94: Hoare triple {27107#false} ~cond := #in~cond; {27107#false} is VALID [2018-11-14 16:51:46,236 INFO L273 TraceCheckUtils]: 95: Hoare triple {27107#false} assume !(~cond == 0); {27107#false} is VALID [2018-11-14 16:51:46,237 INFO L273 TraceCheckUtils]: 96: Hoare triple {27107#false} assume true; {27107#false} is VALID [2018-11-14 16:51:46,237 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {27107#false} {27107#false} #143#return; {27107#false} is VALID [2018-11-14 16:51:46,237 INFO L273 TraceCheckUtils]: 98: Hoare triple {27107#false} havoc #t~mem9;havoc #t~mem10; {27107#false} is VALID [2018-11-14 16:51:46,237 INFO L273 TraceCheckUtils]: 99: Hoare triple {27107#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {27107#false} is VALID [2018-11-14 16:51:46,237 INFO L273 TraceCheckUtils]: 100: Hoare triple {27107#false} assume true; {27107#false} is VALID [2018-11-14 16:51:46,238 INFO L273 TraceCheckUtils]: 101: Hoare triple {27107#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27107#false} is VALID [2018-11-14 16:51:46,238 INFO L256 TraceCheckUtils]: 102: Hoare triple {27107#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {27107#false} is VALID [2018-11-14 16:51:46,238 INFO L273 TraceCheckUtils]: 103: Hoare triple {27107#false} ~cond := #in~cond; {27107#false} is VALID [2018-11-14 16:51:46,238 INFO L273 TraceCheckUtils]: 104: Hoare triple {27107#false} assume ~cond == 0; {27107#false} is VALID [2018-11-14 16:51:46,239 INFO L273 TraceCheckUtils]: 105: Hoare triple {27107#false} assume !false; {27107#false} is VALID [2018-11-14 16:51:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:46,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:46,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-11-14 16:51:46,275 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 106 [2018-11-14 16:51:46,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:46,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-14 16:51:46,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:46,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-14 16:51:46,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-14 16:51:46,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=716, Invalid=1176, Unknown=0, NotChecked=0, Total=1892 [2018-11-14 16:51:46,474 INFO L87 Difference]: Start difference. First operand 314 states and 409 transitions. Second operand 44 states. [2018-11-14 16:51:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:47,638 INFO L93 Difference]: Finished difference Result 485 states and 644 transitions. [2018-11-14 16:51:47,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 16:51:47,638 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 106 [2018-11-14 16:51:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:51:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 225 transitions. [2018-11-14 16:51:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:51:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 225 transitions. [2018-11-14 16:51:47,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 225 transitions. [2018-11-14 16:51:47,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:47,970 INFO L225 Difference]: With dead ends: 485 [2018-11-14 16:51:47,970 INFO L226 Difference]: Without dead ends: 332 [2018-11-14 16:51:47,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=716, Invalid=1176, Unknown=0, NotChecked=0, Total=1892 [2018-11-14 16:51:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-11-14 16:51:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 322. [2018-11-14 16:51:48,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:48,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 332 states. Second operand 322 states. [2018-11-14 16:51:48,268 INFO L74 IsIncluded]: Start isIncluded. First operand 332 states. Second operand 322 states. [2018-11-14 16:51:48,269 INFO L87 Difference]: Start difference. First operand 332 states. Second operand 322 states. [2018-11-14 16:51:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:48,276 INFO L93 Difference]: Finished difference Result 332 states and 433 transitions. [2018-11-14 16:51:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 433 transitions. [2018-11-14 16:51:48,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:48,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:48,276 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand 332 states. [2018-11-14 16:51:48,277 INFO L87 Difference]: Start difference. First operand 322 states. Second operand 332 states. [2018-11-14 16:51:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:48,284 INFO L93 Difference]: Finished difference Result 332 states and 433 transitions. [2018-11-14 16:51:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 433 transitions. [2018-11-14 16:51:48,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:48,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:48,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:48,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-11-14 16:51:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 419 transitions. [2018-11-14 16:51:48,293 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 419 transitions. Word has length 106 [2018-11-14 16:51:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:48,293 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 419 transitions. [2018-11-14 16:51:48,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-14 16:51:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 419 transitions. [2018-11-14 16:51:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-14 16:51:48,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:48,294 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:48,295 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:48,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:48,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1203431106, now seen corresponding path program 16 times [2018-11-14 16:51:48,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:48,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:48,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:48,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:48,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:49,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {29161#true} call ULTIMATE.init(); {29161#true} is VALID [2018-11-14 16:51:49,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {29161#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29161#true} is VALID [2018-11-14 16:51:49,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {29161#true} assume true; {29161#true} is VALID [2018-11-14 16:51:49,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29161#true} {29161#true} #137#return; {29161#true} is VALID [2018-11-14 16:51:49,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {29161#true} call #t~ret15 := main(); {29161#true} is VALID [2018-11-14 16:51:49,088 INFO L273 TraceCheckUtils]: 5: Hoare triple {29161#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {29163#(= main_~i~0 0)} is VALID [2018-11-14 16:51:49,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {29163#(= main_~i~0 0)} assume true; {29163#(= main_~i~0 0)} is VALID [2018-11-14 16:51:49,089 INFO L273 TraceCheckUtils]: 7: Hoare triple {29163#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {29164#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {29164#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {29164#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {29164#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29164#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {29164#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29164#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {29164#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29165#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {29165#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {29165#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {29165#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29165#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {29165#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29165#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {29165#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29166#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {29166#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {29166#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {29166#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29166#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {29166#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29166#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {29166#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29167#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {29167#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {29167#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {29167#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29167#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {29167#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29167#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {29167#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29168#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,100 INFO L273 TraceCheckUtils]: 24: Hoare triple {29168#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {29168#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {29168#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29168#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {29168#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29168#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {29168#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29169#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {29169#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {29169#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,104 INFO L273 TraceCheckUtils]: 29: Hoare triple {29169#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29169#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,105 INFO L273 TraceCheckUtils]: 30: Hoare triple {29169#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29169#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {29169#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29170#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,108 INFO L273 TraceCheckUtils]: 32: Hoare triple {29170#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {29170#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {29170#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29170#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,109 INFO L273 TraceCheckUtils]: 34: Hoare triple {29170#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29170#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {29170#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29171#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,111 INFO L273 TraceCheckUtils]: 36: Hoare triple {29171#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {29171#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {29171#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29171#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,112 INFO L273 TraceCheckUtils]: 38: Hoare triple {29171#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29171#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,113 INFO L273 TraceCheckUtils]: 39: Hoare triple {29171#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29172#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,114 INFO L273 TraceCheckUtils]: 40: Hoare triple {29172#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {29172#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,114 INFO L273 TraceCheckUtils]: 41: Hoare triple {29172#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29172#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,115 INFO L273 TraceCheckUtils]: 42: Hoare triple {29172#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29172#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,116 INFO L273 TraceCheckUtils]: 43: Hoare triple {29172#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29173#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,117 INFO L273 TraceCheckUtils]: 44: Hoare triple {29173#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {29173#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,118 INFO L273 TraceCheckUtils]: 45: Hoare triple {29173#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29173#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,118 INFO L273 TraceCheckUtils]: 46: Hoare triple {29173#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29173#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,119 INFO L273 TraceCheckUtils]: 47: Hoare triple {29173#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29174#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,120 INFO L273 TraceCheckUtils]: 48: Hoare triple {29174#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {29174#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,121 INFO L273 TraceCheckUtils]: 49: Hoare triple {29174#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29174#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,122 INFO L273 TraceCheckUtils]: 50: Hoare triple {29174#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29174#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,123 INFO L273 TraceCheckUtils]: 51: Hoare triple {29174#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29175#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,123 INFO L273 TraceCheckUtils]: 52: Hoare triple {29175#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {29175#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,124 INFO L273 TraceCheckUtils]: 53: Hoare triple {29175#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29175#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,125 INFO L273 TraceCheckUtils]: 54: Hoare triple {29175#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29175#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,126 INFO L273 TraceCheckUtils]: 55: Hoare triple {29175#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29176#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {29176#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume true; {29176#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,128 INFO L273 TraceCheckUtils]: 57: Hoare triple {29176#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29176#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,128 INFO L273 TraceCheckUtils]: 58: Hoare triple {29176#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29176#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,129 INFO L273 TraceCheckUtils]: 59: Hoare triple {29176#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29177#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,130 INFO L273 TraceCheckUtils]: 60: Hoare triple {29177#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume true; {29177#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,131 INFO L273 TraceCheckUtils]: 61: Hoare triple {29177#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29177#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,131 INFO L273 TraceCheckUtils]: 62: Hoare triple {29177#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29177#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,132 INFO L273 TraceCheckUtils]: 63: Hoare triple {29177#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29178#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,133 INFO L273 TraceCheckUtils]: 64: Hoare triple {29178#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume true; {29178#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,134 INFO L273 TraceCheckUtils]: 65: Hoare triple {29178#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29178#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,135 INFO L273 TraceCheckUtils]: 66: Hoare triple {29178#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29178#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,135 INFO L273 TraceCheckUtils]: 67: Hoare triple {29178#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29179#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,136 INFO L273 TraceCheckUtils]: 68: Hoare triple {29179#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume true; {29179#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,137 INFO L273 TraceCheckUtils]: 69: Hoare triple {29179#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29179#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,138 INFO L273 TraceCheckUtils]: 70: Hoare triple {29179#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29179#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,139 INFO L273 TraceCheckUtils]: 71: Hoare triple {29179#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29180#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:49,140 INFO L273 TraceCheckUtils]: 72: Hoare triple {29180#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume true; {29180#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:49,140 INFO L273 TraceCheckUtils]: 73: Hoare triple {29180#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29180#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:49,141 INFO L273 TraceCheckUtils]: 74: Hoare triple {29180#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29180#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:49,142 INFO L273 TraceCheckUtils]: 75: Hoare triple {29180#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := ~k~0 + 1; {29181#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,143 INFO L273 TraceCheckUtils]: 76: Hoare triple {29181#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume true; {29181#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,144 INFO L273 TraceCheckUtils]: 77: Hoare triple {29181#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29181#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,144 INFO L273 TraceCheckUtils]: 78: Hoare triple {29181#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29181#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,145 INFO L273 TraceCheckUtils]: 79: Hoare triple {29181#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29182#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,146 INFO L273 TraceCheckUtils]: 80: Hoare triple {29182#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume true; {29182#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,147 INFO L273 TraceCheckUtils]: 81: Hoare triple {29182#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29182#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,147 INFO L273 TraceCheckUtils]: 82: Hoare triple {29182#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29182#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,148 INFO L273 TraceCheckUtils]: 83: Hoare triple {29182#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29183#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,149 INFO L273 TraceCheckUtils]: 84: Hoare triple {29183#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume true; {29183#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,150 INFO L273 TraceCheckUtils]: 85: Hoare triple {29183#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29183#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,151 INFO L273 TraceCheckUtils]: 86: Hoare triple {29183#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29183#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,152 INFO L273 TraceCheckUtils]: 87: Hoare triple {29183#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {29184#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,152 INFO L273 TraceCheckUtils]: 88: Hoare triple {29184#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume true; {29184#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:49,153 INFO L273 TraceCheckUtils]: 89: Hoare triple {29184#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume !(~k~0 < 100000); {29162#false} is VALID [2018-11-14 16:51:49,153 INFO L273 TraceCheckUtils]: 90: Hoare triple {29162#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {29162#false} is VALID [2018-11-14 16:51:49,153 INFO L273 TraceCheckUtils]: 91: Hoare triple {29162#false} ~x~0 := 0; {29162#false} is VALID [2018-11-14 16:51:49,154 INFO L273 TraceCheckUtils]: 92: Hoare triple {29162#false} assume true; {29162#false} is VALID [2018-11-14 16:51:49,154 INFO L273 TraceCheckUtils]: 93: Hoare triple {29162#false} assume !(~x~0 < ~i~0); {29162#false} is VALID [2018-11-14 16:51:49,154 INFO L273 TraceCheckUtils]: 94: Hoare triple {29162#false} ~x~0 := 0; {29162#false} is VALID [2018-11-14 16:51:49,154 INFO L273 TraceCheckUtils]: 95: Hoare triple {29162#false} assume true; {29162#false} is VALID [2018-11-14 16:51:49,155 INFO L273 TraceCheckUtils]: 96: Hoare triple {29162#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {29162#false} is VALID [2018-11-14 16:51:49,155 INFO L256 TraceCheckUtils]: 97: Hoare triple {29162#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29161#true} is VALID [2018-11-14 16:51:49,155 INFO L273 TraceCheckUtils]: 98: Hoare triple {29161#true} ~cond := #in~cond; {29161#true} is VALID [2018-11-14 16:51:49,155 INFO L273 TraceCheckUtils]: 99: Hoare triple {29161#true} assume !(~cond == 0); {29161#true} is VALID [2018-11-14 16:51:49,156 INFO L273 TraceCheckUtils]: 100: Hoare triple {29161#true} assume true; {29161#true} is VALID [2018-11-14 16:51:49,156 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {29161#true} {29162#false} #143#return; {29162#false} is VALID [2018-11-14 16:51:49,156 INFO L273 TraceCheckUtils]: 102: Hoare triple {29162#false} havoc #t~mem9;havoc #t~mem10; {29162#false} is VALID [2018-11-14 16:51:49,157 INFO L273 TraceCheckUtils]: 103: Hoare triple {29162#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {29162#false} is VALID [2018-11-14 16:51:49,157 INFO L273 TraceCheckUtils]: 104: Hoare triple {29162#false} assume true; {29162#false} is VALID [2018-11-14 16:51:49,157 INFO L273 TraceCheckUtils]: 105: Hoare triple {29162#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {29162#false} is VALID [2018-11-14 16:51:49,157 INFO L256 TraceCheckUtils]: 106: Hoare triple {29162#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29162#false} is VALID [2018-11-14 16:51:49,158 INFO L273 TraceCheckUtils]: 107: Hoare triple {29162#false} ~cond := #in~cond; {29162#false} is VALID [2018-11-14 16:51:49,158 INFO L273 TraceCheckUtils]: 108: Hoare triple {29162#false} assume ~cond == 0; {29162#false} is VALID [2018-11-14 16:51:49,158 INFO L273 TraceCheckUtils]: 109: Hoare triple {29162#false} assume !false; {29162#false} is VALID [2018-11-14 16:51:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 2 proven. 800 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:49,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:49,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:49,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:51:49,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:51:49,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:49,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:49,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {29161#true} call ULTIMATE.init(); {29161#true} is VALID [2018-11-14 16:51:49,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {29161#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29161#true} is VALID [2018-11-14 16:51:49,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {29161#true} assume true; {29161#true} is VALID [2018-11-14 16:51:49,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29161#true} {29161#true} #137#return; {29161#true} is VALID [2018-11-14 16:51:49,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {29161#true} call #t~ret15 := main(); {29161#true} is VALID [2018-11-14 16:51:49,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {29161#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {29203#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:49,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {29203#(<= main_~i~0 0)} assume true; {29203#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:49,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {29203#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {29210#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:49,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {29210#(<= main_~k~0 1)} assume true; {29210#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:49,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {29210#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29210#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:49,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {29210#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29210#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:49,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {29210#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {29223#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:49,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {29223#(<= main_~k~0 2)} assume true; {29223#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:49,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {29223#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29223#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:49,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {29223#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29223#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:49,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {29223#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {29236#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:49,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {29236#(<= main_~k~0 3)} assume true; {29236#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:49,911 INFO L273 TraceCheckUtils]: 17: Hoare triple {29236#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29236#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:49,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {29236#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29236#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:49,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {29236#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {29249#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:49,913 INFO L273 TraceCheckUtils]: 20: Hoare triple {29249#(<= main_~k~0 4)} assume true; {29249#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:49,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {29249#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29249#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:49,914 INFO L273 TraceCheckUtils]: 22: Hoare triple {29249#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29249#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:49,915 INFO L273 TraceCheckUtils]: 23: Hoare triple {29249#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {29262#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:49,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {29262#(<= main_~k~0 5)} assume true; {29262#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:49,916 INFO L273 TraceCheckUtils]: 25: Hoare triple {29262#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29262#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:49,917 INFO L273 TraceCheckUtils]: 26: Hoare triple {29262#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29262#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:49,918 INFO L273 TraceCheckUtils]: 27: Hoare triple {29262#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {29275#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:49,918 INFO L273 TraceCheckUtils]: 28: Hoare triple {29275#(<= main_~k~0 6)} assume true; {29275#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:49,919 INFO L273 TraceCheckUtils]: 29: Hoare triple {29275#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29275#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:49,920 INFO L273 TraceCheckUtils]: 30: Hoare triple {29275#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29275#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:49,921 INFO L273 TraceCheckUtils]: 31: Hoare triple {29275#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {29288#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:49,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {29288#(<= main_~k~0 7)} assume true; {29288#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:49,922 INFO L273 TraceCheckUtils]: 33: Hoare triple {29288#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29288#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:49,922 INFO L273 TraceCheckUtils]: 34: Hoare triple {29288#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29288#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:49,923 INFO L273 TraceCheckUtils]: 35: Hoare triple {29288#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {29301#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:49,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {29301#(<= main_~k~0 8)} assume true; {29301#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:49,924 INFO L273 TraceCheckUtils]: 37: Hoare triple {29301#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29301#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:49,925 INFO L273 TraceCheckUtils]: 38: Hoare triple {29301#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29301#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:49,926 INFO L273 TraceCheckUtils]: 39: Hoare triple {29301#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {29314#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:49,927 INFO L273 TraceCheckUtils]: 40: Hoare triple {29314#(<= main_~k~0 9)} assume true; {29314#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:49,927 INFO L273 TraceCheckUtils]: 41: Hoare triple {29314#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29314#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:49,928 INFO L273 TraceCheckUtils]: 42: Hoare triple {29314#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29314#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:49,929 INFO L273 TraceCheckUtils]: 43: Hoare triple {29314#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {29327#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:49,929 INFO L273 TraceCheckUtils]: 44: Hoare triple {29327#(<= main_~k~0 10)} assume true; {29327#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:49,930 INFO L273 TraceCheckUtils]: 45: Hoare triple {29327#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29327#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:49,931 INFO L273 TraceCheckUtils]: 46: Hoare triple {29327#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29327#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:49,931 INFO L273 TraceCheckUtils]: 47: Hoare triple {29327#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {29340#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:49,932 INFO L273 TraceCheckUtils]: 48: Hoare triple {29340#(<= main_~k~0 11)} assume true; {29340#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:49,933 INFO L273 TraceCheckUtils]: 49: Hoare triple {29340#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29340#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:49,933 INFO L273 TraceCheckUtils]: 50: Hoare triple {29340#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29340#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:49,934 INFO L273 TraceCheckUtils]: 51: Hoare triple {29340#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {29353#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:49,935 INFO L273 TraceCheckUtils]: 52: Hoare triple {29353#(<= main_~k~0 12)} assume true; {29353#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:49,935 INFO L273 TraceCheckUtils]: 53: Hoare triple {29353#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29353#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:49,936 INFO L273 TraceCheckUtils]: 54: Hoare triple {29353#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29353#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:49,937 INFO L273 TraceCheckUtils]: 55: Hoare triple {29353#(<= main_~k~0 12)} ~k~0 := ~k~0 + 1; {29366#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:49,937 INFO L273 TraceCheckUtils]: 56: Hoare triple {29366#(<= main_~k~0 13)} assume true; {29366#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:49,938 INFO L273 TraceCheckUtils]: 57: Hoare triple {29366#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29366#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:49,939 INFO L273 TraceCheckUtils]: 58: Hoare triple {29366#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29366#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:49,940 INFO L273 TraceCheckUtils]: 59: Hoare triple {29366#(<= main_~k~0 13)} ~k~0 := ~k~0 + 1; {29379#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:49,940 INFO L273 TraceCheckUtils]: 60: Hoare triple {29379#(<= main_~k~0 14)} assume true; {29379#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:49,941 INFO L273 TraceCheckUtils]: 61: Hoare triple {29379#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29379#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:49,942 INFO L273 TraceCheckUtils]: 62: Hoare triple {29379#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29379#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:49,942 INFO L273 TraceCheckUtils]: 63: Hoare triple {29379#(<= main_~k~0 14)} ~k~0 := ~k~0 + 1; {29392#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:49,943 INFO L273 TraceCheckUtils]: 64: Hoare triple {29392#(<= main_~k~0 15)} assume true; {29392#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:49,944 INFO L273 TraceCheckUtils]: 65: Hoare triple {29392#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29392#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:49,944 INFO L273 TraceCheckUtils]: 66: Hoare triple {29392#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29392#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:49,945 INFO L273 TraceCheckUtils]: 67: Hoare triple {29392#(<= main_~k~0 15)} ~k~0 := ~k~0 + 1; {29405#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:49,946 INFO L273 TraceCheckUtils]: 68: Hoare triple {29405#(<= main_~k~0 16)} assume true; {29405#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:49,947 INFO L273 TraceCheckUtils]: 69: Hoare triple {29405#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29405#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:49,947 INFO L273 TraceCheckUtils]: 70: Hoare triple {29405#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29405#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:49,948 INFO L273 TraceCheckUtils]: 71: Hoare triple {29405#(<= main_~k~0 16)} ~k~0 := ~k~0 + 1; {29418#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:49,949 INFO L273 TraceCheckUtils]: 72: Hoare triple {29418#(<= main_~k~0 17)} assume true; {29418#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:49,950 INFO L273 TraceCheckUtils]: 73: Hoare triple {29418#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29418#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:49,950 INFO L273 TraceCheckUtils]: 74: Hoare triple {29418#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29418#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:49,951 INFO L273 TraceCheckUtils]: 75: Hoare triple {29418#(<= main_~k~0 17)} ~k~0 := ~k~0 + 1; {29431#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:49,952 INFO L273 TraceCheckUtils]: 76: Hoare triple {29431#(<= main_~k~0 18)} assume true; {29431#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:49,952 INFO L273 TraceCheckUtils]: 77: Hoare triple {29431#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29431#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:49,953 INFO L273 TraceCheckUtils]: 78: Hoare triple {29431#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29431#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:49,954 INFO L273 TraceCheckUtils]: 79: Hoare triple {29431#(<= main_~k~0 18)} ~k~0 := ~k~0 + 1; {29444#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:49,954 INFO L273 TraceCheckUtils]: 80: Hoare triple {29444#(<= main_~k~0 19)} assume true; {29444#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:49,955 INFO L273 TraceCheckUtils]: 81: Hoare triple {29444#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29444#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:49,956 INFO L273 TraceCheckUtils]: 82: Hoare triple {29444#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29444#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:49,956 INFO L273 TraceCheckUtils]: 83: Hoare triple {29444#(<= main_~k~0 19)} ~k~0 := ~k~0 + 1; {29457#(<= main_~k~0 20)} is VALID [2018-11-14 16:51:49,957 INFO L273 TraceCheckUtils]: 84: Hoare triple {29457#(<= main_~k~0 20)} assume true; {29457#(<= main_~k~0 20)} is VALID [2018-11-14 16:51:49,958 INFO L273 TraceCheckUtils]: 85: Hoare triple {29457#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {29457#(<= main_~k~0 20)} is VALID [2018-11-14 16:51:49,958 INFO L273 TraceCheckUtils]: 86: Hoare triple {29457#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29457#(<= main_~k~0 20)} is VALID [2018-11-14 16:51:49,959 INFO L273 TraceCheckUtils]: 87: Hoare triple {29457#(<= main_~k~0 20)} ~k~0 := ~k~0 + 1; {29470#(<= main_~k~0 21)} is VALID [2018-11-14 16:51:49,960 INFO L273 TraceCheckUtils]: 88: Hoare triple {29470#(<= main_~k~0 21)} assume true; {29470#(<= main_~k~0 21)} is VALID [2018-11-14 16:51:49,961 INFO L273 TraceCheckUtils]: 89: Hoare triple {29470#(<= main_~k~0 21)} assume !(~k~0 < 100000); {29162#false} is VALID [2018-11-14 16:51:49,961 INFO L273 TraceCheckUtils]: 90: Hoare triple {29162#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {29162#false} is VALID [2018-11-14 16:51:49,961 INFO L273 TraceCheckUtils]: 91: Hoare triple {29162#false} ~x~0 := 0; {29162#false} is VALID [2018-11-14 16:51:49,961 INFO L273 TraceCheckUtils]: 92: Hoare triple {29162#false} assume true; {29162#false} is VALID [2018-11-14 16:51:49,962 INFO L273 TraceCheckUtils]: 93: Hoare triple {29162#false} assume !(~x~0 < ~i~0); {29162#false} is VALID [2018-11-14 16:51:49,962 INFO L273 TraceCheckUtils]: 94: Hoare triple {29162#false} ~x~0 := 0; {29162#false} is VALID [2018-11-14 16:51:49,962 INFO L273 TraceCheckUtils]: 95: Hoare triple {29162#false} assume true; {29162#false} is VALID [2018-11-14 16:51:49,962 INFO L273 TraceCheckUtils]: 96: Hoare triple {29162#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {29162#false} is VALID [2018-11-14 16:51:49,963 INFO L256 TraceCheckUtils]: 97: Hoare triple {29162#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29162#false} is VALID [2018-11-14 16:51:49,963 INFO L273 TraceCheckUtils]: 98: Hoare triple {29162#false} ~cond := #in~cond; {29162#false} is VALID [2018-11-14 16:51:49,963 INFO L273 TraceCheckUtils]: 99: Hoare triple {29162#false} assume !(~cond == 0); {29162#false} is VALID [2018-11-14 16:51:49,963 INFO L273 TraceCheckUtils]: 100: Hoare triple {29162#false} assume true; {29162#false} is VALID [2018-11-14 16:51:49,963 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {29162#false} {29162#false} #143#return; {29162#false} is VALID [2018-11-14 16:51:49,963 INFO L273 TraceCheckUtils]: 102: Hoare triple {29162#false} havoc #t~mem9;havoc #t~mem10; {29162#false} is VALID [2018-11-14 16:51:49,963 INFO L273 TraceCheckUtils]: 103: Hoare triple {29162#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {29162#false} is VALID [2018-11-14 16:51:49,964 INFO L273 TraceCheckUtils]: 104: Hoare triple {29162#false} assume true; {29162#false} is VALID [2018-11-14 16:51:49,964 INFO L273 TraceCheckUtils]: 105: Hoare triple {29162#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {29162#false} is VALID [2018-11-14 16:51:49,964 INFO L256 TraceCheckUtils]: 106: Hoare triple {29162#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29162#false} is VALID [2018-11-14 16:51:49,964 INFO L273 TraceCheckUtils]: 107: Hoare triple {29162#false} ~cond := #in~cond; {29162#false} is VALID [2018-11-14 16:51:49,964 INFO L273 TraceCheckUtils]: 108: Hoare triple {29162#false} assume ~cond == 0; {29162#false} is VALID [2018-11-14 16:51:49,964 INFO L273 TraceCheckUtils]: 109: Hoare triple {29162#false} assume !false; {29162#false} is VALID [2018-11-14 16:51:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:50,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:50,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-11-14 16:51:50,023 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 110 [2018-11-14 16:51:50,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:50,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-14 16:51:50,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:50,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-14 16:51:50,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-14 16:51:50,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=1287, Unknown=0, NotChecked=0, Total=2070 [2018-11-14 16:51:50,205 INFO L87 Difference]: Start difference. First operand 322 states and 419 transitions. Second operand 46 states. [2018-11-14 16:51:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:51,146 INFO L93 Difference]: Finished difference Result 493 states and 654 transitions. [2018-11-14 16:51:51,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 16:51:51,146 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 110 [2018-11-14 16:51:51,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 16:51:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 230 transitions. [2018-11-14 16:51:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 16:51:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 230 transitions. [2018-11-14 16:51:51,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 230 transitions. [2018-11-14 16:51:51,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:51,371 INFO L225 Difference]: With dead ends: 493 [2018-11-14 16:51:51,372 INFO L226 Difference]: Without dead ends: 340 [2018-11-14 16:51:51,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=783, Invalid=1287, Unknown=0, NotChecked=0, Total=2070 [2018-11-14 16:51:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-14 16:51:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 330. [2018-11-14 16:51:51,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:51,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 340 states. Second operand 330 states. [2018-11-14 16:51:51,792 INFO L74 IsIncluded]: Start isIncluded. First operand 340 states. Second operand 330 states. [2018-11-14 16:51:51,792 INFO L87 Difference]: Start difference. First operand 340 states. Second operand 330 states. [2018-11-14 16:51:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:51,799 INFO L93 Difference]: Finished difference Result 340 states and 443 transitions. [2018-11-14 16:51:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 443 transitions. [2018-11-14 16:51:51,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:51,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:51,800 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand 340 states. [2018-11-14 16:51:51,800 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 340 states. [2018-11-14 16:51:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:51,808 INFO L93 Difference]: Finished difference Result 340 states and 443 transitions. [2018-11-14 16:51:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 443 transitions. [2018-11-14 16:51:51,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:51,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:51,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:51,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-11-14 16:51:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 429 transitions. [2018-11-14 16:51:51,814 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 429 transitions. Word has length 110 [2018-11-14 16:51:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:51,815 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 429 transitions. [2018-11-14 16:51:51,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-14 16:51:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 429 transitions. [2018-11-14 16:51:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-14 16:51:51,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:51,816 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:51,816 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:51,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1919714008, now seen corresponding path program 17 times [2018-11-14 16:51:51,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:51,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:51,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:51,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:51,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:52,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {31266#true} call ULTIMATE.init(); {31266#true} is VALID [2018-11-14 16:51:52,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {31266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31266#true} is VALID [2018-11-14 16:51:52,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {31266#true} assume true; {31266#true} is VALID [2018-11-14 16:51:52,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31266#true} {31266#true} #137#return; {31266#true} is VALID [2018-11-14 16:51:52,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {31266#true} call #t~ret15 := main(); {31266#true} is VALID [2018-11-14 16:51:52,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {31266#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {31268#(= main_~i~0 0)} is VALID [2018-11-14 16:51:52,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {31268#(= main_~i~0 0)} assume true; {31268#(= main_~i~0 0)} is VALID [2018-11-14 16:51:52,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {31268#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {31269#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {31269#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume true; {31269#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {31269#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31269#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {31269#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31269#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {31269#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31270#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {31270#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume true; {31270#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {31270#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31270#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {31270#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31270#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {31270#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31271#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {31271#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume true; {31271#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,465 INFO L273 TraceCheckUtils]: 17: Hoare triple {31271#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31271#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {31271#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31271#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {31271#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31272#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {31272#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume true; {31272#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {31272#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31272#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {31272#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31272#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {31272#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31273#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {31273#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume true; {31273#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,471 INFO L273 TraceCheckUtils]: 25: Hoare triple {31273#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31273#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {31273#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31273#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,473 INFO L273 TraceCheckUtils]: 27: Hoare triple {31273#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31274#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {31274#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume true; {31274#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,474 INFO L273 TraceCheckUtils]: 29: Hoare triple {31274#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31274#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,475 INFO L273 TraceCheckUtils]: 30: Hoare triple {31274#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31274#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,476 INFO L273 TraceCheckUtils]: 31: Hoare triple {31274#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31275#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,477 INFO L273 TraceCheckUtils]: 32: Hoare triple {31275#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume true; {31275#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,477 INFO L273 TraceCheckUtils]: 33: Hoare triple {31275#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31275#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,478 INFO L273 TraceCheckUtils]: 34: Hoare triple {31275#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31275#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,479 INFO L273 TraceCheckUtils]: 35: Hoare triple {31275#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31276#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,479 INFO L273 TraceCheckUtils]: 36: Hoare triple {31276#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume true; {31276#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,480 INFO L273 TraceCheckUtils]: 37: Hoare triple {31276#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31276#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,481 INFO L273 TraceCheckUtils]: 38: Hoare triple {31276#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31276#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {31276#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31277#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,483 INFO L273 TraceCheckUtils]: 40: Hoare triple {31277#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume true; {31277#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,483 INFO L273 TraceCheckUtils]: 41: Hoare triple {31277#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31277#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,484 INFO L273 TraceCheckUtils]: 42: Hoare triple {31277#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31277#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,485 INFO L273 TraceCheckUtils]: 43: Hoare triple {31277#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31278#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,485 INFO L273 TraceCheckUtils]: 44: Hoare triple {31278#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume true; {31278#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,486 INFO L273 TraceCheckUtils]: 45: Hoare triple {31278#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31278#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,487 INFO L273 TraceCheckUtils]: 46: Hoare triple {31278#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31278#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,488 INFO L273 TraceCheckUtils]: 47: Hoare triple {31278#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31279#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,488 INFO L273 TraceCheckUtils]: 48: Hoare triple {31279#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume true; {31279#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,489 INFO L273 TraceCheckUtils]: 49: Hoare triple {31279#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31279#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,490 INFO L273 TraceCheckUtils]: 50: Hoare triple {31279#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31279#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,491 INFO L273 TraceCheckUtils]: 51: Hoare triple {31279#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31280#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,492 INFO L273 TraceCheckUtils]: 52: Hoare triple {31280#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume true; {31280#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,492 INFO L273 TraceCheckUtils]: 53: Hoare triple {31280#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31280#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,493 INFO L273 TraceCheckUtils]: 54: Hoare triple {31280#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31280#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,494 INFO L273 TraceCheckUtils]: 55: Hoare triple {31280#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31281#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,495 INFO L273 TraceCheckUtils]: 56: Hoare triple {31281#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume true; {31281#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,496 INFO L273 TraceCheckUtils]: 57: Hoare triple {31281#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31281#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,496 INFO L273 TraceCheckUtils]: 58: Hoare triple {31281#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31281#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,497 INFO L273 TraceCheckUtils]: 59: Hoare triple {31281#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31282#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,498 INFO L273 TraceCheckUtils]: 60: Hoare triple {31282#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume true; {31282#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,498 INFO L273 TraceCheckUtils]: 61: Hoare triple {31282#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31282#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,499 INFO L273 TraceCheckUtils]: 62: Hoare triple {31282#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31282#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,500 INFO L273 TraceCheckUtils]: 63: Hoare triple {31282#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31283#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,500 INFO L273 TraceCheckUtils]: 64: Hoare triple {31283#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume true; {31283#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,501 INFO L273 TraceCheckUtils]: 65: Hoare triple {31283#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31283#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,502 INFO L273 TraceCheckUtils]: 66: Hoare triple {31283#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31283#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,503 INFO L273 TraceCheckUtils]: 67: Hoare triple {31283#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31284#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,504 INFO L273 TraceCheckUtils]: 68: Hoare triple {31284#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume true; {31284#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,504 INFO L273 TraceCheckUtils]: 69: Hoare triple {31284#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31284#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,505 INFO L273 TraceCheckUtils]: 70: Hoare triple {31284#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31284#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,506 INFO L273 TraceCheckUtils]: 71: Hoare triple {31284#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31285#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:52,507 INFO L273 TraceCheckUtils]: 72: Hoare triple {31285#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume true; {31285#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:52,508 INFO L273 TraceCheckUtils]: 73: Hoare triple {31285#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31285#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:52,508 INFO L273 TraceCheckUtils]: 74: Hoare triple {31285#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31285#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-14 16:51:52,509 INFO L273 TraceCheckUtils]: 75: Hoare triple {31285#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := ~k~0 + 1; {31286#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,510 INFO L273 TraceCheckUtils]: 76: Hoare triple {31286#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume true; {31286#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,511 INFO L273 TraceCheckUtils]: 77: Hoare triple {31286#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31286#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,511 INFO L273 TraceCheckUtils]: 78: Hoare triple {31286#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31286#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,512 INFO L273 TraceCheckUtils]: 79: Hoare triple {31286#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31287#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,513 INFO L273 TraceCheckUtils]: 80: Hoare triple {31287#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume true; {31287#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,513 INFO L273 TraceCheckUtils]: 81: Hoare triple {31287#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31287#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,514 INFO L273 TraceCheckUtils]: 82: Hoare triple {31287#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31287#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,515 INFO L273 TraceCheckUtils]: 83: Hoare triple {31287#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31288#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,516 INFO L273 TraceCheckUtils]: 84: Hoare triple {31288#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume true; {31288#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,517 INFO L273 TraceCheckUtils]: 85: Hoare triple {31288#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31288#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,517 INFO L273 TraceCheckUtils]: 86: Hoare triple {31288#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31288#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,518 INFO L273 TraceCheckUtils]: 87: Hoare triple {31288#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31289#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,519 INFO L273 TraceCheckUtils]: 88: Hoare triple {31289#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume true; {31289#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,520 INFO L273 TraceCheckUtils]: 89: Hoare triple {31289#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31289#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,520 INFO L273 TraceCheckUtils]: 90: Hoare triple {31289#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31289#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,521 INFO L273 TraceCheckUtils]: 91: Hoare triple {31289#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := ~k~0 + 1; {31290#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,522 INFO L273 TraceCheckUtils]: 92: Hoare triple {31290#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume true; {31290#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-14 16:51:52,522 INFO L273 TraceCheckUtils]: 93: Hoare triple {31290#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !(~k~0 < 100000); {31267#false} is VALID [2018-11-14 16:51:52,523 INFO L273 TraceCheckUtils]: 94: Hoare triple {31267#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {31267#false} is VALID [2018-11-14 16:51:52,523 INFO L273 TraceCheckUtils]: 95: Hoare triple {31267#false} ~x~0 := 0; {31267#false} is VALID [2018-11-14 16:51:52,523 INFO L273 TraceCheckUtils]: 96: Hoare triple {31267#false} assume true; {31267#false} is VALID [2018-11-14 16:51:52,523 INFO L273 TraceCheckUtils]: 97: Hoare triple {31267#false} assume !(~x~0 < ~i~0); {31267#false} is VALID [2018-11-14 16:51:52,523 INFO L273 TraceCheckUtils]: 98: Hoare triple {31267#false} ~x~0 := 0; {31267#false} is VALID [2018-11-14 16:51:52,524 INFO L273 TraceCheckUtils]: 99: Hoare triple {31267#false} assume true; {31267#false} is VALID [2018-11-14 16:51:52,524 INFO L273 TraceCheckUtils]: 100: Hoare triple {31267#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {31267#false} is VALID [2018-11-14 16:51:52,524 INFO L256 TraceCheckUtils]: 101: Hoare triple {31267#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {31266#true} is VALID [2018-11-14 16:51:52,524 INFO L273 TraceCheckUtils]: 102: Hoare triple {31266#true} ~cond := #in~cond; {31266#true} is VALID [2018-11-14 16:51:52,524 INFO L273 TraceCheckUtils]: 103: Hoare triple {31266#true} assume !(~cond == 0); {31266#true} is VALID [2018-11-14 16:51:52,524 INFO L273 TraceCheckUtils]: 104: Hoare triple {31266#true} assume true; {31266#true} is VALID [2018-11-14 16:51:52,525 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {31266#true} {31267#false} #143#return; {31267#false} is VALID [2018-11-14 16:51:52,525 INFO L273 TraceCheckUtils]: 106: Hoare triple {31267#false} havoc #t~mem9;havoc #t~mem10; {31267#false} is VALID [2018-11-14 16:51:52,525 INFO L273 TraceCheckUtils]: 107: Hoare triple {31267#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {31267#false} is VALID [2018-11-14 16:51:52,525 INFO L273 TraceCheckUtils]: 108: Hoare triple {31267#false} assume true; {31267#false} is VALID [2018-11-14 16:51:52,525 INFO L273 TraceCheckUtils]: 109: Hoare triple {31267#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {31267#false} is VALID [2018-11-14 16:51:52,525 INFO L256 TraceCheckUtils]: 110: Hoare triple {31267#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {31267#false} is VALID [2018-11-14 16:51:52,525 INFO L273 TraceCheckUtils]: 111: Hoare triple {31267#false} ~cond := #in~cond; {31267#false} is VALID [2018-11-14 16:51:52,525 INFO L273 TraceCheckUtils]: 112: Hoare triple {31267#false} assume ~cond == 0; {31267#false} is VALID [2018-11-14 16:51:52,525 INFO L273 TraceCheckUtils]: 113: Hoare triple {31267#false} assume !false; {31267#false} is VALID [2018-11-14 16:51:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 2 proven. 882 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:51:52,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:52,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:52,556 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:51:52,672 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-14 16:51:52,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:52,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:53,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {31266#true} call ULTIMATE.init(); {31266#true} is VALID [2018-11-14 16:51:53,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {31266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31266#true} is VALID [2018-11-14 16:51:53,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {31266#true} assume true; {31266#true} is VALID [2018-11-14 16:51:53,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31266#true} {31266#true} #137#return; {31266#true} is VALID [2018-11-14 16:51:53,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {31266#true} call #t~ret15 := main(); {31266#true} is VALID [2018-11-14 16:51:53,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {31266#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {31309#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:53,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {31309#(<= main_~i~0 0)} assume true; {31309#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:53,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {31309#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0 + 1;~s~0 := ~i~0; {31316#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:53,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {31316#(<= main_~k~0 1)} assume true; {31316#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:53,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {31316#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31316#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:53,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {31316#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31316#(<= main_~k~0 1)} is VALID [2018-11-14 16:51:53,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {31316#(<= main_~k~0 1)} ~k~0 := ~k~0 + 1; {31329#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:53,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {31329#(<= main_~k~0 2)} assume true; {31329#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:53,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {31329#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31329#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:53,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {31329#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31329#(<= main_~k~0 2)} is VALID [2018-11-14 16:51:53,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {31329#(<= main_~k~0 2)} ~k~0 := ~k~0 + 1; {31342#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:53,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {31342#(<= main_~k~0 3)} assume true; {31342#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:53,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {31342#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31342#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:53,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {31342#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31342#(<= main_~k~0 3)} is VALID [2018-11-14 16:51:53,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {31342#(<= main_~k~0 3)} ~k~0 := ~k~0 + 1; {31355#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:53,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {31355#(<= main_~k~0 4)} assume true; {31355#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:53,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {31355#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31355#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:53,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {31355#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31355#(<= main_~k~0 4)} is VALID [2018-11-14 16:51:53,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {31355#(<= main_~k~0 4)} ~k~0 := ~k~0 + 1; {31368#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:53,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {31368#(<= main_~k~0 5)} assume true; {31368#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:53,450 INFO L273 TraceCheckUtils]: 25: Hoare triple {31368#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31368#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:53,451 INFO L273 TraceCheckUtils]: 26: Hoare triple {31368#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31368#(<= main_~k~0 5)} is VALID [2018-11-14 16:51:53,451 INFO L273 TraceCheckUtils]: 27: Hoare triple {31368#(<= main_~k~0 5)} ~k~0 := ~k~0 + 1; {31381#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:53,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {31381#(<= main_~k~0 6)} assume true; {31381#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:53,452 INFO L273 TraceCheckUtils]: 29: Hoare triple {31381#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31381#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:53,453 INFO L273 TraceCheckUtils]: 30: Hoare triple {31381#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31381#(<= main_~k~0 6)} is VALID [2018-11-14 16:51:53,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {31381#(<= main_~k~0 6)} ~k~0 := ~k~0 + 1; {31394#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:53,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {31394#(<= main_~k~0 7)} assume true; {31394#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:53,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {31394#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31394#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:53,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {31394#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31394#(<= main_~k~0 7)} is VALID [2018-11-14 16:51:53,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {31394#(<= main_~k~0 7)} ~k~0 := ~k~0 + 1; {31407#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:53,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {31407#(<= main_~k~0 8)} assume true; {31407#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:53,457 INFO L273 TraceCheckUtils]: 37: Hoare triple {31407#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31407#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:53,457 INFO L273 TraceCheckUtils]: 38: Hoare triple {31407#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31407#(<= main_~k~0 8)} is VALID [2018-11-14 16:51:53,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {31407#(<= main_~k~0 8)} ~k~0 := ~k~0 + 1; {31420#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:53,459 INFO L273 TraceCheckUtils]: 40: Hoare triple {31420#(<= main_~k~0 9)} assume true; {31420#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:53,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {31420#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31420#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:53,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {31420#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31420#(<= main_~k~0 9)} is VALID [2018-11-14 16:51:53,460 INFO L273 TraceCheckUtils]: 43: Hoare triple {31420#(<= main_~k~0 9)} ~k~0 := ~k~0 + 1; {31433#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:53,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {31433#(<= main_~k~0 10)} assume true; {31433#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:53,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {31433#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31433#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:53,462 INFO L273 TraceCheckUtils]: 46: Hoare triple {31433#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31433#(<= main_~k~0 10)} is VALID [2018-11-14 16:51:53,463 INFO L273 TraceCheckUtils]: 47: Hoare triple {31433#(<= main_~k~0 10)} ~k~0 := ~k~0 + 1; {31446#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:53,463 INFO L273 TraceCheckUtils]: 48: Hoare triple {31446#(<= main_~k~0 11)} assume true; {31446#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:53,464 INFO L273 TraceCheckUtils]: 49: Hoare triple {31446#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31446#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:53,464 INFO L273 TraceCheckUtils]: 50: Hoare triple {31446#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31446#(<= main_~k~0 11)} is VALID [2018-11-14 16:51:53,465 INFO L273 TraceCheckUtils]: 51: Hoare triple {31446#(<= main_~k~0 11)} ~k~0 := ~k~0 + 1; {31459#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:53,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {31459#(<= main_~k~0 12)} assume true; {31459#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:53,466 INFO L273 TraceCheckUtils]: 53: Hoare triple {31459#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31459#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:53,466 INFO L273 TraceCheckUtils]: 54: Hoare triple {31459#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31459#(<= main_~k~0 12)} is VALID [2018-11-14 16:51:53,467 INFO L273 TraceCheckUtils]: 55: Hoare triple {31459#(<= main_~k~0 12)} ~k~0 := ~k~0 + 1; {31472#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:53,468 INFO L273 TraceCheckUtils]: 56: Hoare triple {31472#(<= main_~k~0 13)} assume true; {31472#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:53,468 INFO L273 TraceCheckUtils]: 57: Hoare triple {31472#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31472#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:53,469 INFO L273 TraceCheckUtils]: 58: Hoare triple {31472#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31472#(<= main_~k~0 13)} is VALID [2018-11-14 16:51:53,469 INFO L273 TraceCheckUtils]: 59: Hoare triple {31472#(<= main_~k~0 13)} ~k~0 := ~k~0 + 1; {31485#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:53,470 INFO L273 TraceCheckUtils]: 60: Hoare triple {31485#(<= main_~k~0 14)} assume true; {31485#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:53,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {31485#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31485#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:53,471 INFO L273 TraceCheckUtils]: 62: Hoare triple {31485#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31485#(<= main_~k~0 14)} is VALID [2018-11-14 16:51:53,472 INFO L273 TraceCheckUtils]: 63: Hoare triple {31485#(<= main_~k~0 14)} ~k~0 := ~k~0 + 1; {31498#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:53,472 INFO L273 TraceCheckUtils]: 64: Hoare triple {31498#(<= main_~k~0 15)} assume true; {31498#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:53,473 INFO L273 TraceCheckUtils]: 65: Hoare triple {31498#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31498#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:53,473 INFO L273 TraceCheckUtils]: 66: Hoare triple {31498#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31498#(<= main_~k~0 15)} is VALID [2018-11-14 16:51:53,474 INFO L273 TraceCheckUtils]: 67: Hoare triple {31498#(<= main_~k~0 15)} ~k~0 := ~k~0 + 1; {31511#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:53,475 INFO L273 TraceCheckUtils]: 68: Hoare triple {31511#(<= main_~k~0 16)} assume true; {31511#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:53,475 INFO L273 TraceCheckUtils]: 69: Hoare triple {31511#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31511#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:53,476 INFO L273 TraceCheckUtils]: 70: Hoare triple {31511#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31511#(<= main_~k~0 16)} is VALID [2018-11-14 16:51:53,476 INFO L273 TraceCheckUtils]: 71: Hoare triple {31511#(<= main_~k~0 16)} ~k~0 := ~k~0 + 1; {31524#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:53,477 INFO L273 TraceCheckUtils]: 72: Hoare triple {31524#(<= main_~k~0 17)} assume true; {31524#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:53,477 INFO L273 TraceCheckUtils]: 73: Hoare triple {31524#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31524#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:53,478 INFO L273 TraceCheckUtils]: 74: Hoare triple {31524#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31524#(<= main_~k~0 17)} is VALID [2018-11-14 16:51:53,479 INFO L273 TraceCheckUtils]: 75: Hoare triple {31524#(<= main_~k~0 17)} ~k~0 := ~k~0 + 1; {31537#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:53,479 INFO L273 TraceCheckUtils]: 76: Hoare triple {31537#(<= main_~k~0 18)} assume true; {31537#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:53,480 INFO L273 TraceCheckUtils]: 77: Hoare triple {31537#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31537#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:53,480 INFO L273 TraceCheckUtils]: 78: Hoare triple {31537#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31537#(<= main_~k~0 18)} is VALID [2018-11-14 16:51:53,481 INFO L273 TraceCheckUtils]: 79: Hoare triple {31537#(<= main_~k~0 18)} ~k~0 := ~k~0 + 1; {31550#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:53,481 INFO L273 TraceCheckUtils]: 80: Hoare triple {31550#(<= main_~k~0 19)} assume true; {31550#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:53,482 INFO L273 TraceCheckUtils]: 81: Hoare triple {31550#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31550#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:53,482 INFO L273 TraceCheckUtils]: 82: Hoare triple {31550#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31550#(<= main_~k~0 19)} is VALID [2018-11-14 16:51:53,483 INFO L273 TraceCheckUtils]: 83: Hoare triple {31550#(<= main_~k~0 19)} ~k~0 := ~k~0 + 1; {31563#(<= main_~k~0 20)} is VALID [2018-11-14 16:51:53,484 INFO L273 TraceCheckUtils]: 84: Hoare triple {31563#(<= main_~k~0 20)} assume true; {31563#(<= main_~k~0 20)} is VALID [2018-11-14 16:51:53,484 INFO L273 TraceCheckUtils]: 85: Hoare triple {31563#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31563#(<= main_~k~0 20)} is VALID [2018-11-14 16:51:53,485 INFO L273 TraceCheckUtils]: 86: Hoare triple {31563#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31563#(<= main_~k~0 20)} is VALID [2018-11-14 16:51:53,485 INFO L273 TraceCheckUtils]: 87: Hoare triple {31563#(<= main_~k~0 20)} ~k~0 := ~k~0 + 1; {31576#(<= main_~k~0 21)} is VALID [2018-11-14 16:51:53,486 INFO L273 TraceCheckUtils]: 88: Hoare triple {31576#(<= main_~k~0 21)} assume true; {31576#(<= main_~k~0 21)} is VALID [2018-11-14 16:51:53,486 INFO L273 TraceCheckUtils]: 89: Hoare triple {31576#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~k~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4); {31576#(<= main_~k~0 21)} is VALID [2018-11-14 16:51:53,487 INFO L273 TraceCheckUtils]: 90: Hoare triple {31576#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31576#(<= main_~k~0 21)} is VALID [2018-11-14 16:51:53,488 INFO L273 TraceCheckUtils]: 91: Hoare triple {31576#(<= main_~k~0 21)} ~k~0 := ~k~0 + 1; {31589#(<= main_~k~0 22)} is VALID [2018-11-14 16:51:53,488 INFO L273 TraceCheckUtils]: 92: Hoare triple {31589#(<= main_~k~0 22)} assume true; {31589#(<= main_~k~0 22)} is VALID [2018-11-14 16:51:53,489 INFO L273 TraceCheckUtils]: 93: Hoare triple {31589#(<= main_~k~0 22)} assume !(~k~0 < 100000); {31267#false} is VALID [2018-11-14 16:51:53,489 INFO L273 TraceCheckUtils]: 94: Hoare triple {31267#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + ~s~0 * 4, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {31267#false} is VALID [2018-11-14 16:51:53,489 INFO L273 TraceCheckUtils]: 95: Hoare triple {31267#false} ~x~0 := 0; {31267#false} is VALID [2018-11-14 16:51:53,489 INFO L273 TraceCheckUtils]: 96: Hoare triple {31267#false} assume true; {31267#false} is VALID [2018-11-14 16:51:53,490 INFO L273 TraceCheckUtils]: 97: Hoare triple {31267#false} assume !(~x~0 < ~i~0); {31267#false} is VALID [2018-11-14 16:51:53,490 INFO L273 TraceCheckUtils]: 98: Hoare triple {31267#false} ~x~0 := 0; {31267#false} is VALID [2018-11-14 16:51:53,490 INFO L273 TraceCheckUtils]: 99: Hoare triple {31267#false} assume true; {31267#false} is VALID [2018-11-14 16:51:53,490 INFO L273 TraceCheckUtils]: 100: Hoare triple {31267#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {31267#false} is VALID [2018-11-14 16:51:53,490 INFO L256 TraceCheckUtils]: 101: Hoare triple {31267#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {31267#false} is VALID [2018-11-14 16:51:53,491 INFO L273 TraceCheckUtils]: 102: Hoare triple {31267#false} ~cond := #in~cond; {31267#false} is VALID [2018-11-14 16:51:53,491 INFO L273 TraceCheckUtils]: 103: Hoare triple {31267#false} assume !(~cond == 0); {31267#false} is VALID [2018-11-14 16:51:53,491 INFO L273 TraceCheckUtils]: 104: Hoare triple {31267#false} assume true; {31267#false} is VALID [2018-11-14 16:51:53,491 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {31267#false} {31267#false} #143#return; {31267#false} is VALID [2018-11-14 16:51:53,491 INFO L273 TraceCheckUtils]: 106: Hoare triple {31267#false} havoc #t~mem9;havoc #t~mem10; {31267#false} is VALID [2018-11-14 16:51:53,491 INFO L273 TraceCheckUtils]: 107: Hoare triple {31267#false} #t~post8 := ~x~0;~x~0 := #t~post8 + 1;havoc #t~post8; {31267#false} is VALID [2018-11-14 16:51:53,492 INFO L273 TraceCheckUtils]: 108: Hoare triple {31267#false} assume true; {31267#false} is VALID [2018-11-14 16:51:53,492 INFO L273 TraceCheckUtils]: 109: Hoare triple {31267#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {31267#false} is VALID [2018-11-14 16:51:53,492 INFO L256 TraceCheckUtils]: 110: Hoare triple {31267#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {31267#false} is VALID [2018-11-14 16:51:53,492 INFO L273 TraceCheckUtils]: 111: Hoare triple {31267#false} ~cond := #in~cond; {31267#false} is VALID [2018-11-14 16:51:53,492 INFO L273 TraceCheckUtils]: 112: Hoare triple {31267#false} assume ~cond == 0; {31267#false} is VALID [2018-11-14 16:51:53,492 INFO L273 TraceCheckUtils]: 113: Hoare triple {31267#false} assume !false; {31267#false} is VALID [2018-11-14 16:51:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:51:53,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:53,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 16:51:53,521 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 114 [2018-11-14 16:51:53,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:53,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 16:51:53,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:53,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 16:51:53,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 16:51:53,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 16:51:53,718 INFO L87 Difference]: Start difference. First operand 330 states and 429 transitions. Second operand 48 states. [2018-11-14 16:51:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:54,845 INFO L93 Difference]: Finished difference Result 501 states and 664 transitions. [2018-11-14 16:51:54,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 16:51:54,845 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 114 [2018-11-14 16:51:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 16:51:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 235 transitions. [2018-11-14 16:51:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 16:51:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 235 transitions. [2018-11-14 16:51:54,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 235 transitions. [2018-11-14 16:51:55,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:55,112 INFO L225 Difference]: With dead ends: 501 [2018-11-14 16:51:55,112 INFO L226 Difference]: Without dead ends: 348 [2018-11-14 16:51:55,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 16:51:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-14 16:51:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 338. [2018-11-14 16:51:55,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:55,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand 338 states. [2018-11-14 16:51:55,913 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand 338 states. [2018-11-14 16:51:55,913 INFO L87 Difference]: Start difference. First operand 348 states. Second operand 338 states. [2018-11-14 16:51:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:55,921 INFO L93 Difference]: Finished difference Result 348 states and 453 transitions. [2018-11-14 16:51:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 453 transitions. [2018-11-14 16:51:55,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:55,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:55,922 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand 348 states. [2018-11-14 16:51:55,922 INFO L87 Difference]: Start difference. First operand 338 states. Second operand 348 states. [2018-11-14 16:51:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:55,929 INFO L93 Difference]: Finished difference Result 348 states and 453 transitions. [2018-11-14 16:51:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 453 transitions. [2018-11-14 16:51:55,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:55,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:55,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:55,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-14 16:51:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 439 transitions. [2018-11-14 16:51:55,937 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 439 transitions. Word has length 114 [2018-11-14 16:51:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:55,938 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 439 transitions. [2018-11-14 16:51:55,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 16:51:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 439 transitions. [2018-11-14 16:51:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-14 16:51:55,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:55,939 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:55,939 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:55,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:55,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1948656622, now seen corresponding path program 18 times [2018-11-14 16:51:55,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:55,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:55,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat